default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSanjam Garg
Person information
- affiliation: University of California, Berkeley, CA, USA
SPARQL queries 
🛈 Please note that only 50% of the records listed on this page have a DOI. Therefore, DOI-based queries can only provide partial results.
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[j9]Arka Rai Choudhuri, Sanjam Garg, Aarushi Goel, Sruthi Sekar, Rohit Sinha:
SublonK: Sublinear Prover PlonK. Proc. Priv. Enhancing Technol. 2024(3): 314-335 (2024)- [c106]Sanjam Garg, Dimitris Kolonelos, Guru-Vamsi Policharla, Mingyuan Wang:
Threshold Encryption with Silent Setup. CRYPTO (7) 2024: 352-386 - [c105]Sanjam Garg, Abhishek Jain, Pratyay Mukherjee, Mingyuan Wang:
Scalable Multiparty Computation from Non-linear Secret Sharing. CRYPTO (8) 2024: 384-417 - [c104]Sanjam Garg, Aarushi Goel, Mingyuan Wang:
How to Prove Statements Obliviously? CRYPTO (10) 2024: 449-487 - [c103]Sanjam Garg, Mohammad Hajiabadi, Peihan Miao, Alice Murphy:
Laconic Branching Programs from the Diffie-Hellman Assumption. Public Key Cryptography (3) 2024: 323-355 - [c102]Sanjam Garg, Abhishek Jain, Pratyay Mukherjee, Rohit Sinha, Mingyuan Wang, Yinuo Zhang:
hinTS: Threshold Signatures with Silent Setup. SP 2024: 3034-3052 - [c101]Arka Rai Choudhuri, Sanjam Garg, Julien Piet, Guru-Vamsi Policharla:
Mempool Privacy via Batched Threshold Encryption: Attacks and Defenses. USENIX Security Symposium 2024 - [i106]Sanjam Garg
, Mohammad Hajiabadi, Peihan Miao, Alice Murphy:
Laconic Branching Programs from the Diffie-Hellman Assumption. IACR Cryptol. ePrint Arch. 2024: 102 (2024) - [i105]Sanjam Garg, Dimitris Kolonelos, Guru-Vamsi Policharla, Mingyuan Wang:
Threshold Encryption with Silent Setup. IACR Cryptol. ePrint Arch. 2024: 263 (2024) - [i104]Arka Rai Choudhuri, Sanjam Garg, Julien Piet, Guru-Vamsi Policharla:
Mempool Privacy via Batched Threshold Encryption: Attacks and Defenses. IACR Cryptol. ePrint Arch. 2024: 669 (2024) - [i103]Sanjam Garg, Aniket Kate, Pratyay Mukherjee, Rohit Sinha, Sriram Sridhar:
Insta-Pok3r: Real-time Poker on Blockchain. IACR Cryptol. ePrint Arch. 2024: 1061 (2024) - [i102]Arka Rai Choudhuri, Sanjam Garg, Guru-Vamsi Policharla, Mingyuan Wang:
Practical Mempool Privacy via One-time Setup Batched Threshold Encryption. IACR Cryptol. ePrint Arch. 2024: 1516 (2024) - 2023
- [j8]Zvika Brakerski, Nico Döttling, Sanjam Garg, Giulio Malavolta:
Candidate iO from Homomorphic Encryption Schemes. J. Cryptol. 36(3): 27 (2023) - [c100]Sanjam Garg, Aarushi Goel, Somesh Jha, Saeed Mahloujifar, Mohammad Mahmoody, Guru-Vamsi Policharla, Mingyuan Wang:
Experimenting with Zero-Knowledge Proofs of Training. CCS 2023: 1880-1894 - [c99]Sanjam Garg, Abhishek Jain, Pratyay Mukherjee, Rohit Sinha, Mingyuan Wang, Yinuo Zhang:
Cryptography with Weights: MPC, Encryption and Signatures. CRYPTO (1) 2023: 295-327 - [c98]Arka Rai Choudhuri, Sanjam Garg, Abhishek Jain, Zhengzhong Jin, Jiaheng Zhang:
Correlation Intractability and SNARGs from Sub-exponential DDH. CRYPTO (4) 2023: 635-668 - [c97]James Bartusek, Sanjam Garg, Abhishek Jain, Guru-Vamsi Policharla:
End-to-End Secure Messaging with Traceability Only for Illegal Content. EUROCRYPT (5) 2023: 35-66 - [c96]Sanjam Garg, Mohammad Hajiabadi, Abhishek Jain, Zhengzhong Jin, Omkant Pandey, Sina Shiehian:
Credibility in Private Set Membership. Public Key Cryptography (2) 2023: 159-189 - [c95]Leemon Baird, Sanjam Garg, Abhishek Jain, Pratyay Mukherjee, Rohit Sinha, Mingyuan Wang, Yinuo Zhang:
Threshold Signatures in the Multiverse. SP 2023: 1454-1470 - [c94]Sanjam Garg, Aarushi Goel, Abhishek Jain, Guru-Vamsi Policharla, Sruthi Sekar:
zkSaaS: Zero-Knowledge SNARKs as a Service. USENIX Security Symposium 2023: 4427-4444 - [i101]Jaiden Fairoze, Sanjam Garg, Somesh Jha, Saeed Mahloujifar, Mohammad Mahmoody, Mingyuan Wang:
Publicly Detectable Watermarking for Language Models. CoRR abs/2310.18491 (2023) - [i100]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) - [i99]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) - [i98]Sanjam Garg, Abhishek Jain, Pratyay Mukherjee, Rohit Sinha, Mingyuan Wang, Yinuo Zhang:
hinTS: Threshold Signatures with Silent Setup. IACR Cryptol. ePrint Arch. 2023: 567 (2023) - [i97]Arka Rai Choudhuri, Sanjam Garg, Aarushi Goel, Sruthi Sekar, Rohit Sinha:
SublonK: Sublinear Prover PlonK. IACR Cryptol. ePrint Arch. 2023: 902 (2023) - [i96]Sanjam Garg, Aarushi Goel, Abhishek Jain, Guru-Vamsi Policharla, Sruthi Sekar:
zkSaaS: Zero-Knowledge SNARKs as a Service. IACR Cryptol. ePrint Arch. 2023: 905 (2023) - [i95]Sanjam Garg, Aarushi Goel, Somesh Jha, Saeed Mahloujifar, Mohammad Mahmoody, Guru-Vamsi Policharla, Mingyuan Wang:
Experimenting with Zero-Knowledge Proofs of Training. IACR Cryptol. ePrint Arch. 2023: 1345 (2023) - [i94]Sanjam Garg, Aarushi Goel, Mingyuan Wang:
How to Prove Statements Obliviously? IACR Cryptol. ePrint Arch. 2023: 1609 (2023) - [i93]Jaiden Fairoze, Sanjam Garg, Somesh Jha, Saeed Mahloujifar, Mohammad Mahmoody, Mingyuan Wang:
Publicly Detectable Watermarking for Language Models. IACR Cryptol. ePrint Arch. 2023: 1661 (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) - [c93]Sanjam Garg, Abhishek Jain, Zhengzhong Jin, Yinuo Zhang:
Succinct Zero Knowledge for Floating Point Computations. CCS 2022: 1203-1216 - [c92]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 - [c91]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 - [c90]Sanjam Garg, Somesh Jha, Saeed Mahloujifar, Mohammad Mahmoody, Mingyuan Wang:
Overparameterization from Computational Constraints. NeurIPS 2022 - [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? SP 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]Sanjam Garg, Craig Gentry, Shai Halevi, Mark Zhandry:
Functional Encryption Without Obfuscation. TCC (A2) 2016: 480-511 - [c30]Sanjam Garg, Divya Gupta, Peihan Miao, Omkant Pandey:
Secure Multiparty RAM Computation in Constant Rounds. TCC (B1) 2016: 491-520 - [i36]Sanjam Garg, Omkant Pandey, Akshayaram Srinivasan, Mark Zhandry:
Breaking the Sub-Exponential Barrier in Obfustopia. IACR Cryptol. ePrint Arch. 2016: 102 (2016) - [i35]Sanjam Garg, Pratyay Mukherjee, Omkant Pandey, Antigoni Polychroniadou:
The Exact Round Complexity of Secure Computation. IACR Cryptol. ePrint Arch. 2016: 252 (2016) - [i34]Sanjam Garg, Pratyay Mukherjee, Akshayaram Srinivasan:
Obfuscation without the Vulnerabilities of Multilinear Maps. IACR Cryptol. ePrint Arch. 2016: 390 (2016) - [i33]Sanjam Garg, Akshayaram Srinivasan:
Unifying Security Notions of Functional Encryption. IACR Cryptol. ePrint Arch. 2016: 524 (2016) - [i32]Nico Döttling, Sanjam Garg, Divya Gupta, Peihan Miao, Pratyay Mukherjee:
Obfuscation from Low Noise Multilinear Maps. IACR Cryptol. ePrint Arch. 2016: 599 (2016) - [i31]Sanjam Garg, Divya Gupta, Peihan Miao, Omkant Pandey:
Secure Multiparty RAM Computation in Constant Rounds. IACR Cryptol. ePrint Arch. 2016: 815 (2016) - [i30]Sanjam Garg, Eric Miles, Pratyay Mukherjee, Amit Sahai, Akshayaram Srinivasan, Mark Zhandry:
Secure Obfuscation in a Weak Multilinear Map Model. IACR Cryptol. ePrint Arch. 2016: 817 (2016) - [i29]Daniel Apon, Nico Döttling, Sanjam Garg, Pratyay Mukherjee:
Cryptanalysis of Indistinguishability Obfuscations of Circuits over GGH13. IACR Cryptol. ePrint Arch. 2016: 1003 (2016) - 2015
- [c29]Sanjam Garg, Yuval Ishai, Eyal Kushilevitz, Rafail Ostrovsky, Amit Sahai:
Cryptography with One-Way Communication. CRYPTO (2) 2015: 191-208 - [c28]Sanjam Garg, Steve Lu, Rafail Ostrovsky:
Black-Box Garbled RAM. FOCS 2015: 210-229 - [c27]Nir Bitansky, Sanjam Garg, Huijia Lin, Rafael Pass, Sidharth Telang:
Succinct Randomized Encodings and their Applications. STOC 2015: 439-448 - [c26]Sanjam Garg, Steve Lu, Rafail Ostrovsky, Alessandra Scafuro:
Garbled RAM From One-Way Functions. STOC 2015: 449-458 - [c25]Sanjam Garg, Antigoni Polychroniadou:
Two-Round Adaptively Secure MPC from Indistinguishability Obfuscation. TCC (2) 2015: 614-637 - [i28]Sanjam Garg, Steve Lu, Rafail Ostrovsky:
Black-Box Garbled RAM. Electron. Colloquium Comput. Complex. TR15 (2015) - [i27]Sanjam Garg, Steve Lu, Rafail Ostrovsky:
Black-Box Garbled RAM. IACR Cryptol. ePrint Arch. 2015: 307 (2015) - [i26]Nir Bitansky, Sanjam Garg, Huijia Lin, Rafael Pass, Sidharth Telang:
Succinct Randomized Encodings and their Applications. IACR Cryptol. ePrint Arch. 2015: 356 (2015) - [i25]Sanjam Garg, Omkant Pandey:
Incremental Program Obfuscation. IACR Cryptol. ePrint Arch. 2015: 997 (2015) - [i24]Sanjam Garg, Payman Mohassel, Charalampos Papamanthou:
TWORAM: Round-Optimal Oblivious RAM with Applications to Searchable Encryption. IACR Cryptol. ePrint Arch. 2015: 1010 (2015) - [i23]Sanjam Garg, Omkant Pandey, Akshayaram Srinivasan:
On the Exact Cryptographic Hardness of Finding a Nash Equilibrium. IACR Cryptol. ePrint Arch. 2015: 1078 (2015) - 2014
- [c24]Sanjam Garg, Craig Gentry, Shai Halevi, Daniel Wichs:
On the Implausibility of Differing-Inputs Obfuscation and Extractable Witness Encryption with Auxiliary Input. CRYPTO (1) 2014: 518-535 - [c23]Boaz Barak, Sanjam Garg, Yael Tauman Kalai, Omer Paneth, Amit Sahai:
Protecting Obfuscation against Algebraic Attacks. EUROCRYPT 2014: 221-238 - [c22]Sanjam Garg, Divya Gupta:
Efficient Round Optimal Blind Signatures. EUROCRYPT 2014: 477-495 - [c21]Nishanth Chandran, Sanjam Garg:
Balancing Output Length and Query Bound in Hardness Preserving Constructions of Pseudorandom Functions. INDOCRYPT 2014: 89-103 - [c20]Chongwon Cho, Sanjam Garg, Rafail Ostrovsky:
Cross-Domain Secure Computation. Public Key Cryptography 2014: 650-668 - [c19]Sanjam Garg:
Program Obfuscation via Multilinear Maps. SCN 2014: 91-94 - [c18]Sanjam Garg, Craig Gentry, Shai Halevi, Mariana Raykova:
Two-Round Secure MPC from Indistinguishability Obfuscation. TCC 2014: 74-94 - [i22]Sanjam Garg, Divya Gupta:
Efficient Round Optimal Blind Signatures. IACR Cryptol. ePrint Arch. 2014: 81 (2014) - [i21]Sanjam Garg, Craig Gentry, Shai Halevi, Mark Zhandry:
Fully Secure Attribute Based Encryption from Multilinear Maps. IACR Cryptol. ePrint Arch. 2014: 622 (2014) - [i20]Sanjam Garg, Craig Gentry, Shai Halevi, Mark Zhandry:
Fully Secure Functional Encryption without Obfuscation. IACR Cryptol. ePrint Arch. 2014: 666 (2014) - [i19]Nir Bitansky, Sanjam Garg, Sidharth Telang:
Succinct Randomized Encodings and their Applications. IACR Cryptol. ePrint Arch. 2014: 771 (2014) - [i18]Sanjam Garg, Antigoni Polychroniadou:
Two-Round Adaptively Secure MPC from Indistinguishability Obfuscation. IACR Cryptol. ePrint Arch. 2014: 844 (2014) - [i17]Sanjam Garg, Yuval Ishai, Eyal Kushilevitz, Rafail Ostrovsky, Amit Sahai:
Cryptography with One-Way Communication. IACR Cryptol. ePrint Arch. 2014: 914 (2014) - [i16]Sanjam Garg, Steve Lu, Rafail Ostrovsky, Alessandra Scafuro:
Garbled RAM From One-Way Functions. IACR Cryptol. ePrint Arch. 2014: 941 (2014) - 2013
- [b1]Sanjam Garg:
Candidate Multilinear Maps. University of California, Los Angeles, USA, 2013 - [c17]Elette Boyle, Sanjam Garg, Abhishek Jain, Yael Tauman Kalai, Amit Sahai:
Secure Computation against Adaptive Auxiliary Information. CRYPTO (1) 2013: 316-334 - [c16]Sanjam Garg, Craig Gentry, Shai Halevi, Amit Sahai, Brent Waters:
Attribute-Based Encryption for Circuits from Multilinear Maps. CRYPTO (2) 2013: 479-499 - [c15]Sanjam Garg, Craig Gentry, Shai Halevi:
Candidate Multilinear Maps from Ideal Lattices. EUROCRYPT 2013: 1-17 - [c14]Sanjam Garg, Craig Gentry, Shai Halevi, Mariana Raykova, Amit Sahai, Brent Waters:
Candidate Indistinguishability Obfuscation and Functional Encryption for all Circuits. FOCS 2013: 40-49 - [c13]Sanjam Garg, Craig Gentry, Amit Sahai, Brent Waters:
Witness encryption and its applications. STOC 2013: 467-476 - [c12]Nir Bitansky, Dana Dachman-Soled, Sanjam Garg, Abhishek Jain, Yael Tauman Kalai, Adriana López-Alt, Daniel Wichs:
Why "Fiat-Shamir for Proofs" Lacks a Proof. TCC 2013: 182-201 - [i15]Sanjam Garg, Craig Gentry, Shai Halevi, Amit Sahai, Brent Waters:
Attribute-Based Encryption for Circuits from Multilinear Maps. IACR Cryptol. ePrint Arch. 2013: 128 (2013) - [i14]Sanjam Garg, Craig Gentry, Amit Sahai, Brent Waters:
Witness Encryption and its Applications. IACR Cryptol. ePrint Arch. 2013: 258 (2013) - [i13]Sanjam Garg, Craig Gentry, Shai Halevi, Mariana Raykova, Amit Sahai, Brent Waters:
Candidate Indistinguishability Obfuscation and Functional Encryption for all circuits. IACR Cryptol. ePrint Arch. 2013: 451 (2013) - [i12]Sanjam Garg, Craig Gentry, Shai Halevi, Mariana Raykova:
Two-round secure MPC from Indistinguishability Obfuscation. IACR Cryptol. ePrint Arch. 2013: 601 (2013) - [i11]Boaz Barak, Sanjam Garg, Yael Tauman Kalai, Omer Paneth, Amit Sahai:
Protecting Obfuscation Against Algebraic Attacks. IACR Cryptol. ePrint Arch. 2013: 631 (2013) - [i10]Prabhanjan Ananth, Dan Boneh, Sanjam Garg, Amit Sahai, Mark Zhandry:
Differing-Inputs Obfuscation and Applications. IACR Cryptol. ePrint Arch. 2013: 689 (2013) - [i9]Sanjam Garg, Craig Gentry, Shai Halevi, Daniel Wichs:
On the Implausibility of Differing-Inputs Obfuscation and Extractable Witness Encryption with Auxiliary Input. IACR Cryptol. ePrint Arch. 2013: 860 (2013) - 2012
- [c11]Sanjam Garg, Amit Sahai:
Adaptively Secure Multi-Party Computation with Dishonest Majority. CRYPTO 2012: 105-123 - [c10]Sanjam Garg, Abishek Kumarasubramanian, Rafail Ostrovsky, Ivan Visconti:
Impossibility Results for Static Input Secure Computation. CRYPTO 2012: 424-442 - [c9]Sanjam Garg, Vipul Goyal, Abhishek Jain, Amit Sahai:
Concurrently Secure Computation in Constant Rounds. EUROCRYPT 2012: 99-116 - [c8]Sanjam Garg, Rafail Ostrovsky, Ivan Visconti, Akshay Wadia:
Resettable Statistical Zero Knowledge. TCC 2012: 494-511 - [i8]Sanjam Garg, Abishek Kumarasubramanian, Rafail Ostrovsky, Ivan Visconti:
Impossibility Results for Static Input Secure Computation. IACR Cryptol. ePrint Arch. 2012: 433 (2012) - [i7]Sanjam Garg, Amit Sahai:
Adaptively Secure Multi-Party Computation with Dishonest Majority. IACR Cryptol. ePrint Arch. 2012: 441 (2012) - [i6]Sanjam Garg, Craig Gentry, Shai Halevi:
Candidate Multilinear Maps from Ideal Lattices and Applications. IACR Cryptol. ePrint Arch. 2012: 610 (2012) - [i5]Nishanth Chandran, Sanjam Garg:
Hardness Preserving Constructions of Pseudorandom Functions, Revisited. IACR Cryptol. ePrint Arch. 2012: 616 (2012) - [i4]Nir Bitansky, Sanjam Garg, Daniel Wichs:
Why "Fiat-Shamir for Proofs" Lacks a Proof. IACR Cryptol. ePrint Arch. 2012: 705 (2012) - 2011
- [c7]Sanjam Garg, Abhishek Jain, Amit Sahai:
Leakage-Resilient Zero Knowledge. CRYPTO 2011: 297-315 - [c6]Sanjam Garg, Vanishree Rao, Amit Sahai, Dominique Schröder, Dominique Unruh:
Round Optimal Blind Signatures. CRYPTO 2011: 630-648 - [c5]Sanjam Garg, Vipul Goyal, Abhishek Jain, Amit Sahai:
Bringing People of Different Beliefs Together to Do UC. TCC 2011: 311-328 - [i3]Sanjam Garg, Vipul Goyal, Abhishek Jain, Amit Sahai:
Concurrently Secure Computation in Constant Rounds. IACR Cryptol. ePrint Arch. 2011: 251 (2011) - [i2]Sanjam Garg, Rafail Ostrovsky, Ivan Visconti, Akshay Wadia:
Resettable Statistical Zero Knowledge. IACR Cryptol. ePrint Arch. 2011: 457 (2011) - 2010
- [c4]Sanjam Garg, Abishek Kumarasubramanian, Amit Sahai, Brent Waters:
Building efficient fully collusion-resilient traitor tracing and revocation schemes. CCS 2010: 121-130
2000 – 2009
- 2009
- [i1]Sanjam Garg, Abishek Kumarasubramanian, Amit Sahai, Brent Waters:
Building Efficient Fully Collusion-Resilient Traitor Tracing and Revocation Schemes. IACR Cryptol. ePrint Arch. 2009: 532 (2009) - 2008
- [c3]Sanjam Garg, Huzur Saran:
Anti-DDoS Virtualized Operating System. ARES 2008: 667-674 - [c2]Sanjam Garg, Raghav Bhaskar, Satyanarayana V. Lokam:
Improved Bounds on Security Reductions for Discrete Log Based Signatures. CRYPTO 2008: 93-107 - 2007
- [c1]Michael LeMay, George Gross, Carl A. Gunter, Sanjam Garg:
Unified Architecture for Large-Scale Attested Metering. HICSS 2007: 115
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 21:20 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
