Round-optimal honest-majority MPC in Minicrypt and with everlasting security (extended abstract)

Related Items

Cites Work

Unnamed Item
Unnamed Item
Unnamed Item
An optimally fair coin toss
A full proof of the BGW protocol for perfectly secure multiparty computation
Long-term security and universal composability
Cryptography in the multi-string model
Minimum disclosure proofs of knowledge
Perfect zero-knowledge arguments for NP using any one-way permutation
Perfect secure computation in two rounds
Round-optimal secure multiparty computation with honest majority
Statistical ZAP arguments
Statistical Zaps and new oblivious transfer protocols
The resiliency of MPC with low interaction: the benefit of making errors (extended abstract)
Improving the round complexity of VSS in point-to-point networks
Secure MPC: laziness leads to GOD
Multiparty Computation with Low Communication, Computation and Interaction via Threshold FHE
The random oracle methodology, revisited
Computational Verifiable Secret Sharing Revisited
On Non-Black-Box Simulation and the Impossibility of Approximate Obfuscation
Practical and Provably-Secure Commitment Schemes from Collision-Free Hashing
Constant-Round MPC with Fairness and Guarantee of Output Delivery
Bounds on information exchange for Byzantine agreement
How To Prove Yourself: Practical Solutions to Identification and Signature Problems
Statistical secrecy and multibit commitments
On the Composition of Zero-Knowledge Proof Systems
Adaptively Secure Garbling with Applications to One-Time Programs and Secure Outsourcing
Black-box concurrent zero-knowledge requires \tilde {Ω} (log n ) rounds
The round complexity of verifiable secret sharing and secure multicast
Fiat-Shamir: from practice to theory
New Techniques for Noninteractive Zero-Knowledge
Zaps and Their Applications
Constant-Round Multiparty Computation Using a Black-Box Pseudorandom Generator
On the exact round complexity of secure three-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)