Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDIlan Komargodski
Person information
- affiliation: The Hebrew University of Jerusalem, Israel
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2023
[j21]Gilad Asharov, Ilan Komargodski, Wei-Kai Lin, Kartik Nayak, Enoch Peserico, Elaine Shi:
OptORAMa: Optimal Oblivious RAM. J. ACM 70(1): 4:1-4:70 (2023)- [j20]Pratish Datta, Ilan Komargodski, Brent Waters:
Decentralized Multi-authority ABE for sfNC1 from BDH. J. Cryptol. 36(2): 6 (2023) - [j19]Gilad Asharov, Ilan Komargodski, Wei-Kai Lin, Elaine Shi:
Oblivious RAM with Worst-Case Logarithmic Overhead. J. Cryptol. 36(2): 7 (2023) - [c51]Rex Fernando, Aayush Jain, Ilan Komargodski
:
Maliciously-Secure MrNISC in the Plain Model. EUROCRYPT (2) 2023: 98-128 - [c50]Cody Freitag, Ashrujit Ghoshal, Ilan Komargodski:
Optimal Security for Keyed Hash Functions: Avoiding Time-Space Tradeoffs for Finding Collisions. EUROCRYPT (4) 2023: 440-469 - [c49]Pratish Datta, Ilan Komargodski, Brent Waters:
Fully Adaptive Decentralized Multi-Authority ABE. EUROCRYPT (3) 2023: 447-478 - [i64]Cody Freitag, Ashrujit Ghoshal, Ilan Komargodski:
Optimal Security for Keyed Hash Functions: Avoiding Time-Space Tradeoffs for Finding Collisions. IACR Cryptol. ePrint Arch. 2023: 348 (2023) - 2022
- [j18]Naomi Ephraim, Cody Freitag, Ilan Komargodski, Rafael Pass:
SPARKs: Succinct Parallelizable Arguments of Knowledge. J. ACM 69(5): 31:1-31:88 (2022) - [j17]Gilad Asharov, Ilan Komargodski, Rafael Pass, Naomi Sirkin:
On the Complexity of Compressing Obfuscation. J. Cryptol. 35(3): 21 (2022) - [j16]Ilan Komargodski, Tal Moran, Moni Naor, Rafael Pass, Alon Rosen, Eylon Yogev:
One-Way Functions and (Im)perfect Obfuscation. SIAM J. Comput. 51(6): 1769-1795 (2022) - [c48]Cody Freitag, Ashrujit Ghoshal, Ilan Komargodski:
Time-Space Tradeoffs for Sponge Hashing: Attacks and Limitations for Short Collisions. CRYPTO (3) 2022: 131-160 - [c47]Ashrujit Ghoshal, Ilan Komargodski:
On Time-Space Tradeoffs for Bounded-Length Collisions in Merkle-Damgård Hashing. CRYPTO (3) 2022: 161-191 - [c46]Ilan Komargodski, Shin'ichiro Matsuo, Elaine Shi, Ke Wu:
log *-Round Game-Theoretically-Fair Leader Election. CRYPTO (3) 2022: 409-438 - [c45]Rex Fernando, Yuval Gelles, Ilan Komargodski, Elaine Shi:
Maliciously Secure Massively Parallel Computation for All-but-One Corruptions. CRYPTO (1) 2022: 688-718 - [c44]Gilad Asharov, Ilan Komargodski, Wei-Kai Lin, Enoch Peserico, Elaine Shi:
Optimal Oblivious Parallel RAM. SODA 2022: 2459-2521 - [i63]Nimrod Aviram, Benjamin Dowling, Ilan Komargodski, Kenneth G. Paterson, Eyal Ronen, Eylon Yogev:
Practical (Post-Quantum) Key Combiners from One-Wayness and Applications to TLS. IACR Cryptol. ePrint Arch. 2022: 65 (2022) - [i62]Ashrujit Ghoshal, Ilan Komargodski:
On Time-Space Tradeoffs for Bounded-Length Collisions in Merkle-Damgard Hashing. IACR Cryptol. ePrint Arch. 2022: 309 (2022) - [i61]Cody Freitag, Ilan Komargodski:
The Cost of Statistical Security in Interactive Proofs for Repeated Squaring. IACR Cryptol. ePrint Arch. 2022: 766 (2022) - [i60]Ilan Komargodski, Shin'ichiro Matsuo, Elaine Shi, Ke Wu:
log*-Round Game-Theoretically-Fair Leader Election. IACR Cryptol. ePrint Arch. 2022: 791 (2022) - [i59]Ilan Komargodski, Elaine Shi:
Differentially Oblivious Turing Machines. IACR Cryptol. ePrint Arch. 2022: 883 (2022) - [i58]Cody Freitag, Ashrujit Ghoshal, Ilan Komargodski:
Time-Space Tradeoffs for Sponge Hashing: Attacks and Limitations for Short Collisions. IACR Cryptol. ePrint Arch. 2022: 1009 (2022) - [i57]Rex Fernando, Yuval Gelles, Ilan Komargodski, Elaine Shi:
Maliciously Secure Massively Parallel Computation for All-but-One Corruptions. IACR Cryptol. ePrint Arch. 2022: 1027 (2022) - [i56]Pratish Datta, Ilan Komargodski, Brent Waters:
Fully Adaptive Decentralized Multi-Authority ABE. IACR Cryptol. ePrint Arch. 2022: 1311 (2022) - 2021
- [j15]Yael Tauman Kalai, Ilan Komargodski, Ran Raz:
A Lower Bound for Adaptively-Secure Collective Coin Flipping Protocols. Comb. 41(1): 75-98 (2021) - [c43]Dana Dachman-Soled, Ilan Komargodski, Rafael Pass:
Non-malleable Codes for Bounded Parallel-Time Tampering. CRYPTO (3) 2021: 535-565 - [c42]Ilan Komargodski, Wei-Kai Lin:
A Logarithmic Lower Bound for Oblivious RAM (for All Parameters). CRYPTO (4) 2021: 579-609 - [c41]Gilad Asharov, Ilan Komargodski, Wei-Kai Lin, Elaine Shi:
Oblivious RAM with Worst-Case Logarithmic Overhead. CRYPTO (4) 2021: 610-640 - [c40]Pratish Datta, Ilan Komargodski, Brent Waters:
Decentralized Multi-authority ABE for DNFs from LWE. EUROCRYPT (1) 2021: 177-209 - [c39]Fabrice Benhamouda, Aayush Jain, Ilan Komargodski, Huijia Lin:
Multiparty Reusable Non-interactive Secure Computation from LWE. EUROCRYPT (2) 2021: 724-753 - [c38]Ilan Komargodski, Elaine Shi:
Differentially Oblivious Turing Machines. ITCS 2021: 68:1-68:19 - [c37]Cody Freitag, Ilan Komargodski, Rafael Pass, Naomi Sirkin:
Non-malleable Time-Lock Puzzles and Applications. TCC (3) 2021: 447-479 - [i55]Nir Bitansky, Iftach Haitner, Ilan Komargodski, Eylon Yogev:
Distributional Collision Resistance Beyond One-Way Functions. CoRR abs/2105.00710 (2021) - [i54]Itay Berman, Iftach Haitner, Ilan Komargodski, Moni Naor:
Hardness-Preserving Reductions via Cuckoo Hashing. CoRR abs/2105.01409 (2021) - [i53]Fabrice Benhamouda, Aayush Jain, Ilan Komargodski, Huijia Lin:
Multiparty Reusable Non-Interactive Secure Computation from LWE. IACR Cryptol. ePrint Arch. 2021: 378 (2021) - [i52]Gilad Asharov, Ilan Komargodski, Wei-Kai Lin, Elaine Shi:
Oblivious RAM with Worst-Case Logarithmic Overhead. IACR Cryptol. ePrint Arch. 2021: 1123 (2021) - [i51]Rex Fernando, Aayush Jain, Ilan Komargodski:
Maliciously-Secure MrNISC in the Plain Model. IACR Cryptol. ePrint Arch. 2021: 1319 (2021) - [i50]Pratish Datta, Ilan Komargodski, Brent Waters:
Decentralized Multi-Authority ABE for NC^1 from Computational-BDH. IACR Cryptol. ePrint Arch. 2021: 1325 (2021) - 2020
- [j14]Ilan Komargodski, Gil Segev:
From Minicrypt to Obfustopia via Private-Key Functional Encryption. J. Cryptol. 33(2): 406-458 (2020) - [j13]Andrej Bogdanov, Siyao Guo, Ilan Komargodski:
Threshold Secret Sharing Requires a Linear-Size Alphabet. Theory Comput. 16: 1-18 (2020) - [c36]Naomi Ephraim, Cody Freitag, Ilan Komargodski, Rafael Pass:
Continuous Verifiable Delay Functions. EUROCRYPT (3) 2020: 125-154 - [c35]Gilad Asharov, Ilan Komargodski, Wei-Kai Lin, Kartik Nayak, Enoch Peserico, Elaine Shi:
OptORAMa: Optimal Oblivious RAM. EUROCRYPT (2) 2020: 403-432 - [c34]Naomi Ephraim, Cody Freitag, Ilan Komargodski, Rafael Pass:
SPARKs: Succinct Parallelizable Arguments of Knowledge. EUROCRYPT (1) 2020: 707-737 - [c33]Gilad Asharov, Ilan Komargodski, Wei-Kai Lin, Enoch Peserico, Elaine Shi:
Oblivious Parallel Tight Compaction. ITC 2020: 11:1-11:23 - [c32]Tomer Grossman, Ilan Komargodski, Moni Naor:
Instance Complexity and Unlabeled Certificates in the Decision Tree Model. ITCS 2020: 56:1-56:38 - [c31]Cody Freitag, Ilan Komargodski, Rafael Pass:
Impossibility of Strong KDM Security with Auxiliary Input. SCN 2020: 512-524 - [c30]Rex Fernando, Ilan Komargodski, Yanyi Liu, Elaine Shi:
Secure Massively Parallel Computation for Dishonest Majority. TCC (2) 2020: 379-409 - [i49]Gilad Asharov, Ilan Komargodski, Wei-Kai Lin, Enoch Peserico, Elaine Shi:
Oblivious Parallel Tight Compaction. IACR Cryptol. ePrint Arch. 2020: 125 (2020) - [i48]Dana Dachman-Soled, Ilan Komargodski, Rafael Pass:
Non-Malleable Codes for Bounded Polynomial Depth Tampering. IACR Cryptol. ePrint Arch. 2020: 776 (2020) - [i47]Naomi Ephraim, Cody Freitag, Ilan Komargodski, Rafael Pass:
Non-Malleable Time-Lock Puzzles and Applications. IACR Cryptol. ePrint Arch. 2020: 779 (2020) - [i46]Naomi Ephraim, Cody Freitag, Ilan Komargodski, Rafael Pass:
SPARKs: Succinct Parallelizable Arguments of Knowledge. IACR Cryptol. ePrint Arch. 2020: 994 (2020) - [i45]Ilan Komargodski, Wei-Kai Lin:
Lower Bound for Oblivious RAM with Large Cells. IACR Cryptol. ePrint Arch. 2020: 1132 (2020) - [i44]Rex Fernando, Ilan Komargodski, Yanyi Liu, Elaine Shi:
Secure Massively Parallel Computation for Dishonest Majority. IACR Cryptol. ePrint Arch. 2020: 1157 (2020) - [i43]Gilad Asharov, Ilan Komargodski, Wei-Kai Lin, Enoch Peserico, Elaine Shi:
Optimal Oblivious Parallel RAM. IACR Cryptol. ePrint Arch. 2020: 1292 (2020) - [i42]Pratish Datta, Ilan Komargodski, Brent Waters:
Decentralized Multi-Authority ABE for DNFs from LWE. IACR Cryptol. ePrint Arch. 2020: 1386 (2020)
2010 – 2019
- 2019
- [j12]Ilan Komargodski, Moni Naor, Eylon Yogev:
White-Box vs. Black-Box Complexity of Search Problems: Ramsey and Graph Property Testing. J. ACM 66(5): 34:1-34:28 (2019) - [j11]Itay Berman, Iftach Haitner, Ilan Komargodski, Moni Naor:
Hardness-Preserving Reductions via Cuckoo Hashing. J. Cryptol. 32(2): 361-392 (2019) - [j10]Oded Goldreich, Tom Gur, Ilan Komargodski:
Strong Locally Testable Codes with Relaxed Local Decoders. ACM Trans. Comput. Theory 11(3): 17:1-17:38 (2019) - [c29]Cody Freitag, Ilan Komargodski, Rafael Pass:
Non-Uniformly Sound Certificates with Applications to Concurrent Zero-Knowledge. CRYPTO (3) 2019: 98-127 - [c28]Nir Bitansky, Iftach Haitner, Ilan Komargodski, Eylon Yogev:
Distributional Collision Resistance Beyond One-Way Functions. EUROCRYPT (3) 2019: 667-695 - [i41]Tomer Grossman, Ilan Komargodski, Moni Naor:
Instance Complexity and Unlabeled Certificates in the Decision Tree Model. Electron. Colloquium Comput. Complex. TR19 (2019) - [i40]Nir Bitansky, Iftach Haitner, Ilan Komargodski, Eylon Yogev:
Distributional Collision Resistance Beyond One-Way Functions. IACR Cryptol. ePrint Arch. 2019: 115 (2019) - [i39]Cody Freitag, Ilan Komargodski, Rafael Pass:
Impossibility of Strong KDM Security with Auxiliary Input. IACR Cryptol. ePrint Arch. 2019: 293 (2019) - [i38]Naomi Ephraim, Cody Freitag, Ilan Komargodski, Rafael Pass:
Continuous Verifiable Delay Functions. IACR Cryptol. ePrint Arch. 2019: 619 (2019) - [i37]Cody Freitag, Ilan Komargodski, Rafael Pass:
Non-Uniformly Sound Certificates with Applications to Concurrent Zero-Knowledge. IACR Cryptol. ePrint Arch. 2019: 631 (2019) - [i36]Gilad Asharov, Naomi Ephraim, Ilan Komargodski, Rafael Pass:
On Perfect Correctness without Derandomization. IACR Cryptol. ePrint Arch. 2019: 1025 (2019) - 2018
- [j9]Badih Ghazi, Ilan Komargodski, Pravesh K. Kothari, Madhu Sudan:
Communication with Contextual Uncertainty. Comput. Complex. 27(3): 463-509 (2018) - [j8]Ilan Komargodski, Mark Zhandry:
Cutting-edge cryptography through the lens of secret sharing. Inf. Comput. 263: 75-96 (2018) - [j7]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) - [j6]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) - [j5]Ilan Komargodski:
Leakage resilient one-way functions: The auxiliary-input setting. Theor. Comput. Sci. 746: 6-18 (2018) - [j4]Ilan Komargodski, Moni Naor, Eylon Yogev:
How to Share a Secret, Infinitely. IEEE Trans. Inf. Theory 64(6): 4179-4190 (2018) - [c27]Ilan Komargodski, Eylon Yogev:
On Distributional Collision Resistant Hashing. CRYPTO (2) 2018: 303-327 - [c26]Gilad Asharov, Naomi Ephraim, Ilan Komargodski, Rafael Pass:
On the Complexity of Compressing Obfuscation. CRYPTO (3) 2018: 753-783 - [c25]Ilan Komargodski, Moni Naor, Eylon Yogev:
Collision Resistant Hashing for Paranoids: Dealing with Multiple Collisions. EUROCRYPT (2) 2018: 162-194 - [c24]Ilan Komargodski, Eylon Yogev:
Another Step Towards Realizing Random Oracles: Non-malleable Point Obfuscation. EUROCRYPT (1) 2018: 259-279 - [c23]Boaz Barak, Zvika Brakerski, Ilan Komargodski, Pravesh K. Kothari:
Limits on Low-Degree Pseudorandom Generators (Or: Sum-of-Squares Meets Program Obfuscation). EUROCRYPT (2) 2018: 649-679 - [c22]Zvika Brakerski, Aayush Jain, Ilan Komargodski, Alain Passelègue, Daniel Wichs:
Non-trivial Witness Encryption and Null-iO from Standard Assumptions. SCN 2018: 425-441 - [c21]Yael Tauman Kalai, Ilan Komargodski, Ran Raz:
A Lower Bound for Adaptively-Secure Collective Coin-Flipping Protocols. DISC 2018: 34:1-34:16 - [i35]Ilan Komargodski, Ran Raz, Yael Tauman Kalai:
A Lower Bound for Adaptively-Secure Collective Coin-Flipping Protocols. Electron. Colloquium Comput. Complex. TR18 (2018) - [i34]Ilan Komargodski, Eylon Yogev:
Another Step Towards Realizing Random Oracles: Non-Malleable Point Obfuscation. IACR Cryptol. ePrint Arch. 2018: 149 (2018) - [i33]Ilan Komargodski, Eylon Yogev:
On Distributional Collision Resistant Hashing. IACR Cryptol. ePrint Arch. 2018: 480 (2018) - [i32]Gilad Asharov, Naomi Ephraim, Ilan Komargodski, Rafael Pass:
On the Complexity of Compressing Obfuscation. IACR Cryptol. ePrint Arch. 2018: 552 (2018) - [i31]Gilad Asharov, Ilan Komargodski, Wei-Kai Lin, Kartik Nayak, Elaine Shi:
OptORAMa: Optimal Oblivious RAM. IACR Cryptol. ePrint Arch. 2018: 892 (2018) - 2017
- [j3]Ilan Komargodski, Moni Naor, Eylon Yogev:
Secret-Sharing for NP. J. Cryptol. 30(2): 444-469 (2017) - [j2]Ilan Komargodski, Ran Raz, Avishay Tal:
Improved Average-Case Lower Bounds for De Morgan Formula Size: Matching Worst-Case Lower Bound. SIAM J. Comput. 46(1): 37-57 (2017) - [j1]Siyao Guo, Ilan Komargodski:
Negation-limited formulas. Theor. Comput. Sci. 660: 75-85 (2017) - [c20]Shai Halevi, Yuval Ishai, Abhishek Jain, Ilan Komargodski, Amit Sahai, Eylon Yogev:
Non-Interactive Multiparty Computation Without Correlated Randomness. ASIACRYPT (3) 2017: 181-211 - [c19]Zahra Jafargholi, Chethan Kamath, Karen Klein, Ilan Komargodski, Krzysztof Pietrzak, Daniel Wichs:
Be Adaptive, Avoid Overcommitting. CRYPTO (1) 2017: 133-163 - [c18]Ilan Komargodski, Gil Segev:
From Minicrypt to Obfustopia via Private-Key Functional Encryption. EUROCRYPT (1) 2017: 122-151 - [c17]Ilan Komargodski, Moni Naor, Eylon Yogev:
White-Box vs. Black-Box Complexity of Search Problems: Ramsey and Graph Property Testing. FOCS 2017: 622-632 - [c16]Ilan Komargodski, Anat Paskin-Cherniavsky:
Evolving Secret Sharing: Dynamic Thresholds and Robustness. TCC (2) 2017: 379-393 - [i30]Boaz Barak, Zvika Brakerski, Ilan Komargodski, Pravesh Kothari:
Limits on Low-Degree Pseudorandom Generators (Or: Sum-of-Squares Meets Program Obfuscation). Electron. Colloquium Comput. Complex. TR17 (2017) - [i29]Ilan Komargodski, Moni Naor, Eylon Yogev:
White-Box vs. Black-Box Complexity of Search Problems: Ramsey and Graph Property Testing. Electron. Colloquium Comput. Complex. TR17 (2017) - [i28]Ilan Komargodski, Gil Segev:
From Minicrypt to Obfustopia via Private-Key Functional Encryption. IACR Cryptol. ePrint Arch. 2017: 80 (2017) - [i27]Boaz Barak, Zvika Brakerski, Ilan Komargodski, Pravesh K. Kothari:
Limits on Low-Degree Pseudorandom Generators (Or: Sum-of-Squares Meets Program Obfuscation). IACR Cryptol. ePrint Arch. 2017: 312 (2017) - [i26]Ilan Komargodski, Moni Naor, Eylon Yogev:
Collision Resistant Hashing for Paranoids: Dealing with Multiple Collisions. IACR Cryptol. ePrint Arch. 2017: 486 (2017) - [i25]Zahra Jafargholi, Chethan Kamath, Karen Klein, Ilan Komargodski, Krzysztof Pietrzak, Daniel Wichs:
Be Adaptive, Avoid Overcommitting. IACR Cryptol. ePrint Arch. 2017: 515 (2017) - [i24]Shai Halevi, Yuval Ishai, Abhishek Jain, Ilan Komargodski, Amit Sahai, Eylon Yogev:
Non-Interactive Multiparty Computation without Correlated Randomness. IACR Cryptol. ePrint Arch. 2017: 871 (2017) - [i23]Zvika Brakerski, Aayush Jain, Ilan Komargodski, Alain Passelègue, Daniel Wichs:
Non-Trivial Witness Encryption and Null-iO from Standard Assumptions. IACR Cryptol. ePrint Arch. 2017: 874 (2017) - [i22]Ilan Komargodski, Anat Paskin-Cherniavsky:
Evolving Secret Sharing: Dynamic Thresholds and Robustness. IACR Cryptol. ePrint Arch. 2017: 948 (2017) - 2016
- [c15]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 - [c14]Badih Ghazi, Ilan Komargodski, Pravesh Kothari, Madhu Sudan:
Communication with Contextual Uncertainty. SODA 2016: 2072-2085 - [c13]Ilan Komargodski:
Leakage Resilient One-Way Functions: The Auxiliary-Input Setting. TCC (B1) 2016: 139-158 - [c12]Ilan Komargodski, Mark Zhandry:
Cutting-Edge Cryptography Through the Lens of Secret Sharing. TCC (A2) 2016: 449-479 - [c11]Andrej Bogdanov, Siyao Guo, Ilan Komargodski:
Threshold Secret Sharing Requires a Linear Size Alphabet. TCC (B2) 2016: 471-484 - [c10]Ilan Komargodski, Moni Naor, Eylon Yogev:
How to Share a Secret, Infinitely. TCC (B2) 2016: 485-514 - [i21]Andrej Bogdanov, Siyao Guo, Ilan Komargodski:
Threshold Secret Sharing Requires a Linear Size Alphabet. Electron. Colloquium Comput. Complex. TR16 (2016) - [i20]Ilan Komargodski, Moni Naor, Eylon Yogev:
How to Share a Secret, Infinitely. Electron. Colloquium Comput. Complex. TR16 (2016) - [i19]Ilan Komargodski, Moni Naor, Eylon Yogev:
How to Share a Secret, Infinitely. IACR Cryptol. ePrint Arch. 2016: 194 (2016) - [i18]Ilan Komargodski:
Leakage Resilient One-Way Functions: The Auxiliary-Input Setting. IACR Cryptol. ePrint Arch. 2016: 791 (2016) - 2015
- [c9]Siyao Guo, Ilan Komargodski:
Negation-Limited Formulas. APPROX-RANDOM 2015: 850-866 - [c8]Oded Goldreich, Tom Gur, Ilan Komargodski:
Strong Locally Testable Codes with Relaxed Local Decoders. CCC 2015: 1-41 - [c7]Ilan Komargodski, Gil Segev, Eylon Yogev:
Functional Encryption for Randomized Functionalities in the Private-Key Setting from Minimal Assumptions. TCC (2) 2015: 352-377 - [c6]Yael Tauman Kalai, Ilan Komargodski:
Compressing Communication in Distributed Protocols. DISC 2015: 467-479 - [i17]Ilan Komargodski, Pravesh Kothari, Madhu Sudan:
Communication with Contextual Uncertainty. CoRR abs/1504.04813 (2015) - [i16]Yael Tauman Kalai, Ilan Komargodski:
Compressing Communication in Distributed Protocols. CoRR abs/1506.00290 (2015) - [i15]Siyao Guo, Ilan Komargodski:
Negation-Limited Formulas. Electron. Colloquium Comput. Complex. TR15 (2015) - [i14]Yael Tauman Kalai, Ilan Komargodski:
Compressing Communication in Distributed Protocols. Electron. Colloquium Comput. Complex. TR15 (2015) - [i13]Ilan Komargodski, Pravesh Kothari, Madhu Sudan:
Communication with Contextual Uncertainty. Electron. Colloquium Comput. Complex. TR15 (2015) - [i12]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) - [i11]Ilan Komargodski, Mark Zhandry:
Modern Cryptography Through the Lens of Secret Sharing. IACR Cryptol. ePrint Arch. 2015: 735 (2015) - 2014
- [c5]Ilan Komargodski, Moni Naor, Eylon Yogev:
Secret-Sharing for NP. ASIACRYPT (2) 2014: 254-273 - [c4]Ilan Komargodski, Tal Moran, Moni Naor, Rafael Pass, Alon Rosen, Eylon Yogev:
One-Way Functions and (Im)Perfect Obfuscation. FOCS 2014: 374-383 - [i10]Ilan Komargodski, Moni Naor, Eylon Yogev:
Secret-Sharing for NP from Indistinguishability Obfuscation. CoRR abs/1403.5698 (2014) - [i9]Oded Goldreich, Tom Gur, Ilan Komargodski:
Strong Locally Testable Codes with Relaxed Local Decoders. Electron. Colloquium Comput. Complex. TR14 (2014) - [i8]Ilan Komargodski, Moni Naor, Eylon Yogev:
Secret-Sharing for NP from Indistinguishability Obfuscation. IACR Cryptol. ePrint Arch. 2014: 213 (2014) - [i7]Ilan Komargodski, Tal Moran, Moni Naor, Rafael Pass, Alon Rosen, Eylon Yogev:
One-Way Functions and (Im)perfect Obfuscation. IACR Cryptol. ePrint Arch. 2014: 347 (2014) - [i6]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) - 2013
- [c3]Ilan Komargodski, Ran Raz,