Unified Architecture for Large-Scale Attested Metering. - Michael LeMay; George Gross; Carl A. Gunter; Sanjam Garg (HICSS, 2007)

Anti-DDoS Virtualized Operating System. - Sanjam Garg; Huzur Saran (ARES, 2008)

Improved Bounds on Security Reductions for Discrete Log Based Signatures. - Sanjam Garg; Raghav Bhaskar; Satyanarayana V. Lokam (CRYPTO, 2008)

Building Efficient Fully Collusion-Resilient Traitor Tracing and Revocation Schemes. - Sanjam Garg; Abishek Kumarasubramanian; Amit Sahai; Brent Waters (IACR Cryptol. ePrint Arch., 2009)

Leakage-Resilient Zero Knowledge. - Sanjam Garg; Abhishek Jain 002; Amit Sahai (CRYPTO, 2011)

Round Optimal Blind Signatures. - Sanjam Garg; Vanishree Rao; Amit Sahai; Dominique Schröder; Dominique Unruh (CRYPTO, 2011)

Bringing People of Different Beliefs Together to Do UC. - Sanjam Garg; Vipul Goyal; Abhishek Jain 002; Amit Sahai (TCC, 2011)

Concurrently Secure Computation in Constant Rounds. - Sanjam Garg; Vipul Goyal; Abhishek Jain 002; Amit Sahai (IACR Cryptol. ePrint Arch., 2011)

Resettable Statistical Zero Knowledge. - Sanjam Garg; Rafail Ostrovsky; Ivan Visconti; Akshay Wadia (IACR Cryptol. ePrint Arch., 2011)

Why "Fiat-Shamir for Proofs" Lacks a Proof. - Nir Bitansky; Sanjam Garg; Daniel Wichs (IACR Cryptol. ePrint Arch., 2012)

Hardness Preserving Constructions of Pseudorandom Functions, Revisited. - Nishanth Chandran; Sanjam Garg (IACR Cryptol. ePrint Arch., 2012)

Candidate Multilinear Maps from Ideal Lattices and Applications. - Sanjam Garg; Craig Gentry; Shai Halevi (IACR Cryptol. ePrint Arch., 2012)

Impossibility Results for Static Input Secure Computation. - Sanjam Garg; Abishek Kumarasubramanian; Rafail Ostrovsky; Ivan Visconti (IACR Cryptol. ePrint Arch., 2012)

Adaptively Secure Multi-Party Computation with Dishonest Majority. - Sanjam Garg; Amit Sahai (IACR Cryptol. ePrint Arch., 2012)

Secure Computation against Adaptive Auxiliary Information. - Elette Boyle; Sanjam Garg; Abhishek Jain 002; Yael Tauman Kalai; Amit Sahai (CRYPTO (1), 2013)

Candidate Multilinear Maps from Ideal Lattices. - Sanjam Garg; Craig Gentry; Shai Halevi (EUROCRYPT, 2013)

Why "Fiat-Shamir for Proofs" Lacks a Proof. - Nir Bitansky; Dana Dachman-Soled; Sanjam Garg; Abhishek Jain 002; Yael Tauman Kalai; Adriana López-Alt; Daniel Wichs (TCC, 2013)

Differing-Inputs Obfuscation and Applications. - Prabhanjan Ananth; Dan Boneh; Sanjam Garg; Amit Sahai; Mark Zhandry (IACR Cryptol. ePrint Arch., 2013)

Protecting Obfuscation Against Algebraic Attacks. - Boaz Barak; Sanjam Garg; Yael Tauman Kalai; Omer Paneth; Amit Sahai (IACR Cryptol. ePrint Arch., 2013)

Two-round secure MPC from Indistinguishability Obfuscation. - Sanjam Garg; Craig Gentry; Shai Halevi; Mariana Raykova 001 (IACR Cryptol. ePrint Arch., 2013)

Attribute-Based Encryption for Circuits from Multilinear Maps. - Sanjam Garg; Craig Gentry; Shai Halevi; Amit Sahai; Brent Waters (IACR Cryptol. ePrint Arch., 2013)

Witness Encryption and its Applications. - Sanjam Garg; Craig Gentry; Amit Sahai; Brent Waters (IACR Cryptol. ePrint Arch., 2013)

Candidate Multilinear Maps. - Sanjam Garg (2013)

