Generalized Secret Sharing and Monotone Functions-Reference-Cited by-同舟云学术

Generalized Secret Sharing and Monotone Functions

Published:1990 Issue: Volume: Page:27-35
ISSN:0302-9743
Container-title:Advances in Cryptology — CRYPTO’ 88
language:
Short-container-title:

Author:

Benaloh Josh,Leichter Jerry

Publisher

Springer New York

Link

http://link.springer.com/content/pdf/10.1007/0-387-34799-2_3

Reference8 articles.

1. Asmuth, C. and Bloom, J. “A Modular Approach to Key Safeguarding.” Texas A&M University, Department of Mathematics, College Station, TX (1980).

2. Lect Notes Comput Sci;J. Benaloh,1986

3. Benaloh, J. “Verifiable Secret-Ballot Elections.” Ph.D. Thesis presented at Yale University (Sep. 1987).

4. Blakley, G. “Safeguarding Cryptographic Keys.” Proc. AFIPS 1979 National Computer Conference, New York, NY (June 1979), 313–317.

5. Feldman, P. “A Practical Scheme for Non-interactive Verifiable Secret Sharing.” Proc. 28thIEEE Symp. on Foundations of Computer Science, Los Angeles, CA (Oct. 1987), 427–437.

Cited by 233 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. A Novel Authenticated Quantum Anonymous Secret Sharing for Classical and Quantum Information;Advanced Quantum Technologies;2024-09-06

2. Randomness Recoverable Secret Sharing Schemes;Journal of Cryptology;2024-08-20

3. On Boolean functions derived from linear maps over $$\mathbb {Z}_4$$ and their application to secret sharing;Designs, Codes and Cryptography;2024-08-16

4. Combinatorial constructions of repairable threshold schemes;Archiv der Mathematik;2024-08-06

5. On modular (CRT-based) secret sharing;Journal of Computer Virology and Hacking Techniques;2024-07-01