Searching for authors named "Omer Horvitz" – sorted by Relevance.
-
Weak key authenticity and the computational completeness of formal encryption
- Weak Key Authenticity and the Computational Completeness of Formal Encryption Omer Horvitz 1
- Cited by 9 (0 self) – Add To MetaCart
-
Bounds on the efficiency of "black-box" commitment schemes
- Bounds on the Efficiency of "Black-Box" Commitment Schemes Omer Horvitz ? and Jonathan Katz
- Cited by 1 (0 self) – Add To MetaCart
-
Universally-composable two-party computation in two rounds
- Universally-Composable Two-Party Computation in Two Rounds Omer Horvitz ⋆ and Jonathan Katz
- Cited by 1 (0 self) – Add To MetaCart
-
Bounds on the efficiency of “black-box” commitment schemes
- Bounds on the Efficiency of “Black-Box” Commitment Schemes Omer Horvitz ∗ Jonathan Katz † Abstract
- Cited by 5 (0 self) – Add To MetaCart
-
Lecture 6
- Scribe(s): 1 Introduction Omer Horvitz Zhongchao Yu John Trafton Akhil Gupta In this lecture, we show how
- Add To MetaCart
-
Reducing complexity assumptions for statistically-hiding commitment
- Reducing Complexity Assumptions for Statistically-Hiding Commitment ∗ Iftach Haitner † Omer
- Cited by 16 (6 self) – Add To MetaCart

