| 2009 |
|---|
| 13 | EE | Tal Moran,
Moni Naor,
Gil Segev:
An Optimally Fair Coin Toss.
TCC 2009: 1-18 |
| 12 | EE | Alon Rosen,
Gil Segev:
Chosen-Ciphertext Security via Correlated Products.
TCC 2009: 419-436 |
| 11 | EE | Yuriy Arbitman,
Moni Naor,
Gil Segev:
De-amortized Cuckoo Hashing: Provable Worst-Case Performance and Experimental Results
CoRR abs/0903.0391: (2009) |
| 2008 |
|---|
| 10 | EE | Tal Moran,
Gil Segev:
David and Goliath Commitments: UC Computation for Asymmetric Parties Using Tamper-Proof Hardware.
EUROCRYPT 2008: 527-544 |
| 9 | EE | Moni Naor,
Gil Segev,
Udi Wieder:
History-Independent Cuckoo Hashing.
ICALP (2) 2008: 631-642 |
| 8 | EE | Ilya Mironov,
Moni Naor,
Gil Segev:
Sketching in adversarial environments.
STOC 2008: 651-660 |
| 7 | EE | Iftach Haitner,
Jonathan J. Hoch,
Gil Segev:
A Linear Lower Bound on the Communication Complexity of Single-Server Private Information Retrieval.
TCC 2008: 445-464 |
| 6 | EE | Moni Naor,
Gil Segev,
Adam Smith:
Tight Bounds for Unconditional Authentication Protocols in the Manual Channel and Shared Key Models.
IEEE Transactions on Information Theory 54(6): 2408-2425 (2008) |
| 2007 |
|---|
| 5 | EE | Iftach Haitner,
Jonathan J. Hoch,
Omer Reingold,
Gil Segev:
Finding Collisions in Interactive Protocols - A Tight Lower Bound on the Round Complexity of Statistically-Hiding Commitments.
FOCS 2007: 669-679 |
| 4 | EE | Tal Moran,
Moni Naor,
Gil Segev:
Deterministic History-Independent Strategies for Storing Information on Write-Once Memories.
ICALP 2007: 303-315 |
| 3 | EE | Iftach Haitner,
Jonathan J. Hoch,
Omer Reingold,
Gil Segev:
Finding Collisions in Interactive Protocols -- A Tight Lower Bound on the Round Complexity of Statistically-Hiding Commitments.
Electronic Colloquium on Computational Complexity (ECCC) 14(038): (2007) |
| 2006 |
|---|
| 2 | EE | Moni Naor,
Gil Segev,
Adam Smith:
Tight Bounds for Unconditional Authentication Protocols in the Manual Channel and Shared Key Models.
CRYPTO 2006: 214-231 |
| 1 | EE | Danny Segev,
Gil Segev:
Approximate k-Steiner Forests Via the Lagrangian Relaxation Technique with Internal Preprocessing.
ESA 2006: 600-611 |
