| Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
| 1 | Ilya Mironov, Omkant Pandey, Omer Reingold, Gil Segev |
Incremental Deterministic Public-Key Encryption.  |
IACR Cryptology ePrint Archive  |
2012 |
DBLP BibTeX RDF |
|
| 1 | 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 |
DBLP BibTeX RDF |
|
| 1 | Ilya Mironov, Omkant Pandey, Omer Reingold, Gil Segev |
Incremental Deterministic Public-Key Encryption. |
EUROCRYPT |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Krzysztof Pietrzak, Alon Rosen, Gil Segev |
Lossy Functions Do Not Amplify Well. |
TCC |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Dan Boneh, Gil Segev, Brent Waters |
Targeted malleability: homomorphic encryption for restricted computations. |
ITCS |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Gil Cohen, Ran Raz, Gil Segev |
Non-Malleable Extractors with Short Seeds and Applications to Privacy Amplification. |
Electronic Colloquium on Computational Complexity (ECCC) |
2011 |
DBLP BibTeX RDF |
|
| 1 | L. Elisa Celis, Omer Reingold, Gil Segev, Udi Wieder |
Balls and Bins: Smaller Hash Families and Faster Evaluation. |
Electronic Colloquium on Computational Complexity (ECCC) |
2011 |
DBLP BibTeX RDF |
|
| 1 | Zvika Brakerski, Gil Segev |
Better Security for Deterministic Public-Key Encryption: The Auxiliary-Input Setting. |
IACR Cryptology ePrint Archive |
2011 |
DBLP BibTeX RDF |
|
| 1 | Dan Boneh, Gil Segev, Brent Waters |
Targeted Malleability: Homomorphic Encryption for Restricted Computations. |
IACR Cryptology ePrint Archive |
2011 |
DBLP BibTeX RDF |
|
| 1 | Ilya Mironov, Moni Naor, Gil Segev |
Sketching in Adversarial Environments. |
SIAM J. Comput. |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Elette Boyle, Gil Segev, Daniel Wichs |
Fully Leakage-Resilient Signatures. |
EUROCRYPT |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Zvika Brakerski, Jonathan Katz, Gil Segev, Arkady Yerukhimovich |
Limits on the Power of Zero-Knowledge Proofs in Cryptographic Constructions. |
TCC |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Zvika Brakerski, Gil Segev |
Better Security for Deterministic Public-Key Encryption: The Auxiliary-Input Setting. |
CRYPTO |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | L. Elisa Celis, Omer Reingold, Gil Segev, Udi Wieder |
Balls and Bins: Smaller Hash Families and Faster Evaluation. |
FOCS |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Danny Segev, Gil Segev |
Approximate k-Steiner Forests via the Lagrangian Relaxation Technique with Internal Preprocessing. |
Algorithmica |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Elette Boyle, Gil Segev, Daniel Wichs |
Fully Leakage-Resilient Signatures. |
IACR Cryptology ePrint Archive |
2010 |
DBLP BibTeX RDF |
|
| 1 | Alon Rosen, Gil Segev |
Chosen-Ciphertext Security via Correlated Products. |
SIAM J. Comput. |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | David Mandell Freeman, Oded Goldreich, Eike Kiltz, Alon Rosen, Gil Segev |
More Constructions of Lossy and Correlation-Secure Trapdoor Functions. |
Public Key Cryptography |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Joël Alwen, Yevgeniy Dodis, Moni Naor, Gil Segev, Shabsi Walfish, Daniel Wichs |
Public-Key Encryption in the Bounded-Retrieval Model. |
EUROCRYPT |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Vadim Lyubashevsky, Adriana Palacio, Gil Segev |
Public-Key Cryptographic Primitives Provably as Secure as Subset Sum. |
TCC |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Yuriy Arbitman, Moni Naor, Gil Segev |
Backyard Cuckoo Hashing: Constant Worst-Case Operations with a Succinct Representation. |
FOCS |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Tal Moran, Moni Naor, Gil Segev |
Deterministic History-Independent Strategies for Storing Information on Write-Once Memories. |
Theory of Computing |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Moni Naor, Gil Segev |
Public-Key Cryptosystems Resilient to Key Leakage. |
IACR Cryptology ePrint Archive |
2009 |
DBLP BibTeX RDF |
|
| 1 | 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 |
DBLP BibTeX RDF |
|
| 1 | Vadim Lyubashevsky, Adriana Palacio, Gil Segev |
Public-Key Cryptographic Primitives Provably as Secure as Subset Sum. |
IACR Cryptology ePrint Archive |
2009 |
DBLP BibTeX RDF |
|
| 1 | 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 |
DBLP BibTeX RDF |
|
| 1 | Tal Moran, Moni Naor, Gil Segev |
An Optimally Fair Coin Toss. |
IACR Cryptology ePrint Archive |
2009 |
DBLP BibTeX RDF |
|
| 1 | Yuriy Arbitman, Moni Naor, Gil Segev |
Backyard Cuckoo Hashing: Constant Worst-Case Operations with a Succinct Representation |
CoRR |
2009 |
DBLP BibTeX RDF |
|
| 1 | Yuriy Arbitman, Moni Naor, Gil Segev |
De-amortized Cuckoo Hashing: Provable Worst-Case Performance and Experimental Results |
CoRR |
2009 |
DBLP BibTeX RDF |
|
| 1 | Yuriy Arbitman, Moni Naor, Gil Segev |
De-amortized Cuckoo Hashing: Provable Worst-Case Performance and Experimental Results. |
ICALP |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | 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 |
DBLP DOI BibTeX RDF |
|
| 1 | Alon Rosen, Gil Segev |
Chosen-Ciphertext Security via Correlated Products. |
TCC |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Tal Moran, Moni Naor, Gil Segev |
An Optimally Fair Coin Toss. |
TCC |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Moni Naor, Gil Segev |
Public-Key Cryptosystems Resilient to Key Leakage. |
CRYPTO |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Tal Moran, Gil Segev |
David and Goliath Commitments: UC Computation for Asymmetric Parties Using Tamper-Proof Hardware. |
IACR Cryptology ePrint Archive |
2008 |
DBLP BibTeX RDF |
|
| 1 | Alon Rosen, Gil Segev |
Efficient Lossy Trapdoor Functions based on the Composite Residuosity Assumption. |
IACR Cryptology ePrint Archive |
2008 |
DBLP BibTeX RDF |
|
| 1 | Alon Rosen, Gil Segev |
Chosen-Ciphertext Security via Correlated Products. |
IACR Cryptology ePrint Archive |
2008 |
DBLP BibTeX RDF |
|
| 1 | Moni Naor, Gil Segev, Udi Wieder |
History-Independent Cuckoo Hashing. |
IACR Cryptology ePrint Archive |
2008 |
DBLP BibTeX RDF |
|
| 1 | 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 |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Moni Naor, Gil Segev, Udi Wieder |
History-Independent Cuckoo Hashing. |
ICALP |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Tal Moran, Gil Segev |
David and Goliath Commitments: UC Computation for Asymmetric Parties Using Tamper-Proof Hardware. |
EUROCRYPT |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Iftach Haitner, Jonathan J. Hoch, Gil Segev |
A Linear Lower Bound on the Communication Complexity of Single-Server Private Information Retrieval. |
TCC |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Ilya Mironov, Moni Naor, Gil Segev |
Sketching in adversarial environments. |
STOC |
2008 |
DBLP DOI BibTeX RDF |
data stream model., sketch model, massive data sets |
| 1 | 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) |
2007 |
DBLP BibTeX RDF |
|
| 1 | 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 |
DBLP BibTeX RDF |
|
| 1 | 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 |
DBLP BibTeX RDF |
|
| 1 | Tal Moran, Moni Naor, Gil Segev |
Deterministic History-Independent Strategies for Storing Information on Write-Once Memories. |
IACR Cryptology ePrint Archive |
2007 |
DBLP BibTeX RDF |
|
| 1 | Tal Moran, Moni Naor, Gil Segev |
Deterministic History-Independent Strategies for Storing Information on Write-Once Memories. |
ICALP |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | 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 |
DBLP DOI BibTeX RDF |
|
| 1 | 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 |
DBLP BibTeX RDF |
|
| 1 | Danny Segev, Gil Segev |
Approximate k-Steiner Forests Via the Lagrangian Relaxation Technique with Internal Preprocessing. |
ESA |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Moni Naor, Gil Segev, Adam Smith |
Tight Bounds for Unconditional Authentication Protocols in the Manual Channel and Shared Key Models. |
CRYPTO |
2006 |
DBLP DOI BibTeX RDF |
|
![[Valid RSS]](Pics/valid-rss.png "Validate my RSS feed")