Sanjam Garg

According to our database1, Sanjam Garg authored at least 102 papers between 2007 and 2021.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

On csauthors.net:

Bibliography

2021
Identity-based Encryption from the Diffie-Hellman Assumption.
J. ACM, 2021

Compact Ring Signatures from Learning With Errors.
IACR Cryptol. ePrint Arch., 2021

Reusable Two-Round MPC from LPN.
IACR Cryptol. ePrint Arch., 2021

Laconic Private Set Intersection and Applications.
IACR Cryptol. ePrint Arch., 2021

NeuraCrypt is not private.
CoRR, 2021

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

2020
Black-Box Constructions of Bounded-Concurrent Secure Computation.
IACR Cryptol. ePrint Arch., 2020

Formalizing Data Deletion in the Context of the Right to be Forgotten.
IACR Cryptol. ePrint Arch., 2020

Master-Key KDM-Secure IBE from Pairings.
IACR Cryptol. ePrint Arch., 2020

FHE-Based Bootstrapping of Designated-Prover NIZK.
IACR Cryptol. ePrint Arch., 2020

Factoring and Pairings are not Necessary for iO: Circular-Secure LWE Suffices.
IACR Cryptol. ePrint Arch., 2020

Candidate iO from Homomorphic Encryption Schemes.
IACR Cryptol. ePrint Arch., 2020

Constant Ciphertext-Rate Non-Committing Encryption from Standard Assumptions.
IACR Cryptol. ePrint Arch., 2020

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

Separating Two-Round Secure Computation from Oblivious Transfer.
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

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

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

2019
Efficient Range-Trapdoor Functions and Applications: Rate-1 OT and More.
IACR Cryptol. ePrint Arch., 2019

Tight Verifiable Delay Functions.
IACR Cryptol. ePrint Arch., 2019

Trapdoor Hash Functions and Their Applications.
IACR Cryptol. ePrint Arch., 2019

Two-Round Oblivious Transfer from CDH or LPN.
IACR Cryptol. ePrint Arch., 2019

Rate-1 Trapdoor Functions from the Diffie-Hellman Problem.
IACR Cryptol. ePrint Arch., 2019

Laconic Conditional Disclosure of Secrets and Applications.
IACR Cryptol. ePrint Arch., 2019

Leveraging Linear Decryption: Rate-1 Fully-Homomorphic Encryption and Time-Lock Puzzles.
IACR Cryptol. ePrint Arch., 2019

Ad Hoc Multi-Input Functional Encryption.
IACR Cryptol. ePrint Arch., 2019

The Broadcast Message Complexity of Secure Multiparty Computation.
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.
IACR Cryptol. ePrint Arch., 2018

Adaptively Secure Garbling with Near Optimal Online Complexity.
IACR Cryptol. ePrint Arch., 2018

Adaptive Garbled RAM from Laconic Oblivious Transfer.
IACR Cryptol. ePrint Arch., 2018

Two-Round Multiparty Secure Computation Minimizing Public Key Operations.
IACR Cryptol. ePrint Arch., 2018

A New Approach to Black-Box Concurrent Secure Computation.
IACR Cryptol. ePrint Arch., 2018

Two-Round MPC: Information-Theoretic and Black-Box.
IACR Cryptol. ePrint Arch., 2018

Registration-Based Encryption from Standard Assumptions.
IACR Cryptol. ePrint Arch., 2018

Registration-Based Encryption: Removing Private-Key Generator from IBE.
IACR Cryptol. ePrint Arch., 2018

Limits on the Power of Garbling Techniques for Public-Key Encryption.
IACR Cryptol. ePrint Arch., 2018

Trapdoor Functions from the Computational Diffie-Hellman Assumption.
IACR Cryptol. ePrint Arch., 2018

New Techniques for Efficient Trapdoor Functions and Applications.
IACR Cryptol. ePrint Arch., 2018

2017
Two-Round Multiparty Secure Computation from Minimal Assumptions.
IACR Cryptol. ePrint Arch., 2017