Balancing Output Length and Query Bound in Hardness Preserving Constructions of Pseudorandom Functions. - Nishanth Chandran; Sanjam Garg (INDOCRYPT, 2014)

Cross-Domain Secure Computation. - Chongwon Cho; Sanjam Garg; Rafail Ostrovsky (Public Key Cryptography, 2014)

Program Obfuscation via Multilinear Maps. - Sanjam Garg (SCN, 2014)

Succinct Randomized Encodings and their Applications. - Nir Bitansky; Sanjam Garg; Sidharth Telang (IACR Cryptol. ePrint Arch., 2014)

Efficient Round Optimal Blind Signatures. - Sanjam Garg; Divya Gupta 001 (IACR Cryptol. ePrint Arch., 2014)

Fully Secure Attribute Based Encryption from Multilinear Maps. - Sanjam Garg; Craig Gentry; Shai Halevi; Mark Zhandry (IACR Cryptol. ePrint Arch., 2014)

Fully Secure Functional Encryption without Obfuscation. - Sanjam Garg; Craig Gentry; Shai Halevi; Mark Zhandry (IACR Cryptol. ePrint Arch., 2014)

Cryptography with One-Way Communication. - Sanjam Garg; Yuval Ishai; Eyal Kushilevitz; Rafail Ostrovsky; Amit Sahai (IACR Cryptol. ePrint Arch., 2014)

Garbled RAM From One-Way Functions. - Sanjam Garg; Steve Lu 001; Rafail Ostrovsky; Alessandra Scafuro (IACR Cryptol. ePrint Arch., 2014)

Two-Round Adaptively Secure MPC from Indistinguishability Obfuscation. - Sanjam Garg; Antigoni Polychroniadou (IACR Cryptol. ePrint Arch., 2014)

Black-Box Garbled RAM. - Sanjam Garg; Steve Lu 001; Rafail Ostrovsky (Electron. Colloquium Comput. Complex., 2015)

Succinct Randomized Encodings and their Applications. - Nir Bitansky; Sanjam Garg; Huijia Lin; Rafael Pass; Sidharth Telang (IACR Cryptol. ePrint Arch., 2015)

TWORAM: Round-Optimal Oblivious RAM with Applications to Searchable Encryption. - Sanjam Garg; Payman Mohassel; Charalampos Papamanthou (IACR Cryptol. ePrint Arch., 2015)

Incremental Program Obfuscation. - Sanjam Garg; Omkant Pandey (IACR Cryptol. ePrint Arch., 2015)

On the Exact Cryptographic Hardness of Finding a Nash Equilibrium. - Sanjam Garg; Omkant Pandey; Akshayaram Srinivasan (IACR Cryptol. ePrint Arch., 2015)

TWORAM: Efficient Oblivious RAM in Two Rounds with Applications to Searchable Encryption. - Sanjam Garg; Payman Mohassel; Charalampos Papamanthou (CRYPTO (3), 2016)

Revisiting the Cryptographic Hardness of Finding a Nash Equilibrium. - Sanjam Garg; Omkant Pandey; Akshayaram Srinivasan (CRYPTO (2), 2016)

Functional Encryption Without Obfuscation. - Sanjam Garg; Craig Gentry; Shai Halevi; Mark Zhandry (TCC (A2), 2016)

Single-Key to Multi-Key Functional Encryption with Polynomial Loss. - Sanjam Garg; Akshayaram Srinivasan (TCC (B2), 2016)

Hiding secrets in software: a cryptographic approach to program obfuscation. - Sanjam Garg; Craig Gentry; Shai Halevi; Mariana Raykova 001; Amit Sahai; Brent Waters (Commun. ACM, 2016)

Cryptanalysis of Indistinguishability Obfuscations of Circuits over GGH13. - Daniel Apon; Nico Döttling; Sanjam Garg; Pratyay Mukherjee (IACR Cryptol. ePrint Arch., 2016)

Obfuscation from Low Noise Multilinear Maps. - Nico Döttling; Sanjam Garg; Divya Gupta 001; Peihan Miao 001; Pratyay Mukherjee (IACR Cryptol. ePrint Arch., 2016)

Secure Multiparty RAM Computation in Constant Rounds. - Sanjam Garg; Divya Gupta 001; Peihan Miao 001; Omkant Pandey (IACR Cryptol. ePrint Arch., 2016)

