Prashant Nalini Vasudevan

Orcid: 0000-0001-6880-795X

According to our database1, Prashant Nalini Vasudevan authored at least 36 papers between 2015 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
On Wagner's k-Tree Algorithm Over Integers.
IACR Cryptol. ePrint Arch., 2024

Instance-Hiding Interactive Proofs.
Electron. Colloquium Comput. Complex., 2024

Strong Batching for Non-Interactive Statistical Zero-Knowledge.
Electron. Colloquium Comput. Complex., 2024

Doubly-Efficient Batch Verification in Statistical Zero-Knowledge.
Electron. Colloquium Comput. Complex., 2024

Instance-Hiding Interactive Proofs - (Extended Abstract).
Proceedings of the Theory of Cryptography - 22nd International Conference, 2024

k-SUM in the Sparse Regime: Complexity and Applications.
Proceedings of the Advances in Cryptology - CRYPTO 2024, 2024

2023
k-SUM in the Sparse Regime.
Electron. Colloquium Comput. Complex., 2023

Batch Proofs are Statistically Hiding.
Electron. Colloquium Comput. Complex., 2023

Control, Confidentiality, and the Right to be Forgotten.
Proceedings of the 2023 ACM SIGSAC Conference on Computer and Communications Security, 2023

2022
Deletion inference, reconstruction, and compliance in machine (un)learning.
Proc. Priv. Enhancing Technol., 2022

Collision-Resistance from Multi-Collision-Resistance.
Electron. Colloquium Comput. Complex., 2022

2021
Conditional Disclosure of Secrets: Amplification, Closure, Amortization, Lower-bounds, and Separations.
SIAM J. Comput., 2021

Public-Coin Statistical Zero-Knowledge Batch Verification against Malicious Verifiers.
Electron. Colloquium Comput. Complex., 2021

2020
On the Power of Statistical Zero Knowledge.
SIAM J. Comput., 2020

Formalizing Data Deletion in the Context of the Right to be Forgotten.
IACR Cryptol. ePrint Arch., 2020

Batch Verification for Statistical Zero Knowledge Proofs.
Electron. Colloquium Comput. Complex., 2020

Cryptography from Information Loss.
Electron. Colloquium Comput. Complex., 2020

2019
Nearly Optimal Robust Secret Sharing against Rushing Adversaries.
IACR Cryptol. ePrint Arch., 2019

Tight Verifiable Delay Functions.
IACR Cryptol. ePrint Arch., 2019

Statistical Difference Beyond the Polarizing Regime.
Electron. Colloquium Comput. Complex., 2019

XOR Codes and Sparse Learning Parity with Noise.
Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms, 2019

2018
Fine-grained cryptography.
PhD thesis, 2018

Leakage Resilient Secret Sharing and Applications.
IACR Cryptol. ePrint Arch., 2018

Proofs of Work from Worst-Case Assumptions.
IACR Cryptol. ePrint Arch., 2018

XOR Codes and Sparse Random Linear Equations with Noise.
Electron. Colloquium Comput. Complex., 2018

Placing Conditional Disclosure of Secrets in the Communication Complexity Universe.
Electron. Colloquium Comput. Complex., 2018

From Laconic Zero-Knowledge to Public-Key Cryptography - Extended Abstract.
Proceedings of the Advances in Cryptology - CRYPTO 2018, 2018

2017
Proofs of Useful Work.
IACR Cryptol. ePrint Arch., 2017

From Laconic Zero-Knowledge to Public-Key Cryptography.
Electron. Colloquium Comput. Complex., 2017

Multi Collision Resistant Hash Functions and their Applications.
Electron. Colloquium Comput. Complex., 2017

Average-Case Fine-Grained Hardness.
Electron. Colloquium Comput. Complex., 2017

2016
Fine-grained Cryptography.
IACR Cryptol. ePrint Arch., 2016

On SZK and PP.
Electron. Colloquium Comput. Complex., 2016

Improvements to Secure Computation with Penalties.
Proceedings of the 2016 ACM SIGSAC Conference on Computer and Communications Security, 2016

2015
From Statistical Zero Knowledge to Secret Sharing.
IACR Cryptol. ePrint Arch., 2015

Secret Sharing and Statistical Zero Knowledge.
Proceedings of the Advances in Cryptology - ASIACRYPT 2015 - 21st International Conference on the Theory and Application of Cryptology and Information Security, Auckland, New Zealand, November 29, 2015


  Loading...