Hierarchical threshold secret sharing

Journal of Cryptology

Volumn 20, Issue 2, 2007, Pages 237-264

  Tassa, Tamir ^a  

^a OPEN UNIVERSITY OF ISRAEL   (Israel)

Author keywords

Birkhoff interpolation; Hierarchical multilevel access structures; Ideal schemes; Secret sharing schemes; Threshold schemes

Indexed keywords

BIRKHOFF INTERPOLATION; IDEAL SCHEMES; MULTILEVEL ACCESS STRUCTURES; SECRET SHARING SCHEMES; THRESHOLD SCHEMES;

DATA STRUCTURES; DATA TRANSFER; HIERARCHICAL SYSTEMS; INTERPOLATION; POLYNOMIALS; PROBLEM SOLVING;

SECURITY OF DATA;

EID: 33947522725     PISSN: 09332790     EISSN: 14321378     Source Type: Journal    
DOI: 10.1007/s00145-006-0334-8     Document Type: Article

References (22)

1. K. Atkinson and A. Sharma, A partial characterization of poised Hermite-Birkhoff interpolation problems, SIAM Journal on Numerical Analysis, vol. 6 (1969), pp. 230-235.
2. A. Beimel, T. Tassa and E. Weinreb, Characterizing ideal weighted threshold secret sharing, The Second Theory of Cryptography Conference, TCC 2005, LNCS 3378, MIT, Cambridge, MA (2005), pp. 600-619.
3. J. Benaloh and J. Leichter, Generalized secret sharing and monotone functions, Advances in Cryptology - CRYPTO 88, LNCS 403, Springer-Verlag, Berlin (1990), pp. 27-35.
4. A. Beutelspacjer and K. Vedder, Geometric structures as threshold schemes, in Cryptography and Coding, Clarendon Press, Oxford (1989), pp. 255-268.
5. G.R. Blakley, Safeguarding cryptographic keys, The National Computer Conference 1979, AFIPS 48 (1979), pp. 313-317.
6. E.F. Brickell, Some ideal secret sharing schemes, Journal of Combinatorial Mathematics and Combinatorial Computing, vol. 9 (1989), pp. 105-113.
7. C. Charnes, K. Martin, J. Pieprzyk and R. Safavi-Naini, Sharing secret information in hierarchical groups, Information and Communications Security, LNCS 1334, Springer-Verlag, Berlin (1997), pp. 81-86.
8. E. Dawson and D. Donovan, The breadth of Shamir's secret sharing scheme, Computers and Security, vol. 13 (1994), pp. 69-78.
9. D.K. Faddeev and I.S. Sominskii, Problems in Higher Algebra, Freeman, San Francisco, CA (1965).
10. J.Friedman, Constructing O(n log n) size monotone formulae for the k-th elementary symmetric polynomial of n Boolean variables, IEEE Symposium on Foundations of Computer Science (1984), pp. 506-515.
11. A. Gal, Combinatorial Methods in Boolean Function Complexity, Ph.D. thesis, University of Chicago (1995).
12. M. Ito, A. Saito and T. Nishizeki, Secret sharing scheme realizing general access structure, IEEE Global Telecommunications Conference (1987), pp. 99-102.
13. M. Karchmer and A. Wigderson, On span programs, in The 8th Structures in Complexity Conference, (1993), pp. 102-111.
14. G.G. Lorentz, K. Jetter and S.D. Riemenschneider, Birkhoff Interpolation, Encyclopedia of Mathematics and its Applications, Vol. 19, Addison-Wesley, Reading, MA (1983).
15. C. Padró and G. Sáez, Secret sharing schemes with bipartite access structure, Advances in Cryptology - EUROCRYPT 98, LNCS 1403, Springer-Verlag, Berlin (1998), pp. 500-511.
16. Schoenberg, I. J., On Hermite-Birkhoff interpolation, Journal of Mathematical Analysis and Applications, vol. 16 (1966), pp. 538-543.
17. A. Shamir, How to share a secret, Communications of the ACM, vol. 22 (1979), pp. 612-613.
18. G.J. Simmons, How to (really) share a secret, Advances in Cryptology - CRYPTO 88, LNCS 403, Springer-Verlag, Berlin (1990), pp. 390-448.
19. G.J. Simmons, An introduction to shared secret and/or shared control schemes and their applications, in Contemporary Cryptology, The Science of Information Integrity, IEEE Press, Piscataway, NJ (1991), pp. 441-197.
20. T. Tassa, Hierarchical threshold secret sharing, in The First Theory of Cryptography Conference, TCC 2004, LNCS 2951, MIT, Cambridge, MA (2004), pp. 473-490.
21. T. Tassa and N. Dyn, Multipartite Secret Sharing by Bivariate Interpolation, The 33rd International Colloquium on Automata, Languages and Programming, ICALP 2006, Part II, LNCS 4052, Springer-Verlag, Berlin (2006), pp. 288-299.
22. A. Wool, Private communication.