Two round information-theoretic MPC with malicious security

DOI10.1007/978-3-030-17656-3_19OpenAlexW2885740921MaRDI QIDQ2292884

Abhishek Jain, Arka Rai Choudhuri, Aarushi Goel, Prabhanjan V. Ananth

Publication date: 6 February 2020

Full work available at URL: https://doi.org/10.1007/978-3-030-17656-3_19

Mathematics Subject Classification ID

Cryptography (94A60) Computer system organization (68Mxx) Theory of data (68Pxx)

Related Items (12)

Broadcast-optimal two round MPC with an honest majority ⋮ Round-optimal multi-party computation with identifiable abort ⋮ Minimizing setup in broadcast-optimal two round MPC ⋮ mrNISC from LWE with polynomial modulus ⋮ mrNISC from LWE with polynomial modulus ⋮ Towards efficiency-preserving round compression in MPC. Do fewer rounds mean more computation? ⋮ Round-efficient Byzantine agreement and multi-party computation with asynchronous fallback ⋮ On actively-secure elementary MPC reductions ⋮ On communication models and best-achievable security in two-round MPC ⋮ On the exact round complexity of secure three-party computation ⋮ Black-box transformations from passive to covert security with public verifiability ⋮ Broadcast-optimal two-round MPC

This page was built for publication: Two round information-theoretic MPC with malicious security