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 220 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Authenticable dynamic quantum multi-secret sharing based on the Chinese remainder theorem;Quantum Information Processing;2024-02-03

2. Combinatorial constructions of repairable ramp schemes;Cryptography and Communications;2024-01-17

3. Two (w, ω, n) weighted threshold quantum secret sharing schemes on d-level single quantum systems;Physica Scripta;2023-11-30

4. Secure Medical Data Management Based on Homomorphic Encryption and Secret Sharing;2023 IEEE 8th International Conference on Smart Cloud (SmartCloud);2023-09-16

5. Capturing One-Way Functions via NP-Hardness of Meta-Complexity;Proceedings of the 55th Annual ACM Symposium on Theory of Computing;2023-06-02