Improving the efficiency of optimally-resilient statistically-secure asynchronous multi-party computation
From MaRDI portal
Publication:2152067
DOI10.1007/978-3-030-65277-7_36OpenAlexW3111970299MaRDI QIDQ2152067
Publication date: 6 July 2022
Full work available at URL: https://doi.org/10.1007/978-3-030-65277-7_36
Cryptography (94A60) Data encryption (aspects in computer science) (68P25) Authentication, digital signatures and secret sharing (94A62) Computer system organization (68Mxx)
Related Items (2)
Network-agnostic security comes (almost) for free in DKG and MPC ⋮ On the communication efficiency of statistically secure asynchronous MPC with optimal resilience
Cites Work
- Unnamed Item
- 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
- An Efficient Framework for Unconditionally Secure Multiparty Computation
- How to share a secret
- Computational Verifiable Secret Sharing Revisited
- Simple and Efficient Perfectly-Secure Asynchronous MPC
- Efficient Statistical Asynchronous Verifiable Secret Sharing with Optimal Resilience
- Almost-Surely Terminating Asynchronous Byzantine Agreement Revisited
- Asynchronous secure computation
- Asynchronous secure computations with optimal resilience (extended abstract)
This page was built for publication: Improving the efficiency of optimally-resilient statistically-secure asynchronous multi-party computation