Secure Obfuscation in a Weak Multilinear Map Model. - Sanjam Garg; Eric Miles; Pratyay Mukherjee; Amit Sahai; Akshayaram Srinivasan; Mark Zhandry (IACR Cryptol. ePrint Arch., 2016)

The Exact Round Complexity of Secure Computation. - Sanjam Garg; Pratyay Mukherjee; Omkant Pandey; Antigoni Polychroniadou (IACR Cryptol. ePrint Arch., 2016)

Obfuscation without the Vulnerabilities of Multilinear Maps. - Sanjam Garg; Pratyay Mukherjee; Akshayaram Srinivasan (IACR Cryptol. ePrint Arch., 2016)

Breaking the Sub-Exponential Barrier in Obfustopia. - Sanjam Garg; Omkant Pandey; Akshayaram Srinivasan; Mark Zhandry (IACR Cryptol. ePrint Arch., 2016)

Unifying Security Notions of Functional Encryption. - Sanjam Garg; Akshayaram Srinivasan (IACR Cryptol. ePrint Arch., 2016)

Candidate Indistinguishability Obfuscation and Functional Encryption for All Circuits. - Sanjam Garg; Craig Gentry; Shai Halevi; Mariana Raykova 001; Amit Sahai; Brent Waters (SIAM J. Comput., 2016)

On the Implausibility of Differing-Inputs Obfuscation and Extractable Witness Encryption with Auxiliary Input. - Sanjam Garg; Craig Gentry; Shai Halevi; Daniel Wichs (Algorithmica, 2017)

Two-Message Witness Indistinguishability and Secure Computation in the Plain Model from New Assumptions. - Saikrishna Badrinarayanan; Sanjam Garg; Yuval Ishai; Amit Sahai; Akshay Wadia (IACR Cryptol. ePrint Arch., 2017)

Laconic Oblivious Transfer and its Applications. - Chongwon Cho; Nico Döttling; Sanjam Garg; Divya Gupta 001; Peihan Miao 001; Antigoni Polychroniadou (IACR Cryptol. ePrint Arch., 2017)

From Selective IBE to Full IBE and Selective HIBE. - Nico Döttling; Sanjam Garg (IACR Cryptol. ePrint Arch., 2017)

New Constructions of Identity-Based and Key-Dependent Message Secure Encryption Schemes. - Nico Döttling; Sanjam Garg; Mohammad Hajiabadi; Daniel Masny (IACR Cryptol. ePrint Arch., 2017)

On the Exact Round Complexity of Self-Composable Two-Party Computation. - Sanjam Garg; Susumu Kiyoshima; Omkant Pandey (IACR Cryptol. ePrint Arch., 2017)

Lower Bounds on Obfuscation from All-or-Nothing Encryption Primitives. - Sanjam Garg; Mohammad Mahmoody; Ameer Mohammed (IACR Cryptol. ePrint Arch., 2017)

When does Functional Encryption Imply Obfuscation? - Sanjam Garg; Mohammad Mahmoody; Ameer Mohammed (IACR Cryptol. ePrint Arch., 2017)

On the Round Complexity of OT Extension. - Sanjam Garg; Mohammad Mahmoody; Daniel Masny; Izaak Meckler (IACR Cryptol. ePrint Arch., 2017)

Garbled Protocols and Two-Round MPC from Bilinear Maps. - Sanjam Garg; Akshayaram Srinivasan (IACR Cryptol. ePrint Arch., 2017)

New Techniques for Efficient Trapdoor Functions and Applications. - Sanjam Garg; Romain Gay; Mohammad Hajiabadi (IACR Cryptol. ePrint Arch., 2018)

Trapdoor Functions from the Computational Diffie-Hellman Assumption. - Sanjam Garg; Mohammad Hajiabadi (IACR Cryptol. ePrint Arch., 2018)

Limits on the Power of Garbling Techniques for Public-Key Encryption. - Sanjam Garg; Mohammad Hajiabadi; Mohammad Mahmoody; Ameer Mohammed (IACR Cryptol. ePrint Arch., 2018)

Registration-Based Encryption: Removing Private-Key Generator from IBE. - Sanjam Garg; Mohammad Hajiabadi; Mohammad Mahmoody; Ahmadreza Rahimi (IACR Cryptol. ePrint Arch., 2018)