Garbled Protocols and Two-Round MPC from Bilinear Maps.
IACR Cryptol. ePrint Arch., 2017

On the Round Complexity of OT Extension.
IACR Cryptol. ePrint Arch., 2017

When does Functional Encryption Imply Obfuscation?
IACR Cryptol. ePrint Arch., 2017

Lower Bounds on Obfuscation from All-or-Nothing Encryption Primitives.
IACR Cryptol. ePrint Arch., 2017

On the Exact Round Complexity of Self-Composable Two-Party Computation.
IACR Cryptol. ePrint Arch., 2017

New Constructions of Identity-Based and Key-Dependent Message Secure Encryption Schemes.
IACR Cryptol. ePrint Arch., 2017

From Selective IBE to Full IBE and Selective HIBE.
IACR Cryptol. ePrint Arch., 2017

Laconic Oblivious Transfer and its Applications.
IACR Cryptol. ePrint Arch., 2017

Two-Message Witness Indistinguishability and Secure Computation in the Plain Model from New Assumptions.
IACR Cryptol. ePrint Arch., 2017

On the Implausibility of Differing-Inputs Obfuscation and Extractable Witness Encryption with Auxiliary Input.
Algorithmica, 2017

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

Breaking the Sub-Exponential Barrier in Obfustopia.
IACR Cryptol. ePrint Arch., 2016

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

The Exact Round Complexity of Secure Computation.
IACR Cryptol. ePrint Arch., 2016

Secure Obfuscation in a Weak Multilinear Map Model.
IACR Cryptol. ePrint Arch., 2016

Secure Multiparty RAM Computation in Constant Rounds.
IACR Cryptol. ePrint Arch., 2016

Obfuscation from Low Noise Multilinear Maps.
IACR Cryptol. ePrint Arch., 2016

Cryptanalysis of Indistinguishability Obfuscations of Circuits over GGH13.
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

Functional Encryption Without Obfuscation.
Proceedings of the Theory of Cryptography - 13th International Conference, 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

Incremental Program Obfuscation.
IACR Cryptol. ePrint Arch., 2015

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

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

Black-Box Garbled RAM.
Electron. Colloquium Comput. Complex., 2015

2014
Two-Round Adaptively Secure MPC from Indistinguishability Obfuscation.
IACR Cryptol. ePrint Arch., 2014

Garbled RAM From One-Way Functions.
IACR Cryptol. ePrint Arch., 2014

Cryptography with One-Way Communication.
IACR Cryptol. ePrint Arch., 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

Efficient Round Optimal Blind Signatures.
IACR Cryptol. ePrint Arch., 2014

Succinct Randomized Encodings and their Applications.
IACR Cryptol. ePrint Arch., 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

2013
Witness Encryption and its Applications.
IACR Cryptol. ePrint Arch., 2013

Attribute-Based Encryption for Circuits from Multilinear Maps.
IACR Cryptol. ePrint Arch., 2013

Candidate Indistinguishability Obfuscation and Functional Encryption for all circuits.
IACR Cryptol. ePrint Arch., 2013

Two-round secure MPC from Indistinguishability Obfuscation.
IACR Cryptol. ePrint Arch., 2013

Protecting Obfuscation Against Algebraic Attacks.
IACR Cryptol. ePrint Arch., 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

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

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

2012
Adaptively Secure Multi-Party Computation with Dishonest Majority.
IACR Cryptol. ePrint Arch., 2012

Impossibility Results for Static Input Secure Computation.
IACR Cryptol. ePrint Arch., 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

2011
Resettable Statistical Zero Knowledge.
IACR Cryptol. ePrint Arch., 2011

Concurrently Secure Computation in Constant Rounds.
IACR Cryptol. ePrint Arch., 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

2009
Building Efficient Fully Collusion-Resilient Traitor Tracing and Revocation Schemes.
IACR Cryptol. ePrint Arch., 2009

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...