Sanjam Garg

发表

Indistinguishability Obfuscation for RAM Programs and Succinct Randomized Encodings

Nir Bitansky, Ran Canetti, Vinod Vaikuntanathan, 2018, SIAM J. Comput..

Adversarially Robust Learning Could Leverage Computational Hardness

S. Jha, Saeed Mahloujifar, Mohammad Mahmoody, 2019, ALT.

Candidate Indistinguishability Obfuscation and Functional Encryption for All Circuits

S. Halevi, A. Sahai, Mariana Raykova, 2016, SIAM J. Comput..

Cryptographic Program Obfuscation

Sanjam Garg, 2016 .

Candidate Multilinear Maps

Sanjam Garg, 2015 .

Breaking the Sub-Exponential Barrier in Obfustopia

Mark Zhandry, Sanjam Garg, Akshayaram Srinivasan, 2017, EUROCRYPT.

A ug 2 02 1 NeuraCrypt is not private

Florian Tramèr, Nicholas Carlini, S. Jha, 2021 .

Candidate Indistinguishability Obfuscation and Functional Encryption for all Circuits

S. Halevi, A. Sahai, Mariana Raykova, 2013, 2013 IEEE 54th Annual Symposium on Foundations of Computer Science.

Candidate Indistinguishability Obfuscation and Functional Encryption for all Circuits

Brent Waters, Craig Gentry, Amit Sahai, 2013, 2013 IEEE 54th Annual Symposium on Foundations of Computer Science.

Overparameterized (robust) models from computational constraints

S. Jha, Saeed Mahloujifar, Mohammad Mahmoody, 2022, ArXiv.

Overparameterization from Computational Constraints

S. Jha, Saeed Mahloujifar, Mohammad Mahmoody, 2022, NeurIPS.

Cryptography with Weights: MPC, Encryption and Signatures

Abhishek Jain, Sanjam Garg, Yinuo Zhang, 2022, IACR Cryptol. ePrint Arch..

Succinct Zero Knowledge for Floating Point Computations

Abhishek Jain, Sanjam Garg, Yinuo Zhang, 2022, CCS.

Security of Our Constructions

Sanjam Garg, Sanjam Garg, 2015 .

Survey of Applications

Sanjam Garg, Sanjam Garg, 2015 .

Amortizing Rate-1 OT and Applications to PIR and PSI

Sanjam Garg, Melissa Chase, Peihan Miao, 2021, TCC.

The New Encoding Schemes

Sanjam Garg, Sanjam Garg, 2015 .

Separating Two-Round Secure Computation From Oblivious Transfer

Yuval Ishai, Zvika Brakerski, Sanjam Garg, 2020, ITCS.

The Broadcast Message Complexity of Secure Multiparty Computation

Sanjam Garg, Aarushi Goel, Abhishek Jain, 2019, ASIACRYPT.

Two-Round MPC: Information-Theoretic and Black-Box

Yuval Ishai, Sanjam Garg, Akshayaram Srinivasan, 2018, IACR Cryptol. ePrint Arch..

Garbled Protocols and Two-Round MPC from Bilinear Maps

Sanjam Garg, Akshayaram Srinivasan, Sanjam Garg, 2017, 2017 IEEE 58th Annual Symposium on Foundations of Computer Science (FOCS).

The Exact Round Complexity of Secure Computation

Sanjam Garg, Antigoni Polychroniadou, Pratyay Mukherjee, 2016, EUROCRYPT.

Deletion Inference, Reconstruction, and Compliance in Machine (Un)Learning

Prashant Nalini Vasudevan, Ji Gao, Mohammad Mahmoody, 2022, Proc. Priv. Enhancing Technol..

NeuraCrypt is not private pdf

Somesh Jha, Sanjam Garg, Nicholas Carlini, 2021, ArXiv.

Hiding secrets in software

Brent Waters, Craig Gentry, Amit Sahai, 2016, Commun. ACM.

Two-Round Secure MPC from Indistinguishability Obfuscation

Craig Gentry, Shai Halevi, Sanjam Garg, 2014, TCC.

Witness encryption and its applications

Brent Waters, Craig Gentry, Amit Sahai, 2013, STOC '13.

Identity-Based Encryption from the Diffie-Hellman Assumption

Nico Döttling, Sanjam Garg, Sanjam Garg, 2017, CRYPTO.

Resettable Statistical Zero Knowledge

Rafail Ostrovsky, Ivan Visconti, Sanjam Garg, 2012, IACR Cryptol. ePrint Arch..

