Is it even possible? On the parallel composition of asynchronous MPC protocols
From MaRDI portal
Cites work
- scientific article; zbMATH DE number 1722683 (Why is no real title available?)
- scientific article; zbMATH DE number 1808209 (Why is no real title available?)
- scientific article; zbMATH DE number 5485433 (Why is no real title available?)
- scientific article; zbMATH DE number 177820 (Why is no real title available?)
- scientific article; zbMATH DE number 1759772 (Why is no real title available?)
- Asynchronous Multi-Party Computation with Quadratic Communication
- Asynchronous agreement on a core set in constant expected time and more efficient asynchronous VSS and MPC
- Asynchronous byzantine agreement protocols
- Asynchronous consensus and broadcast protocols
- Asynchronous secure computation
- Asynchronous secure computations with optimal resilience (extended abstract)
- Asynchronous secure multiparty computation in constant time
- Bounded-concurrent secure multi-party computation with a dishonest majority
- Bounded-concurrent secure two-party computation without setup assumptions
- Concurrent asynchronous Byzantine agreement in expected-constant rounds, revisited
- Constant-round asynchronous multi-party computation based on one-way functions
- Cryptographic Asynchronous Multi-party Computation with Optimal Resilience
- From fairness to full security in multiparty computation
- Homomorphic encryption
- Impossibility of distributed consensus with one faulty process
- Multiparty computation with low communication, computation and interaction via threshold FHE
- Must you know the code of f to securely compute f?
- On the composition of authenticated Byzantine Agreement
- Peeking into the future: MPC resilient to super-rushing adversaries
- Perfect asynchronous MPC with linear communication overhead
- Reaching Agreement in the Presence of Faults
- Resilient-optimal interactive consistency in constant time
- Round-preserving parallel composition of probabilistic-termination cryptographic protocols
- Secure protocol transformations
- Secure two-party computation with fairness -- a necessary design principle
- Static vs. adaptive security in perfect MPC: a separation and the adaptive security of BGW
- The Byzantine Generals Problem
- Towards achieving asynchronous MPC with linear communication and optimal resilience
- Universally composable security
- Universally composable synchronous computation
This page was built for publication: Is it even possible? On the parallel composition of asynchronous MPC protocols
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7233168)
