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 and Moti Yung. Certifying permutations: Noninteractive zero-knowledge based on any trapdoor permutation. Journal of Cryptology, 9(3):149-166, Summer 1996.

• Josh Benaloh and Dwight Tuinstra. Receipt-free secret-ballot elections (extended abstract). In Proceedings of the Twenty-Sixth Annual ACM Symposium on the Theory of Computing, pages 544-553, Montréal, Québec, Canada, 23-25 May 1994.

• Yvo Desmedt and Jennifer Seberry. Practical proven secure authentication with arbitration. In Jennifer Seberry and Yuliang Zheng, editors, Advances in Cryptology -- AUSCRYPT '92, volume 718 of Lecture Notes in Computer Science, pages 27-32, Gold Coast, Queensland, Australia, 13-16 December 1992. Springer-Verlag.

• 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.

• Markus Jakobsson and Moti Yung. Applying anti-trust policies to increase trust in a versatile e-money system. In Rafael Hirschfeld, editor, Financial Cryptography: First International Conference, FC '97, volume 1318 of Lecture Notes in Computer Science, pages 217-238, Anguilla, British West Indies, 24-28 February 1997. Springer-Verlag.

• Torben Pryds Pedersen and Birgit Pfitzmann. Fail-stop signatures. SIAM Journal on Computing, 26(2):291-330, April 1997.

• Alfredo De Santis, Yvo Desmedt, Yair Frankel, and Moti Yung. How to share a function securely (extended summary). In Proceedings of the Twenty-Sixth Annual ACM Symposium on the Theory of Computing, pages 522-533, Montréal, Québec, Canada, 23-25 May 1994.

Selected references

• Mihir Bellare and Silvio Micali. How to sign given any trapdoor function (extended abstract). In Proceedings of the Twentieth Annual ACM Symposium on Theory of Computing, pages 32-42, Chicago, Illinois, 2-4 May 1988.

• Oded Goldreich, Shafi Goldwasser, and Silvio Micali. How to construct random functions. Journal of the ACM, 33(4):792-807, October 1986.

• Shafi Goldwasser, Silvio Micali, and Andy Yao. Strong signature schemes. In Proceedings of the Fifteenth Annual ACM Symposium on Theory of Computing, pages 431-439, Boston, Massachusetts, 25-27 April 1983.

• Moni Naor and Moti Yung. Universal one-way hash functions and their cryptographic applications. In Proceedings of the Twenty First Annual ACM Symposium on Theory of Computing, pages 33-43, Seattle, Washington, 15-17 May 1989.

• John Rompel. One-way functions are necessary and sufficient for secure signatures. In Proceedings of the Twenty Second Annual ACM Symposium on Theory of Computing, pages 387-394, Baltimore, Maryland, 14-16 May 1990.

• Andrew C. Yao. Theory and applications of trapdoor functions (extended abstract). In 23rd Annual Symposium on Foundations of Computer Science, pages 80-91, Chicago, Illinois, 3-5 November 1982. IEEE.

Shortcuts: