Recursive secret sharing for distributed storage and information hiding

Authors:
Abhishek Parakh;Subhash Kak
Affiliations:
Computer Science Department, Oklahoma State University, Stillwater, OK;Computer Science Department, Oklahoma State University, Stillwater, OK
Venue:
ANTS'09 Proceedings of the 3rd international conference on Advanced networks and telecommunication systems
Year:
2009

Citing 9
Cited 1

Efficient dispersal of information for security, load balancing, and fault tolerance

Journal of the ACM (JACM)
Secret sharing made short

CRYPTO '93 Proceedings of the 13th annual international cryptology conference on Advances in cryptology
How to share a secret

Communications of the ACM
Recursive hiding of secrets in visual cryptography

Cryptologia
Secure Distributed Storage and Retrieval

WDAG '97 Proceedings of the 11th International Workshop on Distributed Algorithms
Robust computational secret sharing and a unified account of classical secret-sharing goals

Proceedings of the 14th ACM conference on Computer and communications security
New efficient and practical verifiable multi-secret sharing schemes

Information Sciences: an International Journal
Online data storage using implicit security

Information Sciences: an International Journal
Linear multi-secret sharing schemes based on multi-party computation

Finite Fields and Their Applications

Dividing secrets to secure data outsourcing

Information Sciences: an International Journal

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper presents a recursive computational multi-secret sharing technique that hides k - 2 secrets of size b each into n shares of a single secret S of size b, such that any k of the n shares suffice to recreate the secret S as well as all the hidden secrets. This may act as a steganographic channel to transmit hidden information or used for authentication and verification of shares and the secret itself. Further, such a recursive technique may be used as a computational secret sharing technique that has potential applications in secure and reliable storage of information on the Web, in sensor networks and information dispersal schemes. The presented technique, unlike previous computational techniques, does not require the use of any encryption key or storage of public information.