Skip to main content

Jain, Abhishek

Assistant Professor
Computer Science
https://www.cs.jhu.edu/~abhishek/

Malone Hall 315
(410) 516-4276
ajain38@jhu.edu

Jump to:

News

About

Education
  • Ph.D. 2012, University of California, Los Angeles
  • Master of Science 2009, University of California - Los Angeles
  • Bachelor of Technology 2006, Indian Institute Of Technology
Experience
  • 2013 - 2014:  Part-time Consultant at MSR New England, Microsoft Corporation
  • 2012 - 2014:  Postdoctoral Researcher, MIT and Boston University
Awards
  • 2018:  Samsung Global Research Outreach (GRO) Award
  • 2015:  Paper at STOC 2015 invited to SICOMP Journal
  • 2013:  Paper at CRYPTO 2013 invited to Journal of Cryptology
  • 2012:  Symantec Outstanding Graduate Student Award
  • 2011:  Best Paper Award, EUROCRYPT 2011

Publications

Journal Articles
  • Bartusek J, Carmer B, Jain A, Jin Z, Lepoint T, Ma F, Malkin T, Malozemoff AJ, Raykova M (2019).  Public-Key Function-Private Hidden Vector Encryption (and More).  Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics).  11923 LNCS.  489-519.
  • Ananth P, Choudhuri AR, Goel A, Jain A (2019).  Two round information-theoretic MPC with malicious security.  Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics).  11477 LNCS.  532-561.
  • Fleischhacker N, Goyal V, Jain A, Paskin-Cherniavsky A, Radune S (2019).  Interactive Non-malleable Codes.  Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics).  11892 LNCS.  233-263.
  • Garg S, Goel A, Jain A (2019).  The broadcast message complexity of secure multiparty computation.  Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics).  11921 LNCS.  426-455.
  • Badrinarayanan S, Jain A, Ostrovsky R, Visconti I (2019).  UC-Secure Multiparty Computation from One-Way Functions Using Stateless Tokens.  Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics).  11922 LNCS.  577-605.
  • Choudhuri AR, Goyal V, Jain A (2019).  Founding secure computation on blockchains.  Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics).  11477 LNCS.  351-380.
  • Boyle E, Jain A, Prabhakaran M, Yu CH (2018).  The bottleneck complexity of secure multiparty computation.  Leibniz International Proceedings in Informatics, LIPIcs.  107.
  • Bitansky N, Canetti R, Garg S, Holmgren J, Jain A, Lin H, Pass R, Telang S, Vaikuntanathan V (2018).  Indistinguishability Obfuscation for RAM Programs and Succinct Randomized Encodings.  SIAM Journal on Computing.  SIAM.  47.  1123--1210.
  • Bitansky N, Canetti R, Garg S, Holmgren J, Jain A, Lin H, Pass R, Telang S, Vaikuntanathan V (2018).  Indistinguishability obfuscation for ram programs and succinct randomized encodings.  SIAM Journal on Computing.  47(3).  1123-1210.
  • Fleischhacker N, Goyal V, Jain A (2018).  On the existence of three round zero-knowledge proofs.  Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics).  10822 LNCS.  3-33.
  • Badrinarayanan S, Goyal V, Jain A, Kalai YT, Khurana D, Sahai A (2018).  Promise zero knowledge and its applications to round optimal MPC.  Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics).  10992 LNCS.  459-487.
  • Ananth P, Choudhuri AR, Goel A, Jain A (2018).  Round-optimal secure multiparty computation with honest majority.  Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics).  10992 LNCS.  395-424.
  • Badrinarayanan S, Jain A, Ostrovsky R, Visconti I (2018).  Non-interactive secure computation from one-way functions.  Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics).  11274 LNCS.  118-138.
  • Choudhuri AR, Green M, Jain A, Kaptchuk G, Miers I (2017).  Fairness in an unfair world: Fair multiparty computation from public bulletin boards.  Proceedings of the ACM Conference on Computer and Communications Security.  719-728.
  • Kiltz E, Pietrzak K, Venturi D, Cash D, Jain A (2017).  Efficient Authentication from Hard Learning Problems.  Journal of Cryptology.  30(4).  1238-1275.
  • Ananth P, Jain A (2017).  On Secure Two-Party Computation in Three Rounds.  Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics).  10677 LNCS.  612-644.
  • Kiltz E, Pietrzak K, Venturi D, Cash D, Jain A (2017).  Efficient Authentication from Hard Learning Problems.  Journal of Cryptology.  Springer.  30.  1238--1275.
  • Ananth P, Jain A, Sahai A (2017).  Indistinguishability obfuscation for turing machines: Constant overhead and amortization.  Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics).  10402 LNCS.  252-279.
  • Ananth P, Cohen A, Jain A (2017).  Cryptography with updates.  Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics).  10211 LNCS.  445-472.
  • Badrinarayanan S, Goyal V, Jain A, Khurana D, Sahai A (2017).  Round Optimal Concurrent MPC via Strong Simulation.  Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics).  10677 LNCS.  743-775.
  • Halevi S, Ishai Y, Jain A, Komargodski I, Sahai A, Yogev E (2017).  Non-interactive multiparty computation without correlated randomness.  Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics).  10626 LNCS.  181-211.
  • Jain A, Kalai YT, Khurana D, Rothblum R (2017).  Distinguisher-dependent simulation in two rounds and its applications.  Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics).  10402 LNCS.  158-189.
  • Ananth P, Jain A, Sahai A (2017).  Patchable indistinguishability obfuscation: IO for evolving software.  Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics).  10212 LNCS.  127-155.
  • Ananth P, Choudhuri AR, Jain A (2017).  A new approach to round-optimal secure multiparty computation.  Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics).  10401 LNCS.  468-499.
  • Halevi S, Ishai Y, Jain A, Kushilevitz E, Rabin T (2016).  Secure multiparty computation with general interaction patterns.  ITCS 2016 - Proceedings of the 2016 ACM Conference on Innovations in Theoretical Computer Science.  157-168.
  • Bitansky N, Goldwasser S, Jain A, Paneth O, Vaikuntanathan V (2016).  Time-lock puzzles from randomized encodings.  ITCS 2016 - Proceedings of the 2016 ACM Conference on Innovations in Theoretical Computer Science.  345-356.
  • Bitansky N, Goldwasser S, Jain A, Paneth O, Vaikuntanathan V, Waters B (2016).  Time-lock puzzles from randomized encodings.  Association for Computing Machinery.
  • Canetti R, Holmgren J, Jain A, Vaikuntanathan V (2015).  Succinct garbling and indistinguishability obfuscation for RAM programs.  Proceedings of the Annual ACM Symposium on Theory of Computing.  14-17-June-2015.  429-437.
  • Jain A, Kalai YT, Lewko AB (2015).  Interactive coding for multiparty protocols.  ITCS 2015 - Proceedings of the 6th Innovations in Theoretical Computer Science.  1-10.
  • Canetti R, Goyal V, Jain A (2015).  Concurrent secure computation with optimal query complexity.  Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics).  9216.  43-62.
  • Badrinarayanan S, Gupta D, Jain A, Sahai A (2015).  Multi-input functional encryption for unbounded arity functions.  Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics).  9452.  27-51.
  • Ananth P, Jain A (2015).  Indistinguishability obfuscation from compact functional encryption.  Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics).  9215.  308-326.
  • Ananth P, Jain A, Sahai A (2015).  Indistinguishability Obfuscation with Constant Size Overhead..  IACR Cryptology ePrint Archive.  2015.  1023.
  • Ananth P, Jain A, Sahai A (2015).  Achieving Compactness Generically: Indistinguishability Obfuscation from Non-Compact Functional Encryption..  IACR Cryptology ePrint Archive.  2015.  730.
  • Goyal V, Jain A, Koppula V, Sahai A (2015).  Functional encryption for randomized functionalities.  Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics).  9015.  325-351.
  • Bishop A, Jain A, Kowalczyk L (2015).  Function-hiding inner product encryption.  Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics).  9452.  470-491.
  • Ananth P, Jain A, Sahai A (2015).  Indistinguishability obfuscation from functional encryption for simple functions.  Eprint.  730.  2015.
  • Canetti R, Jain A, Scafuro A (2014).  Practical UC security with a global random oracle.  Proceedings of the ACM Conference on Computer and Communications Security.  597-608.
  • Canetti R, Jain A, Paneth O (2014).  Client-server concurrent zero knowledge with constant rounds and guaranteed complexity.  Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics).  8617 LNCS(PART 2).  337-350.
  • Jain A, Pandey O (2014).  Non-malleable zero knowledge: Black-box constructions and definitional relationships.  Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics).  8642.  435-454.
  • Goldwasser S, Gordon SD, Goyal V, Jain A, Katz J, Liu FH, Sahai A, Shi E, Zhou HS (2014).  Multi-input functional encryption.  Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics).  8441 LNCS.  578-602.
  • Goyal V, Jain A, Ostrovsky R, Richelson S, Visconti I (2013).  Constant-round concurrent zero knowledge in the bounded player model.  Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics).  8269 LNCS(PART 1).  21-40.
  • De Caro A, Iovino V, Jain A, O'Neill A, Paneth O, Persiano G (2013).  On the achievability of simulation-based security for functional encryption.  Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics).  8043 LNCS(PART 2).  519-535.
  • Goyal V, Gupta D, Jain A (2013).  What information is leaked under concurrent composition?.  Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics).  8043 LNCS(PART 2).  220-238.
  • Boyle E, Garg S, Jain A, Kalai YT, Sahai A (2013).  Secure computation against adaptive auxiliary information.  Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics).  8042 LNCS(PART 1).  316-334.
  • Goyal V, Jain A (2013).  On concurrently secure computation in the multiple ideal query model.  Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics).  7881 LNCS.  684-701.
  • Goyal V, Jain A, Ostrovsky R, Richelson S, Visconti I (2013).  Concurrent zero knowledge in the bounded player model.  Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics).  7785 LNCS.  60-79.
  • Bitansky N, Dachman-Soled D, Garg S, Jain A, Kalai YT, López-Alt A, Wichs D (2013).  Why "Fiat-Shamir for proofs" lacks a proof.  Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics).  7785 LNCS.  182-201.
  • Jain A, Sahai A (2013).  The IPS compiler.  Cryptology and Information Security Series.  10.  201-221.
  • Jain A, Sahai A (2013).  The IPS Compiler.  Secure Multi-Party Computation.  IOS Press.  201.
  • Jain A, Krenn S, Pietrzak K, Tentes A (2012).  Commitments and efficient zero-knowledge proofs from learning parity with noise.  Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics).  7658 LNCS.  663-680.
  • Agrawal S, Goyal V, Jain A, Prabhakaran M, Sahai A (2012).  New impossibility results for concurrent composition and a non-interactive completeness theorem for secure computation.  Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics).  7417 LNCS.  443-460.
  • Boyle E, Goldwasser S, Jain A, Kalai YT (2012).  Multiparty computation secure against continual memory leakage.  Proceedings of the Annual ACM Symposium on Theory of Computing.  1235-1254.
  • Garg S, Goyal V, Jain A, Sahai A (2012).  Concurrently secure computation in constant rounds.  Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics).  7237 LNCS.  99-116.
  • Dodis Y, Jain A, Moran T, Wichs D (2012).  Counterexamples to hardness amplification beyond negligible.  Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics).  7194 LNCS.  476-493.
  • Jain A, Pietrzak K, Tentes A (2012).  Hardness preserving constructions of pseudorandom functions.  Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics).  7194 LNCS.  369-382.
  • Dachman-Soled D, Jain A, Kalai YT, L'opez-Alt A (2012).  On the (In) security of the Fiat-Shamir Paradigm, Revisited..  IACR Cryptology ePrint Archive.  2012.  706.
  • Garg S, Goyal V, Jain A, Sahai A (2012).  Concurrently secure computation in constant rounds.  Advances in Cryptology--EUROCRYPT 2012.  Springer.  99--116.
  • Agrawal S, Goyal V, Jain A, Prabhakaran M, Sahai A (2012).  New impossibility results for concurrent composition and a non-interactive completeness theorem for secure computation.  Advances in Cryptology--CRYPTO 2012.  Springer.  443--460.
  • Asharov G, Jain A, López-Alt A, Tromer E, Vaikuntanathan V, Wichs D (2012).  Multiparty computation with low communication, computation and interaction via threshold FHE.  Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics).  7237 LNCS.  483-501.
  • Garg S, Jain A, Sahai A (2011).  Leakage-resilient zero knowledge.  Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics).  6841 LNCS.  297-315.
  • Kiltz E, Pietrzak K, Cash D, Jain A, Venturi D (2011).  Efficient authentication from hard learning problems.  Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics).  6632 LNCS.  7-26.
  • Jain A, Pietrzak K (2011).  Parallel repetition for leakage resilience amplification revisited.  Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics).  6597 LNCS.  58-69.
  • Garg S, Goyal V, Jain A, Sahai A (2011).  Bringing people of different beliefs together to do UC.  Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics).  6597 LNCS.  311-328.
  • Kiltz E, Pietrzak K, Cash D, Jain A, Venturi D (2011).  Efficient authentication from hard learning problems.  Advances in Cryptology--EUROCRYPT 2011.  Springer.  7--26.
  • Garg S, Jain A, Sahai A (2011).  Leakage-resilient zero knowledge.  Advances in Cryptology--CRYPTO 2011.  Springer.  297--315.
  • Goyal V, Jain A, Ostrovsky R (2010).  Password-authenticated session-key generation on the internet in the plain model.  Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics).  6223 LNCS.  277-294.
  • Goyal V, Jain A (2010).  On the round complexity of covert computation.  Proceedings of the Annual ACM Symposium on Theory of Computing.  191-200.
  • Goyal V, Jain A, Ostrovsky R (2010).  Password-authenticated session-key generation on the internet in the plain model.  Advances in Cryptology--CRYPTO 2010.  Springer.  277--294.
  • Zhang X, Jain A, Perrig A (2008).  Packet-dropping adversary identification for data plane security.  Proceedings of 2008 ACM CoNEXT Conference - 4th International Conference on Emerging Networking EXperiments and Technologies, CoNEXT '08.
  • Goyal V, Jain A, Pandey O, Sahai A (2008).  Bounded ciphertext policy attribute based encryption.  Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics).  5126 LNCS(PART 2).  579-591.
  • Goyal V, Jain A, Quisquater JJ (2006).  Improvements to mitchell's remote user authentication protocol.  Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics).  3935 LNCS.  69-80.
  • Ananth P, Jain A, Sahai A  Indistinguishability Obfuscation from Functional Encryption for Simple Functions, And a New Bootstrapping Theorem for iO.
  • Ananth P, Choudhuri AR, Goel A, Jain A  Two Round Information-Theoretic MPC with Malicious Security.
