M. Naor
M. Yung
- {1} W. Alexi, B. Chor, O. Goldreich and C. Schnorr, RSA/Rabin Bits are 1/2 + 1/poly Secure, Siam Journal on Computing, 17(2) (1988), pp. 194-209. Google Scholar
Digital Library
- {2} M. Bellare and S. Goldwasser, New Paradigms for Digital Signatures and Message Authentication based on Noninteractive Zero-knowledge Proofs, Crypto 89. Google ScholarDigital Library
- {3} M. Bellare and S. Micali, How to Sign Given Any Trapdoor Function, Proc. 20th Annual Symposium on the Theory of Computing, Chicago, 1988, pp. 32-42. Google ScholarDigital Library
- {4} Blum M., P. Feldman and S. Micali, Non-Interactive Zero-Knowledge Proof Systems, Proc. 20th Annual Symposium on the Theory of Computing, Chicago, 1988, pp. 103-112. Google ScholarDigital Library
- {5} M. Blum, A. De Santis, S. Micali and, G. Persiano, Non-Interactive Zero-Knowledge, Manuscript.Google Scholar
- {6} M. Blum and S. Goldwasser, An Efficient Probabilistic Public-key Encryption that Hides All Partial Information , Proc. of Crypto 84, pp. 289-299. Google ScholarDigital Library
- {7} A. De Santis, S. Micali and G. Persiano, Non-Interactive Zero-Knowledge Proof Systems Proc. of Crypto 87. Google ScholarDigital Library
- {8} W. Diffie and M. Hellman, New Directions in Cryptography , IEEE Trans. on Information Theory 22(6), 1976, pp. 644-654.Google ScholarDigital Library
- {9} U. Feige and A. Shamir, Witness Hiding and Witness Indistinguishability, STOC 1990.Google ScholarDigital Library
- {10} U. Feige, A. Fiat and A. Shamir, Zero Knowledge Proofs of ldentity, J. of Cryptology 1 (2), pp. 77-94. (Preliminary version in STOC 87). Google ScholarDigital Library
- {11} Z. Galil, S. Haber and M. Yung, Symmetric Public-key Cryptosystems, Submitted to J. of Cryptology, (preliminary version in Crypto 85). Google ScholarDigital Library
- {12} O. Goldreich, A Uniform Complexity Encryption and Zero-knowledge, Technion CS-TR 570, June 1989.Google Scholar
- {13} O. Goldreich S. Goldwasser and S. Micali, How to Construct Random Functions, J. of the ACM 33 (1986), pp. 792-807. Google ScholarDigital Library
- {14} O. Goldreich and H. Krawczyk, On the Composition of Zero-knowledge Proof Systems, Technion CS-TR 568, June 1989. (To appear ICALP 90). Google ScholarDigital Library
- {15} O. Goldreich and L. Levin, A Hard Predicate for All One-way Functions, Proc. 21st Annual Symposium on the Theory of Computing, Seattle, 1989, pp. 25-32. Google ScholarDigital Library
- {16} S. Goldreich, S. Micali and A. Wigderson, Proofs that Yield Nothing But their Validity, and a Methodology of Cryptographic Protocol Design, Proceedings of the 27th Symposium on the Foundation of Computer Science, 1986, pp. 174-187.Google ScholarDigital Library
- {17} S. Goldwasser and S. Micali, Probabilistic Encryption J. Com. Sys. Sci. 28 (1984), pp. 270-299.Google ScholarCross Ref
- {18} S. Goldwasser, S. Micali and C. Rackoff, The Knowledge Complexity of Interactive Proof-Systems, Siam J. on Computing, 18(1) (1989), pp. 186-208. Google ScholarDigital Library
- {19} S. Goldwasser, S. Micali and R. Rivest, A Secure Digital Signature Scheme, Siam Journal on Computing, Vol. 17, 2 (1988), pp. 281-308. Google ScholarDigital Library
- {20} S. Goldwasser, S. Micali and P. Tong, Why and How to Establish a Private Code on a Public Network, Proceedings of the 23rd Symposium on the Foundation of Computer Science, 1982, pp. 134-144.Google ScholarDigital Library
- {21} L. Levin, One-way Functions and Pseudo-random Generators , Combinatorica 7 (1987), pp. 357-363. Google ScholarDigital Library
- {22} R. Merkle and M. Hellman, Hiding Information and Signatures in Trapdoor Knapsacks, IEEE Trans. on Information Theory, vol. IT-24, 5 (1978), pp. 525-530.Google Scholar
- {23} S. Micali, Personal Communication, February 1990.Google Scholar
- {24} S. Micali and C. Rackoff and R. Sloan, Notions of Security of Public-Key Cryptosystems, SIAM J. on Computing 17(2) 1988, pp. 412-426. Google ScholarDigital Library
- {25} M. Naor and M. Yung, Universal One-way Hash Functions and their Cryptographic Applications, Proc. 21st Annual Symposium on the Theory of Computing, Seattle, 1989, pp. 33-43. Google ScholarDigital Library
- {26} M. O. Rabin, Digital Signatures and Public Key Functions as Intractable as Factoring, Technical Memo TM- 212, Lab. for Computer Science, MIT, 1979. Google ScholarDigital Library
- {27} C. Rackoff and D. Simon, Manuscript, 1990.Google Scholar
- {28} R. Rivest, A. Shamir and L. Adleman, A Method for Obtaining Digital Signature and Public Key Cryptosystems, Comm. of ACM, 21 (1978), pp. 120-126. Google ScholarDigital Library
- {29} J. Rompel, One-way Function are Necessary and Sufficient for Signatures, STOC 1990. Google ScholarDigital Library
- {30} M. Tompa and H. Woll, Random Self Reducibility and Zero-knowledge Interactive Proofs of Knowledge, Proceedings of the 28th Symposium on the Foundation of Computer Science, 1987.Google ScholarDigital Library
- {31} A. C. Yao, Theory and Applications of Trapdoor functions , Proceedings of the 23th Symposium on the Foundation of Computer Science, 1982, pp. 80-91.Google Scholar
- {32} M. Yung, Cryptoprotocols: Subscription To a Public Key, Proceedings of Crypto 84, Springer-Verlag, 1985, pp. 439- 453. Google ScholarDigital Library
- {33} S. Zachos, Probabilistic Quantifiers, Adversaries and Complexity Classes: an overview, Proceeding of Structure in Complexity, Springer Verlag, 1986, pp. 383-400. Google ScholarDigital Library
Index Terms
- Public-key cryptosystems provably secure against chosen ciphertext attacks
Recommendations
Chosen ciphertext secure keyed-homomorphic public-key cryptosystems
In homomorphic encryption schemes, anyone can perform homomorphic operations, and therefore, it is difficult to manage when, where and by whom they are performed. In addition, the property that anyone can "freely" perform the operation inevitably means ...
Immunizing public key cryptosystems against chosen ciphertext attacks
Three methods for strengthening public key cryptosystems in such a way that they become secure against adaptively chosen ciphertext attacks are presented. In an adaptively chosen ciphertext attack, an attacker can query the deciphering algorithm with ...
A Public Key Encryption Scheme Secure against Key Dependent Chosen Plaintext and Adaptive Chosen Ciphertext Attacks
Proceedings of the 28th Annual International Conference on Advances in Cryptology - EUROCRYPT 2009 - Volume 5479Recently, at Crypto 2008, Boneh, Halevi, Hamburg, and Ostrovsky BHHO solved the long-standing open problem of "circular encryption," by presenting a public key encryption scheme and proving that it is semantically secure against key dependent chosen ...
Comments