Robust Multiparty Computation with Linear Communication Complexity
From MaRDI portal
Publication:5756628
DOI10.1007/11818175_28zbMath1129.94307MaRDI 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
94A60: Cryptography
68P30: Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science)
Related Items
Counting Method for Multi-party Computation over Non-abelian Groups, Efficient perfectly secure computation with optimal resilience, Efficient perfectly secure computation with optimal resilience, Fast large-scale honest-majority MPC for malicious adversaries, Network-agnostic security comes (almost) for free in DKG and MPC, On the Amortized Communication Complexity of Byzantine Broadcast, Order-C secure multiparty computation for highly repetitive circuits, Towards efficiency-preserving round compression in MPC. Do fewer rounds mean more computation?, On communication-efficient asynchronous MPC with adaptive security, Linear Overhead Optimally-Resilient Robust MPC Using Preprocessing, The Cost of Fault Tolerance in Multi-Party Communication Complexity, Graph Design for Secure Multiparty Computation over Non-Abelian Groups