Book Chapters
  • Canetti R, Goyal V, Jain A (2015).  Concurrent Secure Computation with Optimal Query Complexity.  Advances in Cryptology--CRYPTO 2015.  Springer Berlin Heidelberg.  43--62.
  • Bishop A, Jain A, Kowalczyk L (2015).  Function-hiding inner product encryption.  Advances in Cryptology--ASIACRYPT 2015.  Springer Berlin Heidelberg.  470--491.
  • Ananth P, Jain A (2015).  Indistinguishability obfuscation from compact functional encryption.  Advances in Cryptology--CRYPTO 2015.  Springer Berlin Heidelberg.  308--326.
  • Canetti R, Jain A, Paneth O (2014).  Client-Server Concurrent Zero Knowledge with Constant Rounds and Guaranteed Complexity.  Advances in Cryptology--CRYPTO 2014.  Springer Berlin Heidelberg.  337--350.
  • Jain A, Pandey O (2014).  Non-malleable zero knowledge: Black-box constructions and definitional relationships.  Security and Cryptography for Networks.  Springer International Publishing.  435--454.
  • De Caro A, Iovino V, Jain A, O’Neill A, Paneth O, Persiano G (2013).  On the achievability of simulation-based security for functional encryption.  Advances in Cryptology--CRYPTO 2013.  Springer Berlin Heidelberg.  519--535.
  • Boyle E, Garg S, Jain A, Kalai YT, Sahai A (2013).  Secure computation against adaptive auxiliary information.  Advances in Cryptology--CRYPTO 2013.  Springer Berlin Heidelberg.  316--334.
  • Goyal V, Jain A (2013).  On Concurrently Secure Computation in the Multiple Ideal Query Model.  Advances in Cryptology--EUROCRYPT 2013.  Springer Berlin Heidelberg.  684--701.
  • Goyal V, Jain A, Ostrovsky R, Richelson S, Visconti I (2013).  Constant-Round Concurrent Zero Knowledge in the Bounded Player Model.  Advances in Cryptology-ASIACRYPT 2013.  Springer Berlin Heidelberg.  21--40.
  • Goyal V, Jain A, Ostrovsky R, Richelson S, Visconti I (2013).  Concurrent zero knowledge in the bounded player model.  Theory of Cryptography.  Springer Berlin Heidelberg.  60--79.
  • Bitansky N, Dachman-Soled D, Garg S, Jain A, Kalai YT, L'opez-Alt A, Wichs D (2013).  Why “fiat-shamir for proofs” lacks a proof.  Theory of Cryptography.  Springer Berlin Heidelberg.  182--201.
  • Goyal V, Gupta D, Jain A (2013).  What Information Is Leaked under Concurrent Composition?.  Advances in Cryptology--CRYPTO 2013.  Springer Berlin Heidelberg.  220--238.
  • Jain A, Krenn S, Pietrzak K, Tentes A (2012).  Commitments and efficient zero-knowledge proofs from learning parity with noise.  Advances in Cryptology--ASIACRYPT 2012.  Springer Berlin Heidelberg.  663--680.
  • Goyal V, Jain A, Quisquater JJ (2005).  Improvements to mitchell’s remote user authentication protocol.  Information Security and Cryptology-ICISC 2005.  Springer Berlin Heidelberg.  69--80.
