Name
Affiliation
Papers
SANJAM GARG
UCLA
87
Collaborators
Citations 
PageRank 
106
1710
69.92
Referers 
Referees 
References 
1332
725
1707
Search Limit
1001000
Title
Citations
PageRank
Year
IBE with Incompressible Master Secret and Small Identity Secrets.00.342022
Deletion inference, reconstruction, and compliance in machine (un)learning.00.342022
On the Worst-Case Inefficiency of CGKA.00.342022
A More Complete Analysis of the Signal Double Ratchet Algorithm.00.342022
Succinct Zero Knowledge for Floating Point Computations00.342022
Amortizing Rate-1 OT and Applications to PIR and PSI.00.342021
Laconic Private Set Intersection and Applications00.342021
Identity-based Encryption from the Diffie-Hellman Assumption00.342021
Amortizing Rate-1 OT and Applications to PIR and PSI00.342021
Tight Verifiable Delay Functions.00.342020
Black-Box Constructions of Bounded-Concurrent Secure Computation.00.342020
Reusable Two-Round MPC from DDH.00.342020
Separating Two-Round Secure Computation From Oblivious Transfer.00.342020
Adversarially Robust Learning Could Leverage Computational Hardness.00.342020
Efficient Range-Trapdoor Functions and Applications: Rate-1 OT and More.00.342019
Ad Hoc Multi-Input Functional Encryption.00.342019
Laconic Conditional Disclosure of Secrets and Applications00.342019
Trapdoor Hash Functions and Their Applications.00.342019
Leveraging Linear Decryption: Rate-1 Fully-Homomorphic Encryption and Time-Lock Puzzles.10.362019
Two-Round Multiparty Secure Computation from Minimal Assumptions.110.442018
New Techniques for Efficient Trapdoor Functions and Applications.00.342018
Obfuscation from Low Noise Multilinear Maps.00.342018
On the Round Complexity of OT Extension.10.342018
Two-Round Multiparty Secure Computation Minimizing Public Key Operations.00.342018
Registration-Based Encryption from Standard Assumptions.00.342018
Indistinguishability Obfuscation for RAM Programs and Succinct Randomized Encodings.20.372018
Adaptively Secure Garbling with Near Optimal Online Complexity.30.372018
Trapdoor Functions from the Computational Diffie-Hellman Assumption.00.342018
Adaptive Garbled RAM from Laconic Oblivious Transfer.00.342018
Limits on the Power of Garbling Techniques for Public-Key Encryption.00.342018
A New Approach to Black-Box Concurrent Secure Computation.10.352018
A Simple Construction Of Io For Turing Machines20.352018
Incremental Program Obfuscation.20.372017
Identity-Based Encryption from the Diffie-Hellman Assumption.180.552017
Two-Message Witness Indistinguishability and Secure Computation in the Plain Model from New Assumptions.10.352017
From Selective IBE to Full IBE and Selective HIBE.50.412017
On the Exact Round Complexity of Self-Composable Two-Party Computation.20.362017
When Does Functional Encryption Imply Obfuscation?40.372017
Garbled Protocols and Two-Round MPC from Bilinear Maps70.402017
Cryptanalysis of Indistinguishability Obfuscations of Circuits over GGH13.80.422017
Breaking the Sub-Exponential Barrier in Obfustopia.180.542017
Laconic Oblivious Transfer and its Applications.90.442017
Lower Bounds on Obfuscation from All-or-Nothing Encryption Primitives.50.382017
Hiding secrets in software: a cryptographic approach to program obfuscation.10.362016
Obfuscation without the Vulnerabilities of Multilinear Maps.00.342016
The Exact Round Complexity of Secure Computation.230.642016
Functional Encryption Without Obfuscation.330.802016
Secure Obfuscation in a Weak Multilinear Map Model.280.682016
TWORAM: Efficient Oblivious RAM in Two Rounds with Applications to Searchable Encryption.130.552016
Unifying Security Notions of Functional Encryption.30.382016
  • 1
  • 2