Sanjam Garg

Orcid: 0000-0003-1330-0419

Affiliations:
  • University of California, Berkeley, CA, USA


According to our database1, Sanjam Garg authored at least 140 papers between 2007 and 2025.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2025
Black-Box Crypto is Useless for Pseudorandom Codes.
IACR Cryptol. ePrint Arch., 2025

Jigsaw: Doubly Private Smart Contracts.
IACR Cryptol. ePrint Arch., 2025

Collaborative zkSNARKs with Sublinear Prover Time and Constant Proof Size.
IACR Cryptol. ePrint Arch., 2025

BEAST-MEV: Batched Threshold Encryption with Silent Setup for MEV prevention.
IACR Cryptol. ePrint Arch., 2025

Laconic PSI on Authenticated Inputs and Applications.
IACR Cryptol. ePrint Arch., 2025

SoK: Watermarking for AI-Generated Content.
Proceedings of the IEEE Symposium on Security and Privacy, 2025

Split Prover Zero-Knowledge SNARKs.
Proceedings of the Public-Key Cryptography - PKC 2025, 2025

A Framework for Witness Encryption from Linearly Verifiable SNARKs and Applications.
Proceedings of the Advances in Cryptology - CRYPTO 2025, 2025

Malicious Security in Collaborative zk-SNARKs: More than Meets the Eye.
Proceedings of the Advances in Cryptology - CRYPTO 2025, 2025

2024
Insta-Pok3r: Real-time Poker on Blockchain.
IACR Cryptol. ePrint Arch., 2024

Practical Mempool Privacy via One-time Setup Batched Threshold Encryption.
IACR Cryptol. ePrint Arch., 2024

Publicly-Detectable Watermarking for Language Models.
IACR Commun. Cryptol., 2024

Mempool Privacy via Batched Threshold Encryption: Attacks and Defenses.
Proceedings of the 33rd USENIX Security Symposium, 2024

hinTS: Threshold Signatures with Silent Setup.
Proceedings of the IEEE Symposium on Security and Privacy, 2024

Laconic Branching Programs from the Diffie-Hellman Assumption.
Proceedings of the Public-Key Cryptography - PKC 2024, 2024

Threshold Encryption with Silent Setup.
Proceedings of the Advances in Cryptology - CRYPTO 2024, 2024

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

How to Prove Statements Obliviously?
Proceedings of the Advances in Cryptology - CRYPTO 2024, 2024

2023
SublonK: Sublinear Prover PlonK.
IACR Cryptol. ePrint Arch., 2023

Obfuscation and Outsourced Computation with Certified Deletion.
IACR Cryptol. ePrint Arch., 2023

zkSaaS: Zero-Knowledge SNARKs as a Service.
Proceedings of the 32nd USENIX Security Symposium, 2023

Threshold Signatures in the Multiverse.
Proceedings of the 44th IEEE Symposium on Security and Privacy, 2023

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

End-to-End Secure Messaging with Traceability Only for Illegal Content.
Proceedings of the Advances in Cryptology - EUROCRYPT 2023, 2023

Cryptography with Weights: MPC, Encryption and Signatures.
Proceedings of the Advances in Cryptology - CRYPTO 2023, 2023

Correlation Intractability and SNARGs from Sub-exponential DDH.
Proceedings of the Advances in Cryptology - CRYPTO 2023, 2023

Experimenting with Zero-Knowledge Proofs of Training.
Proceedings of the 2023 ACM SIGSAC Conference on Computer and Communications Security, 2023

2022
Deletion inference, reconstruction, and compliance in machine (un)learning.
Proc. Priv. Enhancing Technol., 2022

Overparameterized (robust) models from computational constraints.
CoRR, 2022

IBE with Incompressible Master Secret and Small Identity Secrets.
Proceedings of the Theory of Cryptography - 20th International Conference, 2022

On the Worst-Case Inefficiency of CGKA.
Proceedings of the Theory of Cryptography - 20th International Conference, 2022

Reusable Two-Round MPC from LPN.
Proceedings of the Public-Key Cryptography - PKC 2022, 2022

Overparameterization from Computational Constraints.
Proceedings of the Advances in Neural Information Processing Systems 35: Annual Conference on Neural Information Processing Systems 2022, 2022

Factoring and Pairings Are Not Necessary for IO: Circular-Secure LWE Suffices.
Proceedings of the 49th International Colloquium on Automata, Languages, and Programming, 2022

A More Complete Analysis of the Signal Double Ratchet Algorithm.
Proceedings of the Advances in Cryptology - CRYPTO 2022, 2022

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

