Abhishek Jain

Orcid: 0000-0002-3572-7643

Affiliations:
  • Johns Hopkins University, USA
  • MIT
  • UCLA


According to our database1, Abhishek Jain authored at least 108 papers between 2005 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Monotone-Policy Aggregate Signatures.
IACR Cryptol. ePrint Arch., 2024

Pseudorandom Obfuscation and Applications.
IACR Cryptol. ePrint Arch., 2024

Black-Box Non-Interactive Zero Knowledge from Vector Trapdoor Hash.
IACR Cryptol. ePrint Arch., 2024

Scalable Multiparty Computation from Non-linear Secret Sharing.
Proceedings of the Advances in Cryptology - CRYPTO 2024, 2024

2023
Time-Deniable Signatures.
Proc. Priv. Enhancing Technol., July, 2023

Secure Multiparty Computation with Free Branching.
IACR Cryptol. ePrint Arch., 2023

hinTS: Threshold Signatures with Silent Setup.
IACR Cryptol. ePrint Arch., 2023

zkSaaS: Zero-Knowledge SNARKs as a Service.
IACR Cryptol. ePrint Arch., 2023

A Note on Non-Interactive Zero-Knowledge from CDH.
IACR Cryptol. ePrint Arch., 2023

Scalable Multiparty Garbling.
IACR Cryptol. ePrint Arch., 2023

Abuse-Resistant Location Tracking: Balancing Privacy and Safety in the Offline Finding Ecosystem.
IACR Cryptol. ePrint Arch., 2023

Threshold Signatures in the Multiverse.
IACR Cryptol. ePrint Arch., 2023

Credibility in Private Set Membership.
Proceedings of the Public-Key Cryptography - PKC 2023, 2023

Efficient Set Membership Encryption and Applications.
Proceedings of the 2023 ACM SIGSAC Conference on Computer and Communications Security, 2023

2022
Indistinguishability Obfuscation via Mathematical Proofs of Equivalence.
IACR Cryptol. ePrint Arch., 2022

Cryptography with Weights: MPC, Encryption and Signatures.
IACR Cryptol. ePrint Arch., 2022

One-Time Programs from Commodity Hardware.
IACR Cryptol. ePrint Arch., 2022

Correlation Intractability and SNARGs from Sub-exponential DDH.
IACR Cryptol. ePrint Arch., 2022

End-to-End Secure Messaging with Traceability Only for Illegal Content.
IACR Cryptol. ePrint Arch., 2022

Steganography-Free Zero-Knowledge.
IACR Cryptol. ePrint Arch., 2022

Pre-Constrained Encryption.
Proceedings of the 13th Innovations in Theoretical Computer Science Conference, 2022

Succinct Zero Knowledge for Floating Point Computations.
Proceedings of the 2022 ACM SIGSAC Conference on Computer and Communications Security, 2022

2021
Non-Interactive Zero Knowledge from Sub-exponential DDH.
IACR Cryptol. ePrint Arch., 2021

On Communication Models and Best-Achievable Security in Two-Round MPC.
IACR Cryptol. ePrint Arch., 2021

SNARGs for <i>P</i> from LWE.
IACR Cryptol. ePrint Arch., 2021

Non-Interactive Batch Arguments for NP from Standard Assumptions.
IACR Cryptol. ePrint Arch., 2021

Oblivious Transfer from Trapdoor Permutations in Minimal Rounds.
IACR Cryptol. ePrint Arch., 2021

Order-C Secure Multiparty Computation for Highly Repetitive Circuits.
IACR Cryptol. ePrint Arch., 2021

Unbounded Multi-Party Computation from Learning with Errors.
IACR Cryptol. ePrint Arch., 2021

SNARGs for $\mathcal{P}$ from LWE.
Proceedings of the 62nd IEEE Annual Symposium on Foundations of Computer Science, 2021

2020
Self-Processing Private Sensor Data via Garbled Encryption.
Proc. Priv. Enhancing Technol., 2020

Statistical Zaps and New Oblivious Transfer Protocols.
IACR Cryptol. ePrint Arch., 2020

The Round Complexity of Secure Computation Against Covert Adversaries.
IACR Cryptol. ePrint Arch., 2020

Fluid MPC: Secure Multiparty Computation with Dynamic Participants.
IACR Cryptol. ePrint Arch., 2020

Multikey FHE in the Plain Model.
IACR Cryptol. ePrint Arch., 2020

