Adaptively secure MPC with sublinear communication complexity

DOI10.1007/978-3-030-26951-7_2zbMath1483.68134OpenAlexW2968553806MaRDI QIDQ5919496

Abhi Shelat, Ran Cohen, Daniel Wichs

Publication date: 9 March 2020

Published in: Advances in Cryptology – CRYPTO 2019 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-030-26951-7_2

Mathematics Subject Classification ID

Cryptography (94A60) Communication complexity, information complexity (68Q11)

Related Items (11)

Round-optimal and communication-efficient multiparty computation ⋮ Adaptively secure computation for RAM programs ⋮ Triply adaptive UC NIZK ⋮ Two-round adaptively secure MPC from isogenies, LPN, or CDH ⋮ Completeness theorems for adaptively secure broadcast ⋮ Secure MPC: laziness leads to GOD ⋮ Adaptive security of multi-party protocols, revisited ⋮ Round-preserving parallel composition of probabilistic-termination cryptographic protocols ⋮ Compact designated verifier NIZKs from the CDH assumption without pairings ⋮ Compact NIZKs from standard assumptions on bilinear maps ⋮ Broadcast-optimal two-round MPC

This page was built for publication: Adaptively secure MPC with sublinear communication complexity