Amit Sahai
Affiliations:- University of California, Los Angeles, USA
According to our database1,
Amit Sahai
authored at least 264 papers
between 1997 and 2024.
Collaborative distances:
Collaborative distances:
Awards
ACM Fellow
ACM Fellow 2018, "For contributions to cryptography and to the development of indistinguishability obfuscation".
Timeline
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
Online presence:
-
on zbmath.org
-
on id.loc.gov
-
on cs.ucla.edu
-
on dl.acm.org
On csauthors.net:
Bibliography
2024
J. Cryptol., March, 2024
Commun. ACM, March, 2024
IACR Cryptol. ePrint Arch., 2024
Proceedings of the 2024 Conference on Empirical Methods in Natural Language Processing, 2024
2023
IACR Cryptol. ePrint Arch., 2023
Hard Languages in $\mathsf{NP} \cap \mathsf{coNP}$ and NIZK Proofs from Unstructured Hardness.
IACR Cryptol. ePrint Arch., 2023
Hard Languages in $\text{NP}\cap\text{coNP}$ and NIZK Proofs from Unstructured Hardness.
Electron. Colloquium Comput. Complex., 2023
Proceedings of the 55th Annual ACM Symposium on Theory of Computing, 2023
2022
Special Section on the Forty-Ninth Annual ACM Symposium on the Theory of Computing (STOC 2017).
SIAM J. Comput., 2022
Polynomial-Time Cryptanalysis of the Subspace Flooding Assumption for Post-Quantum i풪.
IACR Cryptol. ePrint Arch., 2022
IACR Cryptol. ePrint Arch., 2022
IACR Cryptol. ePrint Arch., 2022
IACR Cryptol. ePrint Arch., 2022
IACR Cryptol. ePrint Arch., 2022
Indistinguishability Obfuscation from LPN over $\mathbb {F}_p$, DLIN, and PRGs in NC<sup>0</sup>.
Proceedings of the Advances in Cryptology - EUROCRYPT 2022 - 41st Annual International Conference on the Theory and Applications of Cryptographic Techniques, Trondheim, Norway, May 30, 2022
2021
SIAM J. Comput., 2021
IACR Cryptol. ePrint Arch., 2021
IACR Cryptol. ePrint Arch., 2021
IACR Cryptol. ePrint Arch., 2021
2020
Proc. Priv. Enhancing Technol., 2020
IACR Cryptol. ePrint Arch., 2020
IACR Cryptol. ePrint Arch., 2020
Indistinguishability Obfuscation from Simple-to-State Hard Problems: New Assumptions, New Techniques, and Simplification.
IACR Cryptol. ePrint Arch., 2020
IACR Cryptol. ePrint Arch., 2020
2019
How to leverage hardness of constant degree expanding polynomials over R to build iO.
IACR Cryptol. ePrint Arch., 2019
IACR Cryptol. ePrint Arch., 2019
Indistinguishability Obfuscation Without Multilinear Maps: New Paradigms via Low Degree Weak Pseudorandomness and Security Amplification.
IACR Cryptol. ePrint Arch., 2019
Proceedings of the 60th IEEE Annual Symposium on Foundations of Computer Science, 2019
How to Leverage Hardness of Constant-Degree Expanding Polynomials over \mathbb R R to build i풪 i O.
Proceedings of the Advances in Cryptology - EUROCRYPT 2019, 2019
2018
IACR Cryptol. ePrint Arch., 2018
How to leverage hardness of constant-degree expanding polynomials over ℝ to build iO.
IACR Cryptol. ePrint Arch., 2018
IACR Cryptol. ePrint Arch., 2018
IACR Cryptol. ePrint Arch., 2018
IACR Cryptol. ePrint Arch., 2018
IACR Cryptol. ePrint Arch., 2018
Indistinguishability Obfuscation Without Multilinear Maps: iO from LWE, Bilinear Maps, and Weak Pseudorandomness.
IACR Cryptol. ePrint Arch., 2018
Electron. Colloquium Comput. Complex., 2018
Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing, 2018
2017
IACR Cryptol. ePrint Arch., 2017
IACR Cryptol. ePrint Arch., 2017
IACR Cryptol. ePrint Arch., 2017
IACR Cryptol. ePrint Arch., 2017
IACR Cryptol. ePrint Arch., 2017
Two-Message Witness Indistinguishability and Secure Computation in the Plain Model from New Assumptions.
IACR Cryptol. ePrint Arch., 2017
IACR Cryptol. ePrint Arch., 2017
Robust Transforming Combiners from Indistinguishability Obfuscation to Functional Encryption.
IACR Cryptol. ePrint Arch., 2017
Electron. Colloquium Comput. Complex., 2017
Proceedings of the 8th Innovations in Theoretical Computer Science Conference, 2017
Proceedings of the Advances in Cryptology - EUROCRYPT 2017 - 36th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Paris, France, April 30, 2017
Indistinguishability Obfuscation for Turing Machines: Constant Overhead and Amortization.
Proceedings of the Advances in Cryptology - CRYPTO 2017, 2017
Proceedings of the Advances in Cryptology - ASIACRYPT 2017, 2017
2016
Candidate Indistinguishability Obfuscation and Functional Encryption for All Circuits.
SIAM J. Comput., 2016
Secure obfuscation in a weak multilinear map model: A simple construction secure against all known attacks.
IACR Cryptol. ePrint Arch., 2016
Annihilation Attacks for Multilinear Maps: Cryptanalysis of Indistinguishability Obfuscation over GGH13.
IACR Cryptol. ePrint Arch., 2016
Projective Arithmetic Functional Encryption and Indistinguishability Obfuscation From Degree-5 Multilinear Maps.
IACR Cryptol. ePrint Arch., 2016
Universal Obfuscation and Witness Encryption: Boosting Correctness and Combining Security.
IACR Cryptol. ePrint Arch., 2016
Commun. ACM, 2016
Proceedings of the IEEE International Symposium on Information Theory, 2016
Proceedings of the IEEE 57th Annual Symposium on Foundations of Computer Science, 2016
Proceedings of the IEEE 57th Annual Symposium on Foundations of Computer Science, 2016
Post-zeroizing Obfuscation: New Mathematical Tools, and the Case of Evasive Circuits.
Proceedings of the Advances in Cryptology - EUROCRYPT 2016, 2016
Universal Constructions and Robust Combiners for Indistinguishability Obfuscation and Witness Encryption.
Proceedings of the Advances in Cryptology - CRYPTO 2016, 2016
Proceedings of the Advances in Cryptology - ASIACRYPT 2016, 2016
2015
IEEE Trans. Inf. Theory, 2015
Using Fully Homomorphic Hybrid Encryption to Minimize Non-interative Zero-Knowledge Proofs.
J. Cryptol., 2015
IACR Cryptol. ePrint Arch., 2015
IACR Cryptol. ePrint Arch., 2015
IACR Cryptol. ePrint Arch., 2015
IACR Cryptol. ePrint Arch., 2015
IACR Cryptol. ePrint Arch., 2015
IACR Cryptol. ePrint Arch., 2015
IACR Cryptol. ePrint Arch., 2015
IACR Cryptol. ePrint Arch., 2015
IACR Cryptol. ePrint Arch., 2015
Achieving Compactness Generically: Indistinguishability Obfuscation from Non-Compact Functional Encryption.
IACR Cryptol. ePrint Arch., 2015
Round-Efficient Concurrently Composable Secure Computation via a Robust Extraction Lemma.
Proceedings of the Theory of Cryptography - 12th Theory of Cryptography Conference, 2015
Proceedings of the Public-Key Cryptography - PKC 2015 - 18th IACR International Conference on Practice and Theory in Public-Key Cryptography, Gaithersburg, MD, USA, March 30, 2015
Proceedings of the Advances in Cryptology - EUROCRYPT 2015, 2015
Proceedings of the Advances in Cryptology - CRYPTO 2015, 2015
Multi-party Key Exchange for Unbounded Parties from Indistinguishability Obfuscation.
Proceedings of the Advances in Cryptology - ASIACRYPT 2015 - 21st International Conference on the Theory and Application of Cryptology and Information Security, Auckland, New Zealand, November 29, 2015
2014
IACR Cryptol. ePrint Arch., 2014
A Full Characterization of Completeness for Two-party Randomized Function Evaluation.
IACR Cryptol. ePrint Arch., 2014
IACR Cryptol. ePrint Arch., 2014
IACR Cryptol. ePrint Arch., 2014
Indistinguishability Obfuscation from the Multilinear Subgroup Elimination Assumption.
IACR Cryptol. ePrint Arch., 2014
IACR Cryptol. ePrint Arch., 2014
Semantically Secure Order-Revealing Encryption: Multi-Input Functional Encryption Without Obfuscation.
IACR Cryptol. ePrint Arch., 2014
IACR Cryptol. ePrint Arch., 2014
Bioinform., 2014
Proceedings of the 2014 IEEE International Symposium on Information Theory, Honolulu, HI, USA, June 29, 2014
Proceedings of the Automata, Languages, and Programming - 41st International Colloquium, 2014
Proceedings of the Advances in Cryptology - EUROCRYPT 2014, 2014
2013
Sequential Aggregate Signatures, Multisignatures, and Verifiably Encrypted Signatures Without Random Oracles.
J. Cryptol., 2013
Predicate Encryption Supporting Disjunctions, Polynomial Equations, and Inner Products.
J. Cryptol., 2013
Obfuscation-based Non-black-box Simulation and Four Message Concurrent Zero Knowledge for NP.
IACR Cryptol. ePrint Arch., 2013
IACR Cryptol. ePrint Arch., 2013
Full Domain Hash from (Leveled) Multilinear Maps and Identity-Based Aggregate Signatures.
IACR Cryptol. ePrint Arch., 2013
IACR Cryptol. ePrint Arch., 2013
Homomorphic Encryption from Learning with Errors: Conceptually-Simpler, Asymptotically-Faster, Attribute-Based.
IACR Cryptol. ePrint Arch., 2013
IACR Cryptol. ePrint Arch., 2013
Function Private Functional Encryption and Property Preserving Encryption : New Definitions and Positive Results.
IACR Cryptol. ePrint Arch., 2013
Proceedings of the Advances in Cryptology - CRYPTO 2013, 2013
Proceedings of the Advances in Cryptology - CRYPTO 2013, 2013
Proceedings of the Advances in Cryptology - ASIACRYPT 2013, 2013
Proceedings of the Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, 2013
2012
IACR Cryptol. ePrint Arch., 2012
IACR Cryptol. ePrint Arch., 2012
IACR Cryptol. ePrint Arch., 2012
Round-Efficient Concurrently Composable Secure Computation via a Robust Extraction Lemma.
IACR Cryptol. ePrint Arch., 2012
IACR Cryptol. ePrint Arch., 2012
IACR Cryptol. ePrint Arch., 2012
New Impossibility Results for Concurrent Composition and a Non-Interactive Completeness Theorem for Secure Computation.
IACR Cryptol. ePrint Arch., 2012
Proceedings of the Theory of Cryptography - 9th Theory of Cryptography Conference, 2012
Proceedings of the 2012 IEEE Information Theory Workshop, 2012
2011
IACR Cryptol. ePrint Arch., 2011
Potent Tree Codes and their applications: Coding for Interactive Communication, revisited
CoRR, 2011
Proceedings of the Theory of Cryptography - 8th Theory of Cryptography Conference, 2011
Proceedings of the Public Key Cryptography - PKC 2011, 2011
Proceedings of the IEEE 52nd Annual Symposium on Foundations of Computer Science, 2011
Proceedings of the Advances in Cryptology - EUROCRYPT 2011, 2011
Proceedings of the Advances in Cryptology - CRYPTO 2011, 2011
Proceedings of the Advances in Cryptology - CRYPTO 2011, 2011
Proceedings of the Advances in Cryptology - CRYPTO 2011, 2011
Proceedings of the Advances in Cryptology - CRYPTO 2011, 2011
2010
Fully Secure Functional Encryption: Attribute-Based Encryption and (Hierarchical) Inner Product Encryption.
IACR Cryptol. ePrint Arch., 2010
IACR Cryptol. ePrint Arch., 2010
Electron. Colloquium Comput. Complex., 2010
Proceedings of the Theory of Cryptography, 7th Theory of Cryptography Conference, 2010
Proceedings of the 51th Annual IEEE Symposium on Foundations of Computer Science, 2010
Proceedings of the 17th ACM Conference on Computer and Communications Security, 2010
Proceedings of the Advances in Cryptology - ASIACRYPT 2010, 2010
2009
Special Issue On The Thirty-Eighth Annual ACM Symposium On Theory Of Computing (STOC 2006).
SIAM J. Comput., 2009
IACR Cryptol. ePrint Arch., 2009
Proceedings of the 50th Annual IEEE Symposium on Foundations of Computer Science, 2009
Resolving the Simultaneous Resettability Conjecture and a New Non-Black-Box Simulation Strategy.
Proceedings of the 50th Annual IEEE Symposium on Foundations of Computer Science, 2009
Fast Cryptographic Primitives and Circular-Secure Encryption Based on Hard Learning Problems.
Proceedings of the Advances in Cryptology, 2009
2008
IACR Cryptol. ePrint Arch., 2008
Resolving the Simultaneous Resettability Conjecture and a New Non-Black-Box Simulation Strategy.
IACR Cryptol. ePrint Arch., 2008
Proceedings of the 40th Annual ACM Symposium on Theory of Computing, 2008
Proceedings of the Information Systems Security, 4th International Conference, 2008
Proceedings of the Automata, Languages and Programming, 35th International Colloquium, 2008
Proceedings of the Advances in Cryptology, 2008
Proceedings of the 2008 ACM Conference on Computer and Communications Security, 2008
2007
IACR Cryptol. ePrint Arch., 2007
IACR Cryptol. ePrint Arch., 2007
Electron. Colloquium Comput. Complex., 2007
Proceedings of the 39th Annual ACM Symposium on Theory of Computing, 2007
Proceedings of the 2007 IEEE Symposium on Security and Privacy (S&P 2007), 2007
Proceedings of the Automata, Languages and Programming, 34th International Colloquium, 2007
Proceedings of the 48th Annual IEEE Symposium on Foundations of Computer Science (FOCS 2007), 2007
2006
IACR Cryptol. ePrint Arch., 2006
IACR Cryptol. ePrint Arch., 2006
IACR Cryptol. ePrint Arch., 2006
Non-Malleable Encryption: Equivalence between Two Notions, and an Indistinguishability-based Characterization.
IACR Cryptol. ePrint Arch., 2006
Electron. Colloquium Comput. Complex., 2006
Proceedings of the Advances in Cryptology - EUROCRYPT 2006, 25th Annual International Conference on the Theory and Applications of Cryptographic Techniques, St. Petersburg, Russia, May 28, 2006
Proceedings of the Advances in Cryptology - EUROCRYPT 2006, 25th Annual International Conference on the Theory and Applications of Cryptographic Techniques, St. Petersburg, Russia, May 28, 2006
Proceedings of the Advances in Cryptology, 2006
2005
Electron. Colloquium Comput. Complex., 2005
How To Play Almost Any Mental Game Over The Net - Concurrent Composition via Super-Polynomial Simulation
Electron. Colloquium Comput. Complex., 2005
Electron. Colloquium Comput. Complex., 2005
Relaxing Environmental Security: Monitored Functionalities and Client-Server Computation.
Proceedings of the Theory of Cryptography, Second Theory of Cryptography Conference, 2005
2004
SIAM J. Discret. Math., 2004
IACR Cryptol. ePrint Arch., 2004
Proceedings of the 36th Annual ACM Symposium on Theory of Computing, 2004
Proceedings of the Fifteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2004
Proceedings of the Progress in Cryptology, 2004
Proceedings of the 45th Symposium on Foundations of Computer Science (FOCS 2004), 2004
2003
Proceedings of the Advances in Cryptology, 2003
Proceedings of the 10th ACM Conference on Computer and Communications Security, 2003
2002
IACR Cryptol. ePrint Arch., 2002
A Unified Methodology For Constructing Public-Key Encryption Schemes Secure Against Adaptive Chosen-Ciphertext Attack.
IACR Cryptol. ePrint Arch., 2002
IACR Cryptol. ePrint Arch., 2002
Proceedings of the Proceedings on 34th Annual ACM Symposium on Theory of Computing, 2002
Proceedings of the 43rd Symposium on Foundations of Computer Science (FOCS 2002), 2002
Proceedings of the 43rd Symposium on Foundations of Computer Science (FOCS 2002), 2002
2001
Electron. Colloquium Comput. Complex., 2001
Proceedings of the Advances in Cryptology, 2001
Proceedings of the Advances in Cryptology, 2001
2000
Electron. Colloquium Comput. Complex., 2000
Proceedings of the Thirty-Second Annual ACM Symposium on Theory of Computing, 2000
Proceedings of the 41st Annual Symposium on Foundations of Computer Science, 2000
Proceedings of the 41st Annual Symposium on Foundations of Computer Science, 2000
Proceedings of the Advances in Cryptology, 2000
1999
Can Statistical Zero Knowledge be made Non-Interactive? or On the Relationship of SZK and NISZK
Electron. Colloquium Comput. Complex., 1999
Proceedings of the Selected Areas in Cryptography, 6th Annual International Workshop, 1999
Non-Malleable Non-Interactive Zero Knowledge and Adaptive Chosen-Ciphertext Security.
Proceedings of the 40th Annual Symposium on Foundations of Computer Science, 1999
Proceedings of the Advances in Cryptology, 1999
Proceedings of the Twelfth Annual Conference on Computational Learning Theory, 1999
1998
IACR Cryptol. ePrint Arch., 1998
Honest-Verifier Statistical Zero-Knowledge Equals General Statistical Zero-Knowledge.
Proceedings of the Thirtieth Annual ACM Symposium on the Theory of Computing, 1998
Proceedings of the Advances in Cryptology, 1998
Proceedings of the Advances in Cryptology, 1998
1997
Proceedings of the 38th Annual Symposium on Foundations of Computer Science, 1997
Proceedings of the Randomization Methods in Algorithm Design, 1997