Why "Fiat-Shamir for Proofs" Lacks a Proof

Nir Bitansky, Sanjam Garg, Daniel Wichs, 2013, TCC.

Two-Round Adaptively Secure MPC from Indistinguishability Obfuscation

Sanjam Garg, Antigoni Polychroniadou, Sanjam Garg, 2015, TCC.

Formalizing Data Deletion in the Context of the Right to Be Forgotten

Sanjam Garg, Shafi Goldwasser, Prashant Nalini Vasudevan, 2020, IACR Cryptol. ePrint Arch..

Tight Verifiable Delay Functions

Nico Döttling, Sanjam Garg, Giulio Malavolta, 2020, IACR Cryptol. ePrint Arch..

Laconic Conditional Disclosure of Secrets and Applications

Nico Döttling, Sanjam Garg, Giulio Malavolta, 2019, 2019 IEEE 60th Annual Symposium on Foundations of Computer Science (FOCS).

Factoring and Pairings are not Necessary for iO: Circular-Secure LWE Suffices

Zvika Brakerski, Nico Döttling, Sanjam Garg, 2020, IACR Cryptol. ePrint Arch..

Is Private Learning Possible with Instance Encoding?

Somesh Jha, Sanjam Garg, Nicholas Carlini, 2021, 2021 IEEE Symposium on Security and Privacy (SP).

Adaptively Secure Garbling with Near Optimal Online Complexity

Sanjam Garg, Akshayaram Srinivasan, Sanjam Garg, 2018, IACR Cryptol. ePrint Arch..

Concurrently Secure Computation in Constant Rounds

Amit Sahai, Sanjam Garg, Vipul Goyal, 2012, EUROCRYPT.

Revisiting the Cryptographic Hardness of Finding a Nash Equilibrium

Sanjam Garg, Akshayaram Srinivasan, Omkant Pandey, 2016, CRYPTO.

TWORAM: Efficient Oblivious RAM in Two Rounds with Applications to Searchable Encryption

Sanjam Garg, Charalampos Papamanthou, Payman Mohassel, 2016, CRYPTO.

Two-Round Multiparty Secure Computation Minimizing Public Key Operations

Sanjam Garg, Peihan Miao, Akshayaram Srinivasan, 2018, IACR Cryptol. ePrint Arch..

Master-Key KDM-Secure IBE from Pairings

Sanjam Garg, Romain Gay, Mohammad Hajiabadi, 2020, Public Key Cryptography.

Rate-1 Trapdoor Functions from the Diffie-Hellman Problem

Nico Döttling, Sanjam Garg, Giulio Malavolta, 2019, IACR Cryptol. ePrint Arch..

Leveraging Linear Decryption: Rate-1 Fully-Homomorphic Encryption and Time-Lock Puzzles

Zvika Brakerski, Nico Döttling, Sanjam Garg, 2019, IACR Cryptol. ePrint Arch..

New Techniques for Efficient Trapdoor Functions and Applications

Sanjam Garg, Romain Gay, Mohammad Hajiabadi, 2019, IACR Cryptol. ePrint Arch..

Two-Message Witness Indistinguishability and Secure Computation in the Plain Model from New Assumptions

Yuval Ishai, Amit Sahai, Sanjam Garg, 2017, ASIACRYPT.

Improved Bounds on Security Reductions for Discrete Log Based Signatures

Raghav Bhaskar, Satyanarayana V. Lokam, Sanjam Garg, 2008, CRYPTO.

Obfuscation from Low Noise Multilinear Maps

Nico Döttling, Sanjam Garg, Peihan Miao, 2018, IACR Cryptol. ePrint Arch..

When Does Functional Encryption Imply Obfuscation?

Sanjam Garg, Mohammad Mahmoody, Ameer Mohammed, 2017, TCC.

Lower Bounds on Obfuscation from All-or-Nothing Encryption Primitives

Sanjam Garg, Mohammad Mahmoody, Ameer Mohammed, 2017, CRYPTO.

Incremental Program Obfuscation

Sanjam Garg, Omkant Pandey, Sanjam Garg, 2017, CRYPTO.

Obfuscation without the Vulnerabilities of Multilinear Maps

Sanjam Garg, Pratyay Mukherjee, Akshayaram Srinivasan, 2016, IACR Cryptol. ePrint Arch..

Cryptanalysis of Indistinguishability Obfuscations of Circuits over GGH13

