High payload secret hiding technology for QR codes

Lin, Pei-Yu; Chen, Yihui

doi:10.1186/s13640-016-0155-0

Cited by 48 publications

(48 citation statements)

References 12 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…Taking (7,4) Hamming code for example, we explain how to embed and extract 3 bits of messages into 7 pixels. Let H be the parity check matrix of the (7,4) Hamming code whose columns are in the natural order of increasing binary numbers.…”

Section: Methods Ofmentioning

confidence: 99%

“…Based on the error correction mechanism of QR code, Chiang et al [6] used wet paper code to embed secret information into the carrier image to achieve blind extraction of secret information. Lin and Chen [7] improved the algorithm to make the upper limit of the embedded bits reach the maximum data capacity of the QR code. Lin [8] proposed a (n, n) secret sharing scheme where n bit streams were obtained by the random number generation algorithm and hash function and embedded into the carrier image by wet paper code to form n two-level QR codes.…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

A Novel Three-Layer QR Code Based on Secret Sharing Scheme and Liner Code

Liu

2019

Security and Communication Networks

View full text Add to dashboard Cite

Quick Response (QR) code, a machine-readable symbol, is widely employed in all walks of life due to its large information capacity, strong error correction ability, and fast reading speed. However, anyone with a standard decoder could obtain stored information. In this paper, utilizing the characteristics of the Hamming code, wet paper code, and the recognition mechanism of the QR code, we introduce a high-capacity QR code with three-layer information to protect the sensitive information. In the proposed scheme, we utilize the XOR-based secret-sharing algorithm to embed the second-layer information on the column vector of the constructed random matrix block. Then, without affecting the embedding result of the second layer information, the matrix block elements are reused again, and the Hamming code is constructed with the column vector. Based on the error correction mechanism of the Hamming code, the third layer of information is embedded on the column vector and encoded by wet paper coding to realize the blind extraction. Finally, based on the recognition mechanism of the QR code, the random matrix block containing the secret information is fused with the carrier QR code, and the public information of the carrier QR code is used as the first-layer information. Compared with other schemes, the proposed scheme has the advantages of high information payload, low computational complexity, and strong robustness.

show abstract

Section: Methods Ofmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

A Novel Three-Layer QR Code Based on Secret Sharing Scheme and Liner Code

Liu

2019

Security and Communication Networks

View full text Add to dashboard Cite

show abstract

“…Simulations demonstrated that the scheme has low computational complexity but no error-correction ability; when any bit of the carrier QR barcode is damaged, it is difficult to recover the secret payload. Lin et al [15] improved the steganography scheme of Reference [13] and used the concept of the exploiting modification direction (EMD) scheme to hide secret payloads in QR barcodes. Compared with Reference [13], Reference [15] improved the hiding capacity, and the secret payload could be recovered with few errors.…”

Section: Related Workmentioning

confidence: 99%

“…Some existing digital steganography schemes [4,[9][10][11][12] do not work properly in this scenario because the hidden data are destroyed. Other steganography schemes [13][14][15] based on QR barcodes are not easy to use in the real world because they are not robust to complex physical factors.…”

Section: Introductionmentioning

confidence: 99%

EasyStego: Robust Steganography Based on Quick-Response Barcodes for Crossing Domains

et al. 2019

View full text Add to dashboard Cite

Despite greater attention being paid to sensitive-information leakage in the cyberdomain, the sensitive-information problem of the physical domain remains neglected. Anonymous users can easily access the sensitive information of other users, such as transaction information, health status, and addresses, without any advanced technologies. Ideally, secret messages should be protected not only in the cyberdomain but also in the complex physical domain. However, popular steganography schemes only work in the traditional cyberdomain and are useless when physical distortions of messages are unavoidable. This paper first defines the concept of cross-domain steganography, and then proposes EasyStego, a novel cross-domain steganography scheme. EasyStego is based on the use of QR barcodes as carriers; therefore, it is robust to physical distortions in the complex physical domain. Moreover, EasyStego has a large capacity for embeddable secrets and strong scalability in various scenarios. EasyStego uses an AES encryption algorithm to control the permissions of secret messages, which is more effective in reducing the possibility of sensitive-information leakage. Experiments show that EasyStego has perfect robustness and good efficiency. Compared with the best current steganography scheme based on barcodes, EasyStego has greater steganographic capacity and less impact on barcode data. In robustness tests, EasyStego successfully extracts secret messages at different angles and distances. In the case of adding natural textures and importing quantitative error bits, other related steganography techniques fail, whereas EasyStego can extract secret messages with a success rate of nearly 100%.

show abstract

“…Quick response (QR) code has become one of the more popular two-dimensional barcodes due to its inherent data capacity and higher damage resistance [1]. With smartphone security and privacy becoming a major concern [2], a hijacked QR code can be a dangerous attack vector for smartphone users.…”

Section: Introductionmentioning

confidence: 99%