2021
NeuraCrypt is not private.
CoRR, 2021

Amortizing Rate-1 OT and Applications to PIR and PSI.
Proceedings of the Theory of Cryptography - 19th International Conference, 2021

Laconic Private Set Intersection and Applications.
Proceedings of the Theory of Cryptography - 19th International Conference, 2021

Is Private Learning Possible with Instance Encoding?
Proceedings of the 42nd IEEE Symposium on Security and Privacy, 2021

A Separation Result Between Data-oblivious and Data-aware Poisoning Attacks.
Proceedings of the Advances in Neural Information Processing Systems 34: Annual Conference on Neural Information Processing Systems 2021, 2021

Compact Ring Signatures from Learning with Errors.
Proceedings of the Advances in Cryptology - CRYPTO 2021, 2021

How to Build a Trapdoor Function from an Encryption Scheme.
Proceedings of the Advances in Cryptology - ASIACRYPT 2021, 2021

2020
Reusable Two-Round MPC from DDH.
IACR Cryptol. ePrint Arch., 2020

An Attack on InstaHide: Is Private Learning Possible with Instance Encoding?
CoRR, 2020

Obliviousness Makes Poisoning Adversaries Weaker.
CoRR, 2020

Efficient Range-Trapdoor Functions and Applications: Rate-1 OT and More.
Proceedings of the Theory of Cryptography - 18th International Conference, 2020

FHE-Based Bootstrapping of Designated-Prover NIZK.
Proceedings of the Theory of Cryptography - 18th International Conference, 2020

Constant Ciphertext-Rate Non-committing Encryption from Standard Assumptions.
Proceedings of the Theory of Cryptography - 18th International Conference, 2020

Reusable Two-Round MPC from DDH.
Proceedings of the Theory of Cryptography - 18th International Conference, 2020

Black-Box Constructions of Bounded-Concurrent Secure Computation.
Proceedings of the Security and Cryptography for Networks - 12th International Conference, 2020

Tight Verifiable Delay Functions.
Proceedings of the Security and Cryptography for Networks - 12th International Conference, 2020

Master-Key KDM-Secure IBE from Pairings.
Proceedings of the Public-Key Cryptography - PKC 2020, 2020

Separating Two-Round Secure Computation From Oblivious Transfer.
Proceedings of the 11th Innovations in Theoretical Computer Science Conference, 2020

Ad Hoc Multi-Input Functional Encryption.
Proceedings of the 11th Innovations in Theoretical Computer Science Conference, 2020

Formalizing Data Deletion in the Context of the Right to Be Forgotten.
Proceedings of the Advances in Cryptology - EUROCRYPT 2020, 2020

Two-Round Oblivious Transfer from CDH or LPN.
Proceedings of the Advances in Cryptology - EUROCRYPT 2020, 2020

Candidate iO from Homomorphic Encryption Schemes.
Proceedings of the Advances in Cryptology - EUROCRYPT 2020, 2020

Adversarially Robust Learning Could Leverage Computational Hardness.
Proceedings of the Algorithmic Learning Theory, 2020

2019
Leveraging Linear Decryption: Rate-1 Fully-Homomorphic Encryption and Time-Lock Puzzles.
Proceedings of the Theory of Cryptography - 17th International Conference, 2019

Registration-Based Encryption from Standard Assumptions.
Proceedings of the Public-Key Cryptography - PKC 2019, 2019

Laconic Conditional Disclosure of Secrets and Applications.
Proceedings of the 60th IEEE Annual Symposium on Foundations of Computer Science, 2019

New Techniques for Efficient Trapdoor Functions and Applications.
Proceedings of the Advances in Cryptology - EUROCRYPT 2019, 2019

Trapdoor Hash Functions and Their Applications.
Proceedings of the Advances in Cryptology - CRYPTO 2019, 2019

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

Rate-1 Trapdoor Functions from the Diffie-Hellman Problem.
Proceedings of the Advances in Cryptology - ASIACRYPT 2019, 2019

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

A Simple Construction of iO for Turing Machines.
Proceedings of the Theory of Cryptography - 16th International Conference, 2018

Two-Round MPC: Information-Theoretic and Black-Box.
Proceedings of the Theory of Cryptography - 16th International Conference, 2018

Registration-Based Encryption: Removing Private-Key Generator from IBE.
Proceedings of the Theory of Cryptography - 16th International Conference, 2018

New Constructions of Identity-Based and Key-Dependent Message Secure Encryption Schemes.
Proceedings of the Public-Key Cryptography - PKC 2018, 2018

