Robust Multiparty Computation with Linear Communication Complexity

DOI10.1007/11818175_28MaRDI QIDQ5756628zbMATH OpenOpenAlexFDO

Authors Martin Hirt, Jesper Buus Nielsen

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)

Recommendations

• scientific article; zbMATH DE number 1842487
• Scalable and Unconditionally Secure Multiparty Computation
• Upper Bounds on the Communication Complexity of Optimally Resilient Cryptographic Multiparty Computation
• Perfectly-Secure MPC with Linear Communication Complexity
• Scalable Multiparty Computation with Nearly Optimal Work and Resilience

Cited in

(26)

• HARTS: high-threshold, adaptively secure, and robust threshold Schnorr signatures
• Efficient perfectly secure computation with optimal resilience
• Efficient perfectly secure computation with optimal resilience
• Lightweight asynchronous verifiable secret sharing with optimal resilience
• Communication Locality in Secure Multi-party Computation
• On communication-efficient asynchronous MPC with adaptive security
• Linear overhead optimally-resilient robust MPC using preprocessing
• Efficient information-theoretic multi-party computation over non-commutative rings
• scientific article; zbMATH DE number 1842487 (Why is no real title available?)
• Network-agnostic security comes (almost) for free in DKG and MPC
• Robust multiparty computation with faster verification time
• Order-C secure multiparty computation for highly repetitive circuits
• Multiparty garbling from OT with linear scaling and RAM support
• On the Amortized Communication Complexity of Byzantine Broadcast
• Multiparty Interactive Communication with Private Channels
• Fast batched asynchronous distributed key generation
• SPRINT: high-throughput robust distributed Schnorr signatures
• A theoretical and empirical evaluation of an algorithm for self-healing computation
• Upper Bounds on the Communication Complexity of Optimally Resilient Cryptographic Multiparty Computation
• Fast large-scale honest-majority MPC for malicious adversaries
• Counting Method for Multi-party Computation over Non-abelian Groups
• Weakly super-invertible matrices and constant communication dishonest majority MPC
• Towards achieving asynchronous MPC with linear communication and optimal resilience
• Towards efficiency-preserving round compression in MPC. Do fewer rounds mean more computation?
• The cost of fault tolerance in multi-party communication complexity
• Graph Design for Secure Multiparty Computation over Non-Abelian Groups

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5756628)