Fully dynamic secret sharing schemes

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 773 LNCS, Issue , 1994, Pages 110-125

  Blundo, C ^a   Cresti, A ^b   De Santis, A ^a   Vaccaro, U ^a  

^a UNIVERSITY OF SALERNO   (Italy)

^b SAPIENZA UNIVERSITY OF ROME   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTER SCIENCE; COMPUTERS;

ACCESS STRUCTURE; BROADCAST MESSAGES; COMPUTATIONAL ASSUMPTIONS; FORMAL SETTING; SECRET SHARING SCHEMES;

CRYPTOGRAPHY;

EID: 84996527783     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-48329-2_10     Document Type: Conference Paper

References (17)

1. B. Blakley, G. R. Blakley, A. H. Chan, and J, Massey, Threshold Schemes with Disenrollment, in “Advances in Cryptology - CRYPTO '92", Ed. E. Brickell, “Lecture Notes in Computer Science”, Springer-Verlag.
2. G. R. Blakley, Safeguarding Cryptographic Keys, Proceedings AFIPS 1979 National Computer Conference, pp.313-317, June 1979.
3. C. Blundo, A. De Santis, L. Gargano, and U. Vaccaro, On the Information Rate of Secret Sharing Schemes, in “Advances in Cryptology - CRYPTO '92", Ed. E. Brickell, “Lecture Notes in Computer Science”, Springer-Verlag.
4. C. Blundo, A. De Santis, D. R. Stinson, and U. Vaccaio, Graph Decomposition and Secret Sharing Schemes, in “Advances in Cryptology - Eurocrypt '92", Lecture Notes in Computer Science, Vol. 658, R. Rueppel Ed., Springer-Verlag, pp. 1-24, 1993.
5. E. F. Brickell and D. M. Davenport, On the Classification of Ideal Secret Sharing Schemes, J. Cryptology, Vol. 4, No. 2, pp. 123-134, 1991.
6. R. M. Capocelli, A. De Santis, L. Gargano, and U. Vaccaio, On the Size of Shares for Secret Sharing Schemes, Journal of Cryptology, Vol. 6, No. 3, pp. 157-169, 1993.
7. O. Goldreich, S. Micali, and A. Wigderson, How to Play any Mental Game, Proceedings of 19th ACM Symp. on Theory of Computing, pp. 218-229, 1987.
8. L. Ham, T. Hwang, C. Laih, and J. Lee, Dynamic Threshold Scheme based on the definition of Cross-Product in a N-dimensional Linear Space in “Advances in Cryptology - Eurocrypt '89", Lecture Notes in Computer Science, Vol. 435, J. Brassard Ed., Springer-Verlag, pp. 286-298.
9. E. D. Karnin, J. W. Greene, and M. E. Heilman, On Secret Sharing Systems, IEEE Trans, on Inform. Theory, Vol. IT-29, no. 1, pp. 35-41, Jan. 1983.
10. K. Martin, Discrete Structures in the Theory of Secret Sharing, PhD Thesis, University of London, 1991.
11. K. Martin, Untrustworthy Participants in Perfect Secret Sharing Schemes, Proceedings of the 3rd IMA Conference on Coding and Cryptology, 1992.
12. A. Shamir, How to Share a Secret, Communications of the ACM, Vol. 22, n. 11, pp. 612-613, Nov. 1979.
13. G. J. Simmons, An Introduction to Shared Secret and/or Shared Control Schemes and Their Application, Contemporary Cryptology, IEEE Press, pp. 441-497, 1991.
14. G. J. Simmons, How to (Really) Share a Secret, in “Advances in Cryptology - CRYPTO 88", Ed. S. Goldwasser, “Lecture Notes in Computer Science”, Springer-Verlag.
15. G. J. Simmons, W. Jackson, and K. Martin, The Geometry of Shared Secret Schemes, Bulletin of the ICA, Vol. 1, pp. 71-88, 1991.
16. D. R. Stinson, An Explication of Secret Sharing Schemes, Design, Codes and Cryptography, Vol. 2, pp. 357-390, 1992.
17. D. R. Stinson, Decomposition Constructions for Secret Sharing Schemes, Technical Report UNL-CSE-92-020, Department of Computer Science and Engineering, University of Nebraska, September 1992.