Registration-Based Encryption from Standard Assumptions. - Sanjam Garg; Mohammad Hajiabadi; Mohammad Mahmoody; Ahmadreza Rahimi; Sruthi Sekar (IACR Cryptol. ePrint Arch., 2018)

Two-Round MPC: Information-Theoretic and Black-Box. - Sanjam Garg; Yuval Ishai; Akshayaram Srinivasan (IACR Cryptol. ePrint Arch., 2018)

A New Approach to Black-Box Concurrent Secure Computation. - Sanjam Garg; Susumu Kiyoshima; Omkant Pandey (IACR Cryptol. ePrint Arch., 2018)

Two-Round Multiparty Secure Computation Minimizing Public Key Operations. - Sanjam Garg; Peihan Miao 001; Akshayaram Srinivasan (IACR Cryptol. ePrint Arch., 2018)

Adaptive Garbled RAM from Laconic Oblivious Transfer. - Sanjam Garg; Rafail Ostrovsky; Akshayaram Srinivasan (IACR Cryptol. ePrint Arch., 2018)

Adaptively Secure Garbling with Near Optimal Online Complexity. - Sanjam Garg; Akshayaram Srinivasan (IACR Cryptol. ePrint Arch., 2018)

A Simple Construction of iO for Turing Machines. - Sanjam Garg; Akshayaram Srinivasan (IACR Cryptol. ePrint Arch., 2018)

Indistinguishability Obfuscation for RAM Programs and Succinct Randomized Encodings. - Nir Bitansky; Ran Canetti; Sanjam Garg; Justin Holmgren; Abhishek Jain 002; Huijia Lin; Rafael Pass; Sidharth Telang; Vinod Vaikuntanathan (SIAM J. Comput., 2018)

The Broadcast Message Complexity of Secure Multiparty Computation. - Sanjam Garg; Aarushi Goel; Abhishek Jain 002 (ASIACRYPT (1), 2019)

Ad Hoc Multi-Input Functional Encryption. - Shweta Agrawal 001; Michael Clear; Ophir Frieder; Sanjam Garg; Adam O'Neill; Justin Thaler (IACR Cryptol. ePrint Arch., 2019)

Leveraging Linear Decryption: Rate-1 Fully-Homomorphic Encryption and Time-Lock Puzzles. - Zvika Brakerski; Nico Döttling; Sanjam Garg; Giulio Malavolta (IACR Cryptol. ePrint Arch., 2019)

Laconic Conditional Disclosure of Secrets and Applications. - Nico Döttling; Sanjam Garg; Vipul Goyal; Giulio Malavolta (IACR Cryptol. ePrint Arch., 2019)

Rate-1 Trapdoor Functions from the Diffie-Hellman Problem. - Nico Döttling; Sanjam Garg; Mohammad Hajiabadi; Kevin Liu; Giulio Malavolta (IACR Cryptol. ePrint Arch., 2019)

Two-Round Oblivious Transfer from CDH or LPN. - Nico Döttling; Sanjam Garg; Mohammad Hajiabadi; Daniel Masny; Daniel Wichs (IACR Cryptol. ePrint Arch., 2019)

Trapdoor Hash Functions and Their Applications. - Nico Döttling; Sanjam Garg; Yuval Ishai; Giulio Malavolta; Tamer Mour; Rafail Ostrovsky (IACR Cryptol. ePrint Arch., 2019)

Tight Verifiable Delay Functions. - Nico Döttling; Sanjam Garg; Giulio Malavolta; Prashant Nalini Vasudevan (IACR Cryptol. ePrint Arch., 2019)

Efficient Range-Trapdoor Functions and Applications: Rate-1 OT and More. - Sanjam Garg; Mohammad Hajiabadi; Rafail Ostrovsky (IACR Cryptol. ePrint Arch., 2019)

Adversarially Robust Learning Could Leverage Computational Hardness. - Sanjam Garg; Somesh Jha; Saeed Mahloujifar; Mohammad Mahmoody (ALT, 2020)

Reusable Two-Round MPC from DDH. - James Bartusek; Sanjam Garg; Daniel Masny; Pratyay Mukherjee (TCC (2), 2020)

Obliviousness Makes Poisoning Adversaries Weaker. - Sanjam Garg; Somesh Jha; Saeed Mahloujifar; Mohammad Mahmoody; Abhradeep Thakurta (CoRR, 2020)

