Asynchronous Multi-Party Computation with Quadratic Communication
From MaRDI portal
Recommendations
- Cryptographic Asynchronous Multi-party Computation with Optimal Resilience
- Asynchronous Multiparty Computation: Theory and Implementation
- Simple and Efficient Perfectly-Secure Asynchronous MPC
- scientific article; zbMATH DE number 1583939
- Breaking the ${\mathcal{O}}(n|C|)$ Barrier for Unconditionally Secure Asynchronous Multiparty Computation
Cites work
- Asynchronous Multi-Party Computation with Quadratic Communication
- Asynchronous secure computation
- Asynchronous secure computations with optimal resilience (extended abstract)
- Cryptographic Asynchronous Multi-party Computation with Optimal Resilience
- Fast asynchronous Byzantine agreement with optimal resilience
- How To Prove Yourself: Practical Solutions to Identification and Signature Problems
- scientific article; zbMATH DE number 1618044 (Why is no real title available?)
- scientific article; zbMATH DE number 1808209 (Why is no real title available?)
- scientific article; zbMATH DE number 176564 (Why is no real title available?)
- scientific article; zbMATH DE number 1942434 (Why is no real title available?)
- scientific article; zbMATH DE number 1955785 (Why is no real title available?)
- scientific article; zbMATH DE number 1759349 (Why is no real title available?)
- scientific article; zbMATH DE number 1775406 (Why is no real title available?)
- Joint encryption and message-efficient secure computation
- Practical threshold signatures
- Public-Key Cryptosystems Based on Composite Degree Residuosity Classes
- Random oracles in constantipole
- Security and composition of multiparty cryptographic protocols
- The exact security of digital signatures -- how to sign with RSA and Rabin
- Theory of Cryptography
Cited in
(22)- Perfectly-secure asynchronous MPC for general adversaries (extended abstract)
- High throughput secure MPC over small population in hybrid networks (extended abstract)
- Asymptotically quasi-optimal cryptography
- MPC with synchronous security and asynchronous responsiveness
- 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 1583939 (Why is no real title available?)
- Linear overhead optimally-resilient robust MPC using preprocessing
- Constant-round asynchronous multi-party computation based on one-way functions
- Asynchronous Multi-Party Computation with Quadratic Communication
- Asynchronous Multiparty Computation: Theory and Implementation
- scientific article; zbMATH DE number 1303136 (Why is no real title available?)
- Cryptographic Asynchronous Multi-party Computation with Optimal Resilience
- Revisiting the efficiency of asynchronous MPC with optimal resilience against general adversaries
- Network-agnostic security comes (almost) for free in DKG and MPC
- Lightweight asynchronous verifiable secret sharing with optimal resilience
- Concurrent asynchronous Byzantine agreement in expected-constant rounds, revisited
- Network-agnostic multi-party computation revisited (extended abstract)
- 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
- Is it even possible? On the parallel composition of asynchronous MPC protocols
This page was built for publication: Asynchronous Multi-Party Computation with Quadratic Communication
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3519524)
