当前位置: X-MOL 学术J. Inf. Secur. Appl. › 论文详情
Our official English website, www.x-mol.net, welcomes your feedback! (Note: you will need to create a separate account there.)
Enhanced (n, n)-threshold QR code secret sharing scheme based on error correction mechanism
Journal of Information Security and Applications ( IF 3.8 ) Pub Date : 2021-01-14 , DOI: 10.1016/j.jisa.2020.102719
Peng-Cheng Huang , Chin-Chen Chang , Yung-Hui Li , Yanjun Liu

In recent years, QR code is popular online and offline, and it is an ideal media for secret sharing. This paper utilizes the error correction capacity of QR code to propose an (n, n)-threshold secret sharing scheme for QR code. A secret QR code can be split and encoded into n cover QR codes. The generated marked QR codes still carry cover messages so that they will greatly reduce the suspicion of unauthorized people while transmitted in the public channel. The secret QR code can be easily reconstructed by using XOR operation when all the n authorized participants collaborate. Experimental results show that the proposed scheme is feasible and has high robustness. In addition, compared to the state-of-the-art work, the proposed scheme achieves a higher security.



中文翻译:

基于纠错机制的增强(n,n)阈值QR码秘密共享方案

近年来,QR码在网上和线下都很流行,是秘密共享的理想媒体。本文利用QR码的纠错能力,提出了QR码的(n,n)阈值秘密共享方案。可以将秘密QR码拆分并编码为n个封面QR码。生成的带有标记的QR码仍然带有掩护消息,因此它们将大大减少在公共频道中传输未经授权人员的嫌疑。当所有n个字母都为n时,可以通过XOR操作轻松重建秘密QR码授权参与者进行协作。实验结果表明,该方案是可行的,具有较高的鲁棒性。此外,与最新技术相比,该方案具有更高的安全性。

更新日期:2021-01-16
down
wechat
bug