Linear-communication asynchronous complete secret sharing with optimal resilience
From MaRDI portal
Recommendations
- Towards achieving asynchronous MPC with linear communication and optimal resilience
- Efficient asynchronous verifiable secret sharing and multiparty computation
- Perfect asynchronous MPC with linear communication overhead
- On the communication efficiency of statistically secure asynchronous MPC with optimal resilience
- Communication efficient perfectly secure VSS and MPC in asynchronous networks with optimal resilience
Cites work
- \textsf{Bingo}: adaptivity and asynchrony in verifiable secret sharing and distributed key generation
- An Efficient Framework for Unconditionally Secure Multiparty Computation
- Asymptotically free broadcast in constant expected time via packed VSS
- Asynchronous secure computation
- Asynchronous secure computations with optimal resilience (extended abstract)
- Asynchronous secure multiparty computation in constant time
- Concurrent asynchronous Byzantine agreement in expected-constant rounds, revisited
- Constant-round asynchronous multi-party computation based on one-way functions
- Efficient asynchronous verifiable secret sharing and multiparty computation
- Efficient perfectly secure computation with optimal resilience
- Efficient statistical asynchronous verifiable secret sharing with optimal resilience
- Fast asynchronous Byzantine agreement with optimal resilience
- How to share a secret
- scientific article; zbMATH DE number 1583939 (Why is no real title available?)
- scientific article; zbMATH DE number 176564 (Why is no real title available?)
- Lightweight asynchronous verifiable secret sharing with optimal resilience
- Near-linear unconditionally-secure multiparty computation with a dishonest minority
- On the communication efficiency of statistically secure asynchronous MPC with optimal resilience
- Perfectly-Secure MPC with Linear Communication Complexity
- Revisiting Asynchronous Fault Tolerant Computation with Optimal Resilience
- Scalable and Unconditionally Secure Multiparty Computation
- Security and composition of multiparty cryptographic protocols
- Simple and Efficient Perfectly-Secure Asynchronous MPC
- The round complexity of statistical MPC with optimal resiliency
- Towards achieving asynchronous MPC with linear communication and optimal resilience
- Universally composable security
- Universally composable synchronous computation
Cited in
(5)- Perfect asynchronous MPC with linear communication overhead
- Towards achieving asynchronous MPC with linear communication and optimal resilience
- Computationally efficient asynchronous MPC with linear communication and low additive overhead
- Constant-round asynchronous MPC with optimal resilience and linear communication
- Information-theoretic network-agnostic MPC with polynomial communication
This page was built for publication: Linear-communication asynchronous complete secret sharing with optimal resilience
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6653035)
