Paper 2005/372 Original: eprint.iacr.org/2005/372 ↗
Secret color images sharing schemes based on XOR operation
Abstract
This paper presents two new constructions for the secret color images sharing schemes .One is a (n, n) threshold scheme, which can be constructed based on XOR operation. The other is a (2, n) threshold scheme, which can be constructed by using AND and XOR operations. The two schemes have no pixel expansion, and the time complexity for constructing shared images is O(k1n), excluding the time needed for generating n distinct random matrices (here k1 is the size of the shared image). The reconstructed images can be obtained in the two schemes by using the XOR operation alone. The relative differences of the two schemes are 1 and 1/2, respectively. The time complexity of the recovered images is O(k1n) and O(2k1), respectively. The two schemes also provide perfect secrecy.
Metadata
- Available format(s)
PDF- Publication info
- Preprint.
- History
- 2005-10-23: last updated
- 2005-10-23: published
- Short URL
- https://ia.cr/2005/372
- License
- https://creativecommons.org/licenses/by/4.0/
BibTeX
@misc{cryptoeprint:2005/372,
author = {Dao-Shun Wang and Lei Zhang and Ning Ma and Lian-Sheng Huang},
title = {Secret color images sharing schemes based on XOR operation},
howpublished = {Cryptology {ePrint} Archive, Paper 2005/372},
year = {2005},
url = {https://eprint.iacr.org/2005/372}
}