An Attack on InstaHide: Is Private Learning Possible with Instance Encoding? - Nicholas Carlini; Samuel Deng; Sanjam Garg; Somesh Jha; Saeed Mahloujifar; Mohammad Mahmoody; Shuang Song 001; Abhradeep Thakurta; Florian Tramèr (CoRR, 2020)

Separating Two-Round Secure Computation from Oblivious Transfer. - Benny Applebaum; Zvika Brakerski; Sanjam Garg; Yuval Ishai; Akshayaram Srinivasan (IACR Cryptol. ePrint Arch., 2020)

Reusable Two-Round MPC from DDH. - Saikrishna Badrinarayanan; James Bartusek; Sanjam Garg; Daniel Masny; Pratyay Mukherjee (IACR Cryptol. ePrint Arch., 2020)

Constant Ciphertext-Rate Non-Committing Encryption from Standard Assumptions. - Zvika Brakerski; Pedro Branco 005; Nico Döttling; Sanjam Garg; Giulio Malavolta (IACR Cryptol. ePrint Arch., 2020)

Factoring and Pairings are not Necessary for iO: Circular-Secure LWE Suffices. - Zvika Brakerski; Nico Döttling; Sanjam Garg; Giulio Malavolta (IACR Cryptol. ePrint Arch., 2020)

FHE-Based Bootstrapping of Designated-Prover NIZK. - Zvika Brakerski; Sanjam Garg; Rotem Tsabary (IACR Cryptol. ePrint Arch., 2020)

Master-Key KDM-Secure IBE from Pairings. - Sanjam Garg; Romain Gay; Mohammad Hajiabadi (IACR Cryptol. ePrint Arch., 2020)

Formalizing Data Deletion in the Context of the Right to be Forgotten. - Sanjam Garg; Shafi Goldwasser; Prashant Nalini Vasudevan (IACR Cryptol. ePrint Arch., 2020)

Black-Box Constructions of Bounded-Concurrent Secure Computation. - Sanjam Garg; Xiao Liang 014; Omkant Pandey; Ivan Visconti (IACR Cryptol. ePrint Arch., 2020)

How to Build a Trapdoor Function from an Encryption Scheme. - Sanjam Garg; Mohammad Hajiabadi; Giulio Malavolta; Rafail Ostrovsky (ASIACRYPT (3), 2021)

A Separation Result Between Data-oblivious and Data-aware Poisoning Attacks. - Samuel Deng; Sanjam Garg; Somesh Jha; Saeed Mahloujifar; Mohammad Mahmoody; Abhradeep Guha Thakurta (NeurIPS, 2021)

Is Private Learning Possible with Instance Encoding? - Nicholas Carlini; Samuel Deng; Sanjam Garg; Somesh Jha; Saeed Mahloujifar; Mohammad Mahmoody; Abhradeep Thakurta; Florian Tramèr (SP, 2021)

NeuraCrypt is not private. - Nicholas Carlini; Sanjam Garg; Somesh Jha; Saeed Mahloujifar; Mohammad Mahmoody; Florian Tramèr (CoRR, 2021)

Laconic Private Set Intersection and Applications. - Navid Alamati; Pedro Branco 005; Nico Döttling; Sanjam Garg; Mohammad Hajiabadi; Sihang Pu (IACR Cryptol. ePrint Arch., 2021)

Reusable Two-Round MPC from LPN. - James Bartusek; Sanjam Garg; Akshayaram Srinivasan; Yinuo Zhang (IACR Cryptol. ePrint Arch., 2021)

Amortizing Rate-1 OT and Applications to PIR and PSI. - Melissa Chase; Sanjam Garg; Mohammad Hajiabadi; Jialin Li; Peihan Miao 001 (IACR Cryptol. ePrint Arch., 2021)

Compact Ring Signatures from Learning With Errors. - Rohit Chatterjee; Sanjam Garg; Mohammad Hajiabadi; Dakshita Khurana; Xiao Liang 014; Giulio Malavolta; Omkant Pandey; Sina Shiehian (IACR Cryptol. ePrint Arch., 2021)

Identity-based Encryption from the Diffie-Hellman Assumption. - Nico Döttling; Sanjam Garg (J. ACM, 2021)

Succinct Zero Knowledge for Floating Point Computations. - Sanjam Garg; Abhishek Jain 002; Zhengzhong Jin; Yinuo Zhang (CCS, 2022)