Obfuscation from Low Noise Multilinear Maps.
Proceedings of the Progress in Cryptology - INDOCRYPT 2018, 2018

Adaptively Secure Garbling with Near Optimal Online Complexity.
Proceedings of the Advances in Cryptology - EUROCRYPT 2018 - 37th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Tel Aviv, Israel, April 29, 2018

Two-Round Multiparty Secure Computation from Minimal Assumptions.
Proceedings of the Advances in Cryptology - EUROCRYPT 2018 - 37th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Tel Aviv, Israel, April 29, 2018

A New Approach to Black-Box Concurrent Secure Computation.
Proceedings of the Advances in Cryptology - EUROCRYPT 2018 - 37th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Tel Aviv, Israel, April 29, 2018

Adaptive Garbled RAM from Laconic Oblivious Transfer.
Proceedings of the Advances in Cryptology - CRYPTO 2018, 2018

Two-Round Multiparty Secure Computation Minimizing Public Key Operations.
Proceedings of the Advances in Cryptology - CRYPTO 2018, 2018

On the Round Complexity of OT Extension.
Proceedings of the Advances in Cryptology - CRYPTO 2018, 2018

Limits on the Power of Garbling Techniques for Public-Key Encryption.
Proceedings of the Advances in Cryptology - CRYPTO 2018, 2018

Trapdoor Functions from the Computational Diffie-Hellman Assumption.
Proceedings of the Advances in Cryptology - CRYPTO 2018, 2018

2017
When Does Functional Encryption Imply Obfuscation?
Proceedings of the Theory of Cryptography - 15th International Conference, 2017

From Selective IBE to Full IBE and Selective HIBE.
Proceedings of the Theory of Cryptography - 15th International Conference, 2017

Cryptanalysis of Indistinguishability Obfuscations of Circuits over GGH13.
Proceedings of the 44th International Colloquium on Automata, Languages, and Programming, 2017

Garbled Protocols and Two-Round MPC from Bilinear Maps.
Proceedings of the 58th IEEE Annual Symposium on Foundations of Computer Science, 2017

Breaking the Sub-Exponential Barrier in Obfustopia.
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

On the Exact Round Complexity of Self-composable Two-Party Computation.
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

Incremental Program Obfuscation.
Proceedings of the Advances in Cryptology - CRYPTO 2017, 2017

Lower Bounds on Obfuscation from All-or-Nothing Encryption Primitives.
Proceedings of the Advances in Cryptology - CRYPTO 2017, 2017

Identity-Based Encryption from the Diffie-Hellman Assumption.
Proceedings of the Advances in Cryptology - CRYPTO 2017, 2017

Laconic Oblivious Transfer and Its Applications.
Proceedings of the Advances in Cryptology - CRYPTO 2017, 2017

Two-Message Witness Indistinguishability and Secure Computation in the Plain Model from New Assumptions.
Proceedings of the Advances in Cryptology - ASIACRYPT 2017, 2017

2016
Unifying Security Notions of Functional Encryption.
IACR Cryptol. ePrint Arch., 2016

Obfuscation without the Vulnerabilities of Multilinear Maps.
IACR Cryptol. ePrint Arch., 2016

Hiding secrets in software: a cryptographic approach to program obfuscation.
Commun. ACM, 2016

Single-Key to Multi-Key Functional Encryption with Polynomial Loss.
Proceedings of the Theory of Cryptography - 14th International Conference, 2016

Secure Obfuscation in a Weak Multilinear Map Model.
Proceedings of the Theory of Cryptography - 14th International Conference, 2016

Functional Encryption Without Obfuscation.
Proceedings of the Theory of Cryptography - 13th International Conference, 2016

Secure Multiparty RAM Computation in Constant Rounds.
Proceedings of the Theory of Cryptography - 14th International Conference, 2016

The Exact Round Complexity of Secure Computation.
Proceedings of the Advances in Cryptology - EUROCRYPT 2016, 2016

Revisiting the Cryptographic Hardness of Finding a Nash Equilibrium.
Proceedings of the Advances in Cryptology - CRYPTO 2016, 2016

TWORAM: Efficient Oblivious RAM in Two Rounds with Applications to Searchable Encryption.
Proceedings of the Advances in Cryptology - CRYPTO 2016, 2016

2015
On the Exact Cryptographic Hardness of Finding a Nash Equilibrium.
IACR Cryptol. ePrint Arch., 2015

