scholarly journals Color Visual Secret Sharing for QR Code with Perfect Module Reconstruction

2019 ◽  
Vol 9 (21) ◽  
pp. 4670 ◽  
Author(s):  
Tao Liu ◽  
Bin Yan ◽  
Jeng-Shyang Pan

Visual secret sharing is a secret sharing scheme where the decryption requires no computation. It has found many applications in online transaction security, privacy protection, and bar code security, etc. Recently, researches have indicated that combining visual secret sharing with the widely used Quick Response code may provide additional security mechanism to online transaction. However, current methods are either pixel-based, which requires high computational complexity or module-based, which sacrifices error correction capability of the original Quick Response code. Designing module-based visual secret sharing for the Quick Response code without sacrificing error correction capability is a challenging problem. To solve this problem, this paper proposes a (3, 3)-threshold visual secret sharing for Quick Response code scheme that fully explores the extra freedom provided by color visual secret sharing and color stacking. The binary secret Quick Response code is encoded into color shares. By stacking all the three shares, a binary color Quick Response code can be reconstructed. After the inherent pre-processing steps in a standard Quick Response code decoder, the original binary secret Quick Response code can be completely reconstructed. Thus, the original error correction capability of the Quick Response code is fully preserved. Theoretical analysis shows that the visual secret sharing for Quick Response code is secure under the condition that the computational device available to the attacker is limited to a decoder for standard Quick Response code. Experimental results verify that the secret Quick Response code cannot be reconstructed from just one share or any two shares. However, it can be 100% reconstructed once the three shares are stacked. The proposed visual secret sharing for Quick Response code is module-based, and it does not sacrifice the error correction capability. Furthermore, No extra pre-processing steps other than the standard Quick Response code decoder are required.

Author(s):  
Nikita Bhoskar

Abstract: The quick response code (QR) has become most popular barcode because of its larger data capacity and increased damage resistance. Barcode scanners can easily extract information hidden in the QR code when scanning data forms. However, some confidential data stored directly in QR codes are not secure in real world QR apps. To proposed approach to visual secret sharing scheme to encode a secret QR code into distinct shares. In assessment with other techniques, the shares in proposed scheme are valid QR codes that may be decoded with some unique that means of a trendy QR code reader, so that escaping increases suspicious attackers. An existing sharing technique is subjected to loss of security. On this premise, consider the strategy for (k, n) get to structures by using the (k, k) sharing occurrence on each k-member subset dependent on specific relationship. In addition, the secret message is recovered with the aid of XOR-ing the qualified shares. This operation which can effortlessly be achieved the use of smartphones or different QR scanning gadgets. Contribution work is, working on optimal partitioning methods and compare original message with shared message using hashing techniques. Keywords: Hashing, partitioning algorithm, error correction capacity, high security, Quick Response code, visual secret sharing scheme


2019 ◽  
Vol 79 (9-10) ◽  
pp. 5719-5741 ◽  
Author(s):  
Longdan Tan ◽  
Yuliang Lu ◽  
Xuehu Yan ◽  
Lintao Liu ◽  
Xuan Zhou

AbstractQuick response (QR) codes are becoming increasingly popular in various areas of life due to the advantages of the error correction capacity, the ability to be scanned quickly and the capacity to contain meaningful content. The distribution of dark and light modules of a QR code looks random, but the content of a code can be decoded by a standard QR reader. Thus, a QR code is often used in combination with visual secret sharing (VSS) to generate meaningful shadows. There may be some losses in the process of distribution and preservation of the shadows. To recover secret images with high quality, it is necessary to consider the scheme’s robustness. However, few studies examine robustness of VSS combined with QR codes. In this paper, we propose a robust (k, n)-threshold XOR-ed VSS (XVSS) scheme based on a QR code with the error correction ability. Compared with OR-ed VSS (OVSS), XVSS can recover the secret image losslessly, and the amount of computation needed is low. Since the standard QR encoder does not check if the padding codewords are correct during the encoding phase, we replace padding codewords by initial shadows shared from the secret image using XVSS to generate QR code shadows. As a result, the shadows can be decoded normally, and their error correction abilities are preserved. Once all the shadows have been collected, the secret image can be recovered losslessly. More importantly, if some conventional image attacks, including rotation, JPEG compression, Gaussian noise, salt-and-pepper noise, cropping, resizing, and even the addition of camera and screen noises are performed on the shadows, the secret image can still be recovered. The experimental results and comparisons demonstrate the effectiveness of our scheme.


2019 ◽  
Vol 8 (2) ◽  
pp. 4284-4288

