Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDGil Segev 0001
Person information
- affiliation: Hebrew University, Israel
Other persons with the same name
- Gil Segev 0002 — BGSegev Ltd., Israel
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2022
[c63]Lior Rotem, Gil Segev:
A Fully-Constructive Discrete-Logarithm Preprocessing Algorithm with an Optimal Time-Space Tradeoff. ITC 2022: 12:1-12:16- [i66]Lior Rotem, Gil Segev:
A Fully-Constructive Discrete-Logarithm Preprocessing Algorithm with an Optimal Time-Space Tradeoff. IACR Cryptol. ePrint Arch. 2022: 583 (2022) - 2021
- [j27]Alon Rosen, Gil Segev, Ido Shahaf:
Can PPAD Hardness be Based on Standard Cryptographic Assumptions? J. Cryptol. 34(1): 8 (2021) - [j26]Gilad Asharov, Gil Segev, Ido Shahaf:
Tight Tradeoffs in Searchable Symmetric Encryption. J. Cryptol. 34(2): 9 (2021) - [j25]Lior Rotem, Gil Segev:
Injective Trapdoor Functions via Derandomization: How Strong is Rudich's Black-Box Barrier? J. Cryptol. 34(4): 39 (2021) - [j24]Gilad Asharov, Moni Naor, Gil Segev, Ido Shahaf:
Searchable Symmetric Encryption: Optimal Locality in Linear Space via Two-Dimensional Balanced Allocations. SIAM J. Comput. 50(5): 1501-1536 (2021) - [c62]Gili Schul-Ganz, Gil Segev:
Generic-Group Identity-Based Encryption: A Tight Impossibility Result. ITC 2021: 26:1-26:23 - [c61]Lior Rotem, Gil Segev:
Tighter Security for Schnorr Identification and Signatures: A High-Moment Forking Lemma for ${\varSigma }$-Protocols. CRYPTO (1) 2021: 222-250 - [c60]Avital Shafran, Gil Segev, Shmuel Peleg, Yedid Hoshen:
Crypto-Oriented Neural Architecture Design. ICASSP 2021: 2680-2684 - [c59]Lior Rotem, Gil Segev:
Non-malleable Vector Commitments via Local Equivocability. TCC (3) 2021: 415-446 - [i65]Iftach Haitner, Jonathan J. Hoch, Omer Reingold, Gil Segev:
Finding Collisions in Interactive Protocols - Tight Lower Bounds on the Round and Communication Complexities of Statistically Hiding Commitments. CoRR abs/2105.01417 (2021) - [i64]Gili Schul-Ganz, Gil Segev:
Generic-Group Identity-Based Encryption: A Tight Impossibility Result. IACR Cryptol. ePrint Arch. 2021: 745 (2021) - [i63]Lior Rotem, Gil Segev:
Tighter Security for Schnorr Identification and Signatures: A High-Moment Forking Lemma for Σ-Protocols. IACR Cryptol. ePrint Arch. 2021: 971 (2021) - [i62]Lior Rotem, Gil Segev:
Non-Malleable Vector Commitments via Local Equivocability. IACR Cryptol. ePrint Arch. 2021: 1207 (2021) - 2020
- [j23]Ilan Komargodski, Gil Segev:
From Minicrypt to Obfustopia via Private-Key Functional Encryption. J. Cryptol. 33(2): 406-458 (2020) - [j22]Moni Naor, Lior Rotem, Gil Segev:
The Security of Lazy Users in Out-of-Band Authentication. ACM Trans. Priv. Secur. 23(2): 9:1-9:32 (2020) - [c58]Lior Rotem, Gil Segev:
Generically Speeding-Up Repeated Squaring Is Equivalent to Factoring: Sharp Thresholds for All Generic-Ring Delay Functions. CRYPTO (3) 2020: 481-509 - [c57]Lior Rotem, Gil Segev, Ido Shahaf:
Generic-Group Delay Functions Require Hidden-Order Groups. EUROCRYPT (3) 2020: 155-180 - [c56]Moni Naor, Lior Rotem, Gil Segev:
Out-Of-Band Authenticated Group Key Exchange: From Strong Authentication to Immediate Key Delivery. ITC 2020: 9:1-9:25 - [c55]Gil Segev, Ido Shahaf:
Hardness vs. (Very Little) Structure in Cryptography: A Multi-Prover Interactive Proofs Perspective. ITC 2020: 10:1-10:23 - [c54]Ido Shahaf, Or Ordentlich, Gil Segev:
An Information-Theoretic Proof of the Streaming Switching Lemma for Symmetric Encryption. ISIT 2020: 858-863 - [c53]Gili Schul-Ganz, Gil Segev:
Accumulators in (and Beyond) Generic Groups: Non-trivial Batch Verification Requires Interaction. TCC (2) 2020: 77-107 - [c52]Lior Rotem, Gil Segev:
Algebraic Distinguishers: From Discrete Logarithms to Decisional Uber Assumptions. TCC (3) 2020: 366-389 - [i61]Ido Shahaf, Or Ordentlich, Gil Segev:
An Information-Theoretic Proof of the Streaming Switching Lemma for Symmetric Encryption. CoRR abs/2004.09935 (2020) - [i60]Lior Rotem, Gil Segev, Ido Shahaf:
Generic-Group Delay Functions Require Hidden-Order Groups. IACR Cryptol. ePrint Arch. 2020: 225 (2020) - [i59]Gil Segev, Ido Shahaf:
Hardness vs. (Very Little) Structure in Cryptography: A Multi-Prover Interactive Proofs Perspective. IACR Cryptol. ePrint Arch. 2020: 330 (2020) - [i58]Ido Shahaf, Or Ordentlich, Gil Segev:
An Information-Theoretic Proof of the Streaming Switching Lemma for Symmetric Encryption. IACR Cryptol. ePrint Arch. 2020: 462 (2020) - [i57]Lior Rotem, Gil Segev:
Generically Speeding-Up Repeated Squaring is Equivalent to Factoring: Sharp Thresholds for All Generic-Ring Delay Functions. IACR Cryptol. ePrint Arch. 2020: 812 (2020) - [i56]Gili Schul-Ganz, Gil Segev:
Accumulators in (and Beyond) Generic Groups: Non-Trivial Batch Verification Requires Interaction. IACR Cryptol. ePrint Arch. 2020: 1106 (2020) - [i55]Lior Rotem, Gil Segev:
Algebraic Distinguishers: From Discrete Logarithms to Decisional Uber Assumptions. IACR Cryptol. ePrint Arch. 2020: 1144 (2020)
2010 – 2019
- 2019
- [i54]Avital Shafran, Gil Segev, Shmuel Peleg, Yedid Hoshen:
Crypto-Oriented Neural Architecture Design. CoRR abs/1911.12322 (2019) - [i53]Moni Naor, Lior Rotem, Gil Segev:
Out-of-Band Authenticated Group Key Exchange: From Strong Authentication to Immediate Key Delivery. IACR Cryptol. ePrint Arch. 2019: 1458 (2019) - 2018
- [j21]Ilan Komargodski, Gil Segev, Eylon Yogev:
Functional Encryption for Randomized Functionalities in the Private-Key Setting from Minimal Assumptions. J. Cryptol. 31(1): 60-100 (2018) - [j20]Ilya Mironov
, Omkant Pandey, Omer Reingold, Gil Segev:
Incremental Deterministic Public-Key Encryption. J. Cryptol. 31(1): 134-161 (2018) - [j19]Zvika Brakerski, Gil Segev:
Function-Private Functional Encryption in the Private-Key Setting. J. Cryptol. 31(1): 202-225 (2018) - [j18]Zvika Brakerski, Ilan Komargodski, Gil Segev:
Multi-input Functional Encryption in the Private-Key Setting: Stronger Security from Weaker Assumptions. J. Cryptol. 31(2): 434-520 (2018) - [j17]Gilad Asharov, Gil Segev:
On Constructing One-Way Permutations from Indistinguishability Obfuscation. J. Cryptol. 31(3): 698-736 (2018) - [j16]Ananth Raghunathan, Gil Segev, Salil P. Vadhan:
Deterministic Public-Key Encryption for Adaptively-Chosen Plaintext Distributions. J. Cryptol. 31(4): 1012-1063 (2018) - [c51]Lior Rotem, Gil Segev:
Out-of-Band Authentication in Group Messaging: Computational, Statistical, Optimal. CRYPTO (1) 2018: 63-89 - [c50]Gilad Asharov, Gil Segev, Ido Shahaf:
Tight Tradeoffs in Searchable Symmetric Encryption. CRYPTO (1) 2018: 407-436 - [c49]Zvika Brakerski, Alex Lombardi, Gil Segev, Vinod Vaikuntanathan:
Anonymous IBE, Leakage Resilience and Circular Security from New Assumptions. EUROCRYPT (1) 2018: 535-564 - [c48]Elette Boyle, Saleet Klein, Alon Rosen, Gil Segev:
Securing Abe's Mix-Net Against Malicious Verifiers via Witness Indistinguishability. SCN 2018: 274-291 - [c47]Gil Segev, Ido Shahaf:
Ciphertext Expansion in Limited-Leakage Order-Preserving Encryption: A Tight Computational Lower Bound. TCC (2) 2018: 177-191 - [c46]Lior Rotem, Gil Segev:
Injective Trapdoor Functions via Derandomization: How Strong is Rudich's Black-Box Barrier? TCC (1) 2018: 421-447 - [c45]Moni Naor, Lior Rotem, Gil Segev:
The Security of Lazy Users in Out-of-Band Authentication. TCC (2) 2018: 575-599 - [i52]Lior Rotem, Gil Segev:
Out-of-Band Authentication in Group Messaging: Computational, Statistical, Optimal. IACR Cryptol. ePrint Arch. 2018: 493 (2018) - [i51]Gilad Asharov, Gil Segev, Ido Shahaf:
Tight Tradeoffs in Searchable Symmetric Encryption. IACR Cryptol. ePrint Arch. 2018: 507 (2018) - [i50]Gil Segev, Ido Shahaf:
Ciphertext Expansion in Limited-Leakage Order-Preserving Encryption: A Tight Computational Lower Bound. IACR Cryptol. ePrint Arch. 2018: 521 (2018) - [i49]Lior Rotem, Gil Segev:
Injective Trapdoor Functions via Derandomization: How Strong is Rudich's Black-Box Barrier? IACR Cryptol. ePrint Arch. 2018: 812 (2018) - [i48]Moni Naor, Lior Rotem, Gil Segev:
The Security of Lazy Users in Out-of-Band Authentication. IACR Cryptol. ePrint Arch. 2018: 823 (2018) - 2017
- [j15]Gilad Asharov, Daniel Demmler, Michael Schapira, Thomas Schneider, Gil Segev, Scott Shenker, Michael Zohner:
Privacy-Preserving Interdomain Routing at Internet Scale. Proc. Priv. Enhancing Technol. 2017(3): 147 (2017) - [c44]Ilan Komargodski, Gil Segev:
From Minicrypt to Obfustopia via Private-Key Functional Encryption. EUROCRYPT (1) 2017: 122-151 - [c43]Zvika Brakerski, Nishanth Chandran, Vipul Goyal, Aayush Jain, Amit Sahai, Gil Segev:
Hierarchical Functional Encryption. ITCS 2017: 8:1-8:27 - [c42]Ilya Mironov, Gil Segev, Ido Shahaf:
Strengthening the Security of Encrypted Databases: Non-transitive JOINs. TCC (2) 2017: 631-661 - [c41]Alon Rosen, Gil Segev, Ido Shahaf:
Can PPAD Hardness be Based on Standard Cryptographic Assumptions? TCC (2) 2017: 747-776 - [i47]Ilan Komargodski, Gil Segev:
From Minicrypt to Obfustopia via Private-Key Functional Encryption. IACR Cryptol. ePrint Arch. 2017: 80 (2017) - [i46]Gilad Asharov, Daniel Demmler, Michael Schapira, Thomas Schneider, Gil Segev, Scott Shenker, Michael Zohner:
Privacy-Preserving Interdomain Routing at Internet Scale. IACR Cryptol. ePrint Arch. 2017: 393 (2017) - [i45]Elette Boyle, Saleet Klein, Alon Rosen, Gil Segev:
Securing Abe's Mix-net Against Malicious Verifiers via Witness Indistinguishability. IACR Cryptol. ePrint Arch. 2017: 544 (2017) - [i44]Ilya Mironov, Gil Segev, Ido Shahaf:
Strengthening the Security of Encrypted Databases: Non-Transitive JOINs. IACR Cryptol. ePrint Arch. 2017: 883 (2017) - [i43]Zvika Brakerski, Alex Lombardi, Gil Segev, Vinod Vaikuntanathan:
Anonymous IBE, Leakage Resilience and Circular Security from New Assumptions. IACR Cryptol. ePrint Arch. 2017: 967 (2017) - 2016
- [j14]Tal Moran, Moni Naor, Gil Segev:
An Optimally Fair Coin Toss. J. Cryptol. 29(3): 491-513 (2016) - [j13]Gilad Asharov, Gil Segev:
Limits on the Power of Indistinguishability Obfuscation and Functional Encryption. SIAM J. Comput. 45(6): 2117-2176 (2016) - [c40]Zvika Brakerski, Ilan Komargodski, Gil Segev:
Multi-input Functional Encryption in the Private-Key Setting: Stronger Security from Weaker Assumptions. EUROCRYPT (2) 2016: 852-880 - [c39]Gilad Asharov, Moni Naor, Gil Segev, Ido Shahaf:
Searchable symmetric encryption: optimal locality in linear space via two-dimensional balanced allocations. STOC 2016: 1101-1114 - [c38]Gilad Asharov, Gil Segev:
On Constructing One-Way Permutations from Indistinguishability Obfuscation. TCC (A2) 2016: 512-541 - [i42]Gilad Asharov, Alon Rosen, Gil Segev:
Indistinguishability Obfuscation Does Not Reduce to Structured Languages. Electron. Colloquium Comput. Complex. TR16 (2016) - [i41]Alon Rosen, Gil Segev, Ido Shahaf:
Can PPAD Hardness be Based on Standard Cryptographic Assumptions? Electron. Colloquium Comput. Complex. TR16 (2016) - [i40]Gilad Asharov, Moni Naor, Gil Segev, Ido Shahaf:
Searchable Symmetric Encryption: Optimal Locality in Linear Space via Two-Dimensional Balanced Allocations. IACR Cryptol. ePrint Arch. 2016: 251 (2016) - [i39]Alon Rosen, Gil Segev, Ido Shahaf:
Can PPAD Hardness be Based on Standard Cryptographic Assumptions? IACR Cryptol. ePrint Arch. 2016: 375 (2016) - 2015
- [j12]Iftach Haitner, Jonathan J. Hoch, Omer Reingold, Gil Segev:
Finding Collisions in Interactive Protocols - Tight Lower Bounds on the Round and Communication Complexities of Statistically Hiding Commitments. SIAM J. Comput. 44(1): 193-242 (2015) - [c37]Prabhanjan Ananth, Zvika Brakerski, Gil Segev, Vinod Vaikuntanathan:
From Selective to Adaptive Security in Functional Encryption. CRYPTO (2) 2015: 657-677 - [c36]Gilad Asharov, Gil Segev:
Limits on the Power of Indistinguishability Obfuscation and Functional Encryption. FOCS 2015: 191-209 - [c35]Zvika Brakerski, Gil Segev:
Function-Private Functional Encryption in the Private-Key Setting. TCC (2) 2015: 306-324 - [c34]Ilan Komargodski, Gil Segev, Eylon Yogev:
Functional Encryption for Randomized Functionalities in the Private-Key Setting from Minimal Assumptions. TCC (2) 2015: 352-377 - [c33]Benny Pinkas, Thomas Schneider, Gil Segev, Michael Zohner:
Phasing: Private Set Intersection Using Permutation-based Hashing. USENIX Security Symposium 2015: 515-530 - [i38]Zvika Brakerski, Ilan Komargodski, Gil Segev:
From Single-Input to Multi-Input Functional Encryption in the Private-Key Setting. IACR Cryptol. ePrint Arch. 2015: 158 (2015) - [i37]Gilad Asharov, Gil Segev:
Limits on the Power of Indistinguishability Obfuscation and Functional Encryption. IACR Cryptol. ePrint Arch. 2015: 341 (2015) - [i36]Martín Abadi, Dan Boneh, Ilya Mironov, Ananth Raghunathan, Gil Segev:
Message-Locked Encryption for Lock-Dependent Messages. IACR Cryptol. ePrint Arch. 2015: 440 (2015) - [i35]Benny Pinkas, Thomas Schneider, Gil Segev, Michael Zohner:
Phasing: Private Set Intersection using Permutation-based Hashing. IACR Cryptol. ePrint Arch. 2015: 634 (2015) - [i34]Gilad Asharov, Gil Segev:
On Constructing One-Way Permutations from Indistinguishability Obfuscation. IACR Cryptol. ePrint Arch. 2015: 752 (2015) - [i33]Zvika Brakerski, Gil Segev:
Hierarchical Functional Encryption. IACR Cryptol. ePrint Arch. 2015: 1011 (2015) - 2014
- [j11]Zvika Brakerski, Gil Segev:
Better Security for Deterministic Public-Key Encryption: The Auxiliary-Input Setting. J. Cryptol. 27(2): 210-247 (2014) - [j10]Gil Cohen, Ran Raz, Gil Segev:
Nonmalleable Extractors with Short Seeds and Applications to Privacy Amplification. SIAM J. Comput. 43(2): 450-476 (2014) - [c32]Dan Boneh, Craig Gentry, Sergey Gorbunov, Shai Halevi, Valeria Nikolaenko, Gil Segev, Vinod Vaikuntanathan, Dhinakaran Vinayagamurthy:
Fully Key-Homomorphic Encryption, Arithmetic Circuit ABE and Compact Garbled Circuits. EUROCRYPT 2014: 533-556 - [i32]Dan Boneh, Craig Gentry, Sergey Gorbunov, Shai Halevi, Valeria Nikolaenko, Gil Segev, Vinod Vaikuntanathan, Dhinakaran Vinayagamurthy:
Fully Key-Homomorphic Encryption, Arithmetic Circuit ABE, and Compact Garbled Circuits. IACR Cryptol. ePrint Arch. 2014: 356 (2014) - [i31]Zvika Brakerski, Gil Segev:
Function-Private Functional Encryption in the Private-Key Setting. IACR Cryptol. ePrint Arch. 2014: 550 (2014) - [i30]Ilan Komargodski, Gil Segev, Eylon Yogev:
Functional Encryption for Randomized Functionalities in the Private-Key Setting from Minimal Assumptions. IACR Cryptol. ePrint Arch. 2014: 868 (2014) - [i29]Prabhanjan Ananth, Zvika Brakerski, Gil Segev, Vinod Vaikuntanathan:
The Trojan Method in Functional Encryption: From Selective to Adaptive Security, Generically. IACR Cryptol. ePrint Arch. 2014: 917 (2014) - 2013
- [j9]David Mandell Freeman, Oded Goldreich, Eike Kiltz, Alon Rosen, Gil Segev:
More Constructions of Lossy and Correlation-Secure Trapdoor Functions. J. Cryptol. 26(1): 39-74 (2013) - [j8]Elette Boyle, Gil Segev, Daniel Wichs:
Fully Leakage-Resilient Signatures. J. Cryptol. 26(3): 513-558 (2013) - [j7]L. Elisa Celis, Omer Reingold, Gil Segev, Udi Wieder:
Balls and Bins: Smaller Hash Families and Faster Evaluation. SIAM J. Comput. 42(3): 1030-1050 (2013) - [c31]Dan Boneh, Ananth Raghunathan, Gil Segev:
Function-Private Subspace-Membership Encryption and Its Applications. ASIACRYPT (1) 2013: 255-275 - [c30]Martín Abadi, Dan Boneh, Ilya Mironov, Ananth Raghunathan, Gil Segev:
Message-Locked Encryption for Lock-Dependent Messages. CRYPTO (1) 2013: 374-391 - [c29]Dan Boneh, Ananth Raghunathan, Gil Segev:
Function-Private Identity-Based Encryption: Hiding the Function in Functional Encryption. CRYPTO (2) 2013: 461-478 - [c28]Ananth Raghunathan, Gil Segev, Salil P. Vadhan:
Deterministic Public-Key Encryption for Adaptively Chosen Plaintext Distributions. EUROCRYPT 2013: 93-110 - [c27]Rasmus Pagh, Gil Segev, Udi Wieder:
How to Approximate a Set without Knowing Its Size in Advance. FOCS 2013: 80-89 - [i28]Rasmus Pagh, Gil Segev, Udi Wieder:
How to Approximate A Set Without Knowing Its Size In Advance. CoRR abs/1304.1188 (2013) - [i27]Ananth Raghunathan, Gil Segev, Salil P. Vadhan:
Deterministic Public-Key Encryption for Adaptively Chosen Plaintext Distributions. IACR Cryptol. ePrint Arch. 2013: 125 (2013) - [i26]Dan Boneh, Ananth Raghunathan, Gil Segev:
Function-Private Identity-Based Encryption: Hiding the Function in Functional Encryption. IACR Cryptol. ePrint Arch. 2013: 283 (2013) - [i25]Dan Boneh, Ananth Raghunathan, Gil Segev:
Function-Private Subspace-Membership Encryption and Its Applications. IACR Cryptol. ePrint Arch. 2013: 403 (2013) - [i24]Dan Boneh, Valeria Nikolaenko, Gil Segev:
Attribute-Based Encryption for Arithmetic Circuits. IACR Cryptol. ePrint Arch. 2013: 669 (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. CCC 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]Krzysztof Pietrzak, Alon Rosen, Gil Segev:
Lossy Functions Do Not Amplify Well. TCC 2012: 458-475 - [i23]Ilya Mironov, Omkant Pandey, Omer Reingold, Gil Segev:
Incremental Deterministic Public-Key Encryption. IACR Cryptol. ePrint Arch. 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 Cryptol. ePrint Arch. 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]Elette Boyle, Gil Segev, Daniel Wichs:
Fully Leakage-Resilient Signatures. EUROCRYPT 2011: 89-108 - [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. Electron. Colloquium Comput. Complex. TR11 (2011) - [i20]Gil Cohen, Ran Raz, Gil Segev:
Non-Malleable Extractors with Short Seeds and Applications to Privacy Amplification. Electron. Colloquium Comput. Complex. TR11 (2011) - [i19]Zvika Brakerski, Gil Segev:
Better Security for Deterministic Public-Key Encryption: The Auxiliary-Input Setting. IACR Cryptol. ePrint Arch. 2011: 209 (2011) - [i18]Dan Boneh, Gil Segev, Brent Waters:
Targeted Malleability: Homomorphic Encryption for Restricted Computations. IACR Cryptol. ePrint Arch. 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]