Abstract
A simple secret sharing scheme for secure visual communications is pre-sented in this paper. Secret sharing schemes allow a group of participants at different lo-cations to share a secret (i.e., an image) among them by splitting it into n pieces ("shares" or "shadows"). In case of the (k, n) secret sharing scheme only a group of k qualified par-ticipants among n (where k = n) can reconstruct the secret. This paper presents an (n, n) secret sharing scheme. This scheme randomizes one share after another by executing XOR operations with random seeds derived from an initial seed. This scheme can also be used as an image encryption scheme. This scheme is resistant to collusion attacks.
| Original language | English |
|---|---|
| Pages (from-to) | 433-447 |
| Number of pages | 15 |
| Journal | Intelligent Automation and Soft Computing |
| Volume | 16 |
| Issue number | 3 |
| Publication status | Published - 2010 Nov 1 |
Fingerprint
Keywords
- Embedded System
- Information Security
- Pervasive Computing
- Secret Shar-ing
ASJC Scopus subject areas
- Artificial Intelligence
- Software
- Theoretical Computer Science
- Computational Theory and Mathematics
Cite this
Lee, C. U., Kim, H. J., Park, J. H., Yeo, S. S., & Yang, J. (2010). A pervasive secret sharing scheme for embedded visual communication system. Intelligent Automation and Soft Computing, 16(3), 433-447.