Omer Horvitz

Mail: last name at cs.umd.edu
Telephone: +1 301 466 7829 

   

Address:

Computer Science Department

A.V. Williams Building
University of Maryland

College Park, MD 20742


About Me

I am a graduate student in the Computer Science department at the University of Maryland.
My advisors are Virgil Gligor and Jonathan Katz.

I'm interested in cryptography, system security and theoretical computer science.

Graduating this year; my CV.


Publications

Journal
  • "Bounds on the Efficiency of 'Black-Box' Commitment Schemes". Omer Horvitz and Jonathan Katz. Invited to a special issue of Theoretical Computer Science. A preliminary full version is available.
  • "Reducing Complexity Assumptions for Statistically-Hiding Commitment". Iftach Haitner, Omer Horvitz, Jonathan Katz, Chiu-Yuen Koo, Ruggero Morselli, and Ronen Shaltiel.  Accepted to Journal of Cryptology. A preliminary full version is available.
  • "Weak Key-Authenticity and the Computational Completeness of Formal Encryption". Omer Horvitz and Virgil Gligor. In Submission.

Conference

  • "Universally-Composable Two-Party Computation in Two Rounds". Omer Horvitz and Jonathan Katz. Crypto 2007. The proceedings version is available.
  • "Lower Bounds on the Efficiency of 'Black-Box' Commitment Schemes". Omer Horvitz and Jonathan Katz. International Colloquium on Automata, Languages and Programming (ICALP) 2005. The proceedings version is available.
  • "Reducing Complexity Assumptions for Statistically-Hiding Commitment". Iftach Haitner, Omer Horvitz, Jonathan Katz, Chiu-Yuen Koo, Ruggero Morselli, and Ronen Shaltiel. Eurocrypt 2005. The proceeding version and an earlier version of the paper are available.
  • "Weak Key-Authenticity and the Computational Completeness of Formal Encryption". Omer Horvitz and Virgil Gligor. Crypto 2003. The proceedings version is available.