Robust Multiparty Computation with Linear Communication Complexity

DOI10.1007/11818175_28zbMath1129.94307OpenAlexW1503696148MaRDI QIDQ5756628

Jesper Buus Nielsen, Martin Hirt

Publication date: 4 September 2007

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

Full work available at URL: https://doi.org/10.1007/11818175_28

Mathematics Subject Classification ID

Cryptography (94A60) Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30)

Related Items (12)

The Cost of Fault Tolerance in Multi-Party Communication Complexity ⋮ Network-agnostic security comes (almost) for free in DKG and MPC ⋮ On the Amortized Communication Complexity of Byzantine Broadcast ⋮ Towards efficiency-preserving round compression in MPC. Do fewer rounds mean more computation? ⋮ On communication-efficient asynchronous MPC with adaptive security ⋮ Fast large-scale honest-majority MPC for malicious adversaries ⋮ Graph Design for Secure Multiparty Computation over Non-Abelian Groups ⋮ Efficient perfectly secure computation with optimal resilience ⋮ Efficient perfectly secure computation with optimal resilience ⋮ Order-C secure multiparty computation for highly repetitive circuits ⋮ Linear Overhead Optimally-Resilient Robust MPC Using Preprocessing ⋮ Counting Method for Multi-party Computation over Non-abelian Groups

This page was built for publication: Robust Multiparty Computation with Linear Communication Complexity