Recursive Secret Sharing for Distributed Storage and Information Hiding

TL;DR

This paper introduces a recursive multi-secret sharing method that securely hides multiple secrets within shares, enabling reliable secret reconstruction without encryption keys, suitable for secure distributed storage and steganography.

Contribution

It proposes a novel recursive secret sharing technique that does not require encryption keys or public information, enhancing secure distributed storage and information hiding.

Findings

Hides multiple secrets within a single share set.

Allows reconstruction of all secrets with any k shares.

Does not rely on encryption keys or public info.

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.