Arka Rai Choudhuri

Orcid: 0000-0003-0452-3426

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

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
SublonK: Sublinear Prover PlonK.
Proc. Priv. Enhancing Technol., 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.
IACR Cryptol. ePrint Arch., 2024

Monotone-Policy Aggregate Signatures.
IACR Cryptol. ePrint Arch., 2024

Black-Box Non-Interactive Zero Knowledge from Vector Trapdoor Hash.
IACR Cryptol. ePrint Arch., 2024

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

2023
Time-Deniable Signatures.
Proc. Priv. Enhancing Technol., July, 2023

2022
Correlation Intractability and SNARGs from Sub-exponential DDH.
IACR Cryptol. ePrint Arch., 2022

PPAD is as Hard as LWE and Iterated Squaring.
IACR Cryptol. ePrint Arch., 2022

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

Non-Interactive Batch Arguments for NP from Standard Assumptions.
IACR Cryptol. ePrint Arch., 2021

Oblivious Transfer from Trapdoor Permutations in Minimal Rounds.
IACR Cryptol. ePrint Arch., 2021

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

2020
The Round Complexity of Secure Computation Against Covert Adversaries.
IACR Cryptol. ePrint Arch., 2020

Fluid MPC: Secure Multiparty Computation with Dynamic Participants.
IACR Cryptol. ePrint Arch., 2020

Characterizing Deterministic-Prover Zero Knowledge.
IACR Cryptol. ePrint Arch., 2020

Towards Efficiency-Preserving Round Compression in MPC: Do fewer rounds mean more computation?
IACR Cryptol. ePrint Arch., 2020

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

Founding Secure Computation on Blockchains.
IACR Cryptol. ePrint Arch., 2019

On Round Optimal Secure Multiparty Computation from Minimal Assumptions.
IACR Cryptol. ePrint Arch., 2019

Finding a Nash Equilibrium Is No Easier Than Breaking Fiat-Shamir.
Electron. Colloquium Comput. Complex., 2019

2018
Two Round Information-Theoretic MPC with Malicious Security.
IACR Cryptol. ePrint Arch., 2018

Round-Optimal Secure Multiparty Computation with Honest Majority.
IACR Cryptol. ePrint Arch., 2018

2017
Fairness in an Unfair World: Fair Multiparty Computation from public Bulletin Boards.
IACR Cryptol. ePrint Arch., 2017

A New Approach to Round-Optimal Secure Multiparty Computation.
IACR Cryptol. ePrint Arch., 2017

2016
Significantly Improved Multi-bit Differentials for Reduced Round Salsa and ChaCha.
IACR Trans. Symmetric Cryptol., 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...