Multiparty Homomorphic Encryption (or: On Removing Setup in Multi-Key FHE).
IACR Cryptol. ePrint Arch., 2020

Towards Efficiency-Preserving Round Compression in MPC: Do fewer rounds mean more computation?
IACR Cryptol. ePrint Arch., 2020

Multi-key Fully-Homomorphic Encryption in the Plain Model.
Proceedings of the Theory of Cryptography - 18th International Conference, 2020

2019
Statistical Zap Arguments from Quasi-Polynomial LWE.
IACR Cryptol. ePrint Arch., 2019

Founding Secure Computation on Blockchains.
IACR Cryptol. ePrint Arch., 2019

On Round Optimal Secure Multiparty Computation from Minimal Assumptions.
IACR Cryptol. ePrint Arch., 2019

Public-Key Function-Private Hidden Vector Encryption (and More).
IACR Cryptol. ePrint Arch., 2019

Interactive Non-malleable Codes.
Proceedings of the Theory of Cryptography - 17th International Conference, 2019

The Broadcast Message Complexity of Secure Multiparty Computation.
Proceedings of the Advances in Cryptology - ASIACRYPT 2019, 2019

UC-Secure Multiparty Computation from One-Way Functions Using Stateless Tokens.
Proceedings of the Advances in Cryptology - ASIACRYPT 2019, 2019

2018
Indistinguishability Obfuscation for RAM Programs and Succinct Randomized Encodings.
SIAM J. Comput., 2018

On the Existence of Three Round Zero-Knowledge Proofs.
IACR Cryptol. ePrint Arch., 2018

Non-Interactive Secure Computation from One-Way Functions.
IACR Cryptol. ePrint Arch., 2018

Two Round Information-Theoretic MPC with Malicious Security.
IACR Cryptol. ePrint Arch., 2018

Round-Optimal Secure Multiparty Computation with Honest Majority.
IACR Cryptol. ePrint Arch., 2018

The Bottleneck Complexity of Secure Multiparty Computation.
Proceedings of the 45th International Colloquium on Automata, Languages, and Programming, 2018

2017
Efficient Authentication from Hard Learning Problems.
J. Cryptol., 2017

Distinguisher-Dependent Simulation in Two Rounds and its Applications.
IACR Cryptol. ePrint Arch., 2017

Non-Interactive Multiparty Computation without Correlated Randomness.
IACR Cryptol. ePrint Arch., 2017

Fairness in an Unfair World: Fair Multiparty Computation from public Bulletin Boards.
IACR Cryptol. ePrint Arch., 2017

Promise Zero Knowledge and its Applications to Round Optimal MPC.
IACR Cryptol. ePrint Arch., 2017

Round Optimal Concurrent MPC via Strong Simulation.
IACR Cryptol. ePrint Arch., 2017

A New Approach to Round-Optimal Secure Multiparty Computation.
IACR Cryptol. ePrint Arch., 2017

On Secure Two-Party Computation in Three Rounds.
IACR Cryptol. ePrint Arch., 2017

Patchable Indistinguishability Obfuscation: i<i>O</i> for Evolving Software.
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

2016
Cryptography with Updates.
IACR Cryptol. ePrint Arch., 2016

2015
Secure Multiparty Computation with General Interaction Patterns.
IACR Cryptol. ePrint Arch., 2015

On Concurrently Secure Computation in the Multiple Ideal Query Model.
IACR Cryptol. ePrint Arch., 2015

What Information is Leaked under Concurrent Composition?
IACR Cryptol. ePrint Arch., 2015

Concurrent Secure Computation with Optimal Query Complexity.
IACR Cryptol. ePrint Arch., 2015

Time-Lock Puzzles from Randomized Encodings.
IACR Cryptol. ePrint Arch., 2015

Function-Hiding Inner Product Encryption.
IACR Cryptol. ePrint Arch., 2015

Multi-Input Functional Encryption for Unbounded Arity Functions.
IACR Cryptol. ePrint Arch., 2015

Patchable Obfuscation.
IACR Cryptol. ePrint Arch., 2015

Indistinguishability Obfuscation with Constant Size Overhead.
IACR Cryptol. ePrint Arch., 2015

Achieving Compactness Generically: Indistinguishability Obfuscation from Non-Compact Functional Encryption.
IACR Cryptol. ePrint Arch., 2015

Indistinguishability Obfuscation from Compact Functional Encryption.
IACR Cryptol. ePrint Arch., 2015

