Aayush Jain
I am a fifth-year PhD student at UCLA advised by Prof. Amit Sahai.
Prior to that, I was a Research Fellow at Microsoft Research India from 2013-2015, mentored by Prof. Vipul Goyal. Thanks to Google PhD fellowship, 2018 in Security and Privacy for supporting my work.
New Result: Indistinguishability Obfuscation from Well-Established Cryptographic Assumptions! Check out the Quanta article about the result.
Find complete details in this Invited FOCS 2020 tutorial and a shorter talk here.
Research Interests: I am interested in theoretical and applied cryptography, and its connections with related areas of theoretical computer science. These include (but are not limited to) sum-of-squares and learning algorithms, complexity theory, pseudorandomness and analysis of boolean functions.
Here is my Google Scholar profile. Check out my CV here.
Email: aayushjain@cs.ucla.edu
Publications:
Aayush Jain, Huijia Lin and Amit Sahai
STOC 2021
Multi-Party Reusable Non-Interactive Secure Computation from LWE
Fabrice Benhamouda, Aayush Jain, Ilan Komargodski and Huijia Lin
EUROCRYPT 2021
Romain Gay, Aayush Jain, Huijia Lin and Amit Sahai
EUROCRYPT 2021
Saikrishna Badrinarayanan, Aayush Jain, Nathan Manohar and Amit Sahai
ASIACRYPT 2020
Aayush Jain, Alexis Korb, Nathan Manohar and Amit Sahai
CRYPTO 2020
Saikrishna Badrinarayanan, Rex Fernando, Aayush Jain, Dakshita Khurana and Amit Sahai
EUROCRYPT 2020
Aayush Jain, Nathan Manohar and Amit Sahai
EUROCRYPT 2020
Affine Determinant Programs: A Framework for Obfuscation and Witness Encryption
James Bartusek, Yuval Ishai, Aayush Jain, Fermi Ma, Amit Sahai and Mark Zhandry
ITCS 2020
Prabhanjan Ananth, Saikrishna Badrinarayanan, Aayush Jain, Nathan Manohar and Amit Sahai
TCC 2019
Indistinguishability Obfuscation without Multilinear Maps: New Paradigms via Low Degree Weak Pseudorandomness and Security Amplification (Merge of AJS18 and LM18 )
Prabhanjan Ananth, Aayush Jain, Huijia Lin, Christian Matt and Amit Sahai
CRYPTO 2019
Vipul Goyal, Aayush Jain and Amit Sahai
CRYPTO 2019
Boaz Barak, Sam Hopkins, Aayush Jain, Pravesh Kothari and Amit Sahai
EUROCRYPT 2019
Aayush Jain, Huijia Lin, Christian Matt and Amit Sahai
EUROCRYPT 2019
Zvika Brakerski, Aayush Jain, Ilan Komargodski, Alain Passelegue and Daniel Wichs
SCN 2018
Dan Boneh, Rosario Gennaro, Steven Godfeder, Aayush Jain, Sam Kim, Peter M. R. Rasmussen and Amit Sahai.
CRYPTO 2018
Zvika Brakerski, Nishanth Chandran, Vipul Goyal, Aayush Jain, Amit Sahai and Gil Segev
ITCS 2017
Prabhanjan Ananth, Aayush Jain and Amit Sahai
EUROCRYPT 2017
Saikrishna Badrinarayanan, Vipul Goyal, Aayush Jain and Amit Sahai
ASIACRYPT 2016
Vipul Goyal, Aayush Jain and Adam O' Neill
ASIACRYPT 2016
Prabhanjan Ananth, Aayush Jain, Moni Naor, Amit Sahai and Eylon Yogev
CRYPTO 2016
Manuscripts:
Aayush Jain, Huijia Lin and Amit Sahai
Prabhanjan Ananth, Aayush Jain and Amit Sahai
Saikrishna Badrinarayanan, Vipul Goyal, Aayush Jain and Amit Sahai
Vipul Goyal, Aayush Jain and Dakshita Khurana
Invited Talks (videos embedded in the links):
TCC Workshop on Matches Made in Heaven: Cryptography and Theoretical Computer Science
FOCS Invited Tutorial
TCS+
iO from Well-Established Hardness Assumptions
Invited talk at NTT Labs
iO from Simple-to-State Hardness Assumptions
Invited talk at NTT Labs
iO from Simple-to-State Hardness Assumptions
Simons Lattice Program Reading Group
Simons workshop on Lattices: New Cryptographic Capabilities
Sum-of-Squares Lower Bounds for Perturbation Resilient Generators
Invited Talk at New Roads to Cryptopia, CRYPTO 2019
Indistinguishability Obfuscation without Multilinear Maps: New Paradigms via Low Degree Weak Pseudorandomness and Security Amplification
CRYPTO 2019
Simultaneous Amplification: The Case of Non-Interactive Zero-Knowledge
CRYPTO 2019
Indistinguishability Obfuscation without Multilinear Maps: iO from Bilinear Maps, LWE and weak Pseudorandomness
Invited Talk at Princeton Crypto Reading Group
Indistinguishability Obfuscation without Multilinear Maps: iO from Bilinear Maps, LWE and weak Pseudorandomness
Invited Talk at UC Berkeley Crypto Reading Group
Sum-of-Squares meets Program Obfuscation, Revisited
EUROCRYPT 2019
How to leverage hardness of constant degree polynomials over R to build iO
EUROCRYPT 2019
Threshold Cryptosystems from Threshold Fully Homomorphic Encryption
CRYPTO 2018
Hierarchical Functional Encryption
ITCS 2017
EUROCRYPT 2017
Multi-Input Functional Encryption with Unbounded-Message Security
ASIACRYPT 2016