像素
灰度
图像共享
可视密码
计算机科学
秘密分享
计算机视觉
人工智能
无损压缩
随机游走算法
按位运算
图像(数学)
数字水印
密码学
算法
数据压缩
程序设计语言
作者
Bishoy K. Sharobim,Salwa K. Abd-El-Hafiz,Wafaa S. Sayed,Lobna A. Said,Ahmed G. Radwan
标识
DOI:10.1145/3627345.3627351
摘要
(n, n)-Visual Secret Sharing (VSS) allows a user to send an image in the form of shares to different participants. Every share can not reveal the secret alone, and only all shares together can reveal the secret with fast recovery. This paper proposes a pixel-based (n, n)-VSS system, where to share a pixel from the secret image, (n − 1) random pixels are generated from the Lorenz chaotic system for a varying set of (n − 1) shares. Then, the nth pixel is calculated for a random share using the secret pixel and the generated (n − 1) random pixels. The system is efficient, lossless, implemented for grayscale and color images, and has a simple XOR-based recovery scheme. It passed several security analysis tests and is robust against noise attacks. Moreover, performance analysis and comparisons with other VSS systems are presented, showing good results.
科研通智能强力驱动
Strongly Powered by AbleSci AI