Arka Rai Choudhuri

Orcid: 0000-0003-0452-3426

According to our database1, Arka Rai Choudhuri authored at least 29 papers between 2015 and 2025.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2025
BEAST-MEV: Batched Threshold Encryption with Silent Setup for MEV prevention.
IACR Cryptol. ePrint Arch., 2025

Black-Box Non-interactive Zero Knowledge from Vector Trapdoor Hash.
Proceedings of the Advances in Cryptology - EUROCRYPT 2025, 2025

2024
Practical Mempool Privacy via One-time Setup Batched Threshold Encryption.
IACR Cryptol. ePrint Arch., 2024

Mempool Privacy via Batched Threshold Encryption: Attacks and Defenses.
Proceedings of the 33rd USENIX Security Symposium, 2024

Homomorphic Secret Sharing with Verifiable Evaluation.
Proceedings of the Theory of Cryptography - 22nd International Conference, 2024

Monotone-Policy Aggregate Signatures.
Proceedings of the Advances in Cryptology - EUROCRYPT 2024, 2024

2023
SublonK: Sublinear Prover PlonK.
IACR Cryptol. ePrint Arch., 2023

Correlation Intractability and SNARGs from Sub-exponential DDH.
Proceedings of the Advances in Cryptology - CRYPTO 2023, 2023

2022
Time-Deniable Signatures.
IACR Cryptol. ePrint Arch., 2022

PPAD is as Hard as LWE and Iterated Squaring.
Proceedings of the Theory of Cryptography - 20th International Conference, 2022

2021
SNARGs for <i>P</i> from LWE.
IACR Cryptol. ePrint Arch., 2021

Oblivious Transfer from Trapdoor Permutations in Minimal Rounds.
Proceedings of the Theory of Cryptography - 19th International Conference, 2021

SNARGs for $\mathcal{P}$ from LWE.
Proceedings of the 62nd IEEE Annual Symposium on Foundations of Computer Science, 2021

Non-interactive Batch Arguments for NP from Standard Assumptions.
Proceedings of the Advances in Cryptology - CRYPTO 2021, 2021

Fluid MPC: Secure Multiparty Computation with Dynamic Participants.
Proceedings of the Advances in Cryptology - CRYPTO 2021, 2021

2020
Round Optimal Secure Multiparty Computation from Minimal Assumptions.
Proceedings of the Theory of Cryptography - 18th International Conference, 2020

Characterizing Deterministic-Prover Zero Knowledge.
Proceedings of the Theory of Cryptography - 18th International Conference, 2020

The Round Complexity of Secure Computation Against Covert Adversaries.
Proceedings of the Security and Cryptography for Networks - 12th International Conference, 2020

Towards Efficiency-Preserving Round Compression in MPC - Do Fewer Rounds Mean More Computation?
Proceedings of the Advances in Cryptology - ASIACRYPT 2020, 2020

2019
PPAD-Hardness via Iterated Squaring Modulo a Composite.
IACR Cryptol. ePrint Arch., 2019

Finding a Nash equilibrium is no easier than breaking Fiat-Shamir.
Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing, 2019

Founding Secure Computation on Blockchains.
Proceedings of the Advances in Cryptology - EUROCRYPT 2019, 2019

Two Round Information-Theoretic MPC with Malicious Security.
Proceedings of the Advances in Cryptology - EUROCRYPT 2019, 2019

2018
Round-Optimal Secure Multiparty Computation with Honest Majority.
Proceedings of the Advances in Cryptology - CRYPTO 2018, 2018

2017
A New Approach to Round-Optimal Secure Multiparty Computation.
Proceedings of the Advances in Cryptology - CRYPTO 2017, 2017

Fairness in an Unfair World: Fair Multiparty Computation from Public Bulletin Boards.
Proceedings of the 2017 ACM SIGSAC Conference on Computer and Communications Security, 2017

2016
Significantly Improved Multi-bit Differentials for Reduced Round Salsa and ChaCha.
IACR Cryptol. ePrint Arch., 2016

Differential Cryptanalysis of Salsa and ChaCha - An Evaluation with a Hybrid Model.
IACR Cryptol. ePrint Arch., 2016

2015
An Incentivized Approach for Fair Participation in Wireless Ad hoc Networks.
CoRR, 2015


  Loading...