Author:
Alon Noga,Galil Zvi,Yung Moti
Publisher
Springer Berlin Heidelberg
Reference26 articles.
1. N. Alon, and J. Spencer, The Probabilistic Method, (1991), John Wiley and Sons.
2. M. Bellare, S. Micali, and R. Ostrovsky, Perfect Zero Knowledge in Constant Rounds, Proceedings of the 22th Annual Symposium on the Theory of Computing, 1990, pp. 482–493.
3. J. C. Benaloh and M. Yung, Distributing the. Power of a Government to Enhance the Privacy of Voters, Proc. of the 5th ACM Symposium on the Principles in Distributed Computing, 1986, pp. 52–62.
4. M. Ben-Or, S. Goldwasser, and A. Wigderson, “Completeness theorems for non-cryptographic fault-tolerant distributed computation,” ACM STOC 1988, 1–9.
5. G.R. Blakley, Safeguarding Cryptographic Keys, AFIPS Con. Proc (v. 48), 1979, pp 313–317.
Cited by
6 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献