Efficient asynchronous verifiable secret sharing and multiparty computation
From MaRDI portal
Publication:2018817
Recommendations
- On the communication efficiency of statistically secure asynchronous MPC with optimal resilience
- Efficient statistical asynchronous verifiable secret sharing with optimal resilience
- Communication efficient perfectly secure VSS and MPC in asynchronous networks with optimal resilience
- Communication efficient statistical asynchronous multiparty computation with optimal resilience
- Simple and Efficient Perfectly-Secure Asynchronous MPC
Cites work
- An almost-surely terminating polynomial protocol for asynchronous Byzantine agreement with optimal resilience
- Asynchronous Multiparty Computation: Theory and Implementation
- Asynchronous secure computation
- Asynchronous secure computations with optimal resilience (extended abstract)
- Batch secret sharing for secure multi-party computation in asynchronous network
- Communication efficient perfectly secure VSS and MPC in asynchronous networks with optimal resilience
- Efficient statistical asynchronous verifiable secret sharing with optimal resilience
- Fast asynchronous Byzantine agreement with optimal resilience
- Generalized privacy amplification
- How to share a secret
- scientific article; zbMATH DE number 1583776 (Why is no real title available?)
- scientific article; zbMATH DE number 1583939 (Why is no real title available?)
- scientific article; zbMATH DE number 176564 (Why is no real title available?)
- scientific article; zbMATH DE number 3577144 (Why is no real title available?)
- scientific article; zbMATH DE number 1304080 (Why is no real title available?)
- scientific article; zbMATH DE number 1952911 (Why is no real title available?)
- Improving the Round Complexity of VSS in Point-to-Point Networks
- Near-linear unconditionally-secure multiparty computation with a dishonest minority
- On Expected Constant-Round Protocols for Byzantine Agreement
- Perfectly secure message transmission
- Perfectly-Secure MPC with Linear Communication Complexity
- Privacy Amplification by Public Discussion
- Round Efficient Unconditionally Secure Multiparty Computation Protocol
- Scalable and Unconditionally Secure Multiparty Computation
- Scalable Secure Multiparty Computation
- Secure multiparty protocols and zero-knowledge proof systems tolerating a faulty minority
- Simple and efficient asynchronous Byzantine agreement with optimal resilience
- Simple and Efficient Perfectly-Secure Asynchronous MPC
- The round complexity of verifiable secret sharing and secure multicast
- The Round Complexity of Verifiable Secret Sharing Revisited
- Theory of Cryptography
- Theory of Cryptography
Cited in
(29)- Round and communication efficient unconditionally-secure MPC with \(t<n/3\) in partially synchronous network
- Improving the efficiency of optimally-resilient statistically-secure asynchronous multi-party computation
- High throughput secure MPC over small population in hybrid networks (extended abstract)
- On the communication efficiency of statistically secure asynchronous MPC with optimal resilience
- On communication-efficient asynchronous MPC with adaptive security
- scientific article; zbMATH DE number 1676642 (Why is no real title available?)
- Efficient Asynchronous Accumulators for Distributed PKI
- Breaking the ${\mathcal{O}}(n|C|)$ Barrier for Unconditionally Secure Asynchronous Multiparty Computation
- Asynchronous MPC with a strict honest majority using non-equivocation
- Communication efficient statistical asynchronous multiparty computation with optimal resilience
- On the complexity of verifiable secret sharing and multiparty computation
- Simple and Efficient Perfectly-Secure Asynchronous MPC
- Communication efficient perfectly secure VSS and MPC in asynchronous networks with optimal resilience
- Efficient statistical asynchronous verifiable secret sharing with optimal resilience
- Efficient perfectly secure computation with optimal resilience
- 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
- \textsf{Bingo}: adaptivity and asynchrony in verifiable secret sharing and distributed key generation
- Network-agnostic security comes (almost) for free in DKG and MPC
- Almost-surely terminating asynchronous Byzantine agreement against general adversaries with optimal resilience
- Lightweight asynchronous verifiable secret sharing with optimal resilience
- Network-agnostic multi-party computation revisited (extended abstract)
- Perfect asynchronous MPC with linear communication overhead
- Towards achieving asynchronous MPC with linear communication and optimal resilience
- Linear-communication asynchronous complete secret sharing with optimal resilience
- Asynchronous agreement on a core set in constant expected time and more efficient asynchronous VSS and MPC
- Fast and efficient perfectly secure network-agnostic secure computation
- Amortized complexity of information-theoretically secure MPC revisited
This page was built for publication: Efficient asynchronous verifiable secret sharing and multiparty computation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2018817)
