A new multi-secret images sharing scheme using Largrange’s interpolation

Secret sharing is to send shares of a secret to several participants, and the hidden secret can be decrypted only by gathering the distributed shares. This paper proposes an efficient secret sharing scheme using Largrange’s interpolation for generalized access structures. Furthermore, the generated...

Full description

Saved in:
Bibliographic Details
Published in:The Journal of systems and software 2005-06, Vol.76 (3), p.327-339
Main Authors: Feng, Jen-Bang, Wu, Hsien-Chu, Tsai, Chwei-Shyong, Chu, Yen-Ping
Format: Article
Language:English
Subjects:
( r, n)-Threshold secret sharing
Cryptography
Digital imaging
Generalized access structure
Lagrange multiplier
Largrange’s interpolation
Mentoring programs
Secret sharing
Security
Studies
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:Secret sharing is to send shares of a secret to several participants, and the hidden secret can be decrypted only by gathering the distributed shares. This paper proposes an efficient secret sharing scheme using Largrange’s interpolation for generalized access structures. Furthermore, the generated shared data for each qualified set is 1/( r − 1) smaller than the original secret image if the corresponding qualified set has r participants. In our sharing process, a sharing circle is constructed first and the shared data is generated from the secret images according to this sharing circle. The properties of the sharing circle not only reduce the size of generated data between two qualified sets but also maintain the security. Thus the actual ratio of the shared data to the original secret images is reduced further. The proposed scheme offers a more efficient and effective way to share multiple secrets.
ISSN:0164-1212
1873-1228
DOI:10.1016/j.jss.2004.07.250