On the exact round complexity of secure three-party computation
From MaRDI portal
Publication:5916237
DOI10.1007/978-3-319-96881-0_15zbMath1436.94086OpenAlexW2809697729MaRDI QIDQ5916237
Publication date: 26 September 2018
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-319-96881-0_15
Related Items (10)
Broadcast-optimal two round MPC with an honest majority ⋮ Minimizing setup in broadcast-optimal two round MPC ⋮ Verifiable relation sharing and multi-verifier zero-knowledge in two rounds: trading NIZKs with honest majority (extended abstract) ⋮ Round-optimal honest-majority MPC in Minicrypt and with everlasting security (extended abstract) ⋮ On the exact round complexity of best-of-both-worlds multi-party computation ⋮ Efficient fully secure computation via distributed zero-knowledge proofs ⋮ On communication models and best-achievable security in two-round MPC ⋮ Beyond honest majority: the round complexity of fair and robust multi-party computation ⋮ Adaptively secure MPC with sublinear communication complexity ⋮ Broadcast-optimal two-round MPC
This page was built for publication: On the exact round complexity of secure three-party computation
