Journal of the ACM Bibliography

Selected papers that cite this one

• Dana Angluin and Michael Kharitonov. When won't membership queries help? Journal of Computer and System Sciences, 50(2):336-355, April 1995.

• Mihir Bellare, Ran Canetti, and Hugo Krawczyk. Pseudorandom functions revisited: The cascade construction and its concrete security. In 37th Annual Symposium on Foundations of Computer Science, pages 514-523, Burlington, Vermont, 14-16 October 1996. IEEE.

• M. Bellare, A. Desai, E. Jokipii, and P. Rogaway. A concrete security treatment of symmetric encryption. In 38th Annual Symposium on Foundations of Computer Science, pages 394-403, Miami Beach, Florida, 20-22 October 1997. IEEE.

• Mihir Bellare, Oded Goldreich, and Shafi Goldwasser. Incremental cryptography and application to virus protection. In Proceedings of the Twenty-Seventh Annual ACM Symposium on the Theory of Computing, pages 45-56, Las Vegas, Nevada, 29 May-1 June 1995.

• Mihir Bellare, Russell Impagliazzo, and Moni Naor. Does parallel repetition lower the error in computationally sound protocols? In 38th Annual Symposium on Foundations of Computer Science, pages 374-383, Miami Beach, Florida, 20-22 October 1997. IEEE.

• Mihir Bellare and Silvio Micali. How to sign given any trapdoor permutation. Journal of the ACM, 39(1):214-233, January 1992.

• Mihir Bellare and Phillip Rogaway. Provably secure session key distribution -- the three party case. In Proceedings of the Twenty-Seventh Annual ACM Symposium on the Theory of Computing, pages 57-66, Las Vegas, Nevada, 29 May-1 June 1995.

• Avrim L. Blum. Separating distribution-free and mistake-bound learning models over the Boolean domain. SIAM Journal on Computing, 23(5):990-1000, October 1994.

• Eran Gabber, Phillip B. Gibbons, Yossi Matias, and Alain Mayer. How to make personalized web browsing simple, secure, and anonymous. In Rafael Hirschfeld, editor, Financial Cryptography: First International Conference, FC '97, volume 1318 of Lecture Notes in Computer Science, pages 17-31, Anguilla, British West Indies, 24-28 February 1997. Springer-Verlag.

• Oded Goldreich and Rafail Ostrovsky. Software protection and simulation on oblivious RAMs. Journal of the ACM, 43(3):431-473, May 1996.

• Oded Goldreich and Yair Oren. Definitions and properties of zero-knowledge proof systems. Journal of Cryptology, 7(1):1-32, Winter 1994.

• Shafi Goldwasser. New directions in cryptography: Twenty some years later (or Cryptography and complexity theory: A match made in heaven). In 38th Annual Symposium on Foundations of Computer Science, pages 314-324, Miami Beach, Florida, 20-22 October 1997. IEEE.

• Russell Impagliazzo and Moni Naor. Efficient cryptographic schemes provably as secure as subset sum. Journal of Cryptology, 9(4):199-216, Autumn 1996.

• Michael Kearns, Yishay Mansour, Dana Ron, Ronitt Rubinfeld, Robert E. Schapire, and Linda Sellie. On the learnability of discrete distributions (extended abstract). In Proceedings of the Twenty-Sixth Annual ACM Symposium on the Theory of Computing, pages 273-282, Montréal, Québec, Canada, 23-25 May 1994.

• Michael Kearns and Leslie Valiant. Cryptographic limitations on learning Boolean formulae and finite automata. Journal of the ACM, 41(1):67-95, January 1994.

• Michael Kharitonov. Cryptographic lower bounds for learnability of Boolean functions on the uniform distribution. Journal of Computer and System Sciences, 50(3):600-610, June 1995.

• Nathan Linial, Yishay Mansour, and Noam Nisan. Constant depth circuits, Fourier transform and learnability. Journal of the ACM, 40(3):607-620, July 1993.

• Michael Luby and Charles Rackoff. A study of password security. Journal of Cryptology, 1(3):151-158, 1989.

• S. Micali and C. P. Schnorr. Efficient, perfect polynomial random number generators. Journal of Cryptology, 3(3):157-172, 1991.

• Moni Naor. Evaluation may be easier than generation (extended abstract). In Proceedings of the Twenty-Eighth Annual ACM Symposium on the Theory of Computing, pages 74-83, Philadelphia, Pennsylvania, 22-24 May 1996.

• Moni Naor. Bit commitment using pseudorandomness. Journal of Cryptology, 4(2):151-158, 1991.

• Moni Naor and Omer Reingold. On the construction of pseudo-random permutations: Luby-Rackoff revisited (extended abstract). In Proceedings of the Twenty-Ninth Annual ACM Symposium on Theory of Computing, pages 189-199, El Paso, Texas, 4-6 May 1997.

• Moni Naor and Omer Reingold. Number-theoretic constructions of efficient pseudo-random functions (extended abstract). In 38th Annual Symposium on Foundations of Computer Science, pages 458-467, Miami Beach, Florida, 20-22 October 1997. IEEE.

• Michael Portz. A generalized description of DES-based and Benes-based permutationgenerators. In Jennifer Seberry and Yuliang Zheng, editors, Advances in Cryptology -- AUSCRYPT '92, volume 718 of Lecture Notes in Computer Science, pages 397-409, Gold Coast, Queensland, Australia, 13-16 December 1992. Springer-Verlag.

• Alexander A. Razborov and Steven Rudich. Natural proofs. In Proceedings of the Twenty-Sixth Annual ACM Symposium on the Theory of Computing, pages 204-213, Montréal, Québec, Canada, 23-25 May 1994.

• Alexander A. Razborov and Steven Rudich. Natural proofs. Journal of Computer and System Sciences, 55(1):24-35, August 1997.

• Ronald L. Rivest and Robert Sloan. A formal model of hierarchical concept learning. Information and Computation, 114(1):88-114, October 1994.

• Alexander Russell. Necessary and sufficient condtions for collision-free hashing. Journal of Cryptology, 8(2):87-99, Spring 1995.

• Alfredo De Santis and Giuseppe Persiano. The power of preprocessing in zero-knowledge proofs of knowledge. Journal of Cryptology, 9(3):129-148, Summer 1996.

• V. G. Vovk. Universal forecasting algorithms. Information and Computation, 96(2):245-277, February 1992.

• Osamu Watanabe and Ricard Gavaldà Structural analysis of polynomial-time query learnability. Mathematical Systems Theory, 27(3):231-256, May/June 1994.

• Adam Young and Moti Yung. Monkey: Black-box symmetric ciphers designed for MONopolizing KEYs. In Serge Vaudenay, editor, Fast Software Encryption: 5th International Workshop, volume 1372 of Lecture Notes in Computer Science, pages 122-133, Paris, France, 23-25 March 1998. Springer-Verlag.

Shortcuts: