Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSanjam Garg
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2023
[i94]Leemon Baird, Sanjam Garg, Abhishek Jain, Pratyay Mukherjee, Rohit Sinha, Mingyuan Wang, Yinuo Zhang:
Threshold Signatures in the Multiverse. IACR Cryptol. ePrint Arch. 2023: 63 (2023)- [i93]James Bartusek, Sanjam Garg, Vipul Goyal, Dakshita Khurana, Giulio Malavolta, Justin Raizes, Bhaskar Roberts:
Obfuscation and Outsourced Computation with Certified Deletion. IACR Cryptol. ePrint Arch. 2023: 265 (2023) - 2022
- [j7]Sanjam Garg
, Akshayaram Srinivasan:
Two-round Multiparty Secure Computation from Minimal Assumptions. J. ACM 69(5): 36:1-36:30 (2022) - [j6]Ji Gao, Sanjam Garg, Mohammad Mahmoody, Prashant Nalini Vasudevan:
Deletion inference, reconstruction, and compliance in machine (un)learning. Proc. Priv. Enhancing Technol. 2022(3): 415-436 (2022) - [c92]Sanjam Garg, Abhishek Jain, Zhengzhong Jin, Yinuo Zhang:
Succinct Zero Knowledge for Floating Point Computations. CCS 2022: 1203-1216 - [c91]Alexander Bienstock, Jaiden Fairoze, Sanjam Garg, Pratyay Mukherjee, Srinivasan Raghuraman:
A More Complete Analysis of the Signal Double Ratchet Algorithm. CRYPTO (1) 2022: 784-813 - [c90]Zvika Brakerski, Nico Döttling, Sanjam Garg, Giulio Malavolta:
Factoring and Pairings Are Not Necessary for IO: Circular-Secure LWE Suffices. ICALP 2022: 28:1-28:20 - [c89]James Bartusek, Sanjam Garg, Akshayaram Srinivasan, Yinuo Zhang:
Reusable Two-Round MPC from LPN. Public Key Cryptography (1) 2022: 165-193 - [c88]Alexander Bienstock, Yevgeniy Dodis, Sanjam Garg, Garrison Grogan, Mohammad Hajiabadi, Paul Rösler:
On the Worst-Case Inefficiency of CGKA. TCC (2) 2022: 213-243 - [c87]Nico Döttling, Sanjam Garg, Sruthi Sekar, Mingyuan Wang:
IBE with Incompressible Master Secret and Small Identity Secrets. TCC (1) 2022: 588-617 - [i92]Ji Gao, Sanjam Garg, Mohammad Mahmoody, Prashant Nalini Vasudevan:
Deletion Inference, Reconstruction, and Compliance in Machine (Un)Learning. CoRR abs/2202.03460 (2022) - [i91]Sanjam Garg, Somesh Jha, Saeed Mahloujifar, Mohammad Mahmoody, Mingyuan Wang:
Overparameterized (robust) models from computational constraints. CoRR abs/2208.12926 (2022) - [i90]Alexander Bienstock, Jaiden Fairoze, Sanjam Garg, Pratyay Mukherjee, Srinivasan Raghuraman:
A More Complete Analysis of the Signal Double Ratchet Algorithm. IACR Cryptol. ePrint Arch. 2022: 355 (2022) - [i89]Nico Döttling, Sanjam Garg, Sruthi Sekar, Mingyuan Wang:
IBE with Incompressible Master Secret and Small Identity Secrets. IACR Cryptol. ePrint Arch. 2022: 649 (2022) - [i88]Alexander Bienstock, Yevgeniy Dodis, Sanjam Garg, Garrison Grogan, Mohammad Hajiabadi, Paul Rösler:
On the Worst-Case Inefficiency of CGKA. IACR Cryptol. ePrint Arch. 2022: 1237 (2022) - [i87]Arka Rai Choudhuri, Sanjam Garg, Abhishek Jain, Zhengzhong Jin, Jiaheng Zhang:
Correlation Intractability and SNARGs from Sub-exponential DDH. IACR Cryptol. ePrint Arch. 2022: 1486 (2022) - [i86]Sanjam Garg, Abhishek Jain, Pratyay Mukherjee, Rohit Sinha, Mingyuan Wang, Yinuo Zhang:
Cryptography with Weights: MPC, Encryption and Signatures. IACR Cryptol. ePrint Arch. 2022: 1632 (2022) - [i85]James Bartusek, Sanjam Garg, Abhishek Jain, Guru-Vamsi Policharla:
End-to-End Secure Messaging with Traceability Only for Illegal Content. IACR Cryptol. ePrint Arch. 2022: 1643 (2022) - 2021
- [j5]Nico Döttling, Sanjam Garg:
Identity-based Encryption from the Diffie-Hellman Assumption. J. ACM 68(3): 14:1-14:46 (2021) - [c86]Sanjam Garg, Mohammad Hajiabadi, Giulio Malavolta, Rafail Ostrovsky:
How to Build a Trapdoor Function from an Encryption Scheme. ASIACRYPT (3) 2021: 220-249 - [c85]Rohit Chatterjee, Sanjam Garg, Mohammad Hajiabadi, Dakshita Khurana, Xiao Liang, Giulio Malavolta, Omkant Pandey, Sina Shiehian:
Compact Ring Signatures from Learning with Errors. CRYPTO (1) 2021: 282-312 - [c84]Samuel Deng, Sanjam Garg, Somesh Jha, Saeed Mahloujifar, Mohammad Mahmoody, Abhradeep Guha Thakurta:
A Separation Result Between Data-oblivious and Data-aware Poisoning Attacks. NeurIPS 2021: 10862-10875 - [c83]Nicholas Carlini, Samuel Deng, Sanjam Garg, Somesh Jha, Saeed Mahloujifar, Mohammad Mahmoody, Abhradeep Thakurta, Florian Tramèr:
Is Private Learning Possible with Instance Encoding? IEEE Symposium on Security and Privacy 2021: 410-427 - [c82]Navid Alamati, Pedro Branco, Nico Döttling, Sanjam Garg, Mohammad Hajiabadi, Sihang Pu:
Laconic Private Set Intersection and Applications. TCC (3) 2021: 94-125 - [c81]Melissa Chase, Sanjam Garg, Mohammad Hajiabadi, Jialin Li, Peihan Miao:
Amortizing Rate-1 OT and Applications to PIR and PSI. TCC (3) 2021: 126-156 - [i84]Nicholas Carlini, Sanjam Garg, Somesh Jha, Saeed Mahloujifar, Mohammad Mahmoody, Florian Tramèr:
NeuraCrypt is not private. CoRR abs/2108.07256 (2021) - [i83]James Bartusek, Sanjam Garg, Akshayaram Srinivasan, Yinuo Zhang:
Reusable Two-Round MPC from LPN. IACR Cryptol. ePrint Arch. 2021: 316 (2021) - [i82]Navid Alamati, Pedro Branco, Nico Döttling, Sanjam Garg, Mohammad Hajiabadi, Sihang Pu:
Laconic Private Set Intersection and Applications. IACR Cryptol. ePrint Arch. 2021: 728 (2021) - [i81]Rohit Chatterjee, Sanjam Garg, Mohammad Hajiabadi, Dakshita Khurana, Xiao Liang, Giulio Malavolta, Omkant Pandey, Sina Shiehian:
Compact Ring Signatures from Learning With Errors. IACR Cryptol. ePrint Arch. 2021: 942 (2021) - [i80]Melissa Chase, Sanjam Garg, Mohammad Hajiabadi, Jialin Li, Peihan Miao:
Amortizing Rate-1 OT and Applications to PIR and PSI. IACR Cryptol. ePrint Arch. 2021: 1525 (2021) - 2020
- [c80]Sanjam Garg, Somesh Jha, Saeed Mahloujifar, Mohammad Mahmoody:
Adversarially Robust Learning Could Leverage Computational Hardness. ALT 2020: 364-385 - [c79]Zvika Brakerski, Nico Döttling, Sanjam Garg, Giulio Malavolta:
Candidate iO from Homomorphic Encryption Schemes. EUROCRYPT (1) 2020: 79-109 - [c78]Sanjam Garg, Shafi Goldwasser, Prashant Nalini Vasudevan:
Formalizing Data Deletion in the Context of the Right to Be Forgotten. EUROCRYPT (2) 2020: 373-402 - [c77]Nico Döttling, Sanjam Garg, Mohammad Hajiabadi, Daniel Masny, Daniel Wichs:
Two-Round Oblivious Transfer from CDH or LPN. EUROCRYPT (2) 2020: 768-797 - [c76]Shweta Agrawal, Michael Clear, Ophir Frieder, Sanjam Garg, Adam O'Neill, Justin Thaler:
Ad Hoc Multi-Input Functional Encryption. ITCS 2020: 40:1-40:41 - [c75]Benny Applebaum, Zvika Brakerski, Sanjam Garg, Yuval Ishai, Akshayaram Srinivasan:
Separating Two-Round Secure Computation From Oblivious Transfer. ITCS 2020: 71:1-71:18 - [c74]Sanjam Garg, Romain Gay, Mohammad Hajiabadi:
Master-Key KDM-Secure IBE from Pairings. Public Key Cryptography (1) 2020: 123-152 - [c73]Nico Döttling, Sanjam Garg, Giulio Malavolta, Prashant Nalini Vasudevan:
Tight Verifiable Delay Functions. SCN 2020: 65-84 - [c72]Sanjam Garg, Xiao Liang, Omkant Pandey, Ivan Visconti:
Black-Box Constructions of Bounded-Concurrent Secure Computation. SCN 2020: 87-107 - [c71]Zvika Brakerski, Pedro Branco, Nico Döttling, Sanjam Garg, Giulio Malavolta:
Constant Ciphertext-Rate Non-committing Encryption from Standard Assumptions. TCC (1) 2020: 58-87 - [c70]Sanjam Garg, Mohammad Hajiabadi, Rafail Ostrovsky:
Efficient Range-Trapdoor Functions and Applications: Rate-1 OT and More. TCC (1) 2020: 88-116 - [c69]James Bartusek, Sanjam Garg, Daniel Masny, Pratyay Mukherjee:
Reusable Two-Round MPC from DDH. TCC (2) 2020: 320-348 - [c68]Zvika Brakerski, Sanjam Garg, Rotem Tsabary:
FHE-Based Bootstrapping of Designated-Prover NIZK. TCC (1) 2020: 657-683 - [i79]Sanjam Garg, Shafi Goldwasser, Prashant Nalini Vasudevan:
Formalizing Data Deletion in the Context of the Right to be Forgotten. CoRR abs/2002.10635 (2020) - [i78]Sanjam Garg, Somesh Jha, Saeed Mahloujifar, Mohammad Mahmoody, Abhradeep Thakurta:
Obliviousness Makes Poisoning Adversaries Weaker. CoRR abs/2003.12020 (2020) - [i77]Nicholas Carlini, Samuel Deng, Sanjam Garg, Somesh Jha, Saeed Mahloujifar, Mohammad Mahmoody, Shuang Song, Abhradeep Thakurta, Florian Tramèr:
An Attack on InstaHide: Is Private Learning Possible with Instance Encoding? CoRR abs/2011.05315 (2020) - [i76]Benny Applebaum, Zvika Brakerski, Sanjam Garg, Yuval Ishai, Akshayaram Srinivasan:
Separating Two-Round Secure Computation from Oblivious Transfer. IACR Cryptol. ePrint Arch. 2020: 116 (2020) - [i75]Saikrishna Badrinarayanan, James Bartusek, Sanjam Garg, Daniel Masny, Pratyay Mukherjee:
Reusable Two-Round MPC from DDH. IACR Cryptol. ePrint Arch. 2020: 170 (2020) - [i74]Sanjam Garg, Xiao Liang, Omkant Pandey, Ivan Visconti:
Black-Box Constructions of Bounded-Concurrent Secure Computation. IACR Cryptol. ePrint Arch. 2020: 216 (2020) - [i73]Sanjam Garg, Shafi Goldwasser, Prashant Nalini Vasudevan:
Formalizing Data Deletion in the Context of the Right to be Forgotten. IACR Cryptol. ePrint Arch. 2020: 254 (2020) - [i72]Zvika Brakerski, Nico Döttling, Sanjam Garg, Giulio Malavolta:
Candidate iO from Homomorphic Encryption Schemes. IACR Cryptol. ePrint Arch. 2020: 394 (2020) - [i71]Sanjam Garg, Romain Gay, Mohammad Hajiabadi:
Master-Key KDM-Secure IBE from Pairings. IACR Cryptol. ePrint Arch. 2020: 616 (2020) - [i70]Zvika Brakerski, Nico Döttling, Sanjam Garg, Giulio Malavolta:
Factoring and Pairings are not Necessary for iO: Circular-Secure LWE Suffices. IACR Cryptol. ePrint Arch. 2020: 1024 (2020) - [i69]Zvika Brakerski, Sanjam Garg, Rotem Tsabary:
FHE-Based Bootstrapping of Designated-Prover NIZK. IACR Cryptol. ePrint Arch. 2020: 1168 (2020) - [i68]Zvika Brakerski, Pedro Branco, Nico Döttling, Sanjam Garg, Giulio Malavolta:
Constant Ciphertext-Rate Non-Committing Encryption from Standard Assumptions. IACR Cryptol. ePrint Arch. 2020: 1186 (2020)
2010 – 2019
- 2019
- [c67]Sanjam Garg, Aarushi Goel, Abhishek Jain:
The Broadcast Message Complexity of Secure Multiparty Computation. ASIACRYPT (1) 2019: 426-455 - [c66]Nico Döttling, Sanjam Garg, Mohammad Hajiabadi, Kevin Liu, Giulio Malavolta:
Rate-1 Trapdoor Functions from the Diffie-Hellman Problem. ASIACRYPT (3) 2019: 585-606 - [c65]Nico Döttling, Sanjam Garg, Yuval Ishai, Giulio Malavolta, Tamer Mour, Rafail Ostrovsky:
Trapdoor Hash Functions and Their Applications. CRYPTO (3) 2019: 3-32 - [c64]Sanjam Garg, Romain Gay, Mohammad Hajiabadi:
New Techniques for Efficient Trapdoor Functions and Applications. EUROCRYPT (3) 2019: 33-63 - [c63]Nico Döttling, Sanjam Garg, Vipul Goyal, Giulio Malavolta:
Laconic Conditional Disclosure of Secrets and Applications. FOCS 2019: 661-685 - [c62]Sanjam Garg, Mohammad Hajiabadi, Mohammad Mahmoody, Ahmadreza Rahimi, Sruthi Sekar:
Registration-Based Encryption from Standard Assumptions. Public Key Cryptography (2) 2019: 63-93 - [c61]Zvika Brakerski, Nico Döttling, Sanjam Garg, Giulio Malavolta:
Leveraging Linear Decryption: Rate-1 Fully-Homomorphic Encryption and Time-Lock Puzzles. TCC (2) 2019: 407-437 - [i67]Sanjam Garg, Somesh Jha, Saeed Mahloujifar, Mohammad Mahmoody:
Adversarially Robust Learning Could Leverage Computational Hardness. CoRR abs/1905.11564 (2019) - [i66]Shweta Agrawal, Michael Clear, Ophir Frieder, Sanjam Garg, Adam O'Neill, Justin Thaler:
Ad Hoc Multi-Input Functional Encryption. IACR Cryptol. ePrint Arch. 2019: 356 (2019) - [i65]Nico Döttling, Sanjam Garg, Mohammad Hajiabadi, Daniel Masny, Daniel Wichs:
Two-Round Oblivious Transfer from CDH or LPN. IACR Cryptol. ePrint Arch. 2019: 414 (2019) - [i64]Nico Döttling, Sanjam Garg, Yuval Ishai, Giulio Malavolta, Tamer Mour, Rafail Ostrovsky:
Trapdoor Hash Functions and Their Applications. IACR Cryptol. ePrint Arch. 2019: 639 (2019) - [i63]Nico Döttling, Sanjam Garg, Giulio Malavolta, Prashant Nalini Vasudevan:
Tight Verifiable Delay Functions. IACR Cryptol. ePrint Arch. 2019: 659 (2019) - [i62]Zvika Brakerski, Nico Döttling, Sanjam Garg, Giulio Malavolta:
Leveraging Linear Decryption: Rate-1 Fully-Homomorphic Encryption and Time-Lock Puzzles. IACR Cryptol. ePrint Arch. 2019: 720 (2019) - [i61]Sanjam Garg, Mohammad Hajiabadi, Rafail Ostrovsky:
Efficient Range-Trapdoor Functions and Applications: Rate-1 OT and More. IACR Cryptol. ePrint Arch. 2019: 990 (2019) - [i60]Nico Döttling, Sanjam Garg, Mohammad Hajiabadi, Kevin Liu, Giulio Malavolta:
Rate-1 Trapdoor Functions from the Diffie-Hellman Problem. IACR Cryptol. ePrint Arch. 2019: 1072 (2019) - [i59]Nico Döttling, Sanjam Garg, Vipul Goyal, Giulio Malavolta:
Laconic Conditional Disclosure of Secrets and Applications. IACR Cryptol. ePrint Arch. 2019: 1353 (2019) - 2018
- [j4]Nir Bitansky, Ran Canetti, Sanjam Garg, Justin Holmgren, Abhishek Jain, Huijia Lin, Rafael Pass, Sidharth Telang, Vinod Vaikuntanathan:
Indistinguishability Obfuscation for RAM Programs and Succinct Randomized Encodings. SIAM J. Comput. 47(3): 1123-1210 (2018) - [c60]Sanjam Garg, Peihan Miao, Akshayaram Srinivasan:
Two-Round Multiparty Secure Computation Minimizing Public Key Operations. CRYPTO (3) 2018: 273-301 - [c59]Sanjam Garg, Mohammad Hajiabadi, Mohammad Mahmoody, Ameer Mohammed:
Limits on the Power of Garbling Techniques for Public-Key Encryption. CRYPTO (3) 2018: 335-364 - [c58]Sanjam Garg, Mohammad Hajiabadi:
Trapdoor Functions from the Computational Diffie-Hellman Assumption. CRYPTO (2) 2018: 362-391 - [c57]Sanjam Garg, Rafail Ostrovsky, Akshayaram Srinivasan:
Adaptive Garbled RAM from Laconic Oblivious Transfer. CRYPTO (3) 2018: 515-544 - [c56]Sanjam Garg, Mohammad Mahmoody, Daniel Masny, Izaak Meckler:
On the Round Complexity of OT Extension. CRYPTO (3) 2018: 545-574 - [c55]Sanjam Garg, Akshayaram Srinivasan:
Two-Round Multiparty Secure Computation from Minimal Assumptions. EUROCRYPT (2) 2018: 468-499 - [c54]Sanjam Garg, Akshayaram Srinivasan:
Adaptively Secure Garbling with Near Optimal Online Complexity. EUROCRYPT (2) 2018: 535-565 - [c53]Sanjam Garg, Susumu Kiyoshima, Omkant Pandey:
A New Approach to Black-Box Concurrent Secure Computation. EUROCRYPT (2) 2018: 566-599 - [c52]Nico Döttling, Sanjam Garg, Divya Gupta, Peihan Miao, Pratyay Mukherjee:
Obfuscation from Low Noise Multilinear Maps. INDOCRYPT 2018: 329-352 - [c51]Nico Döttling, Sanjam Garg, Mohammad Hajiabadi, Daniel Masny:
New Constructions of Identity-Based and Key-Dependent Message Secure Encryption Schemes. Public Key Cryptography (1) 2018: 3-31 - [c50]Sanjam Garg, Yuval Ishai, Akshayaram Srinivasan:
Two-Round MPC: Information-Theoretic and Black-Box. TCC (1) 2018: 123-151 - [c49]Sanjam Garg, Akshayaram Srinivasan:
A Simple Construction of iO for Turing Machines. TCC (2) 2018: 425-454 - [c48]Sanjam Garg, Mohammad Hajiabadi, Mohammad Mahmoody, Ahmadreza Rahimi:
Registration-Based Encryption: Removing Private-Key Generator from IBE. TCC (1) 2018: 689-718 - [i58]Sanjam Garg, Akshayaram Srinivasan:
Adaptively Secure Garbling with Near Optimal Online Complexity. IACR Cryptol. ePrint Arch. 2018: 151 (2018) - [i57]Sanjam Garg, Susumu Kiyoshima, Omkant Pandey:
A New Approach to Black-Box Concurrent Secure Computation. IACR Cryptol. ePrint Arch. 2018: 156 (2018) - [i56]Sanjam Garg, Peihan Miao, Akshayaram Srinivasan:
Two-Round Multiparty Secure Computation Minimizing Public Key Operations. IACR Cryptol. ePrint Arch. 2018: 180 (2018) - [i55]Sanjam Garg, Mohammad Hajiabadi:
Trapdoor Functions from the Computational Diffie-Hellman Assumption. IACR Cryptol. ePrint Arch. 2018: 529 (2018) - [i54]Sanjam Garg, Rafail Ostrovsky, Akshayaram Srinivasan:
Adaptive Garbled RAM from Laconic Oblivious Transfer. IACR Cryptol. ePrint Arch. 2018: 549 (2018) - [i53]Sanjam Garg, Mohammad Hajiabadi, Mohammad Mahmoody, Ameer Mohammed:
Limits on the Power of Garbling Techniques for Public-Key Encryption. IACR Cryptol. ePrint Arch. 2018: 555 (2018) - [i52]Sanjam Garg, Akshayaram Srinivasan:
A Simple Construction of iO for Turing Machines. IACR Cryptol. ePrint Arch. 2018: 771 (2018) - [i51]Sanjam Garg, Romain Gay, Mohammad Hajiabadi:
New Techniques for Efficient Trapdoor Functions and Applications. IACR Cryptol. ePrint Arch. 2018: 872 (2018) - [i50]Sanjam Garg, Yuval Ishai, Akshayaram Srinivasan:
Two-Round MPC: Information-Theoretic and Black-Box. IACR Cryptol. ePrint Arch. 2018: 909 (2018) - [i49]Sanjam Garg, Mohammad Hajiabadi, Mohammad Mahmoody, Ahmadreza Rahimi:
Registration-Based Encryption: Removing Private-Key Generator from IBE. IACR Cryptol. ePrint Arch. 2018: 919 (2018) - [i48]Sanjam Garg, Mohammad Hajiabadi, Mohammad Mahmoody, Ahmadreza Rahimi, Sruthi Sekar:
Registration-Based Encryption from Standard Assumptions. IACR Cryptol. ePrint Arch. 2018: 1030 (2018) - 2017
- [j3]Sanjam Garg, Craig Gentry, Shai Halevi, Daniel Wichs:
On the Implausibility of Differing-Inputs Obfuscation and Extractable Witness Encryption with Auxiliary Input. Algorithmica 79(4): 1353-1373 (2017) - [c47]Saikrishna Badrinarayanan, Sanjam Garg, Yuval Ishai, Amit Sahai, Akshay Wadia:
Two-Message Witness Indistinguishability and Secure Computation in the Plain Model from New Assumptions. ASIACRYPT (3) 2017: 275-303 - [c46]Chongwon Cho, Nico Döttling, Sanjam Garg, Divya Gupta, Peihan Miao, Antigoni Polychroniadou:
Laconic Oblivious Transfer and Its Applications. CRYPTO (2) 2017: 33-65 - [c45]Sanjam Garg, Omkant Pandey:
Incremental Program Obfuscation. CRYPTO (2) 2017: 193-223 - [c44]Nico Döttling, Sanjam Garg:
Identity-Based Encryption from the Diffie-Hellman Assumption. CRYPTO (1) 2017: 537-569 - [c43]Sanjam Garg, Mohammad Mahmoody, Ameer Mohammed:
Lower Bounds on Obfuscation from All-or-Nothing Encryption Primitives. CRYPTO (1) 2017: 661-695 - [c42]Sanjam Garg, Omkant Pandey, Akshayaram Srinivasan, Mark Zhandry:
Breaking the Sub-Exponential Barrier in Obfustopia. EUROCRYPT (3) 2017: 156-181 - [c41]Sanjam Garg, Susumu Kiyoshima, Omkant Pandey:
On the Exact Round Complexity of Self-composable Two-Party Computation. EUROCRYPT (2) 2017: 194-224 - [c40]Sanjam Garg, Akshayaram Srinivasan:
Garbled Protocols and Two-Round MPC from Bilinear Maps. FOCS 2017: 588-599 - [c39]Daniel Apon, Nico Döttling, Sanjam Garg, Pratyay Mukherjee:
Cryptanalysis of Indistinguishability Obfuscations of Circuits over GGH13. ICALP 2017: 38:1-38:16 - [c38]Sanjam Garg, Mohammad Mahmoody, Ameer Mohammed:
When Does Functional Encryption Imply Obfuscation? TCC (1) 2017: 82-115 - [c37]Nico Döttling, Sanjam Garg:
From Selective IBE to Full IBE and Selective HIBE. TCC (1) 2017: 372-408 - [i47]Sanjam Garg, Susumu Kiyoshima, Omkant Pandey:
On the Exact Round Complexity of Self-Composable Two-Party Computation. IACR Cryptol. ePrint Arch. 2017: 124 (2017) - [i46]Saikrishna Badrinarayanan, Sanjam Garg, Yuval Ishai, Amit Sahai, Akshay Wadia:
Two-Message Witness Indistinguishability and Secure Computation in the Plain Model from New Assumptions. IACR Cryptol. ePrint Arch. 2017: 433 (2017) - [i45]Chongwon Cho, Nico Döttling, Sanjam Garg, Divya Gupta, Peihan Miao, Antigoni Polychroniadou:
Laconic Oblivious Transfer and its Applications. IACR Cryptol. ePrint Arch. 2017: 491 (2017) - [i44]Sanjam Garg, Mohammad Mahmoody, Ameer Mohammed:
Lower Bounds on Obfuscation from All-or-Nothing Encryption Primitives. IACR Cryptol. ePrint Arch. 2017: 541 (2017) - [i43]Nico Döttling, Sanjam Garg:
Identity-Based Encryption from the Diffie-Hellman Assumption. IACR Cryptol. ePrint Arch. 2017: 543 (2017) - [i42]Sanjam Garg, Mohammad Mahmoody, Ameer Mohammed:
When does Functional Encryption Imply Obfuscation? IACR Cryptol. ePrint Arch. 2017: 943 (2017) - [i41]Nico Döttling, Sanjam Garg:
From Selective IBE to Full IBE and Selective HIBE. IACR Cryptol. ePrint Arch. 2017: 957 (2017) - [i40]Nico Döttling, Sanjam Garg, Mohammad Hajiabadi, Daniel Masny:
New Constructions of Identity-Based and Key-Dependent Message Secure Encryption Schemes. IACR Cryptol. ePrint Arch. 2017: 978 (2017) - [i39]Sanjam Garg, Akshayaram Srinivasan:
Garbled Protocols and Two-Round MPC from Bilinear Maps. IACR Cryptol. ePrint Arch. 2017: 1004 (2017) - [i38]Sanjam Garg, Akshayaram Srinivasan:
Two-Round Multiparty Secure Computation from Minimal Assumptions. IACR Cryptol. ePrint Arch. 2017: 1156 (2017) - [i37]Sanjam Garg, Mohammad Mahmoody, Daniel Masny, Izaak Meckler:
On the Round Complexity of OT Extension. IACR Cryptol. ePrint Arch. 2017: 1187 (2017) - 2016
- [j2]Sanjam Garg, Craig Gentry, Shai Halevi, Mariana Raykova, Amit Sahai, Brent Waters:
Hiding secrets in software: a cryptographic approach to program obfuscation. Commun. ACM 59(5): 113-120 (2016) - [j1]Sanjam Garg, Craig Gentry, Shai Halevi, Mariana Raykova, Amit Sahai, Brent Waters:
Candidate Indistinguishability Obfuscation and Functional Encryption for All Circuits. SIAM J. Comput. 45(3): 882-929 (2016) - [c36]Sanjam Garg, Payman Mohassel, Charalampos Papamanthou:
TWORAM: Efficient Oblivious RAM in Two Rounds with Applications to Searchable Encryption. CRYPTO (3) 2016: 563-592 - [c35]Sanjam Garg, Omkant Pandey, Akshayaram Srinivasan:
Revisiting the Cryptographic Hardness of Finding a Nash Equilibrium. CRYPTO (2) 2016: 579-604 - [c34]Sanjam Garg, Pratyay Mukherjee, Omkant Pandey, Antigoni Polychroniadou:
The Exact Round Complexity of Secure Computation. EUROCRYPT (2) 2016: 448-476 - [c33]Sanjam Garg, Eric Miles, Pratyay Mukherjee, Amit Sahai, Akshayaram Srinivasan, Mark Zhandry:
Secure Obfuscation in a Weak Multilinear Map Model. TCC (B2) 2016: 241-268 - [c32]Sanjam Garg, Akshayaram Srinivasan:
Single-Key to Multi-Key Functional Encryption with Polynomial Loss. TCC (B2) 2016: 419-442 - [c31]