Author:
Cramer Ronald,Gennaro Rosario,Schoenmakers Berry
Publisher
Springer Berlin Heidelberg
Reference36 articles.
1. J. Benaloh. Verifiable Secret-Ballot Elections. PhD thesis, Yale University, Department of Computer Science Department, New Haven, CT, September 1987.
2. J. Benaloh and D. Tuinstra. Receipt-free secret-ballot elections. In Proc. 26th Symposium on Theory of Computing (STOC’ 94), pages 544–553, New York, 1994. A.C.M.
3. J. Benaloh and M. Yung. Distributing the power of a government to enhance the privacy of voters. In Proc. 5th ACM Symposium on Principles of Distributed Computing (PODC’ 86), pages 52–62, New York, 1986. A.C.M.
4. R. Canetti, C. Dwork, M. Naor, and R. Ostrovsky. Deniable encryption, 1996. Manuscript.
5. Lect Notes Comput Sci;R. Cramer,1994
Cited by
230 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献