Perfectly-Secure MPC with Linear Communication Complexity
From MaRDI portal
Recommendations
- Simple and Efficient Perfectly-Secure Asynchronous MPC
- Near-linear unconditionally-secure multiparty computation with a dishonest minority
- Efficient perfectly secure computation with optimal resilience
- Efficient general-adversary multi-party computation
- Communication-efficient MPC for general adversary structures
Cited in
(only showing first 100 items - show all)- Efficient statistical asynchronous verifiable secret sharing with optimal resilience
- On the communication efficiency of statistically secure asynchronous MPC with optimal resilience
- Brief announcement: On secure m-party computation, commuting permutation systems and unassisted non-interactive MPC
- Realistic versus rational secret sharing
- Secure multiparty computation with general interaction patterns
- Round Efficient Unconditionally Secure Multiparty Computation Protocol
- ATLAS: efficient and scalable MPC in the honest majority setting
- Secure Linear Algebra Using Linearly Recurrent Sequences
- Perfectly-secure asynchronous MPC for general adversaries (extended abstract)
- Communication-efficient proactive secret sharing for dynamic groups with dishonest majorities
- High throughput secure MPC over small population in hybrid networks (extended abstract)
- Distributing keys and random secrets with constant complexity
- Perfectly-secure MPC with constant online communication complexity
- Accumulating automata and cascaded equations automata for communicationless information theoretically secure multi-party computation
- Honest majority GOD MPC with \(O(\operatorname{depth}(C))\) rounds and low online communication
- Perfectly-secure multiparty computation with linear communication complexity over any modulus
- Efficient perfectly secure computation with optimal resilience
- Efficient perfectly secure computation with optimal resilience
- Batching multiple protocols to improve efficiency of multi-party computation
- Secure computation with constant communication overhead using multiplication embeddings
- Lightweight asynchronous verifiable secret sharing with optimal resilience
- Communication-efficient (client-aided) secure two-party protocols and its application
- On communication-efficient asynchronous MPC with adaptive security
- Efficient information-theoretic secure multiparty computation over \(\mathbb{Z}/p^k\mathbb{Z}\) via Galois rings
- \textsc{SuperPack}: dishonest majority MPC with constant online communication
- Reducing communication channels in MPC
- Perfectly-secure multiplication for any \(t < n/3\)
- On the communication required for unconditionally secure multiplication
- Detect, pack and batch: perfectly-secure MPC with linear communication and constant expected time
- Public-PEZ Cryptography
- Best possible information-theoretic MPC
- Linear overhead optimally-resilient robust MPC using preprocessing
- 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
- Unconditional communication-efficient MPC via Hall's marriage theorem
- Efficient asynchronous verifiable secret sharing and multiparty computation
- Distributing any elliptic curve based protocol
- 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
- Network oblivious transfer
- Ramp hyper-invertible matrices and their applications to MPC protocols
- Unconditionally secure multiparty computation for symmetric functions with low bottleneck complexity
- Robust Multiparty Computation with Linear Communication Complexity
- Efficient multiparty protocols via log-depth threshold formulae. (Extended abstract)
- Secure equality and greater-than tests with sublinear online complexity
- scientific article; zbMATH DE number 2009982 (Why is no real title available?)
- Scalable and Unconditionally Secure Multiparty Computation
- Between a rock and a hard place: interpolating between MPC and FHE
- Communication-efficient MPC for general adversary structures
- Asymptotically free broadcast in constant expected time via packed VSS
- Honest majority MPC with abort with minimal online communication
- TinyKeys: a new approach to efficient multi-party computation
- Network-agnostic security comes (almost) for free in DKG and MPC
- On linear communication complexity for (maximally) fluid MPC
- Perfect MPC over layered graphs
- On fully-secure honest majority MPC without \(n^2\) round overhead
- Error detection in monotone span programs with application to communication-efficient multi-party computation
- Efficient general-adversary multi-party computation
- The bottleneck complexity of secure multiparty computation
- On the communication complexity of secure computation
- The broadcast message complexity of secure multiparty computation
- scientific article; zbMATH DE number 1583776 (Why is no real title available?)
- From Passive to Covert Security at Low Cost
- Asymptotically free broadcast in constant expected time via packed VSS
- Theory of Cryptography
- Secure multiparty computation with free branching
- scientific article; zbMATH DE number 1842488 (Why is no real title available?)
- Constant-overhead unconditionally secure multiparty computation over binary fields
- The more the merrier: reducing the cost of large scale MPC
- MPC vs. SFE: Perfect Security in a Unified Corruption Model
- Threshold Decryption and Zero-Knowledge Proofs for Lattice-Based Cryptosystems
- Secure multiparty computation of symmetric functions with polylogarithmic bottleneck complexity and correlated randomness
- Guaranteed output delivery comes free in honest majority MPC
- Constant rounds almost linear complexity multi-party computation for prefix sum
- Recent results in scalable multi-party computation
- The price of active security in cryptographic protocols
- Near-linear unconditionally-secure multiparty computation with a dishonest minority
- Distributed CONGEST Algorithms against Mobile Adversaries
- On the Amortized Communication Complexity of Byzantine Broadcast
- Fast batched asynchronous distributed key generation
- Perfect asynchronous MPC with linear communication overhead
- Secure message transmission in asynchronous networks
- Insured MPC: efficient secure computation with financial penalties
- Amortized complexity of information-theoretically secure MPC revisited
- Must the communication graph of MPC protocols be an expander?
- A full proof of the BGW protocol for perfectly secure multiparty computation
- scientific article; zbMATH DE number 7706034 (Why is no real title available?)
- Simultaneous multiplication protocol based on packed linear secret sharing and its applications
- Fast large-scale honest-majority MPC for malicious adversaries
- Secure Multiparty Matrix Multiplication Based on Strassen-Winograd Algorithm
- VSS Made Simpler
- Weakly super-invertible matrices and constant communication dishonest majority MPC
- Linear-communication asynchronous complete secret sharing with optimal resilience
- MPC for tech giants (GMPC): enabling Gulliver and the Lilliputians to cooperate amicably
- Scalable multiparty computation from non-linear secret sharing
- Stochastic secret sharing with 1-bit shares and applications to MPC
- Towards achieving asynchronous MPC with linear communication and optimal resilience
- Almost-Everywhere Secure Computation
- Must the communication graph of MPC protocols be an expander?
- Secure computation, I/O-efficient algorithms and distributed signatures
This page was built for publication: Perfectly-Secure MPC with Linear Communication Complexity
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5445508)