Conference Proceedings
  • Badrinarayanan S, Jain A, Ostrovsky R, Visconti I (2018).  Non-interactive Secure Computation from One-Way Functions.  International Conference on the Theory and Application of Cryptology and Information Security.  Springer.  118--138.
  • Badrinarayanan S, Goyal V, Jain A, Kalai YT, Khurana D, Sahai A (2018).  Promise zero knowledge and its applications to round optimal MPC.  Annual International Cryptology Conference.  Springer, Cham.  459--487.
  • Fleischhacker N, Goyal V, Jain A (2018).  On the Existence of Three Round Zero-Knowledge Proofs.  Annual International Conference on the Theory and Applications of Cryptographic Techniques.  Springer.  3--33.
  • Boyle E, Jain A, Prabhakaran M, Yu C (2018).  The Bottleneck Complexity of Secure Multiparty Computation.  45th International Colloquium on Automata, Languages, and Programming (ICALP 2018).  Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik.
  • Ananth P, Choudhuri AR, Goel A, Jain A (2018).  Round-optimal secure multiparty computation with honest majority.  Annual International Cryptology Conference.  Springer.  395--424.
  • Ananth P, Jain A, Sahai A (2017).  Patchable Indistinguishability Obfuscation: i$backslash$mathcal ${$O$}$ for Evolving Software.  Annual International Conference on the Theory and Applications of Cryptographic Techniques.  Springer, Cham.  127--155.
  • Jain A, Kalai YT, Khurana D, Rothblum R (2017).  Distinguisher-dependent simulation in two rounds and its applications.  Annual International Cryptology Conference.  Springer, Cham.  158--189.
  • Ananth P, Jain A, Sahai A (2017).  Indistinguishability Obfuscation for Turing Machines: Constant Overhead and Amortization.  Annual International Cryptology Conference.  Springer, Cham.  252--279.
  • Choudhuri AR, Green M, Jain A, Kaptchuk G, Miers I (2017).  Fairness in an Unfair World: Fair Multiparty Computation from Public Bulletin Boards.  Proceedings of the 2017 ACM SIGSAC Conference on Computer and Communications Security.  ACM.  719--728.
  • Ananth P, Jain A (2017).  On secure two-party computation in three rounds.  Theory of Cryptography Conference.  Springer, Cham.  612--644.
  • Badrinarayanan S, Goyal V, Jain A, Khurana D, Sahai A (2017).  Round optimal concurrent MPC via strong simulation.  Theory of Cryptography Conference.  Springer, Cham.  743--775.
  • Ananth P, Choudhuri AR, Jain A (2017).  A new approach to round-optimal secure multiparty computation.  Annual International Cryptology Conference.  Springer, Cham.  468--499.
  • Halevi S, Ishai Y, Jain A, Komargodski I, Sahai A, Yogev E (2017).  Non-interactive multiparty computation without correlated randomness.  International Conference on the Theory and Application of Cryptology and Information Security.  Springer, Cham.  181--211.
  • Ananth P, Cohen A, Jain A (2017).  Cryptography with updates.  Annual International Conference on the Theory and Applications of Cryptographic Techniques.  Springer, Cham.  445--472.
  • Halevi S, Ishai Y, Jain A, Kushilevitz E, Rabin T (2016).  Secure Multiparty Computation with General Interaction Patterns.  Proceedings of the 2016 ACM Conference on Innovations in Theoretical Computer Science.  ACM.  157--168.
  • Goyal V, Jain A, Koppula V, Sahai A (2015).  Functional encryption for randomized functionalities.  Theory of Cryptography Conference.  Springer Berlin Heidelberg.  325--351.
  • Jain A, Kalai YT, Lewko AB (2015).  Interactive coding for multiparty protocols.  Proceedings of the 2015 Conference on Innovations in Theoretical Computer Science.  ACM.  1--10.
  • Badrinarayanan S, Gupta D, Jain A, Sahai A (2015).  Multi-input functional encryption for unbounded arity functions.  International Conference on the Theory and Application of Cryptology and Information Security.  Springer Berlin Heidelberg.  27--51.
  • Canetti R, Holmgren J, Jain A, Vaikuntanathan V (2015).  Succinct garbling and indistinguishability obfuscation for ram programs.  Proceedings of the Forty-Seventh Annual ACM on Symposium on Theory of Computing.  ACM.  429--437.
  • Canetti R, Jain A, Scafuro A (2014).  Practical UC security with a global random oracle.  Proceedings of the 2014 ACM SIGSAC Conference on Computer and Communications Security.  ACM.  597--608.
  • Goldwasser S, Gordon SD, Goyal V, Jain A, Katz J, Liu F, Sahai A, Shi E, Zhou H (2014).  Multi-input functional encryption.  Annual International Conference on the Theory and Applications of Cryptographic Techniques.  Springer Berlin Heidelberg.  578--602.
  • Dodis Y, Jain A, Moran T, Wichs D (2012).  Counterexamples to hardness amplification beyond negligible.  Theory of Cryptography Conference.  Springer Berlin Heidelberg.  476--493.
  • Jain A, Pietrzak K, Tentes A (2012).  Hardness preserving constructions of pseudorandom functions.  Theory of Cryptography Conference.  Springer Berlin Heidelberg.  369--382.
  • Asharov G, Jain A, L'opez-Alt A, Tromer E, Vaikuntanathan V, Wichs D (2012).  Multiparty computation with low communication, computation and interaction via threshold FHE.  Annual International Conference on the Theory and Applications of Cryptographic Techniques.  Springer, Berlin, Heidelberg.  483--501.
  • Boyle E, Goldwasser S, Jain A, Kalai YT (2012).  Multiparty computation secure against continual memory leakage.  Proceedings of the forty-fourth annual ACM symposium on Theory of computing.  ACM.  1235--1254.
  • Garg S, Goyal V, Jain A, Sahai A (2011).  Bringing people of different beliefs together to do uc.  Theory of Cryptography Conference.  Springer Berlin Heidelberg.  311--328.
  • Jain A, Pietrzak K (2011).  Parallel repetition for leakage resilience amplification revisited.  Theory of Cryptography Conference.  Springer Berlin Heidelberg.  58--69.
  • Goyal V, Jain A (2010).  On the round complexity of covert computation.  Proceedings of the forty-second ACM symposium on Theory of computing.  ACM.  191--200.
  • Goyal V, Jain A, Pandey O, Sahai A (2008).  Bounded ciphertext policy attribute based encryption.  International Colloquium on Automata, Languages, and Programming.  Springer, Berlin, Heidelberg.  579--591.
  • Zhang X, Jain A, Perrig A (2008).  Packet-dropping adversary identification for data plane security.  Proceedings of the 2008 ACM CoNEXT Conference.  ACM.  24.
Back to top