Abstract
A simple secret sharing scheme for secure visual communications is presented in this paper. Secret sharing schemes allow a group of participants at different locations to share a secret (i.e., an image) among them by splitting it into n pieces (“shazes” or “shadows”. In case of the (k, n) secret shazing scheme only a group of k qualified participants among n (where k≤n) can reconstruct the secret. This paper presents an (n, n) secret sharing scheme. This scheme randomizes one shaze 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 |
DOIs | |
Publication status | Published - 2010 Jan |
Keywords
- Embedded System
- Information Security
- Pervasive Computing
- Secret Sharing
ASJC Scopus subject areas
- Software
- Theoretical Computer Science
- Computational Theory and Mathematics
- Artificial Intelligence