Succinct Garbling and Indistinguishability Obfuscation for RAM Programs.
Proceedings of the Forty-Seventh Annual ACM on Symposium on Theory of Computing, 2015

Interactive Coding for Multiparty Protocols.
Proceedings of the 2015 Conference on Innovations in Theoretical Computer Science, 2015

2014
Indistinguishability Obfuscation of Iterated Circuits and RAM Programs.
IACR Cryptol. ePrint Arch., 2014

Practical UC security with a Global Random Oracle.
IACR Cryptol. ePrint Arch., 2014

Client-Server Concurrent Zero Knowledge with Constant Rounds and Guaranteed Complexity.
IACR Cryptol. ePrint Arch., 2014

Multi-input Functional Encryption.
Proceedings of the Advances in Cryptology - EUROCRYPT 2014, 2014

2013
The IPS Compiler.
Proceedings of the Secure Multi-Party Computation, 2013

Functional Encryption for Randomized Functionalities.
IACR Cryptol. ePrint Arch., 2013

Multi-Input Functional Encryption.
IACR Cryptol. ePrint Arch., 2013

On the Achievability of Simulation-Based Security for Functional Encryption.
IACR Cryptol. ePrint Arch., 2013

Concurrent Zero Knowledge in the Bounded Player Model.
Proceedings of the Theory of Cryptography - 10th Theory of Cryptography Conference, 2013

Why "Fiat-Shamir for Proofs" Lacks a Proof.
Proceedings of the Theory of Cryptography - 10th Theory of Cryptography Conference, 2013

Secure Computation against Adaptive Auxiliary Information.
Proceedings of the Advances in Cryptology - CRYPTO 2013, 2013

Constant-Round Concurrent Zero Knowledge in the Bounded Player Model.
Proceedings of the Advances in Cryptology - ASIACRYPT 2013, 2013

2012
New Frontiers in Secure Computation.
PhD thesis, 2012

Concurrent Zero Knowledge in the Bounded Player Model.
IACR Cryptol. ePrint Arch., 2012

Counterexamples to Hardness Amplification Beyond Negligible.
IACR Cryptol. ePrint Arch., 2012

On the (In)security of the Fiat-Shamir Paradigm, Revisited.
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

Commitments and Efficient Zero-Knowledge Proofs from Hard Learning Problems.
IACR Cryptol. ePrint Arch., 2012

Hardness Preserving Constructions of Pseudorandom Functions.
Proceedings of the Theory of Cryptography - 9th Theory of Cryptography Conference, 2012

Multiparty computation secure against continual memory leakage.
Proceedings of the 44th Symposium on Theory of Computing Conference, 2012

Multiparty Computation with Low Communication, Computation and Interaction via Threshold FHE.
Proceedings of the Advances in Cryptology - EUROCRYPT 2012, 2012

Commitments and Efficient Zero-Knowledge Proofs from Learning Parity with Noise.
Proceedings of the Advances in Cryptology - ASIACRYPT 2012, 2012

2011
Non-Malleable Zero Knowledge: Black-Box Constructions and Definitional Relationships.
IACR Cryptol. ePrint Arch., 2011

Concurrently Secure Computation in Constant Rounds.
IACR Cryptol. ePrint Arch., 2011

Multiparty Computation with Low Communication, Computation and Interaction via Threshold FHE.
IACR Cryptol. ePrint Arch., 2011

Parallel Repetition for Leakage Resilience Amplification Revisited.
Proceedings of the Theory of Cryptography - 8th Theory of Cryptography Conference, 2011

Bringing People of Different Beliefs Together to Do UC.
Proceedings of the Theory of Cryptography - 8th Theory of Cryptography Conference, 2011

Leakage-Resilient Zero Knowledge.
Proceedings of the Advances in Cryptology - CRYPTO 2011, 2011

2010
On the Round Complexity of Covert Computation.
IACR Cryptol. ePrint Arch., 2010

Password-Authenticated Session-Key Generation on the Internet in the Plain Model.
Proceedings of the Advances in Cryptology, 2010

2008
Bounded Ciphertext Policy Attribute Based Encryption.
Proceedings of the Automata, Languages and Programming, 35th International Colloquium, 2008

Packet-dropping adversary identification for data plane security.
Proceedings of the 2008 ACM Conference on Emerging Network Experiment and Technology, 2008

2005
Improvements to Mitchell's Remote User Authentication Protocol.
Proceedings of the Information Security and Cryptology, 2005


  Loading...