M. Ajtai, Generating Hard Instances of Lattice Problems, STOC'96
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
D. Beaver and S. Haber, Cryptographic Protocols Provably Secure Against Dynamic Adversaries, Eurocrypt, 1992.
J. Benaloh and D. Tunistra, Receipt-Free Secret-Ballot Elections, 26th STOC, 1994, pp. 544–552.
R. Canetti and R. Gennaro, Incoercible multiparty computation, FOCS'96
R. Canetti, C. Dwork, M. Naor and R. Ostrovsky, Deniable Encryption, Theory of Cryptology Library, http://thoory.lcs.mit.edu/ tcryptol, 1996.
R. Canetti, U. Feige, O. Goldreich and M. Naor, Adaptively secure computation, 28th STOC, 1996.
D. Dolev, C. Dwork and M. Naor, Non-malleable cryptography, STOC'91
P. Feldman, Private Communication, 1986.
A. Herzberg, Rump-Session presentation at CRYPTO 1991.
R. Gennaro, unpublished manuscript.
O. Goldreich and L. Levin, A Hard-Core Predicate to any One-Way Function, 21st STOC, 1989, pp. 25–32.
O. Goldreich, S. Micali and A. Wigderson, Proofs that Yield Nothing but the Validity of the Assertion, and a Methodology of Cryptographic Protocol Design, 27th FOCS, 174–187, 1986.
O. Goldreich, S. Micali and A. Wigderson, How to Play any Mental Game, 19th STOC, pp. 218–229, 1987.
S. Goldwasser and S. Micali, Probabilistic encryption, JCSS
, Vol. 28, No 2, April 1984, pp. 270–299.MATHMathSciNetGoogle Scholar
P. Gutman, Secure Deletion of Data from Magnetic and Solid-State Memory, Sixth USENIX Security Symposium Proceedings, San Jose, California, July 22–25, 1996, pp. 77–89.
M. Naor and M. Yung “ Public key cryptosystems provably secure against chosen ciphertext attacks”, Proc. 22nd ACM Annual Symposium on the Theory of Computing, 1990, pp. 427–437.
C. Rackoff and D. Simon, Non-interactive zero-knowledge proof of knowledge and chosen ciphertext attack, CRYPT0'91, (LNCS 576), 1991.
K. Sako and J. Kilian, Receipt-Free Mix-Type Voting Scheme, Eurocrypt 1995, pp. 393–403.