Searching for authors named "Gil Segev" – sorted by Relevance.
-
David and Goliath Commitments: UC Computation for Asymmetric Parties Using Tamper-Proof Hardware
- Tal Moran ∗ Gil Segev ∗ Abstract Designing secure protocols in the Universal Composability (UC
- Add To MetaCart
-
Approximate k-Steiner Forests via the Lagrangian Relaxation Technique with Internal Preprocessing
- ∗ Danny Segev † Gil Segev ‡ Abstract An instance of the k-Steiner forest problem consists of an undirected
- Cited by 1 (0 self) – Add To MetaCart
-
Efficient lossy trapdoor functions based on the composite residuosity assumption. Cryptology ePrint Archive, Report 2008/134
- Science and Applied Mathematics, Weizmann Institute of Science, Rehovot 76100, Israel. Email: gil.segev
- Cited by 3 (1 self) – Add To MetaCart
-
Public-Key Cryptosystems Resilient to Key Leakage
- Public-Key Cryptosystems Resilient to Key Leakage Moni Naor ∗ Gil Segev † Abstract Most
- Add To MetaCart
-
Deterministic history-independent strategies for storing information on write-once memories
- Moran# Moni Naor### Gil Segev# Abstract Motivated by the challenging task of designing "secure" vote
- Cited by 4 (2 self) – Add To MetaCart
-
Sketching in adversarial environments
- Sketching in Adversarial Environments Ilya Mironov ∗ Moni Naor † Gil Segev ‡ Abstract We formalize
- Cited by 1 (0 self) – Add To MetaCart
-
History-Independent Cuckoo Hashing
- History-Independent Cuckoo Hashing Moni Naor ∗‡ Gil Segev †‡ Udi Wieder § Abstract Cuckoo hashing
- Cited by 2 (1 self) – Add To MetaCart
-
An Optimally Fair Coin Toss
- An Optimally Fair Coin Toss Tal Moran ∗ Moni Naor ∗† Gil Segev ∗ Abstract We address one
- Add To MetaCart
-
De-amortized Cuckoo Hashing: Provable Worst-Case Performance and Experimental Results
- Arbitman ∗ Moni Naor † Gil Segev ‡ Abstract Cuckoo hashing is a highly practical dynamic dictionary
- Add To MetaCart
-
A linear lower bound on the communication complexity of single-server private information retreival (preliminary title
- Retrieval Iftach Haitner ∗ Jonathan J. Hoch ∗ Gil Segev ∗ Abstract We study the communication complexity
- Cited by 2 (1 self) – Add To MetaCart