Overparameterization from Computational Constraints. - Sanjam Garg; Somesh Jha; Saeed Mahloujifar; Mohammad Mahmoody; Mingyuan Wang 001 (NeurIPS, 2022)

Overparameterized (robust) models from computational constraints. - Sanjam Garg; Somesh Jha; Saeed Mahloujifar; Mohammad Mahmoody; Mingyuan Wang 001 (CoRR, 2022)

End-to-End Secure Messaging with Traceability Only for Illegal Content. - James Bartusek; Sanjam Garg; Abhishek Jain 002; Guru-Vamsi Policharla (IACR Cryptol. ePrint Arch., 2022)

On the Worst-Case Inefficiency of CGKA. - Alexander Bienstock; Yevgeniy Dodis; Sanjam Garg; Garrison Grogan; Mohammad Hajiabadi; Paul Rösler (IACR Cryptol. ePrint Arch., 2022)

A More Complete Analysis of the Signal Double Ratchet Algorithm. - Alexander Bienstock; Jaiden Fairoze; Sanjam Garg; Pratyay Mukherjee; Srinivasan Raghuraman (IACR Cryptol. ePrint Arch., 2022)

Correlation Intractability and SNARGs from Sub-exponential DDH. - Arka Rai Choudhuri; Sanjam Garg; Abhishek Jain 002; Zhengzhong Jin; Jiaheng Zhang (IACR Cryptol. ePrint Arch., 2022)

IBE with Incompressible Master Secret and Small Identity Secrets. - Nico Döttling; Sanjam Garg; Sruthi Sekar; Mingyuan Wang 001 (IACR Cryptol. ePrint Arch., 2022)

Cryptography with Weights: MPC, Encryption and Signatures. - Sanjam Garg; Abhishek Jain 002; Pratyay Mukherjee; Rohit Sinha 001; Mingyuan Wang 001; Yinuo Zhang (IACR Cryptol. ePrint Arch., 2022)

Two-round Multiparty Secure Computation from Minimal Assumptions. - Sanjam Garg; Akshayaram Srinivasan (J. ACM, 2022)

Deletion inference, reconstruction, and compliance in machine (un)learning. - Ji Gao; Sanjam Garg; Mohammad Mahmoody; Prashant Nalini Vasudevan (Proc. Priv. Enhancing Technol., 2022)

Credibility in Private Set Membership. - Sanjam Garg; Mohammad Hajiabadi; Abhishek Jain 002; Zhengzhong Jin; Omkant Pandey; Sina Shiehian (Public Key Cryptography (2), 2023)

Threshold Signatures in the Multiverse. - Leemon Baird; Sanjam Garg; Abhishek Jain 002; Pratyay Mukherjee; Rohit Sinha 001; Mingyuan Wang 001; Yinuo Zhang (IACR Cryptol. ePrint Arch., 2023)

Obfuscation and Outsourced Computation with Certified Deletion. - James Bartusek; Sanjam Garg; Vipul Goyal; Dakshita Khurana; Giulio Malavolta; Justin Raizes; Bhaskar Roberts (IACR Cryptol. ePrint Arch., 2023)

Experimenting with Zero-Knowledge Proofs of Training. - Sanjam Garg; Aarushi Goel; Somesh Jha; Saeed Mahloujifar; Mohammad Mahmoody; Guru-Vamsi Policharla; Mingyuan Wang 001 (IACR Cryptol. ePrint Arch., 2023)

zkSaaS: Zero-Knowledge SNARKs as a Service. - Sanjam Garg; Aarushi Goel; Abhishek Jain 002; Guru-Vamsi Policharla; Sruthi Sekar (IACR Cryptol. ePrint Arch., 2023)

How to Prove Statements Obliviously? - Sanjam Garg; Aarushi Goel; Mingyuan Wang 001 (IACR Cryptol. ePrint Arch., 2023)

hinTS: Threshold Signatures with Silent Setup. - Sanjam Garg; Abhishek Jain 002; Pratyay Mukherjee; Rohit Sinha 001; Mingyuan Wang 001; Yinuo Zhang (IACR Cryptol. ePrint Arch., 2023)

Candidate iO from Homomorphic Encryption Schemes. - Zvika Brakerski; Nico Döttling; Sanjam Garg; Giulio Malavolta (J. Cryptol., 2023)

