Secret Sharing Over Infinite Domains (Extended Abstract)

A (k, n) secret sharing scheme is a probabilistic mapping of a secret to n shares, such that ? The secret can be reconstructed from any k shares. ? No subset of k - 1 shares reveals any partial information about the secret.Various secret sharing schemes have been proposed, and applications in diverse contexts were found. In all these cases, the set of secrets and the set of shares are finite.In this paper we study the possibility of secret sharing schemes over infinite domains. The major case of interest is when the secrets and the shares are taken from a countable set, for example all binary strings. We show that no (k, n) secret sharing scheme over any countable domain exists (for any 2 < k < n).One consequence of this impossibility result is that no perfect private-key encryption schemes, over the set of all strings, exist. Stated informally, this means that there is no way to perfectly encrypt all strings without revealing information about their length.We contrast these results with the case where both the secrets and the shares are real numbers. Simple secret sharing schemes (and perfect private-key encryption schemes) are presented. Thus, infinity alone does not rule out the possibility of secret sharing.

[1]  Claude E. Shannon,et al.  Communication theory of secrecy systems , 1949, Bell Syst. Tech. J..

[2]  Josh Benaloh,et al.  Secret sharing homomorphisms: keeping shares of a secret secret , 1987, CRYPTO 1987.

[3]  Michael O. Rabin,et al.  Randomized byzantine generals , 1983, 24th Annual Symposium on Foundations of Computer Science (sfcs 1983).

[4]  G. R. BLAKLEY Safeguarding cryptographic keys , 1979, 1979 International Workshop on Managing Requirements Knowledge (MARK).

[5]  Avi Wigderson,et al.  Completeness theorems for non-cryptographic fault-tolerant distributed computation , 1988, STOC '88.

[6]  Suresh C. Kothari,et al.  Generalized Linear Threshold Scheme , 1985, CRYPTO.

[7]  G. R. Blakley,et al.  Infinite Structures in Information Theory , 1982, CRYPTO.

[8]  Martín Abadi,et al.  On hiding information from an oracle , 1987, J. Comput. Syst. Sci..

[9]  Silvio Micali,et al.  How to play ANY mental game , 1987, STOC.

[10]  Josh Benaloh,et al.  Generalized Secret Sharing and Monotone Functions , 1990, CRYPTO.

[11]  Adi Shamir,et al.  How to share a secret , 1979, CACM.

[12]  Douglas R. Stinson,et al.  A Combinatorial Approach to Threshold Schemes , 1987, SIAM J. Discret. Math..

[13]  G. R. Blakley,et al.  Security Proofs for Information Protection Systems , 1981, 1981 IEEE Symposium on Security and Privacy.