Recursive secret sharing for distributed storage and information hiding

Abhishek Parakh, Subhash Kak

Research output: Chapter in Book/Report/Conference proceedingConference contribution

6 Scopus citations

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.

Original languageEnglish (US)
Title of host publication2009 IEEE 3rd International Symposium on Advanced Networks and Telecommunication Systems, ANTS 2009
DOIs
StatePublished - 2009
Event2009 IEEE 3rd International Symposium on Advanced Networks and Telecommunication Systems, ANTS 2009 - New Delhi, India
Duration: Dec 14 2009Dec 16 2009

Publication series

Name2009 IEEE 3rd International Symposium on Advanced Networks and Telecommunication Systems, ANTS 2009

Conference

Conference2009 IEEE 3rd International Symposium on Advanced Networks and Telecommunication Systems, ANTS 2009
CountryIndia
CityNew Delhi
Period12/14/0912/16/09

ASJC Scopus subject areas

  • Computer Networks and Communications
  • Electrical and Electronic Engineering

Fingerprint Dive into the research topics of 'Recursive secret sharing for distributed storage and information hiding'. Together they form a unique fingerprint.

Cite this