Non-malleable cryptography

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

	1	Werner Alexi , Benny Chor , Oded Goldreich , Claus P. Schnorr, RSA and Rabin functions: certain parts are as hard as the whole, SIAM Journal on Computing, v.17 n.2, p.194-209, April 1988 [doi>10.1137/0217013]
	2	Mihir Bellare , Silvio Micali, How to sign given any trapdoor function, Proceedings of the twentieth annual ACM symposium on Theory of computing, p.32-42, May 02-04, 1988, Chicago, Illinois, United States [doi>10.1145/62212.62216]
	3	Manuel Blum , Paul Feldman , Silvio Micali, Non-interactive zero-knowledge and its applications, Proceedings of the twentieth annual ACM symposium on Theory of computing, p.103-112, May 02-04, 1988, Chicago, Illinois, United States [doi>10.1145/62212.62222]
	4	M. Blum, A. De Santis, S. Micali and , G. Persiano, Non-Interactzve Zero-Knowledge, MIT-LCS TM-430, May 1990.
	5	Manuel Blum , Shafi Goldwasser, An efficient probabilistic public key encryption scheme which hides all partial information, Proceedings of CRYPTO 84 on Advances in cryptology, p.289-302, August 1985, Santa Barbara, California, United States
	6	B. Chor, S. Goldwasser, S. Micali, and B. Awerbuch, Versfiable Secret Sharing sn the Presence of Faults, Proc. 26th FOCS, pp. 383-395, 1985.
	7	Benny Chor , Michael O. Rabin, Achieving independence in logarithmic number of rounds, Proceedings of the sixth annual ACM Symposium on Principles of distributed computing, p.260-268, August 10-12, 1987, Vancouver, British Columbia, Canada [doi>10.1145/41840.41862]
	8	Yvo Desmedt , Claude Goutier , Samy Bengio, Special Uses and Sbuses of the Fiat-Shamir Passport Protocol, A Conference on the Theory and Applications of Cryptographic Techniques on Advances in Cryptology, p.21-39, August 16-20, 1987
	9	U. Feige and A. Sh#mir, Witness Hiding and Wztness Indzst,ngusshabihty, STOC 1990.
	10	U. Feige , A. Fiat , A. Shamir, Zero-knowledge proofs of identity, Journal of Cryptology, v.1 n.2, p.77-94, Aug. 1988 [doi>10.1007/BF02351717]
	11	u. Feige, D. Lapldot and A. Shamir, Multiple Non- Interactzve Zero-Knowledge Proof# Based on a Single Random Strsng, Proceedings of 31st Symposium on Foundations of Computer Science, 1990, pp. 308-317.
	12	O. Goldreich, A Unz}orm Complexzty Encryption and Zero-knowledge, Technion CS-TR 570, June 1989.
	13	Oded Goldreich , Hugo Krawczyk, On the composition of zero-knowledge proof systems, Proceedings of the seventeenth international colloquium on Automata, languages and programming, p.268-282, July 1990, Warwick University, England
	14	O. Goldreich , L. A. Levin, A hard-core predicate for all one-way functions, Proceedings of the twenty-first annual ACM symposium on Theory of computing, p.25-32, May 14-17, 1989, Seattle, Washington, United States [doi>10.1145/73007.73010]
	15	S. Goldreich, S. Micali and A. Wigderson, Proofs that Yield Nothing But thezr Validity, and a Methodology of Cryptographic Protocol Dessgn, Proceedings of the 27th Symposium on the Foundation of Computer Science, 1986, pp. 174-187.
	16	S. Goldwasser and S. Micali, Probabslsstic Encryption, J. Com. Sys. Sci. 28 (1984), pp 270-299.
	17	S. Goldwasser , S. Micali , C. Rackoff, The knowledge complexity of interactive proof systems, SIAM Journal on Computing, v.18 n.1, p.186-208, Feb. 1989 [doi>10.1137/0218012]
	18	Shafi Goldwasser , Silvio Micali , Ronald L. Rivest, A digital signature scheme secure against adaptive chosen-message attacks, SIAM Journal on Computing, v.17 n.2, p.281-308, April 1988 [doi>10.1137/0217017]
	19	Leonid A. Levin, One-way functions and Pseudorandom generators, Combinatorica, v.7 n.4, p.357-363, Dec, 1987 [doi>10.1007/BF02579323]
	20	Silvio Micali , Charles Rackoff , Bob Sloan, The notion of security for probabilistic cryptosystems, SIAM Journal on Computing, v.17 n.2, p.412-426, April 1988 [doi>10.1137/0217025]
	21	Moni Naor, Bit commitment using pseudo-randomness (extended abstract), Proceedings on Advances in cryptology, p.128-136, July 1989, Santa Barbara, California, United States
	22	M. Naor , M. Yung, Universal one-way hash functions and their cryptographic applications, Proceedings of the twenty-first annual ACM symposium on Theory of computing, p.33-43, May 14-17, 1989, Seattle, Washington, United States [doi>10.1145/73007.73011]
	23	M. Naor , M. Yung, Public-key cryptosystems provably secure against chosen ciphertext attacks, Proceedings of the twenty-second annual ACM symposium on Theory of computing, p.427-437, May 13-17, 1990, Baltimore, Maryland, United States [doi>10.1145/100216.100273]
	24	C. Rackoff and D. Simon, Manuscript, 1990.
	25	J. Rompel, One-way functions are necessary and sufficient for secure signatures, Proceedings of the twenty-second annual ACM symposium on Theory of computing, p.387-394, May 13-17, 1990, Baltimore, Maryland, United States [doi>10.1145/100216.100269]
	26	A. C. Yao, Theory and Applications of Trapdoor }unctions, Proceedings of the 23th Symposium on the Foundation of Computer Science, 1982, pp. 80-91.