Hierarchical Threshold Secret Sharing

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

Volumn 2951, Issue , 2004, Pages 473-490

  Tassa, Tamir ^a,b  

^a OPEN UNIVERSITY OF ISRAEL   (Israel)

^b BEN GURION UNIVERSITY OF THE NEGEV   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

FINANCIAL MARKETS; HUMAN RESOURCE MANAGEMENT; INFORMATION THEORY; INTERPOLATION;

ACCESS STRUCTURE; BIRKHOFF INTERPOLATION; DEPARTMENT MANAGERS; HIERARCHICAL GROUPS; HIERARCHICAL STRUCTURES; SECRET SHARING; SECRET SHARING SCHEMES; THRESHOLD SECRET SHARING;

POLYNOMIALS;

EID: 35048827923     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-24638-1_26     Document Type: Article

References (18)

1. Atkinson, K., Sharma, A.: A partial characterization of poised Hermite-Birkhoff interpolation problems. Siam Journal on Numerical Analysis G (1969) 230-235
2. Benaloh, J., Leichter, J.: Generalized secret sharing and monotone functions. Advances in Cryptology - CRYPTO 88, LNCS 403 (1990) 27-35
3. Beutelspacjer, A., Vedder, K.: Geometric structures as threshold schemes. In Cryptography and Coding, Clarendon Press (1989) 255-268
4. Blakley, G.R.: Safeguarding cryptographic keys. In Proceedings of the National Computer Conference, AFIPS 48 (1979) 313-317
5. Brickell, E.F.: Some ideal secret sharing schemes. Journal of Combinatorial Mathematics and Combinatorial Computing 9 (1989) 105-113
6. Charnes, C., Martin, K., Pieprzyk, J., Safavi-Naini, R.: Sharing secret information in hierarchical groups. Information and Communications Security, LNCS 1334 (1997) 81-86
7. Dawson, E., Donovan, D.: The breadth of Shamir's secret sharing scheme. Computers and Security 13 (1994) 69-78
8. Faddeev, D.K., Sominskii, I.S.: Problems in Higher Algebra, San Francisco, W. H. Freeman, 1965
9. Friedman, J.: 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) 506-515
10. Gál, A.: Combinatorial Methods in Boolean Function Complexity. Ph.D. thesis, University of Chicago, 1995
11. Karchmer, M., Wigderson, A.: On span programs. In 8th Annual Conference on Structure in Complexity Theory (SCTC'93), IEEE Computer Society Press (1993) 102-111
12. Lorentz, G.G., Jetter, K., Riemenschneider, S.D.: Birkhoff Interpolation. In Encyclopedia of Mathematics and its Applications 19 (1983), Addison-Wesley, Reading, Mass.
13. Padró, C., Sáez, G.: Secret sharing schemes with bipartite access structure. Advances in Cryptology - EUROCRYPT 98, LNCS 1403 (1998) 500-511
14. Schoenberg, I.J.: On Hermite-Birkhoff interpolation. Journal of Mathematical Analysis and Applications 16 (1966) 538-543
15. Shamir, A.: How to share a secret. Communications of the ACM 22 (1979) 612-613
16. Simmons, G. J.: How to (really) share a secret. Advances in Cryptology - CRYPTO 88, LNCS 403 (1990) 390-448
17. Simmons, G.J.: An introduction to shared secret and/or shared control schemes and their applications. In Contemporary Cryptology, The Science of Information Integrity, IEEE Press (1991) 441-497
18. Wool, A.: Private communication