Abstract
In this paper a method for realizing (t, n) secret images sharing scheme has been proposed. The proposed algorithm for secret images sharing is realized by applying multi-secret sharing schemes based on two-variable one-way functions and Shamir's secret sharing schemes. In the proposed scheme participants only need to pool their pseudo-shares instead of disclosing their secret shares when recovering secret images. Thus, each participant can share many secret images by holding only one secret share. Moreover, the size of each share does not depend on the size of the secret image and this is an important property for the further process of the image shares. The proposed method is a multi-use scheme that can be used in different secret sharing sessions without redistributing participants' secret shares. Compared with other image secret sharing techniques another main advantage of the proposed method is that it does not generate share images which are difficult to manage.
| Original language | English |
|---|---|
| Title of host publication | Proceedings - 2010 IEEE International Conference on Wireless Communications, Networking and Information Security, WCNIS 2010 |
| Pages | 553-557 |
| Number of pages | 5 |
| DOIs | |
| Publication status | Published - 2010 |
| Externally published | Yes |
| Event | 2010 IEEE International Conference on Wireless Communications, Networking and Information Security, WCNIS 2010 - Beijing Duration: 2010 Jun 25 → 2010 Jun 27 |
Other
| Other | 2010 IEEE International Conference on Wireless Communications, Networking and Information Security, WCNIS 2010 |
|---|---|
| City | Beijing |
| Period | 10/6/25 → 10/6/27 |
Keywords
- Polynomial interpolation
- Secret images sharing
- Shamir's secret sharing scheme
- Two-variable one-way function
ASJC Scopus subject areas
- Computer Networks and Communications
- Information Systems