QR code is a quick response code which is used to store information. In QR code, the information is stored in encoded form. To access information present in QR code , we need to decode information with the help of scanner. The information which is present in QR code is accessible to anybody. Private data is not safe in such scenario. This paper presents a visual secret sharing scheme to encode a secret QR code into distinct shares. Visual secret sharing scheme is a method of distributing secrete amongst a group of participants. The secret message is recovered by XOR-ing the shares. Secret message can be generated only when enough number of shares are combined. This provides security for private message using visual secret sharing scheme. Proposed system provides higher security to messages and it also provides more flexible access structure. Computational cost of proposed scheme is low


MIND Journal ◽  
2019 ◽  
Vol 4 (2) ◽  
pp. 143-154
Author(s):  
DEWI ROSMALA ◽  
YUSUF MIFTAHUDDIN ◽  
RUSTANDI YUSUF

QR Code atau sering disebut Quick Response Code adalah barcode dua dimensi yang dapat dibaca lebih cepat dari barcode dengan kapasitas yang sama. Sudut deteksi pola yang menjamin stabil tiga bacaan pada kecepatan tinggi dan dapat memperbaiki kesalahan atau data dapat dikembalikan bahkan jika sebagian rusak atau kotor. QR Code memiliki karakter yang terbagi dalam empat karakter yaitu numerik, alphanumerik, bit, kaji. QR Code dihasilkan dari proses encoding dengan melakukan konversi atau masukan data ke dalam bentuk biner, sehingga encoding dapat diidentifikasi kebutuhan input data yang dihasilkan dalam QR Code, menentukan versi QR code dan tingkat Error Correction. Pada penelitian ini dilakukan cara bagaimana Melakukan proses encoding alphanumerik dan numeric QR Code dengan membandingkan respon rime dari hasil generate kedua QR Code tersebut. Dengan cara melakukan pemindaian pada QR Code alphanumerik dan numerik. Dari hasil pengujian Pemindaian QR Code alphumerik dan numerik yang dilakukan didapat bahwa QR Code numerik memiliki respon lebih cepat 0.3 Detik dari QR Code alphanumerik. Kata kunci: REST API, QR Code,Android


2019 ◽  
Vol 1 (2) ◽  
pp. 56-61
Author(s):  
Joseph Dedy irawan ◽  
Emmalia Adriantantri

QR-Code (Quick Response Code) merupakan pengembangan dari Bar-Code yang dulunya merupakan kode saru dimensi menjadi kode dua dimensi dengan kemampuan menyimpan data lebih besar dibandingkan dengan Bar-Code, dengan menggunakan QR-Code data yang bisa disimpan dapat berupa kode angka, huruf, binary serta huruf kanji, kode ini sudah diterapkan untuk berbagai bidang. Salah satu penggunaan QR-Code adalah sebagai media untuk melakukan promosi bagi toko, karena dengan menggunakan kode ini dan dengan bantuan internet maka akan terbentuk suatu sistem promosi dengan biaya burah tetapi dapat mencakup area yang sangat luas.Media promosi ini dilakukan dengan cara mempersiapkan data-data barang atau produk yang dijual di toko, kegiatan promosi seperti diskon dan promo yang akan dilakukan toko. Dari data tersebut dimasukkan ke dalam database, kemudian tautan (hyperlink) dari data promosi tersebut disimpan dalam bentuk QR-Code, pelanggan dengan bantuan kamera handphone dapat melakukan scanning dari QR-Code yang diinginkan, dan dengan memasang aplikasi dalam handphone pelanggan maka kode tersebut akan dikirim ke server dan pelanggan akan dikirim informasi promosi yang dilakukan oleh toko, proses ini akan mempermudah pelanggan mencari produk yang diinginkan karena tidak perlu melakukan proses pencarian dari internet, tetapi cukup melakukan scanning dari QR-Code.


Author(s):  
Nurul Fatina Yusni ◽  
Nur Farah Hanani Mohd Zaim ◽  
Siti Khairul Niza Sukri ◽  
Noreha Che Sidik ◽  
Shamsul Jamel Elias ◽  
...  

Polymers ◽  
2021 ◽  
Vol 13 (9) ◽  
pp. 1358
Author(s):  
Taihui Wu ◽  
Jianshe Ma ◽  
Chengchen Wang ◽  
Haibei Wang ◽  
Liangcai Cao ◽  
...  

An optical encryption method based on computer generated holograms printing of photopolymer is presented. Fraunhofer diffraction is performed based on the Gerchberg-Saxton algorithm, and a hologram of the Advanced Encryption Standard encrypted Quick Response code is generated to record the ciphertext. The holograms of the key and the three-dimensional image are generated by the angular spectrum diffraction algorithm. The experimental results show that large-size encrypted Quick Response (QR) code and miniature keys can be printed in photopolymers, which has good application prospects in optical encryption. This method has the advantages of high-density storage, high speed, large fault tolerance, and anti-peeping.


Sign in / Sign up

Export Citation Format

Share Document