Simple and Efficient Perfectly-Secure Asynchronous MPC
From MaRDI portal
(Redirected from Publication:3498387)
Recommendations
- On the communication efficiency of statistically secure asynchronous MPC with optimal resilience
- Asynchronous Multiparty Computation: Theory and Implementation
- Secure multi-party computation in large networks
- Efficient asynchronous verifiable secret sharing and multiparty computation
- Revisiting the efficiency of asynchronous MPC with optimal resilience against general adversaries
Cited in
(49)- Round and communication efficient unconditionally-secure MPC with \(t<n/3\) in partially synchronous network
- Concretely efficient large-scale MPC with active security (or tinykeys for tinyot)
- Efficient asynchronous verifiable secret sharing and multiparty computation
- Always have a backup plan: fully secure synchronous MPC with asynchronous fallback
- Perfectly-secure asynchronous MPC for general adversaries (extended abstract)
- Improving the efficiency of optimally-resilient statistically-secure asynchronous multi-party computation
- High throughput secure MPC over small population in hybrid networks (extended abstract)
- Secure multi-party computation in large networks
- MPC with synchronous security and asynchronous responsiveness
- Secure MPC: laziness leads to GOD
- On the communication efficiency of statistically secure asynchronous MPC with optimal resilience
- Blockchains enable non-interactive MPC
- scientific article; zbMATH DE number 1583939 (Why is no real title available?)
- Asynchronous secure multiparty computation in constant time
- Asynchronous MPC with a strict honest majority using non-equivocation
- Constant-round asynchronous multi-party computation based on one-way functions
- Communication efficient statistical asynchronous multiparty computation with optimal resilience
- Asynchronous Multi-Party Computation with Quadratic Communication
- Communication efficient perfectly secure VSS and MPC in asynchronous networks with optimal resilience
- Asynchronous Multiparty Computation: Theory and Implementation
- scientific article; zbMATH DE number 1950364 (Why is no real title available?)
- scientific article; zbMATH DE number 1955785 (Why is no real title available?)
- Efficient statistical asynchronous verifiable secret sharing with optimal resilience
- On the theoretical gap between synchronous and asynchronous MPC protocols
- Hybrid-secure MPC, trading information-theoretic robustness for computational privacy
- Cryptographic Asynchronous Multi-party Computation with Optimal Resilience
- Perfectly-Secure MPC with Linear Communication Complexity
- MPC vs. SFE: Perfect Security in a Unified Corruption Model
- Theory of Cryptography
- Efficient perfectly secure computation with optimal resilience
- Efficient MPC with a Mixed Adversary
- Le Mans: dynamic and fluid MPC for dishonest majority
- Revisiting the efficiency of asynchronous MPC with optimal resilience against general adversaries
- Batch secret sharing for secure multi-party computation in asynchronous network
- Revisiting the efficiency of perfectly secure asynchronous multi-party computation against general adversaries
- Network-agnostic security comes (almost) for free in DKG and MPC
- On linear communication complexity for (maximally) fluid MPC
- Perfect MPC over layered graphs
- Almost-surely terminating asynchronous Byzantine agreement against general adversaries with optimal resilience
- Secure message transmission in asynchronous networks
- Concurrent asynchronous Byzantine agreement in expected-constant rounds, revisited
- Ramp hyper-invertible matrices and their applications to MPC protocols
- Broadcast-optimal two round MPC with asynchronous peer-to-peer channels
- Perfect asynchronous MPC with linear communication overhead
- Asymmetric multi-party computation
- Towards achieving asynchronous MPC with linear communication and optimal resilience
- Linear-communication asynchronous complete secret sharing with optimal resilience
- Fast and efficient perfectly secure network-agnostic secure computation
- Amortized complexity of information-theoretically secure MPC revisited
This page was built for publication: Simple and Efficient Perfectly-Secure Asynchronous MPC
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3498387)
