Lecture notes in computer science

Efficient Constant-Round MPC with Identifiable Abort and Public Verifiability

Carsten Baum, Emmanuela Orsini, Peter Schöll, Eduardo Soria-Vázquez

Published Jan 1, 2020• 38 citations

Related papers

Efficient Scalable Constant-Round MPC via Garbled Circuits

Aner Ben-Efraim, Yehuda Lindell, Eran Omri

Multi-committee MPC: From Unanimous to Identifiable Abort

Lichun Li, Hongqing Liu, Jiawei Ni +2 more

Towards Building Scalable Constant-Round MPC from Minimal Assumptions via Round Collapsing

Vipul Goyal, Junru Li, Rafail Ostrovsky +1 more

Constant-Round MPC with Fairness and Guarantee of Output Delivery

Steven Gordon, Feng-Hao Liu, Elaine Shi

Constant-Round MPC Protocols with Fall-Back Security

Anasuya Acharya, Aditya Patankar, Arpita Patra +2 more

Efficient Compiler to Covert Security with Public Verifiability for Honest Majority MPC

Thomas Attema, Vincent Dunning, Maarten H. Everts +1 more