Perfectly-Secure MPC with Linear Communication Complexity
From MaRDI portal
Publication:5445508
DOI10.1007/978-3-540-78524-8_13zbMath1162.94336OpenAlexW48039395MaRDI QIDQ5445508
Zuzana Beerliová-Trubíniová, Martin Hirt
Publication date: 5 March 2008
Published in: Theory of Cryptography (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-540-78524-8_13
Related Items (39)
Secure Computation, I/O-Efficient Algorithms and Distributed Signatures ⋮ ATLAS: efficient and scalable MPC in the honest majority setting ⋮ Efficient information-theoretic multi-party computation over non-commutative rings ⋮ Asymptotically-good arithmetic secret sharing over \(\mathbb{Z}/p^{\ell }\mathbb{Z}\) with strong multiplication and its applications to efficient MPC ⋮ An efficient structural attack on NIST submission DAGS ⋮ Honest majority MPC with abort with minimal online communication ⋮ Perfectly-secure asynchronous MPC for general adversaries (extended abstract) ⋮ High throughput secure MPC over small population in hybrid networks (extended abstract) ⋮ Efficient information-theoretic secure multiparty computation over \(\mathbb{Z}/p^k\mathbb{Z}\) via Galois rings ⋮ Detect, pack and batch: perfectly-secure MPC with linear communication and constant expected time ⋮ Asymptotically free broadcast in constant expected time via packed VSS ⋮ Network-agnostic security comes (almost) for free in DKG and MPC ⋮ On the Amortized Communication Complexity of Byzantine Broadcast ⋮ Distributed CONGEST Algorithms against Mobile Adversaries ⋮ Asymptotically good multiplicative LSSS over Galois rings and applications to MPC over \(\mathbb{Z}/p^k\mathbb{Z} \) ⋮ Circuit amortization friendly encodingsand their application to statistically secure multiparty computation ⋮ Secure message transmission in asynchronous networks ⋮ On the communication efficiency of statistically secure asynchronous MPC with optimal resilience ⋮ On communication-efficient asynchronous MPC with adaptive security ⋮ Concretely efficient large-scale MPC with active security (or tinykeys for tinyot) ⋮ Realistic versus Rational Secret Sharing ⋮ Communication-efficient proactive secret sharing for dynamic groups with dishonest majorities ⋮ Fast large-scale honest-majority MPC for malicious adversaries ⋮ A full proof of the BGW protocol for perfectly secure multiparty computation ⋮ Efficient Statistical Asynchronous Verifiable Secret Sharing with Optimal Resilience ⋮ Efficient asynchronous verifiable secret sharing and multiparty computation ⋮ Communication-Optimal Proactive Secret Sharing for Dynamic Groups ⋮ Efficient perfectly secure computation with optimal resilience ⋮ Efficient perfectly secure computation with optimal resilience ⋮ The more the merrier: reducing the cost of large scale MPC ⋮ Constant-overhead unconditionally secure multiparty computation over binary fields ⋮ Linear Overhead Optimally-Resilient Robust MPC Using Preprocessing ⋮ Proactive Secret Sharing with a Dishonest Majority ⋮ Network Oblivious Transfer ⋮ On the Communication Required for Unconditionally Secure Multiplication ⋮ From Passive to Covert Security at Low Cost ⋮ Threshold Decryption and Zero-Knowledge Proofs for Lattice-Based Cryptosystems ⋮ Round Efficient Unconditionally Secure Multiparty Computation Protocol ⋮ Guaranteed output delivery comes free in honest majority MPC
This page was built for publication: Perfectly-Secure MPC with Linear Communication Complexity
