Arka Rai Choudhuri

Arka Rai Choudhuri

Johns Hopkins University

H-index: 13

North America-United States

About Arka Rai Choudhuri

Arka Rai Choudhuri, With an exceptional h-index of 13 and a recent h-index of 13 (since 2020), a distinguished researcher at Johns Hopkins University, specializes in the field of Cryptography.

His recent articles reflect a diverse array of research interests and contributions to the field:

Mempool Privacy via Batched Threshold Encryption: Attacks and Defenses

Correlation intractability and SNARGs from sub-exponential DDH

Sublonk: Sublinear prover plonk

Time-deniable signatures

PPAD is as Hard as LWE and Iterated Squaring

SNARGs for from LWE

Pursuing the Limits of Cryptography

Non-interactive batch arguments for NP from standard assumptions

Arka Rai Choudhuri Information

University

Position

Graduate Student

Citations(all)

695

Citations(since 2020)

655

Cited By

247

hIndex(all)

13

hIndex(since 2020)

13

i10Index(all)

14

i10Index(since 2020)

14

Email

University Profile Page

Google Scholar

Arka Rai Choudhuri Skills & Research Interests

Cryptography

Top articles of Arka Rai Choudhuri

Mempool Privacy via Batched Threshold Encryption: Attacks and Defenses

Cryptology ePrint Archive

2024

Arka Rai Choudhuri
Arka Rai Choudhuri

H-Index: 9

Sanjam Garg
Sanjam Garg

H-Index: 32

Correlation intractability and SNARGs from sub-exponential DDH

2023/8/9

Sublonk: Sublinear prover plonk

Cryptology ePrint Archive

2023

Arka Rai Choudhuri
Arka Rai Choudhuri

H-Index: 9

Sanjam Garg
Sanjam Garg

H-Index: 32

Time-deniable signatures

Proceedings on Privacy Enhancing Technologies

2023

PPAD is as Hard as LWE and Iterated Squaring

2022/11/7

SNARGs for from LWE

2022/2/7

Arka Rai Choudhuri
Arka Rai Choudhuri

H-Index: 9

Zhengzhong Jin
Zhengzhong Jin

H-Index: 4

Pursuing the Limits of Cryptography

2021/12/10

Arka Rai Choudhuri
Arka Rai Choudhuri

H-Index: 9

Non-interactive batch arguments for NP from standard assumptions

2021/8/16

Oblivious transfer from trapdoor permutations in minimal rounds

2021

Fluid MPC: secure multiparty computation with dynamic participants

2021

Characterizing deterministic-prover zero knowledge

2020

Nir Bitansky
Nir Bitansky

H-Index: 24

Arka Rai Choudhuri
Arka Rai Choudhuri

H-Index: 9

Towards Efficiency-Preserving Round Compression in MPC: Do Fewer Rounds Mean More Computation?

2020

The Round Complexity of Secure Computation Against Covert Adversaries

2020/9/14

Round optimal secure multiparty computation from minimal assumptions

2020

See List of Professors in Arka Rai Choudhuri University(Johns Hopkins University)

Co-Authors

academic-engine