Nico Döttling, Sanjam Garg, Daniel Apon, 2016, ICALP.

On the Exact Cryptographic Hardness of Finding a Nash Equilibrium

Sanjam Garg, Akshayaram Srinivasan, Omkant Pandey, 2015, IACR Cryptol. ePrint Arch..

Protecting Obfuscation against Algebraic Attacks

Yael Tauman Kalai, Omer Paneth, Amit Sahai, 2014, EUROCRYPT.

Candidate Multilinear Maps from Ideal Lattices

Craig Gentry, Shai Halevi, Sanjam Garg, 2013, EUROCRYPT.

Trapdoor Hash Functions and Their Applications

Rafail Ostrovsky, Yuval Ishai, Nico Döttling, 2019, IACR Cryptol. ePrint Arch..

Registration-Based Encryption from Standard Assumptions

Sanjam Garg, Mohammad Mahmoody, Sruthi Sekar, 2019, IACR Cryptol. ePrint Arch..

Registration-Based Encryption: Removing Private-Key Generator from IBE

Sanjam Garg, Mohammad Mahmoody, Mohammad Hajiabadi, 2018, IACR Cryptol. ePrint Arch..

Trapdoor Functions from the Computational Diffie-Hellman Assumption

Sanjam Garg, Mohammad Hajiabadi, Sanjam Garg, 2018, IACR Cryptol. ePrint Arch..

Two-round Multiparty Secure Computation from Minimal Assumptions

Sanjam Garg, Akshayaram Srinivasan, Sanjam Garg, 2018, IACR Cryptol. ePrint Arch..

New Constructions of Identity-Based and Key-Dependent Message Secure Encryption Schemes

Nico Döttling, Sanjam Garg, Daniel Masny, 2018, Public Key Cryptography.

From Selective IBE to Full IBE and Selective HIBE

Nico Döttling, Sanjam Garg, Sanjam Garg, 2017, TCC.

Laconic Oblivious Transfer and Its Applications

Nico Döttling, Sanjam Garg, Antigoni Polychroniadou, 2017, CRYPTO.

Laconic Private Set Intersection and Applications

Nico Döttling, Sanjam Garg, Sihang Pu, 2021, IACR Cryptol. ePrint Arch..

Candidate iO from Homomorphic Encryption Schemes

Zvika Brakerski, Nico Döttling, Sanjam Garg, 2020, Journal of Cryptology.

Secure Obfuscation in a Weak Multilinear Map Model

Eric Miles, Mark Zhandry, Amit Sahai, 2016, TCC.

Correlation Intractability and SNARGs from Sub-exponential DDH

Abhishek Jain, Sanjam Garg, Jiaheng Zhang, 2022, IACR Cryptol. ePrint Arch..

zkSaaS: Zero-Knowledge SNARKs as a Service

Abhishek Jain, Sanjam Garg, Aarushi Goel, 2023, IACR Cryptol. ePrint Arch..

Efficient Round Optimal Blind Signatures

Sanjam Garg, Divya Gupta, Sanjam Garg, 2014, IACR Cryptol. ePrint Arch..

Functional Encryption Without Obfuscation

Craig Gentry, Mark Zhandry, Shai Halevi, 2016, TCC.

On the Implausibility of Differing-Inputs Obfuscation and Extractable Witness Encryption with Auxiliary Input

Craig Gentry, Shai Halevi, Sanjam Garg, 2014, Algorithmica.

hinTS: Threshold Signatures with Silent Setup

Abhishek Jain, Sanjam Garg, Yinuo Zhang, 2023, IACR Cryptology ePrint Archive.

Threshold Signatures in the Multiverse

L. Baird, Abhishek Jain, Sanjam Garg, 2023, 2023 IEEE Symposium on Security and Privacy (SP).

SublonK: Sublinear Prover PlonK

Sanjam Garg, Rohit Sinha, Aarushi Goel, 2023, IACR Cryptol. ePrint Arch..

Ad Hoc Multi-Input Functional Encryption

Sanjam Garg, Ophir Frieder, Justin Thaler, 2019, IACR Cryptol. ePrint Arch..

An Attack on InstaHide: Is Private Learning Possible with Instance Encoding? pdf

Somesh Jha, Sanjam Garg, Shuang Song, 2020, ArXiv.

Leakage-Resilient Zero Knowledge

Amit Sahai, Sanjam Garg, Abhishek Jain, 2011, CRYPTO.

Compact Ring Signatures from Learning With Errors

