Author:
Canetti Rein,Dwork Cynthia,Naor Moni,Ostrovsky Rafail
Publisher
Springer Berlin Heidelberg
Reference19 articles.
1. M. Ajtai, Generating Hard Instances of Lattice Problems, STOC'96
2. M. Ajtai, C. Dwork, A Public-Key Cryptosystem with Average-Case/Worst-Case Equivalence, STOC'97; see also Electronic Colloquium on Computational Complexity TR96-065, http://www.eccc.unitrier.de/eccc-local/Lists/TR-1996.html
3. D. Beaver and S. Haber, Cryptographic Protocols Provably Secure Against Dynamic Adversaries, Eurocrypt, 1992.
4. J. Benaloh and D. Tunistra, Receipt-Free Secret-Ballot Elections, 26th STOC, 1994, pp. 544–552.
5. R. Canetti and R. Gennaro, Incoercible multiparty computation, FOCS'96
Cited by
147 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献