Weak Key Authenticity and the Computational Completeness of Formal Encryption. - Omer Horvitz; Virgil D. Gligor (CRYPTO, 2003)

Reducing Complexity Assumptions for Statistically-Hiding Commitment. - Omer Horvitz; Jonathan Katz; Chiu-Yuen Koo; Ruggero Morselli (IACR Cryptol. ePrint Arch., 2004)

Universally-Composable Two-Party Computation in Two Rounds. - Omer Horvitz; Jonathan Katz (CRYPTO, 2007)

Reducing Complexity Assumptions for Statistically-Hiding Commitment. - Iftach Haitner; Omer Horvitz; Jonathan Katz; Chiu-Yuen Koo; Ruggero Morselli; Ronen Shaltiel (J. Cryptol., 2009)

Bounds on the efficiency of black-box commitment schemes. - Omer Horvitz; Jonathan Katz (Theor. Comput. Sci., 2010)