Linear-communication asynchronous complete secret sharing with optimal resilience
From MaRDI portal
Publication:6653035
DOI10.1007/978-3-031-68397-8_13MaRDI QIDQ6653035FDOQ6653035
Authors: Xiaoyu Ji, Junru Li, Yifan Song 
Publication date: 13 December 2024
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
asynchronous networkcommunication complexityverifiable secret sharingsecure multiparty computationUC securityunbounded adversary
Cryptography (94A60) Distributed systems (68M14) Authentication, digital signatures and secret sharing (94A62)
Cites Work
- How to share a secret
- Security and composition of multiparty cryptographic protocols
- Scalable and Unconditionally Secure Multiparty Computation
- Asynchronous secure computation
- Perfectly-Secure MPC with Linear Communication Complexity
- Universally composable security
- Title not available (Why is that?)
- Asynchronous secure computations with optimal resilience (extended abstract)
- Simple and Efficient Perfectly-Secure Asynchronous MPC
- Title not available (Why is that?)
- Efficient statistical asynchronous verifiable secret sharing with optimal resilience
- Fast asynchronous Byzantine agreement with optimal resilience
- Universally composable synchronous computation
- Revisiting Asynchronous Fault Tolerant Computation with Optimal Resilience
- Efficient perfectly secure computation with optimal resilience
- An Efficient Framework for Unconditionally Secure Multiparty Computation
- Near-linear unconditionally-secure multiparty computation with a dishonest minority
- Efficient asynchronous verifiable secret sharing and multiparty computation
- Asynchronous secure multiparty computation in constant time
- Constant-round asynchronous multi-party computation based on one-way functions
- On the communication efficiency of statistically secure asynchronous MPC with optimal resilience
- Asymptotically free broadcast in constant expected time via packed VSS
- \textsf{Bingo}: adaptivity and asynchrony in verifiable secret sharing and distributed key generation
- The round complexity of statistical MPC with optimal resiliency
- Lightweight asynchronous verifiable secret sharing with optimal resilience
- Concurrent asynchronous Byzantine agreement in expected-constant rounds, revisited
- Towards achieving asynchronous MPC with linear communication and optimal resilience
Cited In (2)
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)