Sanjam Garg, Giulio Malavolta, Dakshita Khurana, 2021, IACR Cryptol. ePrint Arch..

Differing-Inputs Obfuscation and Applications

Mark Zhandry, Dan Boneh, Amit Sahai, 2013, IACR Cryptol. ePrint Arch..

Fully Secure Functional Encryption without Obfuscation

Craig Gentry, Mark Zhandry, Shai Halevi, 2014, IACR Cryptol. ePrint Arch..

Fully Secure Attribute Based Encryption from Multilinear Maps

Craig Gentry, Mark Zhandry, Shai Halevi, 2014, IACR Cryptol. ePrint Arch..

TWORAM: Round-Optimal Oblivious RAM with Applications to Searchable Encryption

Sanjam Garg, Charalampos Papamanthou, Payman Mohassel, 2015, IACR Cryptol. ePrint Arch..

Balancing Output Length and Query Bound in Hardness Preserving Constructions of Pseudorandom Functions

Sanjam Garg, Nishanth Chandran, Nishanth Chandran, 2014, INDOCRYPT.

Hardness Preserving Constructions of Pseudorandom Functions, Revisited

Sanjam Garg, Nishanth Chandran, Nishanth Chandran, 2012, IACR Cryptol. ePrint Arch..

How to Build a Trapdoor Function from an Encryption Scheme

R. Ostrovsky, Giulio Malavolta, Sanjam Garg, 2021, Lecture Notes in Computer Science.

Two-Round Oblivious Transfer from CDH or LPN

Nico Döttling, Sanjam Garg, Daniel Wichs, 2020, IACR Cryptol. ePrint Arch..

A Simple Construction of iO for Turing Machines

Sanjam Garg, Akshayaram Srinivasan, Sanjam Garg, 2018, IACR Cryptol. ePrint Arch..

Experimenting with Zero-Knowledge Proofs of Training

Saeed Mahloujifar, Mohammad Mahmoody, Sanjam Garg, 2023, IACR Cryptol. ePrint Arch..

Candidate Multilinear Maps from Ideal Lattices and Applications

Craig Gentry, Shai Halevi, Sanjam Garg, 2012, IACR Cryptol. ePrint Arch..

Succinct Randomized Encodings and their Applications

Nir Bitansky, Sanjam Garg, Sidharth Telang, 2015, IACR Cryptol. ePrint Arch..

On the Round Complexity of OT Extension

Sanjam Garg, Mohammad Mahmoody, Daniel Masny, 2018, IACR Cryptol. ePrint Arch..

IBE with Incompressible Master Secret and Small Identity Secrets

Sanjam Garg, Nico Döttling, Mingyuan Wang, 2022, IACR Cryptology ePrint Archive.

Reusable Two-Round MPC from LPN

Sanjam Garg, Akshayaram Srinivasan, James Bartusek, 2021, IACR Cryptol. ePrint Arch..

Adaptive Garbled RAM from Laconic Oblivious Transfer

Rafail Ostrovsky, Sanjam Garg, Akshayaram Srinivasan, 2018, IACR Cryptol. ePrint Arch..

Reusable Two-Round MPC from DDH

Sanjam Garg, Saikrishna Badrinarayanan, Daniel Masny, 2020, IACR Cryptol. ePrint Arch..

Building efficient fully collusion-resilient traitor tracing and revocation schemes

Brent Waters, Amit Sahai, Sanjam Garg, 2010, CCS '10.

Adaptively Secure Multi-Party Computation with Dishonest Majority

Amit Sahai, Sanjam Garg, A. Sahai, 2012, CRYPTO.

On the Worst-Case Inefficiency of CGKA

Sanjam Garg, Paul Rösler, Mohammad Hajiabadi, 2022, IACR Cryptol. ePrint Arch..

Unifying Security Notions of Functional Encryption

Sanjam Garg, Akshayaram Srinivasan, Sanjam Garg, 2016, IACR Cryptol. ePrint Arch..

Blind Delegation with Certified Deletion

Sanjam Garg, Dakshita Khurana, James Bartusek, 2022 .

Improved Bounds on Security Reductions for Discrete Log Based Signatures

Satyanarayana V. Lokam, Sanjam Garg, Raghav Bhaskar, 2008, Annual International Cryptology Conference.

Why "Fiat-Shamir for Proofs" Lacks a Proof

Daniel Wichs, Nir Bitansky, Sanjam Garg, 2012, IACR Cryptol. ePrint Arch..