Arka Rai Choudhuri

Nexant (United States) — United States

Computer Science · Physical Sciences

13h-index602citations39works4.52yr avg
OpenAlex↗ORCID↗Google Scholar↗Lab page↗

Accepting Students?

No reports yet. Know if this professor is taking students?

Research Topics

Cryptography and Data Security(30), Complexity and Algorithms in Graphs(16), Blockchain Technology Applications and Security(10), Privacy-Preserving Technologies in Data(10), Cryptographic Implementations and Security(8)

Publications39 total

Black-Box Non-interactive Zero Knowledge from Vector Trapdoor Hash
Lecture notes in computer science·2025· 2 cited
Homomorphic Secret Sharing with Verifiable Evaluation
Lecture notes in computer science·2024· 3 cited
SublonK: Sublinear Prover PlonK
Proceedings on Privacy Enhancing Technologies·2024· 4 citedOpen Access
Monotone-Policy Aggregate Signatures
Lecture notes in computer science·2024· 9 cited
Time-Deniable Signatures
Proceedings on Privacy Enhancing Technologies·2023· 7 citedOpen Access
Correlation Intractability and SNARGs from Sub-exponential DDH
Lecture notes in computer science·2023· 40 cited
SNARGs for $\mathcal{P}$ from LWE
2022· 1 cited
PPAD is as Hard as LWE and Iterated Squaring
Lecture notes in computer science·2022· 21 cited
Oblivious Transfer from Trapdoor Permutations in Minimal Rounds
Lecture notes in computer science·2021
Non-interactive Batch Arguments for NP from Standard Assumptions
Lecture notes in computer science·2021· 47 cited
SNARGs for P from LWE.
IACR Cryptology ePrint Archive·2021
Non-Interactive Batch Arguments for NP from Standard Assumptions.
IACR Cryptology ePrint Archive·2021
Fluid MPC: Secure Multiparty Computation with Dynamic Participants
Lecture notes in computer science·2021· 40 cited
The Round Complexity of Secure Computation Against Covert Adversaries
Lecture notes in computer science·2020
Fluid MPC: Secure Multiparty Computation with Dynamic Participants.
IACR Cryptology ePrint Archive·2020· 3 cited
The Round Complexity of Secure Computation Against Covert Adversaries.
IACR Cryptology ePrint Archive·2020
Characterizing Deterministic-Prover Zero Knowledge
Lecture notes in computer science·2020· 4 cited
Characterizing Deterministic-Prover Zero Knowledge.
IACR Cryptology ePrint Archive·2020
Towards Efficiency-Preserving Round Compression in MPC
Lecture notes in computer science·2020· 4 cited
Round Optimal Secure Multiparty Computation from Minimal Assumptions
Lecture notes in computer science·2020· 3 citedOpen Access
page 1 of 2Next →

Frequent Co-authors

Abhishek Jain(28), Aarushi Goel(10), Prabhanjan Ananth(8), Vipul Goyal(7), Matthew Green(5), Zhengzhong Jin(5), Gabriel Kaptchuk(4), Chethan Kamath(4), Subhamoy Maitra(3), Pavel Hubáček(3), Krzysztof Pietrzak(3), Alon Rosen(3), Guy N. Rothblum(3), Michele Ciampi(3), Rafail Ostrovsky(3), Nir Bitansky(3), Ian Miers(2), Sanjam Garg(2), Omer Paneth(2), Jiaheng Zhang(1)