default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDArka Rai Choudhuri
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2025
[c20]Pedro Branco, Arka Rai Choudhuri
, Nico Döttling, Abhishek Jain, Giulio Malavolta, Akshayaram Srinivasan:
Black-Box Non-interactive Zero Knowledge from Vector Trapdoor Hash. EUROCRYPT (4) 2025: 64-92- 2024
- [j3]Arka Rai Choudhuri, Sanjam Garg, Aarushi Goel, Sruthi Sekar, Rohit Sinha:
SublonK: Sublinear Prover PlonK. Proc. Priv. Enhancing Technol. 2024(3): 314-335 (2024) - [c19]Maya Farber Brodsky, Arka Rai Choudhuri, Abhishek Jain, Omer Paneth:
Monotone-Policy Aggregate Signatures. EUROCRYPT (4) 2024: 168-195 - [c18]Arka Rai Choudhuri, Aarushi Goel, Aditya Hegde, Abhishek Jain:
Homomorphic Secret Sharing with Verifiable Evaluation. TCC (4) 2024: 614-650 - [c17]Arka Rai Choudhuri, Sanjam Garg, Julien Piet, Guru-Vamsi Policharla:
Mempool Privacy via Batched Threshold Encryption: Attacks and Defenses. USENIX Security Symposium 2024 - [i27]Arka Rai Choudhuri, Sanjam Garg, Julien Piet, Guru-Vamsi Policharla:
Mempool Privacy via Batched Threshold Encryption: Attacks and Defenses. IACR Cryptol. ePrint Arch. 2024: 669 (2024) - [i26]Maya Farber Brodsky, Arka Rai Choudhuri, Abhishek Jain, Omer Paneth:
Monotone-Policy Aggregate Signatures. IACR Cryptol. ePrint Arch. 2024: 899 (2024) - [i25]Pedro Branco, Arka Rai Choudhuri, Nico Döttling, Abhishek Jain, Giulio Malavolta, Akshayaram Srinivasan:
Black-Box Non-Interactive Zero Knowledge from Vector Trapdoor Hash. IACR Cryptol. ePrint Arch. 2024: 1514 (2024) - [i24]Arka Rai Choudhuri, Sanjam Garg, Guru-Vamsi Policharla, Mingyuan Wang:
Practical Mempool Privacy via One-time Setup Batched Threshold Encryption. IACR Cryptol. ePrint Arch. 2024: 1516 (2024) - 2023
- [j2]Gabrielle Beck, Arka Rai Choudhuri, Matthew Green, Abhishek Jain, Pratyush Ranjan Tiwari:
Time-Deniable Signatures. Proc. Priv. Enhancing Technol. 2023(3): 79-102 (2023) - [c16]Arka Rai Choudhuri, Sanjam Garg, Abhishek Jain, Zhengzhong Jin, Jiaheng Zhang:
Correlation Intractability and SNARGs from Sub-exponential DDH. CRYPTO (4) 2023: 635-668 - [i23]Arka Rai Choudhuri, Sanjam Garg, Aarushi Goel, Sruthi Sekar, Rohit Sinha:
SublonK: Sublinear Prover PlonK. IACR Cryptol. ePrint Arch. 2023: 902 (2023) - 2022
- [c15]Nir Bitansky, Arka Rai Choudhuri, Justin Holmgren, Chethan Kamath, Alex Lombardi, Omer Paneth, Ron D. Rothblum:
PPAD is as Hard as LWE and Iterated Squaring. TCC (2) 2022: 593-622 - [i22]Gabrielle Beck, Arka Rai Choudhuri, Matthew Green, Abhishek Jain, Pratyush Ranjan Tiwari:
Time-Deniable Signatures. IACR Cryptol. ePrint Arch. 2022: 1018 (2022) - [i21]Nir Bitansky, Arka Rai Choudhuri, Justin Holmgren, Chethan Kamath, Alex Lombardi, Omer Paneth, Ron D. Rothblum:
PPAD is as Hard as LWE and Iterated Squaring. IACR Cryptol. ePrint Arch. 2022: 1272 (2022) - [i20]Arka Rai Choudhuri, Sanjam Garg, Abhishek Jain, Zhengzhong Jin, Jiaheng Zhang:
Correlation Intractability and SNARGs from Sub-exponential DDH. IACR Cryptol. ePrint Arch. 2022: 1486 (2022) - 2021
- [c14]Arka Rai Choudhuri, Aarushi Goel, Matthew Green, Abhishek Jain, Gabriel Kaptchuk:
Fluid MPC: Secure Multiparty Computation with Dynamic Participants. CRYPTO (2) 2021: 94-123 - [c13]Arka Rai Choudhuri, Abhishek Jain, Zhengzhong Jin:
Non-interactive Batch Arguments for NP from Standard Assumptions. CRYPTO (4) 2021: 394-423 - [c12]Arka Rai Choudhuri, Abhishek Jain, Zhengzhong Jin:
SNARGs for $\mathcal{P}$ from LWE. FOCS 2021: 68-79 - [c11]Arka Rai Choudhuri, Michele Ciampi, Vipul Goyal, Abhishek Jain, Rafail Ostrovsky:
Oblivious Transfer from Trapdoor Permutations in Minimal Rounds. TCC (2) 2021: 518-549 - [i19]Arka Rai Choudhuri, Abhishek Jain, Zhengzhong Jin:
Non-Interactive Batch Arguments for NP from Standard Assumptions. IACR Cryptol. ePrint Arch. 2021: 807 (2021) - [i18]Arka Rai Choudhuri, Abhishek Jain, Zhengzhong Jin:
SNARGs for P from LWE. IACR Cryptol. ePrint Arch. 2021: 808 (2021) - [i17]Arka Rai Choudhuri, Michele Ciampi, Vipul Goyal, Abhishek Jain, Rafail Ostrovsky:
Oblivious Transfer from Trapdoor Permutations in Minimal Rounds. IACR Cryptol. ePrint Arch. 2021: 1433 (2021) - 2020
- [c10]Prabhanjan Ananth, Arka Rai Choudhuri, Aarushi Goel, Abhishek Jain:
Towards Efficiency-Preserving Round Compression in MPC - Do Fewer Rounds Mean More Computation? ASIACRYPT (3) 2020: 181-212 - [c9]Arka Rai Choudhuri, Vipul Goyal, Abhishek Jain:
The Round Complexity of Secure Computation Against Covert Adversaries. SCN 2020: 600-620 - [c8]Arka Rai Choudhuri, Michele Ciampi, Vipul Goyal, Abhishek Jain, Rafail Ostrovsky:
Round Optimal Secure Multiparty Computation from Minimal Assumptions. TCC (2) 2020: 291-319 - [c7]Nir Bitansky, Arka Rai Choudhuri:
Characterizing Deterministic-Prover Zero Knowledge. TCC (1) 2020: 535-566 - [i16]Arka Rai Choudhuri, Aarushi Goel, Matthew Green, Abhishek Jain, Gabriel Kaptchuk:
Fluid MPC: Secure Multiparty Computation with Dynamic Participants. IACR Cryptol. ePrint Arch. 2020: 754 (2020) - [i15]Arka Rai Choudhuri, Vipul Goyal, Abhishek Jain:
The Round Complexity of Secure Computation Against Covert Adversaries. IACR Cryptol. ePrint Arch. 2020: 1092 (2020) - [i14]Prabhanjan Ananth, Arka Rai Choudhuri, Aarushi Goel, Abhishek Jain:
Towards Efficiency-Preserving Round Compression in MPC: Do fewer rounds mean more computation? IACR Cryptol. ePrint Arch. 2020: 1100 (2020) - [i13]Nir Bitansky, Arka Rai Choudhuri:
Characterizing Deterministic-Prover Zero Knowledge. IACR Cryptol. ePrint Arch. 2020: 1160 (2020)
2010 – 2019
- 2019
- [c6]Arka Rai Choudhuri, Vipul Goyal, Abhishek Jain:
Founding Secure Computation on Blockchains. EUROCRYPT (2) 2019: 351-380 - [c5]Prabhanjan Ananth, Arka Rai Choudhuri, Aarushi Goel, Abhishek Jain:
Two Round Information-Theoretic MPC with Malicious Security. EUROCRYPT (2) 2019: 532-561 - [c4]Arka Rai Choudhuri, Pavel Hubácek, Chethan Kamath, Krzysztof Pietrzak, Alon Rosen, Guy N. Rothblum:
Finding a Nash equilibrium is no easier than breaking Fiat-Shamir. STOC 2019: 1103-1114 - [i12]Arka Rai Choudhuri, Pavel Hubácek, Chethan Kamath, Krzysztof Pietrzak, Alon Rosen, Guy N. Rothblum:
Finding a Nash Equilibrium Is No Easier Than Breaking Fiat-Shamir. Electron. Colloquium Comput. Complex. TR19 (2019) - [i11]Arka Rai Choudhuri, Michele Ciampi, Vipul Goyal, Abhishek Jain, Rafail Ostrovsky:
On Round Optimal Secure Multiparty Computation from Minimal Assumptions. IACR Cryptol. ePrint Arch. 2019: 216 (2019) - [i10]Arka Rai Choudhuri, Vipul Goyal, Abhishek Jain:
Founding Secure Computation on Blockchains. IACR Cryptol. ePrint Arch. 2019: 253 (2019) - [i9]Arka Rai Choudhuri, Pavel Hubácek, Chethan Kamath, Krzysztof Pietrzak, Alon Rosen, Guy N. Rothblum:
Finding a Nash Equilibrium Is No Easier Than Breaking Fiat-Shamir. IACR Cryptol. ePrint Arch. 2019: 549 (2019) - [i8]Arka Rai Choudhuri, Pavel Hubácek, Chethan Kamath, Krzysztof Pietrzak, Alon Rosen, Guy N. Rothblum:
PPAD-Hardness via Iterated Squaring Modulo a Composite. IACR Cryptol. ePrint Arch. 2019: 667 (2019) - 2018
- [c3]Prabhanjan Ananth, Arka Rai Choudhuri, Aarushi Goel, Abhishek Jain:
Round-Optimal Secure Multiparty Computation with Honest Majority. CRYPTO (2) 2018: 395-424 - [i7]Prabhanjan Ananth, Arka Rai Choudhuri, Aarushi Goel, Abhishek Jain:
Round-Optimal Secure Multiparty Computation with Honest Majority. IACR Cryptol. ePrint Arch. 2018: 572 (2018) - [i6]Prabhanjan Ananth, Arka Rai Choudhuri, Aarushi Goel, Abhishek Jain:
Two Round Information-Theoretic MPC with Malicious Security. IACR Cryptol. ePrint Arch. 2018: 1078 (2018) - 2017
- [c2]Arka Rai Choudhuri, Matthew Green, Abhishek Jain, Gabriel Kaptchuk, Ian Miers:
Fairness in an Unfair World: Fair Multiparty Computation from Public Bulletin Boards. CCS 2017: 719-728 - [c1]Prabhanjan Ananth, Arka Rai Choudhuri, Abhishek Jain:
A New Approach to Round-Optimal Secure Multiparty Computation. CRYPTO (1) 2017: 468-499 - [i5]Prabhanjan Ananth, Arka Rai Choudhuri, Abhishek Jain:
A New Approach to Round-Optimal Secure Multiparty Computation. IACR Cryptol. ePrint Arch. 2017: 402 (2017) - [i4]Arka Rai Choudhuri, Matthew Green, Abhishek Jain, Gabriel Kaptchuk, Ian Miers:
Fairness in an Unfair World: Fair Multiparty Computation from public Bulletin Boards. IACR Cryptol. ePrint Arch. 2017: 1091 (2017) - 2016
- [j1]Arka Rai Choudhuri, Subhamoy Maitra:
Significantly Improved Multi-bit Differentials for Reduced Round Salsa and ChaCha. IACR Trans. Symmetric Cryptol. 2016(2): 261-287 (2016) - [i3]Arka Rai Choudhuri, Subhamoy Maitra:
Differential Cryptanalysis of Salsa and ChaCha - An Evaluation with a Hybrid Model. IACR Cryptol. ePrint Arch. 2016: 377 (2016) - [i2]Arka Rai Choudhuri, Subhamoy Maitra:
Significantly Improved Multi-bit Differentials for Reduced Round Salsa and ChaCha. IACR Cryptol. ePrint Arch. 2016: 1034 (2016) - 2015
- [i1]Arka Rai Choudhuri, S. Kalyanasundaram, Shriyak Sridhar, Annappa B.:
An Incentivized Approach for Fair Participation in Wireless Ad hoc Networks. CoRR abs/1503.01314 (2015)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-05-12 21:42 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
