Characterizing ideal weighted threshold secret sharing

Lecture Notes in Computer Science

Volumn 3378, Issue , 2005, Pages 600-619

  Beimel, Amos ^a   Tassa, Tamir ^a,b   Weinreb, Enav ^a  

^a BEN GURION UNIVERSITY OF THE NEGEV   (Israel)

^b OPEN UNIVERSITY OF ISRAEL   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

MATRIX ALGEBRA; SECURITY OF DATA; SET THEORY;

ACCESS STRUCTURE; THRESHOLD SECRET SHARING;

COMPUTER SCIENCE;

EID: 24144494482     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/978-3-540-30576-7_32     Document Type: Conference Paper

References (33)

1. A. Beimel and B. Chor. Universally ideal secret sharing schemes. IEEE Trans. on Information Theory, 40(3):786-794, 1994.
2. A. Beimel, T. Tassa, and E. Weinreb. Characterizing ideal weighted threshold secret sharing. Technical Report 04-05, Dept. of Computer Science, Ben-Gurion University, 2004. Available at: www.cs.bgu.ac.il/~beimel/pub.html.
3. A. Beimel and E. Weinreb. Monotone circuits for weighted threshold functions, 2004. In preparation.
4. M. Ben-Or, S. Goldwasser, and A. Wigderson. Completeness theorems for non-cryptographic fault-tolerant distributed computations. In 20th STOC, 1-10, 1988.
5. J. Benaloh and J. Leichter. Generalized secret sharing and monotone functions. In CRYPTO'88, volume 403 of LNCS, pages 27-35. 1990.
6. G. R. Blakley. Safeguarding cryptographic keys. Proc. of the 1979 AFIPS National Computer Conference, pages 313-317. 1979.
7. E. F. Brickell. Some ideal secret sharing schemes. Journal of Combin. Math. and Combin. Comput., 6:105-113, 1989.
8. E. F. Brickell and D. M. Davenport. On the classification of ideal secret sharing schemes. J. of Cryptology, 4(73):123-134, 1991.
9. E. F. Brickell and D. R. Stinson. Some improved bounds on the information rate of perfect secret sharing schemes. J. of Cryptology, 5(3):153-166, 1992.
10. R. M. Capocelli, A. De Santis, L. Gargano, and U. Vaccaro. On the size of shares for secret sharing schemes. J. of Cryptology, 6(3):157-168, 1993.
11. D. Chaum, C. Crépeau, and I. Damgård. Multiparty unconditionally secure protocols. In Proc. of the 20th ACM STOC, pages 11-19, 1988.
12. R. Cramer, I. Damgård, and U. Maurer. General secure multi-party computation from any linear secret-sharing scheme. In EUROCRYPT 2000, volume 1807 of LNCS, pages 316-334. 2000.
13. Y. Desmedt and Y. Frankel. Shared generation of authenticators and signatures. In CRYPTO'91, volume 576 of LNCS, pages 457-469. 1992.
14. M. Ito, A. Saito, and T. Nishizeki. Secret sharing schemes realizing general access structure. In Proc. of Globecom 87, pages 99-102, 1987.
15. W. Jackson, K. M. Martin, and C. M. O'Keefe. Ideal secret sharing schemes with multiple secrets. J. of Cryptology, 9(4):233-250, 1996.
16. M. Karchmer and A. Wigderson. On span programs. In Proc. of the 8th IEEE Structure in Complexity Theory, pages 102-111, 1993.
17. E. D. Karnin, J. W. Greene, and M. E. Hellman. On secret sharing systems. IEEE Trans. on Information Theory, 29(1):35-41, 1983.
18. J. Martí-Farré and C. Padró. Secret sharing schemes on access structures with intersection number equal to one. 3rd SCN, vol. 2576 of LNCS, pp. 354-363. 2002.
19. K. M. Martin. Discrete Structures in the Theory of Secret Sharing. PhD thesis, University of London, 1991.
20. K. M. Martin. New secret sharing schemes from old. J. Combin. Math. Combin. Comput., 14:65-77, 1993.
21. P. Morillo, C. Padró, G. Sáez, and J. L. Villa. Weighted threshold secret sharing schemes. Inform. Process. Lett., 70(5):211-216, 1999.
22. J. G. Oxley. Matroid Theory. Oxford University Press, 1992.
23. C. Padró and G. Sáez. Secret sharing schemes with bipartite access structure. IEEE Trans. on Information Theory, 46:2596-2605, 2000.
24. M. O. Rabin. Randomized Byzantine generals. In Proc. of the 24th IEEE Symp. on Foundations of Computer Science, pages 403-409, 1983.
25. P. D. Seymour. On secret-sharing matroids. J. of Combinatorial Theory, Series B, 56:69-73, 1992.
26. A. Shamir. How to share a secret. Communications of the ACM, 22:612-613, 1979.
27. G. J. Simmons. How to (really) share a secret. In CRYPTO'88, volume 403 of LNCS, pages 390-448. 1990.
28. G. J. Simmons. An introduction to shared secret and/or shared control and their application. In Contemporary Cryptology, The Science of Information Integrity, pages 441-497. IEEE Press, 1992.
29. G. J. Simmons, W. Jackson, and K. M. Martin. The geometry of shared secret schemes. Bulletin of the ICA, 1:71-88, 1991.
30. J. Simonis and A. Ashikhmin. Almost affine codes. Designs, Codes and Cryptography, 14(2):179-197, 1998.
31. D. R. Stinson. An explication of secret sharing schemes. Designs, Codes and Cryptography, 2:357-390, 1992.
32. D. R. Stinson. New general lower bounds on the information rate of secret sharing schemes. In CRYPTO'92, volume 740 of LNCS, pages 168-182. 1993.
33. T. Tassa. Hierarchical threshold secret sharing. In M. Naor, editor, First Theory of Cryptography Conference, TCC 2004, volume 2951 of LNCS, pages 473-490. 2004.