default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDPrashant Nalini Vasudevan
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j5]Ron D. Rothblum
, Prashant Nalini Vasudevan:
Collision Resistance from Multi-collision Resistance. J. Cryptol. 37(2): 14 (2024)- [c26]Shweta Agrawal, Sagnik Saha, Nikolaj I. Schwartzbach, Akhil Vanukuri, Prashant Nalini Vasudevan:
k-SUM in the Sparse Regime: Complexity and Applications. CRYPTO (2) 2024: 315-351 - [c25]Changrui Mu, Shafik Nassar, Ron D. Rothblum, Prashant Nalini Vasudevan:
Strong Batching for Non-interactive Statistical Zero-Knowledge. EUROCRYPT (6) 2024: 241-270 - [c24]Nir Bitansky, Chethan Kamath, Omer Paneth, Ron D. Rothblum, Prashant Nalini Vasudevan:
Batch Proofs Are Statistically Hiding. STOC 2024: 435-443 - [c23]Changrui Mu, Prashant Nalini Vasudevan:
Instance-Hiding Interactive Proofs - (Extended Abstract). TCC (1) 2024: 3-34 - [c22]Or Keret, Ron D. Rothblum, Prashant Nalini Vasudevan:
Doubly-Efficient Batch Verification in Statistical Zero-Knowledge. TCC (2) 2024: 371-398 - [i46]Haoxing Lin, Prashant Nalini Vasudevan:
On Wagner's k-Tree Algorithm Over Integers. CoRR abs/2410.06856 (2024) - [i45]Or Keret, Ron Rothblum, Prashant Nalini Vasudevan:
Doubly-Efficient Batch Verification in Statistical Zero-Knowledge. Electron. Colloquium Comput. Complex. TR24 (2024) - [i44]Changrui Mu, Shafik Nassar, Ron Rothblum, Prashant Nalini Vasudevan:
Strong Batching for Non-Interactive Statistical Zero-Knowledge. Electron. Colloquium Comput. Complex. TR24 (2024) - [i43]Changrui Mu, Prashant Nalini Vasudevan:
Instance-Hiding Interactive Proofs. Electron. Colloquium Comput. Complex. TR24 (2024) - [i42]Changrui Mu, Shafik Nassar, Ron D. Rothblum, Prashant Nalini Vasudevan:
Strong Batching for Non-Interactive Statistical Zero-Knowledge. IACR Cryptol. ePrint Arch. 2024: 229 (2024) - [i41]Changrui Mu, Prashant Nalini Vasudevan:
Instance-Hiding Interactive Proofs. IACR Cryptol. ePrint Arch. 2024: 776 (2024) - [i40]Or Keret, Ron D. Rothblum, Prashant Nalini Vasudevan:
Doubly-Efficient Batch Verification in Statistical Zero-Knowledge. IACR Cryptol. ePrint Arch. 2024: 781 (2024) - [i39]Haoxing Lin, Prashant Nalini Vasudevan:
On Wagner's k-Tree Algorithm Over Integers. IACR Cryptol. ePrint Arch. 2024: 1612 (2024) - 2023
- [c21]Aloni Cohen, Adam D. Smith, Marika Swanberg, Prashant Nalini Vasudevan:
Control, Confidentiality, and the Right to be Forgotten. CCS 2023: 3358-3372 - [i38]Shweta Agrawal, Sagnik Saha, Nikolaj I. Schwartzbach, Akhil Vanukuri, Prashant Nalini Vasudevan:
k-SUM in the Sparse Regime. CoRR abs/2304.01787 (2023) - [i37]Nir Bitansky, Chethan Kamath, Omer Paneth, Ron Rothblum, Prashant Nalini Vasudevan:
Batch Proofs are Statistically Hiding. Electron. Colloquium Comput. Complex. TR23 (2023) - [i36]Shweta Agrawal, Sagnik Saha, Nikolaj I. Schwartzbach, Akhil Vanukuri, Prashant Nalini Vasudevan:
k-SUM in the Sparse Regime. Electron. Colloquium Comput. Complex. TR23 (2023) - [i35]Shweta Agrawal, Sagnik Saha, Nikolaj I. Schwartzbach, Akhil Vanukuri, Prashant Nalini Vasudevan:
k-SUM in the Sparse Regime. IACR Cryptol. ePrint Arch. 2023: 488 (2023) - [i34]Nir Bitansky, Chethan Kamath, Omer Paneth, Ron Rothblum, Prashant Nalini Vasudevan:
Batch Proofs are Statistically Hiding. IACR Cryptol. ePrint Arch. 2023: 754 (2023) - 2022
- [j4]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) - [c20]Ron D. Rothblum, Prashant Nalini Vasudevan:
Collision-Resistance from Multi-Collision-Resistance. CRYPTO (3) 2022: 503-529 - [i33]Ji Gao, Sanjam Garg, Mohammad Mahmoody, Prashant Nalini Vasudevan:
Deletion Inference, Reconstruction, and Compliance in Machine (Un)Learning. CoRR abs/2202.03460 (2022) - [i32]Aloni Cohen, Adam D. Smith, Marika Swanberg, Prashant Nalini Vasudevan:
Control, Confidentiality, and the Right to be Forgotten. CoRR abs/2210.07876 (2022) - [i31]Ron D. Rothblum, Prashant Nalini Vasudevan:
Collision-Resistance from Multi-Collision-Resistance. Electron. Colloquium Comput. Complex. TR22 (2022) - [i30]Ron D. Rothblum, Prashant Nalini Vasudevan:
Collision-Resistance from Multi-Collision-Resistance. IACR Cryptol. ePrint Arch. 2022: 173 (2022) - 2021
- [j3]Benny Applebaum, Prashant Nalini Vasudevan:
Placing Conditional Disclosure of Secrets in the Communication Complexity Universe. J. Cryptol. 34(2): 11 (2021) - [j2]Benny Applebaum, Barak Arkis, Pavel Raykov, Prashant Nalini Vasudevan:
Conditional Disclosure of Secrets: Amplification, Closure, Amortization, Lower-bounds, and Separations. SIAM J. Comput. 50(1): 32-67 (2021) - [c19]Inbar Kaslasi, Ron D. Rothblum, Prashant Nalini Vasudevan:
Public-Coin Statistical Zero-Knowledge Batch Verification Against Malicious Verifiers. EUROCRYPT (3) 2021: 219-246 - [i29]Inbar Kaslasi, Ron Rothblum, Prashant Nalini Vasudevan:
Public-Coin Statistical Zero-Knowledge Batch Verification against Malicious Verifiers. Electron. Colloquium Comput. Complex. TR21 (2021) - [i28]Inbar Kaslasi, Ron D. Rothblum, Prashant Nalini Vasudevan:
Public-Coin Statistical Zero-Knowledge Batch Verification against Malicious Verifiers. IACR Cryptol. ePrint Arch. 2021: 233 (2021) - 2020
- [j1]Adam Bouland, Lijie Chen, Dhiraj Holden, Justin Thaler, Prashant Nalini Vasudevan:
On the Power of Statistical Zero Knowledge. SIAM J. Comput. 49(4) (2020) - [c18]Pasin Manurangsi, Akshayaram Srinivasan, Prashant Nalini Vasudevan:
Nearly Optimal Robust Secret Sharing Against Rushing Adversaries. CRYPTO (3) 2020: 156-185 - [c17]Sanjam Garg, Shafi Goldwasser, Prashant Nalini Vasudevan:
Formalizing Data Deletion in the Context of the Right to Be Forgotten. EUROCRYPT (2) 2020: 373-402 - [c16]Marshall Ball, Elette Boyle, Akshay Degwekar, Apoorvaa Deshpande, Alon Rosen, Vinod Vaikuntanathan, Prashant Nalini Vasudevan:
Cryptography from Information Loss. ITCS 2020: 81:1-81:27 - [c15]Nico Döttling, Sanjam Garg, Giulio Malavolta, Prashant Nalini Vasudevan:
Tight Verifiable Delay Functions. SCN 2020: 65-84 - [c14]Inbar Kaslasi, Guy N. Rothblum, Ron D. Rothblum, Adam Sealfon, Prashant Nalini Vasudevan:
Batch Verification for Statistical Zero Knowledge Proofs. TCC (2) 2020: 139-167 - [i27]Sanjam Garg, Shafi Goldwasser, Prashant Nalini Vasudevan:
Formalizing Data Deletion in the Context of the Right to be Forgotten. CoRR abs/2002.10635 (2020) - [i26]Marshall Ball, Elette Boyle, Akshay Degwekar, Apoorvaa Deshpande, Alon Rosen, Vinod Vaikuntanathan, Prashant Nalini Vasudevan:
Cryptography from Information Loss. Electron. Colloquium Comput. Complex. TR20 (2020) - [i25]Inbar Kaslasi, Prashant Nalini Vasudevan, Guy N. Rothblum, Ron Rothblum, Adam Sealfon:
Batch Verification for Statistical Zero Knowledge Proofs. Electron. Colloquium Comput. Complex. TR20 (2020) - [i24]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) - [i23]Marshall Ball, Elette Boyle, Akshay Degwekar, Apoorvaa Deshpande, Alon Rosen, Vinod Vaikuntanathan, Prashant Nalini Vasudevan:
Cryptography from Information Loss. IACR Cryptol. ePrint Arch. 2020: 395 (2020) - [i22]Inbar Kaslasi, Guy N. Rothblum, Ron D. Rothblum, Adam Sealfon, Prashant Nalini Vasudevan:
Batch Verification for Statistical Zero Knowledge Proofs. IACR Cryptol. ePrint Arch. 2020: 1167 (2020)
2010 – 2019
- 2019
- [c13]Akshayaram Srinivasan, Prashant Nalini Vasudevan:
Leakage Resilient Secret Sharing and Applications. CRYPTO (2) 2019: 480-509 - [c12]Benny Applebaum, Prashant Nalini Vasudevan:
Placing Conditional Disclosure of Secrets in the Communication Complexity Universe. ITCS 2019: 4:1-4:14 - [c11]Andrej Bogdanov, Manuel Sabin, Prashant Nalini Vasudevan:
XOR Codes and Sparse Learning Parity with Noise. SODA 2019: 986-1004 - [c10]Itay Berman, Akshay Degwekar, Ron D. Rothblum, Prashant Nalini Vasudevan:
Statistical Difference Beyond the Polarizing Regime. TCC (2) 2019: 311-332 - [i21]Itay Berman, Akshay Degwekar, Ron D. Rothblum, Prashant Nalini Vasudevan:
Statistical Difference Beyond the Polarizing Regime. Electron. Colloquium Comput. Complex. TR19 (2019) - [i20]Nico Döttling, Sanjam Garg, Giulio Malavolta, Prashant Nalini Vasudevan:
Tight Verifiable Delay Functions. IACR Cryptol. ePrint Arch. 2019: 659 (2019) - [i19]Pasin Manurangsi, Akshayaram Srinivasan, Prashant Nalini Vasudevan:
Nearly Optimal Robust Secret Sharing against Rushing Adversaries. IACR Cryptol. ePrint Arch. 2019: 1131 (2019) - 2018
- [b1]Prashant Nalini Vasudevan:
Fine-grained cryptography. Massachusetts Institute of Technology, Cambridge, USA, 2018 - [c9]Itay Berman, Akshay Degwekar, Ron D. Rothblum, Prashant Nalini Vasudevan:
From Laconic Zero-Knowledge to Public-Key Cryptography - Extended Abstract. CRYPTO (3) 2018: 674-697 - [c8]Marshall Ball, Alon Rosen, Manuel Sabin, Prashant Nalini Vasudevan:
Proofs of Work From Worst-Case Assumptions. CRYPTO (1) 2018: 789-819 - [c7]Itay Berman, Akshay Degwekar, Ron D. Rothblum, Prashant Nalini Vasudevan:
Multi-Collision Resistant Hash Functions and Their Applications. EUROCRYPT (2) 2018: 133-161 - [i18]Benny Applebaum, Prashant Nalini Vasudevan:
Placing Conditional Disclosure of Secrets in the Communication Complexity Universe. Electron. Colloquium Comput. Complex. TR18 (2018) - [i17]Andrej Bogdanov, Manuel Sabin, Prashant Nalini Vasudevan:
XOR Codes and Sparse Random Linear Equations with Noise. Electron. Colloquium Comput. Complex. TR18 (2018) - [i16]Itay Berman, Akshay Degwekar, Ron D. Rothblum, Prashant Nalini Vasudevan:
From Laconic Zero-Knowledge to Public-Key Cryptography. IACR Cryptol. ePrint Arch. 2018: 548 (2018) - [i15]Marshall Ball, Alon Rosen, Manuel Sabin, Prashant Nalini Vasudevan:
Proofs of Work from Worst-Case Assumptions. IACR Cryptol. ePrint Arch. 2018: 559 (2018) - [i14]Akshayaram Srinivasan, Prashant Nalini Vasudevan:
Leakage Resilient Secret Sharing and Applications. IACR Cryptol. ePrint Arch. 2018: 1154 (2018) - [i13]Benny Applebaum, Prashant Nalini Vasudevan:
Placing Conditional Disclosure of Secrets in the Communication Complexity Universe. IACR Cryptol. ePrint Arch. 2018: 1169 (2018) - 2017
- [c6]Benny Applebaum, Barak Arkis, Pavel Raykov, Prashant Nalini Vasudevan:
Conditional Disclosure of Secrets: Amplification, Closure, Amortization, Lower-Bounds, and Separations. CRYPTO (1) 2017: 727-757 - [c5]Adam Bouland, Lijie Chen, Dhiraj Holden, Justin Thaler, Prashant Nalini Vasudevan:
On the Power of Statistical Zero Knowledge. FOCS 2017: 708-719 - [c4]Marshall Ball, Alon Rosen, Manuel Sabin, Prashant Nalini Vasudevan:
Average-case fine-grained hardness. STOC 2017: 483-496 - [i12]Benny Applebaum, Barak Arkis, Pavel Raykov, Prashant Nalini Vasudevan:
Conditional Disclosure of Secrets: Amplification, Closure, Amortization, Lower-bounds, and Separations. Electron. Colloquium Comput. Complex. TR17 (2017) - [i11]Marshall Ball, Alon Rosen, Manuel Sabin, Prashant Nalini Vasudevan:
Average-Case Fine-Grained Hardness. Electron. Colloquium Comput. Complex. TR17 (2017) - [i10]Itay Berman, Akshay Degwekar, Ron Rothblum, Prashant Nalini Vasudevan:
Multi Collision Resistant Hash Functions and their Applications. Electron. Colloquium Comput. Complex. TR17 (2017) - [i9]Itay Berman, Akshay Degwekar, Ron Rothblum, Prashant Nalini Vasudevan:
From Laconic Zero-Knowledge to Public-Key Cryptography. Electron. Colloquium Comput. Complex. TR17 (2017) - [i8]Benny Applebaum, Barak Arkis, Pavel Raykov, Prashant Nalini Vasudevan:
Conditional Disclosure of Secrets: Amplification, Closure, Amortization, Lower-bounds, and Separations. IACR Cryptol. ePrint Arch. 2017: 164 (2017) - [i7]Marshall Ball, Alon Rosen, Manuel Sabin, Prashant Nalini Vasudevan:
Average-Case Fine-Grained Hardness. IACR Cryptol. ePrint Arch. 2017: 202 (2017) - [i6]Marshall Ball, Alon Rosen, Manuel Sabin, Prashant Nalini Vasudevan:
Proofs of Useful Work. IACR Cryptol. ePrint Arch. 2017: 203 (2017) - [i5]Itay Berman, Akshay Degwekar, Ron D. Rothblum, Prashant Nalini Vasudevan:
Multi Collision Resistant Hash Functions and their Applications. IACR Cryptol. ePrint Arch. 2017: 489 (2017) - 2016
- [c3]Ranjit Kumaresan, Vinod Vaikuntanathan, Prashant Nalini Vasudevan:
Improvements to Secure Computation with Penalties. CCS 2016: 406-417 - [c2]Akshay Degwekar, Vinod Vaikuntanathan, Prashant Nalini Vasudevan:
Fine-Grained Cryptography. CRYPTO (3) 2016: 533-562 - [i4]Adam Bouland, Lijie Chen, Dhiraj Holden, Justin Thaler, Prashant Nalini Vasudevan:
On SZK and PP. CoRR abs/1609.02888 (2016) - [i3]Adam Bouland, Lijie Chen, Dhiraj Holden, Justin Thaler, Prashant Nalini Vasudevan:
On SZK and PP. Electron. Colloquium Comput. Complex. TR16 (2016) - [i2]Akshay Degwekar, Vinod Vaikuntanathan, Prashant Nalini Vasudevan:
Fine-grained Cryptography. IACR Cryptol. ePrint Arch. 2016: 580 (2016) - 2015
- [c1]Vinod Vaikuntanathan, Prashant Nalini Vasudevan:
Secret Sharing and Statistical Zero Knowledge. ASIACRYPT (1) 2015: 656-680 - [i1]Vinod Vaikuntanathan, Prashant Nalini Vasudevan:
From Statistical Zero Knowledge to Secret Sharing. IACR Cryptol. ePrint Arch. 2015: 281 (2015)
Coauthor Index
aka: Ron D. Rothblum
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 2025-01-20 23:03 CET 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:
