Josh Benaloh


Josh Benaloh is a Cryptographer in Microsoft Research.


Background Information

Josh Benaloh has been with the Microsoft Corporation since 1994. He earned an S.B. in Mathematics from MIT in 1981, an M.S. and M.Phil. in Computer Science from Yale University in 1985, and a Ph.D. in Computer Science from Yale University in 1987. He was a postdoctoral fellow at the University of Toronto from 1987 through 1990, and an assistant professor at Clarkson University from 1990 through 1994.


Service to the Research Community


Verifiable Election Technologies

Please see my Verifiable Election Technologies Resources page for information on work in this community.

Publications

(Name before marriage: Josh D. Cohen)

Cohen, J. and Yun, D.
Algebraic Extensions of Arbitrary Integral Domains

Symbolic and Algebraic Computation (Proceedings of EUROSAM `79 International Symposium on Symbolic and Algebraic Manipulation. Marseille, France. June 1979. ed. by Edward Ng.) Lecture Notes in Computer Science, ed. by G. Goos and J. Hartmanis. vol. 72, pp. 134--139. Springer-Verlag. New York. 1979.

Brayton, R., Cohen, J., Hachtel, G., Trager, B., and Yun, D.
Fast Recursive Boolean Function Manipulation

Proceedings of the 1982 International Symposium on Circuits and Systems. Rome, Italy. May 1982. (New York, USA: IEEE 1982), vol. 1, pp. 58--62.

Cohen, J.
Fairing of Biased Coins in Bounded Time

Yale University Department of Computer Science Technical Report number 372. March 1985.

Cohen, J. and Fischer, M.
A Robust and Verifiable Cryptographically Secure Election Scheme

Proceedings of 26th Symposium on Foundations of Computer Science. Portland, OR. October 1985. (New York, USA: IEEE 1985), pp. 372--382. (Also available as Yale University Department of Computer Science Technical Report number 416. July 1985.)

Cohen, J.
Improving Privacy in Cryptographic Elections

Yale University Department of Computer Science Technical Report number 454. February 1986.

(Name after marriage: Josh Cohen Benaloh)

Benaloh, J. and Yung, M.
Distributing the Power of a Government to Enhance the Privacy of Voters

Proceedings of the 5th Symposium on Principles of Distributed Computing. Calgary, AB. August 1986. (New York, USA: ACM 1986), pp. 52--62.

Benaloh, J.
Cryptographic Capsules: A Disjunctive Primitive for Interactive Protocols

Advances in Cryptology Proceedings of CRYPTO `86. Santa Barbara, CA. August 1986. ed. by A. M. Odlyzko.) Lecture Notes in Computer Science, ed. by G. Goos and J. Hartmanis. vol. 263, pp. 213--222. Springer-Verlag. New York. 1987.

Benaloh, J.
Secret Sharing Homomorphisms: Keeping Shares of a Secret Secret

Advances in Cryptology (Proceedings of CRYPTO `86. Santa Barbara, CA. August 1986. ed. by A. M. Odlyzko.) Lecture Notes in Computer Science, ed. by G. Goos and J. Hartmanis. vol. 263, pp. 251--260. Springer-Verlag. New York. 1987.

Benaloh, J.
Verifiable Secret-Ballot Elections

Yale University Department of Computer Science Technical Report number 561. September 1987.

Benaloh, J. and Leichter, J.
Generalized Secret Sharing and Monotone Functions

Advances in Cryptology (Proceedings of CRYPTO `88. Santa Barbara, CA. August 1988. ed. by S. Goldwasser.) Lecture Notes in Computer Science, ed. by G. Goos and J. Hartmanis. vol. 403, pp. 27--35. Springer-Verlag. New York. 1990.

Benaloh, J. and deMare, M.
Efficient Broadcast Time-Stamping

Clarkson University Department of Mathematics and Computer Science Technical Report number TR-MCS-91-1. April 1991. Cryptographic Accumulators and their Applications> Clarkson University Department of Mathematics and Computer Science Technical Report number TR-MCS-92-1. April 1992.>

Benaloh, J. and deMare, M.
One-way Accumulators: A Decentralized Alternative to Digital Signatures

Advances in Cryptology (Proceedings of EuroCrypt `93. Lofthus, Norway. May 1993. ed. by T. Heleseth.) Lecture Notes in Computer Science, ed. by G. Goos and J. Hartmanis. vol. 765, pp. 274--285. Springer-Verlag. New York. 1994.

Benaloh, J. and Tuinstra, D.
Uncoercible Communication

Clarkson University Department of Mathematics and Computer Science Technical Report number TR-MCS-94-1. February 1994.

Benaloh, J.
Dense Probabilistic Encryption

Proceedings of the Workshop on Selected Areas of Cryptography. Kingston, ON. May 1994. pp. 120--128.

Benaloh, J. and Tuinstra, D.
Receipt-Free Secret-Ballot Elections

Proceedings of the 26th ACM Symposium on Theory of Computing. Montreal, PQ. May 1994. (New York, USA: ACM 1994), pp. 544--553.


Cryptography Group's home page

This page last updated 3 February 2004