The round complexity of statistical MPC with optimal resiliency

Cites Work

Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item
An optimally fair coin toss
A full proof of the BGW protocol for perfectly secure multiparty computation
Two-round MPC: information-theoretic and black-box
Perfect secure computation in two rounds
Two-round multiparty secure computation from minimal assumptions
\(k\)-round multiparty computation from \(k\)-round oblivious transfer via garbled interactive circuits
A new approach to round-optimal secure multiparty computation
Four round secure computation without setup
Round-optimal secure multiparty computation with honest majority
Promise zero knowledge and its applications to round optimal MPC
Round optimal secure multiparty computation from minimal assumptions
The resiliency of MPC with low interaction: the benefit of making errors (extended abstract)
Robust secret sharing with almost optimal share size and security against rushing adversaries
Degree 2 is complete for the round-complexity of malicious MPC
Two round information-theoretic MPC with malicious security
Improving the round complexity of VSS in point-to-point networks
Secure MPC: laziness leads to GOD
Unconditionally-Secure Robust Secret Sharing with Compact Shares
The Round Complexity of Verifiable Secret Sharing: The Statistical Case
The Round Complexity of Verifiable Secret Sharing Revisited
Constant-Round MPC with Fairness and Guarantee of Output Delivery
Bounds on information exchange for Byzantine agreement
Broadcast Interactive Proofs
On the Composition of Zero-Knowledge Proof Systems
Simple and efficient asynchronous byzantine agreement with optimal resilience
Black-box concurrent zero-knowledge requires \tilde {Ω} (log n ) rounds
The round complexity of verifiable secret sharing and secure multicast
Round Efficient Unconditionally Secure Multiparty Computation Protocol
A Zero-One Law for Boolean Privacy
Theory of Cryptography
Round-optimal secure multi-party computation
Verifiable relation sharing and multi-verifier zero-knowledge in two rounds: trading NIZKs with honest majority (extended abstract)
Round-optimal honest-majority MPC in Minicrypt and with everlasting security (extended abstract)

This page was built for publication: The round complexity of statistical MPC with optimal resiliency