The round complexity of statistical MPC with optimal resiliency
From MaRDI portal
Cites work
- \(k\)-round multiparty computation from \(k\)-round oblivious transfer via garbled interactive circuits
- A full proof of the BGW protocol for perfectly secure multiparty computation
- A new approach to round-optimal secure multiparty computation
- A Zero-One Law for Boolean Privacy
- An optimally fair coin toss
- Black-box concurrent zero-knowledge requires \(\tilde{\omega}(\log n)\) rounds
- Bounds on information exchange for Byzantine agreement
- Broadcast Interactive Proofs
- Constant-Round MPC with Fairness and Guarantee of Output Delivery
- Degree 2 is complete for the round-complexity of malicious MPC
- Four round secure computation without setup
- scientific article; zbMATH DE number 4037759 (Why is no real title available?)
- scientific article; zbMATH DE number 176564 (Why is no real title available?)
- scientific article; zbMATH DE number 1304080 (Why is no real title available?)
- scientific article; zbMATH DE number 1942420 (Why is no real title available?)
- scientific article; zbMATH DE number 2086626 (Why is no real title available?)
- scientific article; zbMATH DE number 1842509 (Why is no real title available?)
- Improving the round complexity of VSS in point-to-point networks
- On the Composition of Zero-Knowledge Proof Systems
- Perfect secure computation in two rounds
- Promise zero knowledge and its applications to round optimal MPC
- Robust secret sharing with almost optimal share size and security against rushing adversaries
- Round Efficient Unconditionally Secure Multiparty Computation Protocol
- Round optimal secure multiparty computation from minimal assumptions
- Round-optimal honest-majority MPC in Minicrypt and with everlasting security (extended abstract)
- Round-optimal secure multi-party computation
- Round-optimal secure multiparty computation with honest majority
- Secure MPC: laziness leads to GOD
- Simple and efficient asynchronous Byzantine agreement with optimal resilience
- The resiliency of MPC with low interaction: the benefit of making errors (extended abstract)
- The round complexity of verifiable secret sharing and secure multicast
- The Round Complexity of Verifiable Secret Sharing Revisited
- The round complexity of verifiable secret sharing: the statistical case
- Theory of Cryptography
- Two round information-theoretic MPC with malicious security
- Two-round MPC: information-theoretic and black-box
- Two-round multiparty secure computation from minimal assumptions
- Unconditionally-secure robust secret sharing with compact shares
- Verifiable relation sharing and multi-verifier zero-knowledge in two rounds: trading NIZKs with honest majority (extended abstract)
Cited in
(5)- Linear-communication asynchronous complete secret sharing with optimal resilience
- Efficient distributed randomness generation from minimal assumptions where \underline{PA}rties \underline{S}peak \underline{S}equentially \underline{O}nce
- Honest majority GOD MPC with \(O(\operatorname{depth}(C))\) rounds and low online communication
- Rumors MPC: GOD for dynamic committees, low communication via constant-round chat
- Information-theoretic broadcast-optimal MPC
This page was built for publication: The round complexity of statistical MPC with optimal resiliency
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6499317)
