Follow
Arka Rai Choudhuri
Arka Rai Choudhuri
Postdoctoral Researcher, NTT Research
Verified email at ntt-research.com - Homepage
Title
Cited by
Cited by
Year
Fairness in an Unfair World: Fair Multiparty Computation from Public Bulletin Boards
AR Choudhuri, M Green, A Jain, G Kaptchuk, I Miers
Proceedings of the 2017 ACM SIGSAC Conference on Computer and Communications …, 2017
1422017
A New Approach to Round-Optimal Secure Multiparty Computation.
P Ananth, AR Choudhuri, A Jain
Annual International Cryptology Conference CRYPTO 2017, 468-499, 2017
682017
SNARGs for from LWE
AR Choudhuri, A Jain, Z Jin
2021 IEEE 62nd Annual Symposium on Foundations of Computer Science (FOCS), 68-79, 2022
642022
Significantly improved multi-bit differentials for reduced round Salsa and ChaCha
AR Choudhuri, S Maitra
IACR Transactions on Symmetric Cryptology, 261-287, 2016
642016
Round-optimal secure multiparty computation with honest majority
P Ananth, AR Choudhuri, A Goel, A Jain
Advances in Cryptology–CRYPTO 2018: 38th Annual International Cryptology …, 2018
562018
Round optimal secure multiparty computation from minimal assumptions
A Rai Choudhuri, M Ciampi, V Goyal, A Jain, R Ostrovsky
Theory of Cryptography: 18th International Conference, TCC 2020, Durham, NC …, 2020
542020
Finding a Nash equilibrium is no easier than breaking Fiat-Shamir
AR Choudhuri, P Hubáček, C Kamath, K Pietrzak, A Rosen, GN Rothblum
Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing …, 2019
502019
Fluid MPC: secure multiparty computation with dynamic participants
AR Choudhuri, A Goel, M Green, A Jain, G Kaptchuk
Advances in Cryptology–CRYPTO 2021: 41st Annual International Cryptology …, 2021
492021
Non-interactive batch arguments for NP from standard assumptions
AR Choudhuri, A Jain, Z Jin
Annual International Cryptology Conference, 394-423, 2021
382021
PPAD-hardness via iterated squaring modulo a composite
AR Choudhuri, P Hubácek, C Kamath, K Pietrzak, A Rosen, GN Rothblum
Cryptology ePrint Archive, 2019
302019
Two round information-theoretic MPC with malicious security
P Ananth, AR Choudhuri, A Goel, A Jain
Advances in Cryptology–EUROCRYPT 2019: 38th Annual International Conference …, 2019
262019
Founding secure computation on blockchains
AR Choudhuri, V Goyal, A Jain
Advances in Cryptology–EUROCRYPT 2019: 38th Annual International Conference …, 2019
242019
Differential Cryptanalysis of Salsa and ChaCha--An Evaluation with a Hybrid Model
AR Choudhuri, S Maitra
Cryptology ePrint Archive, 2016
182016
Correlation intractability and SNARGs from sub-exponential DDH
AR Choudhuri, S Garg, A Jain, Z Jin, J Zhang
Annual International Cryptology Conference, 635-668, 2023
122023
PPAD is as Hard as LWE and Iterated Squaring
N Bitansky, AR Choudhuri, J Holmgren, C Kamath, A Lombardi, O Paneth, ...
Theory of Cryptography Conference, 593-622, 2022
102022
Oblivious transfer from trapdoor permutations in minimal rounds
AR Choudhuri, M Ciampi, V Goyal, A Jain, R Ostrovsky
Theory of Cryptography: 19th International Conference, TCC 2021, Raleigh, NC …, 2021
72021
Sublonk: Sublinear prover plonk
AR Choudhuri, S Garg, A Goel, S Sekar, R Sinha
IACR Cryptol. ePrint Arch, 902, 2023
32023
Time-deniable signatures
G Beck, AR Choudhuri, M Green, A Jain, PR Tiwari
Proceedings on Privacy Enhancing Technologies 3, 79-102, 2023
32023
Characterizing deterministic-prover zero knowledge
N Bitansky, AR Choudhuri
Theory of Cryptography: 18th International Conference, TCC 2020, Durham, NC …, 2020
22020
Towards Efficiency-Preserving Round Compression in MPC: Do Fewer Rounds Mean More Computation?
P Ananth, AR Choudhuri, A Goel, A Jain
Advances in Cryptology–ASIACRYPT 2020: 26th International Conference on the …, 2020
22020
The system can't perform the operation now. Try again later.
Articles 1–20