Error correcting and complexity aspects of linear secret sharing schemes

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

Volumn 2851, Issue , 2003, Pages 396-407

  Desmedt, Yvo ^a   Kurosawa, Kaoru ^b   Van Le, Tri ^a  

^a FLORIDA STATE UNIVERSITY   (United States)

^b IBARAKI UNIVERSITY   (Japan)

Author keywords

Error correcting codes; Modules; Secret sharing; VSS

Indexed keywords

ERRORS; INFORMATION THEORY; SECURITY OF DATA;

ACCESS STRUCTURE; ERROR CORRECTING CODE; GENERAL ACCESS STRUCTURE; LINEAR SECRET SHARING SCHEMES; MODULES; SECRET SHARING; SECRET SHARING SCHEMES; THRESHOLD CRYPTOGRAPHY;

CRYPTOGRAPHY;

EID: 33845925223     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/10958513_30     Document Type: Article

References (21)

1. J. C. Benaloh and J. Leichter. Generalized secret sharing and monotone functions. In S. Goldwasser, editor, Advances in Cryptology, Proc. of Crypto'88 (Lecture Notes in Computer Science 403), pages 27-35. Springer-Verlag, 1990. Santa Barbara, California, U.S.A., August 11-15.
2. M. Ben-Or, S. Goldwasser, and A. Wigderson. Completeness theorems for non-cryptographic fault-tolerant distributed computation. In Proceedings of the twentieth annual ACM Symp. Theory of Computing, STOC, pp. 1-10, May 2-4, 1988.
3. S. R. Blackburn, M. Burmester, Y. Desmedt, and P. R. Wild. Efficient multiplicative sharing schemes. In U. Maurer, editor, Advances in Cryptology - Eurocrypt '96, Proceedings (Lecture Notes in Computer Science 1070), pp. 107-118. Springer-Verlag, 1996. Zaragoza, Spain, May 12-16.
4. G. R. Blakley. Safeguarding cryptographic keys. In Proc. Nat. Computer Conf. AFIPS Conf. Proc., pp. 313-317, 1979. vol.48.
5. D. Chaum, C. Crépeau, and I. Damgård. Multiparty unconditionally secure protocols. In Proceedings of the twentieth annual ACM Symp. Theory of Computing, STOC, pp. 11-19, May 2-4, 1988.
6. R. Cramer, I. Damgård, and U. M. Maurer. General secure multi-party computation from any linear secret-sharing scheme. In B. Preneel, editor, Advances in Cryptology - Eurocrypt 2000, Proceedings (Lecture Notes in Computer Science 1807), pp. 316-334. Springer-Verlag, 2000. Bruges, Belgium, May 14-18.
7. A. De Santis, Y. Desmedt, Y. Frankel, and M. Yung. How to share a function securely. In Proceedings of the twenty-sixth annual ACM Symp. Theory of Computing (STOC), pp. 522-533, May 23-25, 1994. Montréal, Québec, Canada.
8. Y. Desmedt, G. Di Crescenzo, and M. Burmester. Multiplicative non-abelian sharing schemes and their application to threshold cryptography. In J. Pieprzyk and R. Safavi-Naini, editors, Advances in Cryptology - Asiacrypt '94, Proceedings (Lecture Notes in Computer Science 917), pp. 21-32. Springer-Verlag, 1995. Wollongong, Australia, November/December, 1994.
9. Y. G. Desmedt and Y. Frankel. Homomorphic zero-knowledge threshold schemes over any finite abelian group. SIAM Journal on Discrete Mathematics, 7(4), pp. 667-679, November 1994.
10. M. Garay and D. Johnson. Computers and Intractability: A guide to NP-completeness. W. H. Freeman and Company, New York, 1979.
11. O. Goldreich, S. Micali, and A. Wigderson. How to play any mental game. In Proceedings of the Nineteenth annual ACM Symp. Theory of Computing, STOC, pp. 218-229, May 25-27, 1987.
12. M. Ito, A. Saito, and T. Nishizeki. Secret sharing schemes realizing general access structures. In Proc. IEEE Global Telecommunications Conf., Globecom'87, pp. 99-102. IEEE Communications Soc. Press, 1987.
13. N. Jacobson. Basic Algebra I. W. H. Freeman and Company, New York, 1985.
14. N. Jacobson. Basic Algebra II. W. H. Freeman and Company, New York, 1989.
15. E. D. Karnin, J. W. Greene, and M. Hellman. On secret sharing systems. IEEE Tr. Inform. Theory, 29(1), pp. 35-41, January 1983.
16. R. J. McEliece and D. V. Sarwate. On sharing secrets and Reed-Solomon codes. Comm. ACM, 24(9), pp. 583-584, September 1981.
17. S. Micali. Fair public-key cryptosystems. In E. F. Brickell, editor, Advances in Cryptology - Crypto '92, Proceedings (Lecture Notes in Computer Science 740), pp. 113-138. Springer-Verlag, 1993. Santa Barbara, California, U.S.A., August 16-20.
18. I. S. Reed and G. Solomon. Polynomial codes over certain finite fields. SIAM Journal on Applied Mathematics, 8, pp. 300-304, 1960.
19. A. Shamir. How to share a secret. Commun. ACM, 22, pp. 612-613, November 1979.
20. G. J. Simmons, W. Jackson, and K. Martin. The geometry of shared secret schemes. Bulletin of the Institute of Combinatorics and its Applications, 1, pp. 71-88, 1991.
21. I. Wegener. The Complexity of Boolean Functions. J. Wiley, New York, 1987.