- CSB - MetaPress - Google - Bing - Yahoo
 | 2013 | |
|---|---|---|
| j7 |      | David Mandell Freeman, Oded Goldreich, Eike Kiltz, Alon Rosen, Gil Segev: More Constructions of Lossy and Correlation-Secure Trapdoor Functions. J. Cryptology 26(1): 39-74 (2013) |
| i25 | | Rasmus Pagh, Gil Segev, Udi Wieder: How to Approximate A Set Without Knowing Its Size In Advance. CoRR abs/1304.1188 (2013) |
| i24 | | Ananth Raghunathan, Gil Segev, Salil P. Vadhan: Deterministic Public-Key Encryption for Adaptively Chosen Plaintext Distributions. IACR Cryptology ePrint Archive 2013: 125 (2013) |
| 2012 | ||
| j6 | | Moni Naor, Gil Segev: Public-Key Cryptosystems Resilient to Key Leakage. SIAM J. Comput. 41(4): 772-814 (2012) |
| c26 | | Gil Cohen, Ran Raz, Gil Segev: Non-malleable Extractors with Short Seeds and Applications to Privacy Amplification. IEEE Conference on Computational Complexity 2012: 298-308 |
| c25 | | Ilya Mironov, Omkant Pandey, Omer Reingold, Gil Segev: Incremental Deterministic Public-Key Encryption. EUROCRYPT 2012: 628-644 |
| c24 | | Debayan Gupta, Aaron Segal, Aurojit Panda, Gil Segev, Michael Schapira, Joan Feigenbaum, Jennifer Rexford, Scott Shenker: A new approach to interdomain routing based on secure multi-party computation. HotNets 2012: 37-42 |
| c23 | | Dan Boneh, Gil Segev, Brent Waters: Targeted malleability: homomorphic encryption for restricted computations. ITCS 2012: 350-366 |
| c22 | | |
| i23 | | Ilya Mironov, Omkant Pandey, Omer Reingold, Gil Segev: Incremental Deterministic Public-Key Encryption. IACR Cryptology ePrint Archive 2012: 47 (2012) |
| i22 | | Mihir Bellare, Zvika Brakerski, Moni Naor, Thomas Ristenpart, Gil Segev, Hovav Shacham, Scott Yilek: Hedged Public-key Encryption: How to Protect against Bad Randomness. IACR Cryptology ePrint Archive 2012: 220 (2012) |
| 2011 | ||
| j5 | | Ilya Mironov, Moni Naor, Gil Segev: Sketching in Adversarial Environments. SIAM J. Comput. 40(6): 1845-1870 (2011) |
| c21 | | Zvika Brakerski, Gil Segev: Better Security for Deterministic Public-Key Encryption: The Auxiliary-Input Setting. CRYPTO 2011: 543-560 |
| c20 | | |
| c19 | | L. Elisa Celis, Omer Reingold, Gil Segev, Udi Wieder: Balls and Bins: Smaller Hash Families and Faster Evaluation. FOCS 2011: 599-608 |
| c18 | | Zvika Brakerski, Jonathan Katz, Gil Segev, Arkady Yerukhimovich: Limits on the Power of Zero-Knowledge Proofs in Cryptographic Constructions. TCC 2011: 559-578 |
| i21 | | L. Elisa Celis, Omer Reingold, Gil Segev, Udi Wieder: Balls and Bins: Smaller Hash Families and Faster Evaluation. Electronic Colloquium on Computational Complexity (ECCC) 18: 68 (2011) |
| i20 | | Gil Cohen, Ran Raz, Gil Segev: Non-Malleable Extractors with Short Seeds and Applications to Privacy Amplification. Electronic Colloquium on Computational Complexity (ECCC) 18: 96 (2011) |
| i19 | | Zvika Brakerski, Gil Segev: Better Security for Deterministic Public-Key Encryption: The Auxiliary-Input Setting. IACR Cryptology ePrint Archive 2011: 209 (2011) |
| i18 | | Dan Boneh, Gil Segev, Brent Waters: Targeted Malleability: Homomorphic Encryption for Restricted Computations. IACR Cryptology ePrint Archive 2011: 311 (2011) |
| 2010 | ||
| j4 | | Danny Segev, Gil Segev: Approximate k-Steiner Forests via the Lagrangian Relaxation Technique with Internal Preprocessing. Algorithmica 56(4): 529-549 (2010) |
| j3 | | Alon Rosen, Gil Segev: Chosen-Ciphertext Security via Correlated Products. SIAM J. Comput. 39(7): 3058-3088 (2010) |
| c17 | | Joël Alwen, Yevgeniy Dodis, Moni Naor, Gil Segev, Shabsi Walfish, Daniel Wichs: Public-Key Encryption in the Bounded-Retrieval Model. EUROCRYPT 2010: 113-134 |
| c16 | | Yuriy Arbitman, Moni Naor, Gil Segev: Backyard Cuckoo Hashing: Constant Worst-Case Operations with a Succinct Representation. FOCS 2010: 787-796 |
| c15 | | David Mandell Freeman, Oded Goldreich, Eike Kiltz, Alon Rosen, Gil Segev: More Constructions of Lossy and Correlation-Secure Trapdoor Functions. Public Key Cryptography 2010: 279-295 |
| c14 | | Vadim Lyubashevsky, Adriana Palacio, Gil Segev: Public-Key Cryptographic Primitives Provably as Secure as Subset Sum. TCC 2010: 382-400 |
| i17 | | Elette Boyle, Gil Segev, Daniel Wichs: Fully Leakage-Resilient Signatures. IACR Cryptology ePrint Archive 2010: 488 (2010) |
| 2009 | ||
| j2 | | Tal Moran, Moni Naor, Gil Segev: Deterministic History-Independent Strategies for Storing Information on Write-Once Memories. Theory of Computing 5(1): 43-67 (2009) |
| c13 | | Mihir Bellare, Zvika Brakerski, Moni Naor, Thomas Ristenpart, Gil Segev, Hovav Shacham, Scott Yilek: Hedged Public-Key Encryption: How to Protect against Bad Randomness. ASIACRYPT 2009: 232-249 |
| c12 | | |
| c11 | | Yuriy Arbitman, Moni Naor, Gil Segev: De-amortized Cuckoo Hashing: Provable Worst-Case Performance and Experimental Results. ICALP (1) 2009: 107-118 |
| c10 | | |
| c9 | | |
| i16 | | Yuriy Arbitman, Moni Naor, Gil Segev: De-amortized Cuckoo Hashing: Provable Worst-Case Performance and Experimental Results. CoRR abs/0903.0391 (2009) |
| i15 | | Yuriy Arbitman, Moni Naor, Gil Segev: Backyard Cuckoo Hashing: Constant Worst-Case Operations with a Succinct Representation. CoRR abs/0912.5424 (2009) |
| i14 | | Moni Naor, Gil Segev: Public-Key Cryptosystems Resilient to Key Leakage. IACR Cryptology ePrint Archive 2009: 105 (2009) |
| i13 | | Tal Moran, Moni Naor, Gil Segev: An Optimally Fair Coin Toss. IACR Cryptology ePrint Archive 2009: 214 (2009) |
| i12 | | Joël Alwen, Yevgeniy Dodis, Moni Naor, Gil Segev, Shabsi Walfish, Daniel Wichs: Public-Key Encryption in the Bounded-Retrieval Model. IACR Cryptology ePrint Archive 2009: 512 (2009) |
| i11 | | Vadim Lyubashevsky, Adriana Palacio, Gil Segev: Public-Key Cryptographic Primitives Provably as Secure as Subset Sum. IACR Cryptology ePrint Archive 2009: 576 (2009) |
| i10 | | David Mandell Freeman, Oded Goldreich, Eike Kiltz, Alon Rosen, Gil Segev: More Constructions of Lossy and Correlation-Secure Trapdoor Functions. IACR Cryptology ePrint Archive 2009: 590 (2009) |
| 2008 | ||
| j1 | | 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) |
| c8 | | Tal Moran, Gil Segev: David and Goliath Commitments: UC Computation for Asymmetric Parties Using Tamper-Proof Hardware. EUROCRYPT 2008: 527-544 |
| c7 | | |
| c6 | | |
| c5 | | 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 |
| i9 | | Tal Moran, Gil Segev: David and Goliath Commitments: UC Computation for Asymmetric Parties Using Tamper-Proof Hardware. IACR Cryptology ePrint Archive 2008: 46 (2008) |
| i8 | | Alon Rosen, Gil Segev: Chosen-Ciphertext Security via Correlated Products. IACR Cryptology ePrint Archive 2008: 116 (2008) |
| i7 | | Alon Rosen, Gil Segev: Efficient Lossy Trapdoor Functions based on the Composite Residuosity Assumption. IACR Cryptology ePrint Archive 2008: 134 (2008) |
| i6 | | Moni Naor, Gil Segev, Udi Wieder: History-Independent Cuckoo Hashing. IACR Cryptology ePrint Archive 2008: 358 (2008) |
| 2007 | ||
| c4 | | 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 |
| c3 | | Tal Moran, Moni Naor, Gil Segev: Deterministic History-Independent Strategies for Storing Information on Write-Once Memories. ICALP 2007: 303-315 |
| i5 | | 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) |
| i4 | | 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. IACR Cryptology ePrint Archive 2007: 145 (2007) |
| i3 | | Tal Moran, Moni Naor, Gil Segev: Deterministic History-Independent Strategies for Storing Information on Write-Once Memories. IACR Cryptology ePrint Archive 2007: 151 (2007) |
| i2 | | Iftach Haitner, Jonathan J. Hoch, Gil Segev: A Linear Lower Bound on the Communication Complexity of Single-Server Private Information Retrieval. IACR Cryptology ePrint Archive 2007: 351 (2007) |
| 2006 | ||
| c2 | | Moni Naor, Gil Segev, Adam Smith: Tight Bounds for Unconditional Authentication Protocols in the Manual Channel and Shared Key Models. CRYPTO 2006: 214-231 |
| c1 | | Danny Segev, Gil Segev: Approximate k-Steiner Forests Via the Lagrangian Relaxation Technique with Internal Preprocessing. ESA 2006: 600-611 |
| i1 | | Moni Naor, Gil Segev, Adam Smith: Tight Bounds for Unconditional Authentication Protocols in the Manual Channel and Shared Key Models. IACR Cryptology ePrint Archive 2006: 175 (2006) |
Data released under the ODC-BY 1.0 license — See also our legal information page