TWORAM: Round-Optimal Oblivious RAM with Applications to Searchable Encryption.
IACR Cryptol. ePrint Arch., 2015

Two-Round Adaptively Secure MPC from Indistinguishability Obfuscation.
Proceedings of the Theory of Cryptography - 12th Theory of Cryptography Conference, 2015

Garbled RAM From One-Way Functions.
Proceedings of the Forty-Seventh Annual ACM on Symposium on Theory of Computing, 2015

Succinct Randomized Encodings and their Applications.
Proceedings of the Forty-Seventh Annual ACM on Symposium on Theory of Computing, 2015

Black-Box Garbled RAM.
Proceedings of the IEEE 56th Annual Symposium on Foundations of Computer Science, 2015

Cryptography with One-Way Communication.
Proceedings of the Advances in Cryptology - CRYPTO 2015, 2015

2014
Fully Secure Functional Encryption without Obfuscation.
IACR Cryptol. ePrint Arch., 2014

Fully Secure Attribute Based Encryption from Multilinear Maps.
IACR Cryptol. ePrint Arch., 2014

Succinct Randomized Encodings and their Applications.
IACR Cryptol. ePrint Arch., 2014

Two-Round Secure MPC from Indistinguishability Obfuscation.
Proceedings of the Theory of Cryptography - 11th Theory of Cryptography Conference, 2014

Program Obfuscation via Multilinear Maps.
Proceedings of the Security and Cryptography for Networks - 9th International Conference, 2014

Cross-Domain Secure Computation.
Proceedings of the Public-Key Cryptography - PKC 2014, 2014

Balancing Output Length and Query Bound in Hardness Preserving Constructions of Pseudorandom Functions.
Proceedings of the Progress in Cryptology - INDOCRYPT 2014, 2014

Efficient Round Optimal Blind Signatures.
Proceedings of the Advances in Cryptology - EUROCRYPT 2014, 2014

Protecting Obfuscation against Algebraic Attacks.
Proceedings of the Advances in Cryptology - EUROCRYPT 2014, 2014

On the Implausibility of Differing-Inputs Obfuscation and Extractable Witness Encryption with Auxiliary Input.
Proceedings of the Advances in Cryptology - CRYPTO 2014, 2014

2013
Candidate Multilinear Maps.
PhD thesis, 2013

Differing-Inputs Obfuscation and Applications.
IACR Cryptol. ePrint Arch., 2013

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

Witness encryption and its applications.
Proceedings of the Symposium on Theory of Computing Conference, 2013

Candidate Indistinguishability Obfuscation and Functional Encryption for all Circuits.
Proceedings of the 54th Annual IEEE Symposium on Foundations of Computer Science, 2013

Candidate Multilinear Maps from Ideal Lattices.
Proceedings of the Advances in Cryptology, 2013

Attribute-Based Encryption for Circuits from Multilinear Maps.
Proceedings of the Advances in Cryptology - CRYPTO 2013, 2013

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

2012
Candidate Multilinear Maps from Ideal Lattices and Applications.
IACR Cryptol. ePrint Arch., 2012

Hardness Preserving Constructions of Pseudorandom Functions, Revisited.
IACR Cryptol. ePrint Arch., 2012

Why "Fiat-Shamir for Proofs" Lacks a Proof.
IACR Cryptol. ePrint Arch., 2012

Resettable Statistical Zero Knowledge.
Proceedings of the Theory of Cryptography - 9th Theory of Cryptography Conference, 2012

Concurrently Secure Computation in Constant Rounds.
Proceedings of the Advances in Cryptology - EUROCRYPT 2012, 2012

Adaptively Secure Multi-Party Computation with Dishonest Majority.
Proceedings of the Advances in Cryptology - CRYPTO 2012, 2012

Impossibility Results for Static Input Secure Computation.
Proceedings of the Advances in Cryptology - CRYPTO 2012, 2012

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

Round Optimal Blind Signatures.
Proceedings of the Advances in Cryptology - CRYPTO 2011, 2011

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

2010
Building efficient fully collusion-resilient traitor tracing and revocation schemes.
Proceedings of the 17th ACM Conference on Computer and Communications Security, 2010

2008
Improved Bounds on Security Reductions for Discrete Log Based Signatures.
Proceedings of the Advances in Cryptology, 2008

Anti-DDoS Virtualized Operating System.
Proceedings of the The Third International Conference on Availability, 2008

2007
Unified Architecture for Large-Scale Attested Metering.
Proceedings of the 40th Hawaii International International Conference on Systems Science (HICSS-40 2007), 2007


  Loading...