Unpublished Manuscripts
- Practical Mempool Privacy via One-time Setup Batched Threshold Encryption [eprint]
Arka Rai Choudhuri, Sanjam Garg, Guru-Vamsi Policharla, Mingyuan Wang
eprint 2024
- Black-Box Non-Interactive Zero Knowledge from Vector Trapdoor Hash [eprint]
Pedro Branco, Arka Rai Choudhuri, Nico Döttling, Abhishek Jain, Giulio Malavolta, Akshayaram Srinivasan
eprint 2024
- PPAD-Hardness via Iterated Squaring Modulo a Composite [eprint]
Arka Rai Choudhuri, Pavel Hubáček, Chethan Kamath, Krzysztof Pietrzak, Alon Rosen, Guy Rothblum
eprint 2019
- Differential Cryptanalysis of Salsa and ChaCha -- An Evaluation with a Hybrid Model [eprint][show summary]
Arka Rai Choudhuri, Subhamoy Maitra
eprint 2016
In an attempt to provide greater conjectured security into Salsa and ChaCha, an unnecessarily high number of rounds are prescribed for the ciphers, sacrificing performance. Taking into account the existing differential attacks on reduced versions of Salsa and ChaCha, we propose a hybrid model, a simple tool to evaluate the security of ARX based constructions. We show, under certain assumptions, only 12 rounds of Salsa and ChaCha can be considered sufficient instead of the 20 proposed in these standards.
- Homomorphic Secret Sharing with Verifiable Evaluation
Arka Rai Choudhuri, Aarushi Goel, Aditya Hegde, Abhishek Jain
TCC 2024
- Monotone-Policy Aggregate Signatures [eprint]
Maya Farber Brodsky, Arka Rai Choudhuri, Abhishek Jain, Omer Paneth
EUROCRYPT 2024
- Mempool Privacy via Batched Threshold Encryption: Attacks and Defenses [eprint]
Arka Rai Choudhuri, Sanjam Garg, Julien Piet, Guru-Vamsi Policharla
USENIX Security 2024
- $\mathcal{S}\mathfrak{ublon}\mathcal{K}$: Sublinear Prover $\mathcal{P} \mathfrak{lon}\mathcal{K}$ [eprint]
Arka Rai Choudhuri, Sanjam Garg, Aarushi Goel, Sruthi Sekar, Rohit Sinha
PoPETS 2024
- Correlation Intractability and SNARGs from Sub-exponential DDH [eprint]
Arka Rai Choudhuri, Sanjam Garg, Abhishek Jain, Zhengzhong Jin, Jiaheng Zhang
CRYPTO 2023
- Time-Deniable Signatures [eprint]
Gabrielle Beck, Arka Rai Choudhuri, Matthew Green, Abhishek Jain, Pratyush Ranjan Tiwari
PoPETS 2023
- PPAD is as Hard as LWE and Iterated Squaring [eprint]
Nir Bitansky, Arka Rai Choudhuri, Justin Holmgren, Chethan Kamath, Alex Lombardi, Omer Paneth, Ron D. Rothblum
TCC 2022
- Oblivious Transfer from Trapdoor Permutations in Minimal Rounds [eprint]
Arka Rai Choudhuri, Michele Ciampi, Vipul Goyal, Abhishek Jain, Rafail Ostrovsky
TCC 2021
- SNARGs for $\mathcal{P}$ from LWE [eprint]
Arka Rai Choudhuri, Abhishek Jain, Zhengzhong Jin
FOCS 2021
Invited to the SIAM Journal of Computing Special Issue
- Non-Interactive Batch Arguments for NP from Standard Assumptions [eprint]
Arka Rai Choudhuri, Abhishek Jain, Zhengzhong Jin
CRYPTO 2021
- Fluid MPC: Secure Multiparty Computation with Dynamic Participants [eprint]
Arka Rai Choudhuri, Aarushi Goel, Matthew Green, Abhishek Jain, Gabriel Kaptchuk
CRYPTO 2021
- Characterizing Deterministic-Prover Zero Knowledge [eprint]
Nir Bitansky, Arka Rai Choudhuri
TCC 2020
- Round Optimal Secure Multiparty Computation from Minimal Assumptions [eprint]
Arka Rai Choudhuri, Michele Ciampi, Vipul Goyal, Abhishek Jain, Rafail Ostrovsky
TCC 2020
- Towards Efficiency-Preserving Round Compression in MPC: Do fewer rounds mean more computation? [eprint]
Prabhanjan Ananth, Arka Rai Choudhuri, Aarushi Goel, Abhishek Jain
ASIACRYPT 2020
- The Round Complexity of Secure Computation Against Covert Adversaries [eprint]
Arka Rai Choudhuri, Vipul Goyal, Abhishek Jain
SCN 2020
- Finding a Nash Equilibrium is No Easier than Breaking Fiat-Shamir [eprint][ECCC]
Arka Rai Choudhuri, Pavel Hubáček, Chethan Kamath, Krzysztof Pietrzak, Alon Rosen, Guy Rothblum
STOC 2019
- Founding Secure Computation on Blockchains [eprint]
Arka Rai Choudhuri, Vipul Goyal, Abhishek Jain
EUROCRYPT 2019
- Two Round Information-Theoretic MPC with Malicious Security [eprint]
Prabhanjan Ananth, Arka Rai Choudhuri, Aarushi Goel, Abhishek Jain
EUROCRYPT 2019
- Round-Optimal Secure Multiparty Computation with Honest Majority [eprint]
Prabhanjan Ananth, Arka Rai Choudhuri, Aarushi Goel, Abhishek Jain
CRYPTO 2018
- Fairness in an Unfair World: Fair Multiparty Computation from Public Bulletin Boards [eprint]
Arka Rai Choudhuri, Matthew Green, Abhishek Jain, Gabriel Kaptchuk, Ian Miers
CCS 2017
- A New Approach to Round-Optimal Secure Multiparty Computation [eprint]
Prabhanjan Ananth, Arka Rai Choudhuri, Abhishek Jain
CRYPTO 2017
- Significantly Improved Multi-bit Differentials for Reduced Round Salsa and ChaCha [eprint][show summary]
Arka Rai Choudhuri, Subhamoy Maitra
FSE 2017 / ToSC 2016
In this work, we study how changes in a single bit of the starting cipher state of Salsa and ChaCha propagates biases in other bits of the cipher state. While these biases dissipate in just a few rounds of these ciphers, we show that by carefully choosing a combination of bits from the state, one is able to see strong biases that had previously been missed. These biases are then exploited to show weaknesses in the reduced round version of Salsa and ChaCha, improving the best known key recovery attacks on 8 rounds of Salsa and 7 round of ChaCha, and for the first time providing practical attacks on 6 rounds of Salsa and 5 rounds of ChaCha. Our observations can be viewed through the lens of differential-linear cryptanalysis and we present it as such in the paper.
- Pursuing the Limits of Cryptography [Thesis]
Ph.D. Thesis, December 2021