Abstract
All known constructions of information theoretic t-out-of-n secret sharing schemes require secure, private communication channels among the parties for the reconstruction of the secret. In this work we investigate the cost of performing the reconstruction over public communication channels. A naive implementation of this task distributes O(n) one times pads to each party. This results in shares whose size is O(n) times the secret size. We present three implementations of such schemes that are substantially more efficient:
-
A scheme enabling multiple reconstructions of the secret by different subsets of parties, with factor O(n/t) increase in the shares’ size.
-
A one-time scheme, enabling a single reconstruction of the secret, with O(log(n/t)) increase in the shares’ size.
-
A one-time scheme, enabling a single reconstruction by a set of size exactly t, with factor O(1) increase in the shares’ size.
We prove that the first implementation is optimal (up to constant factors) by showing a tight Ω(n/t) lower bound for the increase in the shares’ size.
Chapter PDF
Similar content being viewed by others
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
R. Ahlswede and I. Csiszar. Common Randomness in Information Theory and Cryptography — Part I: Secret Sharing. IEEE IT, 39(4):1121–1132, July 1993.
A. Beimel and B. Chor. Interaction in Key Distribution Schemes. To appear in IEEE IT. An extended abstract appears in Crypto’ 93, Springer-Verlag, LNCS 773, D.R. Stinson, ed. pp. 444–455.
M. Ben-Or and T. Rabin. Verifiable Secret sharing and Multiparty Protocols with Honest Majority. In Proceeding 21th STOC, pages 73–85. 1989.
J. Benaloh. Secret Sharing Homomorphisms: Keeping Shares of a Secret Secret. In A. M. Odlyzko, editor, CRYPTO’ 86, volume 263 of LNCS, pages 251–260.
J. Benaloh and J. Leichter. Generalized Secret Sharing and Monotone Functions. In S. Goldwasser, ed., CRYPTO’ 88, volume 403 of LNCS, pages 27–35.
B. Blakley, G. R. Blakley, A. H. Chan, and J. Massey. Threshold Schemes with Disenrollment. In E. F. Brickell, ed., CRYPTO’ 92, vol. 740 of LNCS, pp. 540–548.
G. R. Blakley. Safeguarding Cryptographic Keys. In Proc. AFIPS 1979 NCC, vol. 48, pages 313–317, June 1979.
R. Blom. An Optimal Class of Symmetric Key Generation Systems. In T. Beth, N. Cot, and I. Ingemarsson, editors, Eurocrypt 84, volume 209 of LNCS, pages 335–338. Springer-Verlag.
C. Blundo, A. Cresti, A. De Santis, and U. Vaccaro. Fully Dynamic Secret Sharing Schemes. In D. R. Stinson, ed., CRYPTO’ 93, vol. 773 of LNCS, pages 110–125.
C. Blundo, A. De Santis, A. Herzberg, S. Kutten, U. Vaccaro, and M. Yung. Perfectly-Secure Key Distribution for Dynamic Conferences. In E. F. Brickell, editor, CRYPTO’ 92, volume 740 of LNCS, pages 471–486. Springer-Verlag, 1993.
T. M. Cover and J. A. Thomas. Elements of Information Theory. John Wiley & Sons, 1991.
W. Diffie and M. E. Hellman. New Directions in Cryptography. IEEE IT, 22(6):644–654, 1976.
S. Goldwasser and S. Micali. Probabilistic Encryption. JCSS, 28(21):270–299, 1984.
M. Ito, A. Saito, and T. Nishizeki. Secret Sharing Schemes Realizing General Access Structure. In Proc. IEEE Globecom 87, pages 99–102, 1987.
E. D. Karnin, J. W. Greene, and M. E. Hellman. On Secret Sharing Systems. IEEE IT, 29(1):35–41, 1983.
S. C. Kothari. Generalized Linear Threshold Scheme. In G. R. Blakley and D. Chaum, editors, CRYPTO’ 84, volume 196 of LNCS, pages 231–241. Springer-Verlag, 1985.
U. M. Maurer. Secret Key Agreement by Public Discussion from Common Information. IEEE IT, 39(3):733–742, May 1993.
R. J. McEliece and D. V. Sarwate. On Sharing Secrets and Reed-Solomon Codes. Communications of the ACM, 24:583–584, September 1981.
A. Shamir. How to Share a Secret. Communications of the ACM, 22:612–613, 1979.
G. J. Simmons. An Introduction to Shared Secret and/or Shared Control and their Application. In G. J. Simmons, editor, Contemporary Cryptology, pages 441–497. IEEE Press, 1991.
G. J. Simmons, W. Jackson, and K. M. Martin. The Geometry of Shared Secret Schemes. Bulletin of the ICA, 1:71–88, 1991.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1995 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Beimel, A., Chor, B. (1995). Secret Sharing with Public Reconstruction. In: Coppersmith, D. (eds) Advances in Cryptology — CRYPT0’ 95. CRYPTO 1995. Lecture Notes in Computer Science, vol 963. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44750-4_28
Download citation
DOI: https://doi.org/10.1007/3-540-44750-4_28
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-60221-7
Online ISBN: 978-3-540-44750-4
eBook Packages: Springer Book Archive