Publisher
Springer Berlin Heidelberg
Reference17 articles.
1. Benaloh, J. and Leichter J., “Generalized secret sharing and monotone functions”, Proc. Crypto’ 88, pp. 27–35.
2. Blakley, G.R., “Safeguarding Cryptographic Keys”, Proc. AFIPS 1979 National Computer Conference, New York, Vol. 48, 1979, pp. 313–317.
3. Blakley, G.R., and Meadows C. “Security of Ramp Schemes”, in Lecture Notes in Computer Science 196; Advances in Cryptology: Proc. Crypto’ 84, Springer-Verlag, 1985, pp.242–268.
4. Brickel, E.F., and Stinson, D.R., “The Detection of Cheaters in Threshold Schemes”, in Lecture Notes in Computer Science 403; Advances in Cryptology: Proc. Crypto’ 88, Springer-Verlag, 1990, pp.564–577.
5. Chor, B., S. Goldwasser, S. Micali, and B. Awerbuch, “Verifiable Secret Sharing and Achieving Simultaneity in the Presence of Faults”, Proc. 26th FOCS, 1985, pp. 383–395.
Cited by
77 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Secure Keyless Multi-party Storage Scheme;Lecture Notes in Computer Science;2024
2. Random spanning trees for expanders, sparsifiers, and virtual network security;Computer Communications;2023-12
3. An effective mechanism for secret sharing in Distributed Blockchain Systems;2023 International Conference on Research Methodologies in Knowledge Management, Artificial Intelligence and Telecommunication Engineering (RMKMATE);2023-11-01
4. Oblivious Paxos;Proceedings of the 2023 ACM Symposium on Cloud Computing;2023-10-30
5. Chosen-ciphertext secure code-based threshold public key encryptions with short ciphertext;Designs, Codes and Cryptography;2023-10-12