Publicly-Detectable Watermarking for Language Models. - Jaiden Fairoze; Sanjam Garg; Somesh Jha; Saeed Mahloujifar; Mohammad Mahmoody; Mingyuan Wang 001 (IACR Commun. Cryptol., 2024)

Mempool Privacy via Batched Threshold Encryption: Attacks and Defenses. - Arka Rai Choudhuri; Sanjam Garg; Julien Piet; Guru-Vamsi Policharla (IACR Cryptol. ePrint Arch., 2024)

Practical Mempool Privacy via One-time Setup Batched Threshold Encryption. - Arka Rai Choudhuri; Sanjam Garg; Guru-Vamsi Policharla; Mingyuan Wang 001 (IACR Cryptol. ePrint Arch., 2024)

Laconic Branching Programs from the Diffie-Hellman Assumption. - Sanjam Garg; Mohammad Hajiabadi; Peihan Miao 001; Alice Murphy (IACR Cryptol. ePrint Arch., 2024)

Insta-Pok3r: Real-time Poker on Blockchain. - Sanjam Garg; Aniket Kate; Pratyay Mukherjee; Rohit Sinha 001; Sriram Sridhar 004 (IACR Cryptol. ePrint Arch., 2024)

Threshold Encryption with Silent Setup. - Sanjam Garg; Dimitris Kolonelos; Guru-Vamsi Policharla; Mingyuan Wang 001 (IACR Cryptol. ePrint Arch., 2024)

SublonK: Sublinear Prover PlonK. - Arka Rai Choudhuri; Sanjam Garg; Aarushi Goel; Sruthi Sekar; Rohit Sinha 001 (Proc. Priv. Enhancing Technol., 2024)

SoK: Watermarking for AI-Generated Content. - Xuandong Zhao; Sam Gunn; Miranda Christ; Jaiden Fairoze; Andres Fabrega; Nicholas Carlini; Sanjam Garg; Sanghyun Hong 001; Milad Nasr; Florian Tramèr; Somesh Jha; Lei Li 005; et al. (SP, 2025)

Laconic PSI on Authenticated Inputs and Applications. - James Bartusek; Sanjam Garg; Abhishek Jain 002; Guru-Vamsi Policharla (IACR Cryptol. ePrint Arch., 2025)

BEAST-MEV: Batched Threshold Encryption with Silent Setup for MEV prevention. - Jan Bormet; Arka Rai Choudhuri; Sebastian Faust; Sanjam Garg; Hussien Othman; Guru-Vamsi Policharla; Ziyan Qu; Mingyuan Wang 001 (IACR Cryptol. ePrint Arch., 2025)

Collaborative zkSNARKs with Sublinear Prover Time and Constant Proof Size. - Zhiyong Fang; Sanjam Garg; Bhaskar Roberts; Wenxuan Wu; Yupeng Zhang (IACR Cryptol. ePrint Arch., 2025)

Malicious Security in Collaborative zk-SNARKs: More than Meets the Eye. - Sanjam Garg; Aarushi Goel; Abhishek Jain 002; Bhaskar Roberts; Sruthi Sekar (IACR Cryptol. ePrint Arch., 2025)

Jigsaw: Doubly Private Smart Contracts. - Sanjam Garg; Aarushi Goel; Dimitris Kolonelos; Rohit Sinha 001 (IACR Cryptol. ePrint Arch., 2025)

Split Prover Zero-Knowledge SNARKs. - Sanjam Garg; Aarushi Goel; Dimitris Kolonelos; Sina Shiehian; Rohit Sinha 001 (IACR Cryptol. ePrint Arch., 2025)

Black-Box Crypto is Useless for Pseudorandom Codes. - Sanjam Garg; Sam Gunn; Mingyuan Wang 001 (IACR Cryptol. ePrint Arch., 2025)

A Framework for Witness Encryption from Linearly Verifiable SNARKs and Applications. - Sanjam Garg; Mohammad Hajiabadi; Dimitris Kolonelos; Abhiram Kothapalli; Guru-Vamsi Policharla (IACR Cryptol. ePrint Arch., 2025)

Scalable Multiparty Computation from Non-linear Secret Sharing. - Sanjam Garg; Abhishek Jain 002; Pratyay Mukherjee; Mingyuan Wang 001 (IACR Cryptol. ePrint Arch., 2025)