 | 2010 |
|---|
| 7 |       | Omer Horvitz,
Jonathan Katz:
Bounds on the efficiency of black-box commitment schemes.
Theor. Comput. Sci. 411(10): 1251-1260 (2010) |
| 2009 |
|---|
| 6 | | Iftach Haitner,
Omer Horvitz,
Jonathan Katz,
Chiu-Yuen Koo,
Ruggero Morselli,
Ronen Shaltiel:
Reducing Complexity Assumptions for Statistically-Hiding Commitment.
J. Cryptology 22(3): 283-310 (2009) |
| 2007 |
|---|
| 5 | | Omer Horvitz,
Jonathan Katz:
Universally-Composable Two-Party Computation in Two Rounds.
CRYPTO 2007: 111-129 |
| 2005 |
|---|
| 4 | | Iftach Haitner,
Omer Horvitz,
Jonathan Katz,
Chiu-Yuen Koo,
Ruggero Morselli,
Ronen Shaltiel:
Reducing Complexity Assumptions for Statistically-Hiding Commitment.
EUROCRYPT 2005: 58-77 |
| 3 | | Omer Horvitz,
Jonathan Katz:
Bounds on the Efficiency of "Black-Box" Commitment Schemes.
ICALP 2005: 128-139 |
| 2004 |
|---|
| 2 | | Omer Horvitz,
Jonathan Katz,
Chiu-Yuen Koo,
Ruggero Morselli:
Reducing Complexity Assumptions for Statistically-Hiding Commitment.
IACR Cryptology ePrint Archive 2004: 341 (2004) |
| 2003 |
|---|
| 1 | | Omer Horvitz,
Virgil D. Gligor:
Weak Key Authenticity and the Computational Completeness of Formal Encryption.
CRYPTO 2003: 530-547 |
Data released under the ODC-BY 1.0 license — See also our legal information page