Publisher
Springer Berlin Heidelberg
Reference67 articles.
1. N. Alon, Z. Galil and M. Yung, Dynamic-Resharing Verifiable Secret Sharing against Mobile Adversary. 3-d European Symp. on Algorithms (ESA)'95. Lecture Notes in Computer Science Vol. 979, P. Spirakis ed., Springer-Verlag, 1995, pp. 523–537.
2. J. C. Benaloh. Secret sharing homomorphisms: Keeping shares of a secret secret, Advances in Cryptology, Proc. of Crypto'86 LNCS 263, 1987, pp. 251–260.
3. J. C. Benaloh and J. Leichter, Generalized secret sharing and monotone functions. Advances in Cryptology, Proc. of Crypto'88 LNCS 403, Springer-Verlag, 1990, pp. 27–35.
4. M. Ben-Or, S. Goldwasser and A. Wigderson, Completeness theorems for non-cryptographic fault-tolerant distributed computation, Proceedings of the 20th Annual Symposium on Theory of Computing, ACM, 1988, pp. 1–9.
5. R. Blakley, Safeguarding Cryptographic Keys, FIPS Con. Proc (v. 48), 1979, pp. 313–317.
Cited by
14 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Further Readings;Introduction to Network Security;2016-01-01
2. COCA;ACM Transactions on Computer Systems;2002-11
3. Adaptively secure distributed public-key systems;Theoretical Computer Science;2002-09
4. Elliptic Curve Cryptosystems on Smart Cards;IFIP Advances in Information and Communication Technology;2002
5. A PVSS as Hard as Discrete Log and Shareholder Separability;Public Key Cryptography;2001