Size of shares and probability of cheating in threshold schemes

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

Volumn 765 LNCS, Issue , 1994, Pages 118-125

  Carpentjeri, Marco ^a   De Santis, Alfredo ^a   Vaccaro, Ugo ^a  

^a UNIVERSITY OF SALERNO   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTER SCIENCE; COMPUTERS;

SECRET INFORMATION; SECRET SHARING SCHEMES; THRESHOLD SCHEMES; THRESHOLD SECRET SHARING;

CRYPTOGRAPHY;

EID: 85028775273     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-48285-7_10     Document Type: Conference Paper

References (20)

1. M. Ben-Or, T. Rabin Verifiable Secret Sharing and Multiparty Protocols with Honest Majority, Proc. 21st ACM Symposium on Theory of Computing, pp. 73–85, 1989.
2. G. R. Blakley, Safeguarding Cryptographic Keys, Proceedings AFIPS 1979 National Computer Conference, pp. 313–317, 1979.
3. C. Blundo, A. De Santis, L. Gargano, and U. Vaccaro, On the Information Rate of Secret Sharing Schemes, “Advances in Cryptology-CRYPTO 92”, Ed. E. Brickell, “Lecture Notes in Computer Science”, Springer-Verlag, (to appear).
4. C. Blundo, A. De Santis, D. R. Stinson, and U. Vaccaro, Graph Decomposition and Secret Sharing Schemes, “Advances in Cryptology-EUROCRYPT 92”, Ed. R. Rueppel, “Lecture Notes in Computer Science”, Springer-Verlag, (to appear).
5. E. F. Brickell and D. M. Davenport, On the Classification of Ideal Secret Sharing Schemes, J. Cryptology, Vol.4, 123–134, 1991.
6. E. F. Brickell and D. R. Stinson, Some Improved Bounds on the Information Rate of Perfect Secret Sharing Schemes, J. Cryptology, Vol. 5, pp. 153–156, 1992.
7. E. F. Brickell, D. R. Stinson, The Detection of Cheaters in Threshold Schemes, SIAM J. Disc. Math, Vol. 4, pp. 502–510, 1991.
8. R. M. Capocelli, A. De Santis, L. Gargano, U. Vaccaro, On the Size of Shares for Secret Sharing Schemes, Advances in Cryptology — CRYPTO’ 91, J. Feigenbaum (Ed.), Lectures Notes in Computer Science, Vol. 576, pp. 101–113, 1992, Springer-Verlag. Also to appear in Journal of Cryptology.
9. I. Csiszár and J. Körner, Information Theory. Coding Theorems for Discrete Memoryless Systems, Academic Press, 1981.
10. D. Denning, Cryptography and Data Security, Addison-Wesley, Reading, MA, 1983.
11. T.S. Ferguson, Mathematical Statistics, Academic Press, New York, 1967.
12. E. D. Karnin, J. W. Greene, and M. E. Hellman, On Secret Sharing Systems, IEEE Trans. on Inform. Theory, Vol. IT-29, pp. 35–41, 1983.
13. A.W. Marshal], I. Olkin, Inequalities: Theory of Majorization and Its Applications, Academic Press, New York, 1979.
14. R. J. McEliece, D. V. Sarwate, On Sharing Secrets and Reed-Solomon Codes, Communications of the ACM, Vol. 24, pp. 583–584, 1981.
15. A. Shamir, How to Share a Secret, Communication of the ACM, Vol. 22, pp. 612–613, 1979.
16. G. Simmons, Robust Shared Secret Schemes or “How to be Sure You Have the Right Answer Even Though You Do Not Know the Question”, Congr. Numer., Vol. 68, pp. 215–248, 1989.
17. G. J. Simmons, An Introduction to Shared Secret and/or Shared Control Schemes and Their Application, Contemporary Cryptology, IEEE Press, pp. 441–497, 1991.
18. D. R. Stinson, An Explication of Secret Sharing Schemes, Design, Codes and Cryptography, Vol. 2, pp. 357–390, 1992.
19. 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.
20. M. Tompa, H. Woll, How to Share a Secret with Cheaters, Journal of Cryptology, Vol. 1, pp. 133–139, 1988.