default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAkshayaram Srinivasan
Person information
SPARQL queries 
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[c40]Pedro Branco, Nico Döttling, Akshayaram Srinivasan:
Two-Round Maliciously-Secure Oblivious Transfer with Optimal Rate. EUROCRYPT (6) 2024: 271-300- [c39]Pedro Branco, Nico Döttling
, Akshayaram Srinivasan, Riccardo Zanotto:
Rate-1 Fully Local Somewhere Extractable Hashing from DDH. Public Key Cryptography (3) 2024: 356-386 - [i43]Pedro Branco, Nico Döttling, Akshayaram Srinivasan, Riccardo Zanotto:
Rate-1 Fully Local Somewhere Extractable Hashing from DDH. IACR Cryptol. ePrint Arch. 2024: 216 (2024) - [i42]Pedro Branco, Nico Döttling, Akshayaram Srinivasan:
Two-Round Maliciously-Secure Oblivious Transfer with Optimal Rate. IACR Cryptol. ePrint Arch. 2024: 372 (2024) - [i41]Pedro Branco, Arka Rai Choudhuri, Nico Döttling, Abhishek Jain, Giulio Malavolta, Akshayaram Srinivasan:
Black-Box Non-Interactive Zero Knowledge from Vector Trapdoor Hash. IACR Cryptol. ePrint Arch. 2024: 1514 (2024) - 2023
- [c38]James Bartusek, Dakshita Khurana, Akshayaram Srinivasan:
Secure Computation with Shared EPR Pairs (Or: How to Teleport in Zero-Knowledge). CRYPTO (5) 2023: 224-257 - [c37]Yuval Ishai, Dakshita Khurana, Amit Sahai, Akshayaram Srinivasan:
Round-Optimal Black-Box MPC in the Plain Model. CRYPTO (1) 2023: 393-426 - [c36]Vipul Goyal, Akshayaram Srinivasan, Mingyuan Wang:
Reusable Secure Computation in the Plain Model. CRYPTO (1) 2023: 427-458 - [c35]Pedro Branco, Nico Döttling, Akshayaram Srinivasan:
A Framework for Statistically Sender Private OT with Optimal Rate. CRYPTO (1) 2023: 548-576 - [c34]Yuval Ishai, Dakshita Khurana, Amit Sahai, Akshayaram Srinivasan:
Black-Box Reusable NISC with Random Oracles. EUROCRYPT (2) 2023: 68-97 - [i40]James Bartusek, Dakshita Khurana, Akshayaram Srinivasan:
Secure Computation with Shared EPR Pairs (Or: How to Teleport in Zero-Knowledge). CoRR abs/2304.10480 (2023) - [i39]Yuval Ishai, Dakshita Khurana, Amit Sahai, Akshayaram Srinivasan:
Black-Box Reusable NISC with Random Oracles. IACR Cryptol. ePrint Arch. 2023: 514 (2023) - [i38]James Bartusek, Dakshita Khurana, Akshayaram Srinivasan:
Secure Computation with Shared EPR Pairs (Or: How to Teleport in Zero-Knowledge). IACR Cryptol. ePrint Arch. 2023: 564 (2023) - [i37]Vipul Goyal, Akshayaram Srinivasan, Mingyuan Wang:
Reusable Secure Computation in the Plain Model. IACR Cryptol. ePrint Arch. 2023: 1006 (2023) - [i36]Pedro Branco, Nico Döttling, Akshayaram Srinivasan:
A Framework for Statistically Sender Private OT with Optimal Rate. IACR Cryptol. ePrint Arch. 2023: 1011 (2023) - [i35]Yuval Ishai, Dakshita Khurana, Amit Sahai, Akshayaram Srinivasan:
Round-Optimal Black-Box MPC in the Plain Model. IACR Cryptol. ePrint Arch. 2023: 1173 (2023) - 2022
- [j5]Sanjam Garg, Akshayaram Srinivasan:
Two-round Multiparty Secure Computation from Minimal Assumptions. J. ACM 69(5): 36:1-36:30 (2022) - [j4]Andrej Bogdanov, Yuval Ishai, Akshayaram Srinivasan:
Correction to: Unconditionally Secure Computation Against Low-Complexity Leakage. J. Cryptol. 35(1): 2 (2022) - [j3]Andrej Bogdanov, Yuval Ishai, Akshayaram Srinivasan:
Correction to: Unconditionally Secure Computation Against Low-Complexity Leakage. J. Cryptol. 35(2): 7 (2022) - [c33]Yuval Ishai, Dakshita Khurana, Amit Sahai, Akshayaram Srinivasan:
Round-Optimal Black-Box Protocol Compilers. EUROCRYPT (1) 2022: 210-240 - [c32]James Hulett, Ruta Jawale, Dakshita Khurana, Akshayaram Srinivasan:
SNARGs for P from Sub-exponential DDH and QR. EUROCRYPT (2) 2022: 520-549 - [c31]Andrej Bogdanov, Krishnamoorthy Dinesh, Yuval Filmus, Yuval Ishai, Avi Kaplan, Akshayaram Srinivasan:
Bounded Indistinguishability for Simple Sources. ITCS 2022: 26:1-26:18 - [c30]James Bartusek, Sanjam Garg, Akshayaram Srinivasan, Yinuo Zhang:
Reusable Two-Round MPC from LPN. Public Key Cryptography (1) 2022: 165-193 - [c29]Yuval Ishai, Dakshita Khurana, Amit Sahai, Akshayaram Srinivasan:
Round-Optimal Black-Box Secure Computation from Two-Round Malicious OT. TCC (2) 2022: 441-469 - [c28]Yuval Ishai, Arpita Patra, Sikhar Patranabis, Divya Ravi, Akshayaram Srinivasan:
Fully-Secure MPC with Minimal Trust. TCC (2) 2022: 470-501 - [i34]Akshayaram Srinivasan:
Non-Black-Box Approach to Secure Two-Party Computation in Three Rounds. IACR Cryptol. ePrint Arch. 2022: 200 (2022) - [i33]James Hulett, Ruta Jawale, Dakshita Khurana, Akshayaram Srinivasan:
SNARGs for P from Sub-exponential DDH and QR. IACR Cryptol. ePrint Arch. 2022: 353 (2022) - [i32]Yuval Ishai, Dakshita Khurana, Amit Sahai, Akshayaram Srinivasan:
Round-Optimal Black-Box Protocol Compilers. IACR Cryptol. ePrint Arch. 2022: 887 (2022) - [i31]Yuval Ishai, Arpita Patra, Sikhar Patranabis, Divya Ravi, Akshayaram Srinivasan:
Fully-Secure MPC with Minimal Trust. IACR Cryptol. ePrint Arch. 2022: 1248 (2022) - [i30]Yuval Ishai, Dakshita Khurana, Amit Sahai, Akshayaram Srinivasan:
Round-Optimal Black-Box Secure Computation from Two-Round Malicious OT. IACR Cryptol. ePrint Arch. 2022: 1288 (2022) - 2021
- [j2]Andrej Bogdanov, Yuval Ishai, Akshayaram Srinivasan:
Unconditionally Secure Computation Against Low-Complexity Leakage. J. Cryptol. 34(4): 38 (2021) - [c27]Arpita Patra, Akshayaram Srinivasan:
Three-Round Secure Multiparty Computation from Black-Box Two-Round Oblivious Transfer. CRYPTO (2) 2021: 185-213 - [c26]Yuval Ishai, Dakshita Khurana, Amit Sahai, Akshayaram Srinivasan:
On the Round Complexity of Black-Box Secure MPC. CRYPTO (2) 2021: 214-243 - [c25]Dakshita Khurana, Akshayaram Srinivasan:
Improved Computational Extractors and Their Applications. CRYPTO (3) 2021: 566-594 - [c24]Vipul Goyal, Yifan Song, Akshayaram Srinivasan:
Traceable Secret Sharing and Applications. CRYPTO (3) 2021: 718-747 - [c23]Vipul Goyal, Akshayaram Srinivasan, Chenzhi Zhu:
Multi-source Non-malleable Extractors and Applications. EUROCRYPT (2) 2021: 468-497 - [c22]Ryan Lehmkuhl, Pratyush Mishra, Akshayaram Srinivasan, Raluca Ada Popa:
Muse: Secure Inference Resilient to Malicious Clients. USENIX Security Symposium 2021: 2201-2218 - [i29]Andrej Bogdanov, Krishnamoorthy Dinesh, Yuval Filmus, Yuval Ishai, Avi Kaplan, Akshayaram Srinivasan:
Bounded Indistinguishability for Simple Sources. Electron. Colloquium Comput. Complex. TR21 (2021) - [i28]James Bartusek, Sanjam Garg, Akshayaram Srinivasan, Yinuo Zhang:
Reusable Two-Round MPC from LPN. IACR Cryptol. ePrint Arch. 2021: 316 (2021) - [i27]Vipul Goyal, Yifan Song, Akshayaram Srinivasan:
Traceable Secret Sharing and Applications. IACR Cryptol. ePrint Arch. 2021: 871 (2021) - [i26]Arpita Patra, Akshayaram Srinivasan:
Three-Round Secure Multiparty Computation from Black-Box Two-Round Oblivious Transfer. IACR Cryptol. ePrint Arch. 2021: 957 (2021) - [i25]Ryan Lehmkuhl, Pratyush Mishra, Akshayaram Srinivasan, Raluca Ada Popa:
MUSE: Secure Inference Resilient to Malicious Clients. IACR Cryptol. ePrint Arch. 2021: 1040 (2021) - [i24]Dakshita Khurana, Akshayaram Srinivasan:
Improved Computational Extractors and their Applications. IACR Cryptol. ePrint Arch. 2021: 1336 (2021) - [i23]Yuval Ishai, Dakshita Khurana, Amit Sahai, Akshayaram Srinivasan:
On the Round Complexity of Black-box Secure MPC. IACR Cryptol. ePrint Arch. 2021: 1467 (2021) - 2020
- [b1]Akshayaram Srinivasan:
Round-Optimal Secure Multiparty Computation from Minimal Assumptions. University of California, Berkeley, USA, 2020 - [c21]Pratyush Mishra, Ryan Lehmkuhl, Akshayaram Srinivasan, Wenting Zheng, Raluca Ada Popa:
Delphi: A Cryptographic Inference System for Neural Networks. PPMLP@CCS 2020: 27-30 - [c20]Pasin Manurangsi, Akshayaram Srinivasan, Prashant Nalini Vasudevan:
Nearly Optimal Robust Secret Sharing Against Rushing Adversaries. CRYPTO (3) 2020: 156-185 - [c19]Benny Applebaum, Zvika Brakerski, Sanjam Garg, Yuval Ishai, Akshayaram Srinivasan:
Separating Two-Round Secure Computation From Oblivious Transfer. ITCS 2020: 71:1-71:18 - [c18]Pratyush Mishra, Ryan Lehmkuhl, Akshayaram Srinivasan, Wenting Zheng, Raluca Ada Popa:
Delphi: A Cryptographic Inference Service for Neural Networks. USENIX Security Symposium 2020: 2505-2522 - [i22]Pratyush Mishra, Ryan Lehmkuhl, Akshayaram Srinivasan, Wenting Zheng, Raluca Ada Popa:
Delphi: A Cryptographic Inference Service for Neural Networks. IACR Cryptol. ePrint Arch. 2020: 50 (2020) - [i21]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) - [i20]Vipul Goyal, Akshayaram Srinivasan, Chenzhi Zhu:
Multi-Source Non-Malleable Extractors and Applications. IACR Cryptol. ePrint Arch. 2020: 157 (2020)
2010 – 2019
- 2019
- [c17]Andrej Bogdanov, Yuval Ishai, Akshayaram Srinivasan:
Unconditionally Secure Computation Against Low-Complexity Leakage. CRYPTO (2) 2019: 387-416 - [c16]Akshayaram Srinivasan, Prashant Nalini Vasudevan:
Leakage Resilient Secret Sharing and Applications. CRYPTO (2) 2019: 480-509 - [c15]Saikrishna Badrinarayanan, Akshayaram Srinivasan:
Revisiting Non-Malleable Secret Sharing. EUROCRYPT (1) 2019: 593-622 - [i19]Andrej Bogdanov, Yuval Ishai, Akshayaram Srinivasan:
Unconditionally Secure Computation Against Low-Complexity Leakage. IACR Cryptol. ePrint Arch. 2019: 627 (2019) - [i18]Pasin Manurangsi, Akshayaram Srinivasan, Prashant Nalini Vasudevan:
Nearly Optimal Robust Secret Sharing against Rushing Adversaries. IACR Cryptol. ePrint Arch. 2019: 1131 (2019) - 2018
- [c14]Sanjam Garg, Peihan Miao, Akshayaram Srinivasan:
Two-Round Multiparty Secure Computation Minimizing Public Key Operations. CRYPTO (3) 2018: 273-301 - [c13]Sanjam Garg, Rafail Ostrovsky, Akshayaram Srinivasan:
Adaptive Garbled RAM from Laconic Oblivious Transfer. CRYPTO (3) 2018: 515-544 - [c12]Sanjam Garg, Akshayaram Srinivasan:
Two-Round Multiparty Secure Computation from Minimal Assumptions. EUROCRYPT (2) 2018: 468-499 - [c11]Sanjam Garg, Akshayaram Srinivasan:
Adaptively Secure Garbling with Near Optimal Online Complexity. EUROCRYPT (2) 2018: 535-565 - [c10]Sanjam Garg, Yuval Ishai, Akshayaram Srinivasan:
Two-Round MPC: Information-Theoretic and Black-Box. TCC (1) 2018: 123-151 - [c9]Dakshita Khurana, Rafail Ostrovsky, Akshayaram Srinivasan:
Round Optimal Black-Box "Commit-and-Prove". TCC (1) 2018: 286-313 - [c8]Sanjam Garg, Akshayaram Srinivasan:
A Simple Construction of iO for Turing Machines. TCC (2) 2018: 425-454 - [i17]Sanjam Garg, Akshayaram Srinivasan:
Adaptively Secure Garbling with Near Optimal Online Complexity. IACR Cryptol. ePrint Arch. 2018: 151 (2018) - [i16]Sanjam Garg, Peihan Miao, Akshayaram Srinivasan:
Two-Round Multiparty Secure Computation Minimizing Public Key Operations. IACR Cryptol. ePrint Arch. 2018: 180 (2018) - [i15]Sanjam Garg, Rafail Ostrovsky, Akshayaram Srinivasan:
Adaptive Garbled RAM from Laconic Oblivious Transfer. IACR Cryptol. ePrint Arch. 2018: 549 (2018) - [i14]Sanjam Garg, Akshayaram Srinivasan:
A Simple Construction of iO for Turing Machines. IACR Cryptol. ePrint Arch. 2018: 771 (2018) - [i13]Sanjam Garg, Yuval Ishai, Akshayaram Srinivasan:
Two-Round MPC: Information-Theoretic and Black-Box. IACR Cryptol. ePrint Arch. 2018: 909 (2018) - [i12]Dakshita Khurana, Rafail Ostrovsky, Akshayaram Srinivasan:
Round Optimal Black-Box “Commit-and-Prove”. IACR Cryptol. ePrint Arch. 2018: 921 (2018) - [i11]Saikrishna Badrinarayanan, Akshayaram Srinivasan:
Revisiting Non-Malleable Secret Sharing. IACR Cryptol. ePrint Arch. 2018: 1144 (2018) - [i10]Akshayaram Srinivasan, Prashant Nalini Vasudevan:
Leakage Resilient Secret Sharing and Applications. IACR Cryptol. ePrint Arch. 2018: 1154 (2018) - 2017
- [c7]Akshayaram Srinivasan, Chandrasekaran Pandu Rangan:
Efficiently Obfuscating Re-Encryption Program Under DDH Assumption. ACNS 2017: 273-292 - [c6]Sanjam Garg, Omkant Pandey, Akshayaram Srinivasan, Mark Zhandry:
Breaking the Sub-Exponential Barrier in Obfustopia. EUROCRYPT (3) 2017: 156-181 - [c5]Sanjam Garg, Akshayaram Srinivasan:
Garbled Protocols and Two-Round MPC from Bilinear Maps. FOCS 2017: 588-599 - [i9]Sanjam Garg, Akshayaram Srinivasan:
Garbled Protocols and Two-Round MPC from Bilinear Maps. IACR Cryptol. ePrint Arch. 2017: 1004 (2017) - [i8]Sanjam Garg, Akshayaram Srinivasan:
Two-Round Multiparty Secure Computation from Minimal Assumptions. IACR Cryptol. ePrint Arch. 2017: 1156 (2017) - 2016
- [j1]Sree Vivek Sivanandam, S. Sharmila Deva Selvi, Akshayaram Srinivasan, Chandrasekaran Pandu Rangan:
Stronger public key encryption system withstanding RAM scraper like attacks. Secur. Commun. Networks 9(12): 1650-1662 (2016) - [c4]Sanjam Garg, Omkant Pandey, Akshayaram Srinivasan:
Revisiting the Cryptographic Hardness of Finding a Nash Equilibrium. CRYPTO (2) 2016: 579-604 - [c3]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 - [c2]Sanjam Garg, Akshayaram Srinivasan:
Single-Key to Multi-Key Functional Encryption with Polynomial Loss. TCC (B2) 2016: 419-442 - [i7]Sanjam Garg, Omkant Pandey, Akshayaram Srinivasan, Mark Zhandry:
Breaking the Sub-Exponential Barrier in Obfustopia. IACR Cryptol. ePrint Arch. 2016: 102 (2016) - [i6]Sanjam Garg, Pratyay Mukherjee, Akshayaram Srinivasan:
Obfuscation without the Vulnerabilities of Multilinear Maps. IACR Cryptol. ePrint Arch. 2016: 390 (2016) - [i5]Sanjam Garg, Akshayaram Srinivasan:
Unifying Security Notions of Functional Encryption. IACR Cryptol. ePrint Arch. 2016: 524 (2016) - [i4]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) - 2015
- [c1]Akshayaram Srinivasan, C. Pandu Rangan:
Certificateless Proxy Re-Encryption Without Pairing: Revisited. SCC@ASIACCS 2015: 41-52 - [i3]Akshayaram Srinivasan, C. Pandu Rangan:
Efficiently Obfuscating Re-Encryption Program under DDH Assumption. IACR Cryptol. ePrint Arch. 2015: 822 (2015) - [i2]Sanjam Garg, Omkant Pandey, Akshayaram Srinivasan:
On the Exact Cryptographic Hardness of Finding a Nash Equilibrium. IACR Cryptol. ePrint Arch. 2015: 1078 (2015) - 2014
- [i1]Akshayaram Srinivasan, C. Pandu Rangan:
Certificateless Proxy Re-Encryption Without Pairing. IACR Cryptol. ePrint Arch. 2014: 933 (2014)
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:21 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:
