Characterizing ideal weighted threshold secret sharing

SIAM Journal on Discrete Mathematics

Volumn 22, Issue 1, 2008, Pages 360-397

  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

Hierarchical access structures; Ideal secret sharing; Matroids; Tripartite access structures

Indexed keywords

HIERARCHICAL ACCESS STRUCTURES; IDEAL SCHEMES; IDEAL SECRET SHARING; MATROIDS; SECRET SHARING SCHEMES; THRESHOLD ACCESS STRUCTURES; THRESHOLD SECRET SHARING; TRIPARTITE ACCESS STRUCTURES;

GRAPH THEORY;

EID: 61849155741     PISSN: 08954801     EISSN: None     Source Type: Journal    
DOI: 10.1137/S0895480104445654     Document Type: Article

References (36)

1. A. BEIMEL AND B. CHOR, Universally ideal secret sharing schemes, IEEE Trans. Inform. Theory, 40 (1994), pp. 786-794.
2. A. BEIMEL AND E. WEINREB, Monotone circuits for monotone weighted threshold functions, Inform. Process. Lett., 97 (2006), pp. 12-18.
3. M. BEN-OR, S. GOLDWASSER, AND A. WIGDERSON, Completeness theorems for noncryptographic fault-tolerant distributed computations, in Proceedings of the 20th ACM Symposium on the Theory of Computing, Chicago, IL, 1988, ACM, New York, pp. 1-10.
4. J. BENALOH AND J. LEICHTER, Generalized secret sharing and monotone functions, in Advances in Cryptology-CRYPTO '88, S. Goldwasser, ed., Lecture Notes in Comput. Sci. 403, Springer-Verlag, New York, 1990, pp. 27-35.
5. G. R. BLAKLEY, Safeguarding cryptographic keys, in Proceedings of the 1979 AFIPS National Computer Conference, R. E. Merwin, J. T. Zanca, and M. Smith, eds., vol. 48 of AFIPS Conference proceedings, AFIPS (American Federation of Information Processing Societies) Press, 1979, pp. 313-317.
6. E. F. BRICKELL, Some ideal secret sharing schemes, J. Combin. Math. Combin. Comput., 6 (1989), pp. 105-113.
7. E. F. BRICKELL AND D. M. DAVENPORT, On the classification of ideal secret sharing schemes, J. Cryptology, 4 (1991), pp. 123-134.
8. E. F. BRICKELL AND D. R. STINSON, Some improved bounds on the information rate of perfect secret sharing schemes, J. Cryptology, 5 (1992), pp. 153-166.
9. R. M. CAPOCELLI, A. DE SANTIS, L. GARGANO, AND U. VACCARO, On the size of shares for secret sharing schemes, J. Cryptology, 6 (1993), pp. 157-168.
10. D. CHAUM, C. CRÉPEAU, AND I. DAMGÅRD, Multiparty unconditionally secure protocols, in Proceedings of the 20th ACM Symposium on the Theory of Computing, Chicago, IL, 1988, ACM, New York, pp. 11-19.
11. M. J. COLLINS, A Note on Ideal Tripartite Access Structures, Technical Report 2002/193, Cryptology ePrint Archive, 2002, online at http://eprint.iacr.org/.
12. R. CRAMER, I. DAMGÅRD, AND U. MAURER, General secure multi-party computation from any linear secret-sharing scheme, in Advances in Cryptology - EUROCRYPT 2000, B. Preneel, ed., Lecture Notes in Comput. Sci. 1807, Springer-Verlag, New York, 2000, pp. 316-334.
13. Y. DESMEDT AND Y. FRANKEL, Shared generation of authenticators and signatures, in Advances in Cryptology-CRYPTO '91, J. Feigenbaum, ed., Lecture Notes in Comput. Sci. 576, Springer-Verlag, New York, 1992, pp. 457-469.
14. O. FARRAS, J. MARTÍ-FARRÉ, AND C. PADRÓ, Ideal multipartite secret sharing schemes, in Advances in Cryptology-EUROCRYPT 2007, M. Naor, ed., Lecture Notes in Comput. Sci. 4515, Springer-Verlag, New York, 2007, pp. 448-465.
15. J. HERRANZ AND G. SÁEZ, New Results on Multipartite Access Structures, Technical Report 2006/048, Cryptology ePrint Archive, 2006, online at http://eprint.iacr.org/.
16. M. ITO, A. SAITO, AND T. NISHIZEKI, Secret sharing schemes realizing general access structure, in Proceedings of the IEEE Global Telecommunication Conference, Globecom 87, 1987, IEEE Press, Piscataway, NJ, pp. 99-102.
17. W. JACKSON, K. M. MARTIN, AND C. M. O'KEEFE, Ideal secret sharing schemes with multiple secrets, J. Cryptology, 9 (1996), pp. 233-250.
18. M. KARCHMER AND A. WIGDERSON, On span programs, in Proceedings of the 8th IEEE Conference on Structure in Complexity Theory, Boston, 1993, IEEE Press, Piscataway, NJ, pp. 102-111.
19. E. D. KARNIN, J. W. GREENE, AND M. E. HELLMAN, On secret sharing systems, IEEE Trans. Inform. Theory, 29 (1983), pp. 35-41.
20. J. MARTÍ-FARRÉ AND C. PADRÓ, Secret sharing schemes on access structures with intersection number equal to one, Discrete Appl. Math., 154 (2006), pp. 552-563.
21. K. M. MARTIN, Discrete Structures in the Theory of Secret Sharing, Ph.D. thesis, Applied Mathematics and Computation, University of London, London, 1991.
22. K. M. MARTIN, New secret sharing schemes from old, J. Combin. Math. Combin. Comput., 14 (1993), pp. 65-77.
23. P. MORILLO, C. PADRÓ, G. SÁEZ, AND J. L. VILLAR, Weighted threshold secret sharing schemes, Inform. Process. Lett., 70 (1999), pp. 211-216.
24. J. G. OXLEY, Matroid Theory, Oxford University Press, London, 1992.
25. C. PADRÓ AND G. SÁEZ, Secret sharing schemes with bipartite access structure, IEEE Trans. Inform. Theory, 46 (2000), pp. 2596-2605.
26. M. O. RABIN, Randomized Byzantine generals, in Proceedings of the 24th IEEE Symposium on Foundations of Computer Science, Tucson, AZ, 1983, IEEE Press, Piscataway, NJ, pp. 403-409.
27. P. D. SEYMOUR, On secret-sharing matroids, J. Combin. Theory Ser. B, 56 (1992), pp. 69-73.
28. A. SHAMIR, HOW to share a secret, Comm. ACM, 22 (1979), pp. 612-613.
29. G. J. SIMMONS, HOW to (really) share a secret, in Advances in Cryptology-CRYPTO '88, S. Goldwasser, ed., Lecture Notes in Comput. Sci. 403, Springer-Verlag, New York, 1990, pp. 390-448.
30. G. J. SIMMONS, An introduction to shared secret and/or shared control and their application, in Contemporary Cryptology, The Science of Information Integrity, G. J. Simmons, ed., IEEE Press, Piscataway, NJ, 1992, pp. 441-497.
31. G. J. SIMMONS, W. JACKSON, AND K. M. MARTIN, The geometry of shared secret schemes, Bulletin of the Institute of Combinatorics and Its Applications, 1 (1991), pp. 71-88.
32. J. SIMONIS AND A. ASHIKHMIN, Almost affine codes, Designs, Codes and Cryptography, 14 (1998), pp. 179-197.
33. D. R. STINSON, An explication of secret sharing schemes, Designs, Codes and Cryptography, 2 (1992), pp. 357-390.
34. D. R. STINSON, New general lower bounds on the information rate of secret sharing schemes, in Advances in Cryptology-CRYPTO '92, E. F. Brickell, ed., Lecture Notes in Comput. Sci. 740, Springer-Verlag, New York, 1993, pp. 168-182.
35. T. TASSA, Hierarchical threshold secret sharing, J. Cryptology, 20 (2007), pp. 237-264.
36. T. TASSA AND N. DYN, Multipartite secret sharing by bivariate interpolation., in Proceedings of the 33rd International Colloquium on Automata, Languages and Programming, M. Bugliesi, B. Preneel, V. Sassone, and I. Wegener, eds., Lecture Notes in Comput. Sci. 4052, Springer-Verlag, New York, 2006, pp. 288-299.