Constant-Round MPC with Fairness and Guarantee of Output Delivery

From MaRDI portal
Publication:3457060

DOI10.1007/978-3-662-48000-7_4zbMath1351.94047OpenAlexW1440872534MaRDI QIDQ3457060

S. Dov Gordon, Feng-Hao Liu, Elaine Shi

Publication date: 10 December 2015

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-662-48000-7_4




Related Items (23)

Broadcast-optimal two round MPC with an honest majorityThree-round secure multiparty computation from black-box two-round oblivious transferTwo-round MPC: information-theoretic and black-boxTwo-round adaptively secure multiparty computation from standard assumptionsAn improved affine equivalence algorithm for random permutationsMinimizing setup in broadcast-optimal two round MPCRound-optimal honest-majority MPC in Minicrypt and with everlasting security (extended abstract)Two-round MPC without round collapsing revisited -- towards efficient malicious protocolsOn the exact round complexity of best-of-both-worlds multi-party computationSecure MPC: laziness leads to GODOn communication models and best-achievable security in two-round MPCFoundations of Homomorphic Secret SharingOffline witness encryption with semi-adaptive securityBeyond honest majority: the round complexity of fair and robust multi-party computationThe round complexity of statistical MPC with optimal resiliencyOn the exact round complexity of secure three-party computationRound-preserving parallel composition of probabilistic-termination cryptographic protocolsAdaptively secure MPC with sublinear communication complexityMultiparty reusable non-interactive secure computation from LWEUnbounded multi-party computation from learning with errorsProbabilistic Termination and Composability of Cryptographic ProtocolsProbabilistic termination and composability of cryptographic protocolsBroadcast-optimal two-round MPC







This page was built for publication: Constant-Round MPC with Fairness and Guarantee of Output Delivery