Gil Segev

	2009
15		Moni Naor, Gil Segev: Public-Key Cryptosystems Resilient to Key Leakage. CRYPTO 2009: 18-35
14		Yuriy Arbitman, Moni Naor, Gil Segev: De-amortized Cuckoo Hashing: Provable Worst-Case Performance and Experimental Results. ICALP (1) 2009: 107-118
13		Tal Moran, Moni Naor, Gil Segev: An Optimally Fair Coin Toss. TCC 2009: 1-18
12		Alon Rosen, Gil Segev: Chosen-Ciphertext Security via Correlated Products. TCC 2009: 419-436
11		Yuriy Arbitman, Moni Naor, Gil Segev: De-amortized Cuckoo Hashing: Provable Worst-Case Performance and Experimental Results CoRR abs/0903.0391: (2009)
	2008
10		Tal Moran, Gil Segev: David and Goliath Commitments: UC Computation for Asymmetric Parties Using Tamper-Proof Hardware. EUROCRYPT 2008: 527-544
9		Moni Naor, Gil Segev, Udi Wieder: History-Independent Cuckoo Hashing. ICALP (2) 2008: 631-642
8		Ilya Mironov, Moni Naor, Gil Segev: Sketching in adversarial environments. STOC 2008: 651-660
7		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		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		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		Tal Moran, Moni Naor, Gil Segev: Deterministic History-Independent Strategies for Storing Information on Write-Once Memories. ICALP 2007: 303-315
3		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		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		Danny Segev, Gil Segev: Approximate k-Steiner Forests Via the Lagrangian Relaxation Technique with Internal Preprocessing. ESA 2006: 600-611

Coauthor Index

1	Yuriy Arbitman	[11] [14]
2	Iftach Haitner	[3] [5] [7]
3	Jonathan J. Hoch	[3] [5] [7]
4	Ilya Mironov	[8]
5	Tal Moran	[4] [10] [13]
6	Moni Naor	[2] [4] [6] [8] [9] [11] [13] [14] [15]
7	Omer Reingold	[3] [5]
8	Alon Rosen	[12]
9	Danny Segev	[1]
10	Adam Smith	[2] [6]
11	Udi Wieder	[9]

Colors in the list of coauthors