Round-optimal black-box MPC in the plain model

Cites Work

Unnamed Item
Unnamed Item
Smooth projective hashing and two-message oblivious transfer
Round-optimal fully black-box zero-knowledge arguments from one-way permutations
Two-message statistically sender-private OT from LWE
Two-round multiparty secure computation from minimal assumptions
A new approach to round-optimal secure multiparty computation
Four round secure computation without setup
Two-message witness indistinguishability and secure computation in the plain model from new assumptions
Promise zero knowledge and its applications to round optimal MPC
How to construct constant-round zero-knowledge proof systems for NP
Which languages have 4-round fully black-box zero-knowledge arguments from one-way functions?
Multi-source non-malleable extractors and applications
Round-optimal black-box commit-and-prove with succinct communication
Two-round oblivious transfer from CDH or LPN
Round optimal secure multiparty computation from minimal assumptions
Three-round secure multiparty computation from black-box two-round oblivious transfer
On the round complexity of black-box secure MPC
A black-box construction of fully-simulatable, round-optimal oblivious transfer from strongly uniform key agreement
Trapdoor hash functions and their applications
Oblivious transfer from trapdoor permutations in minimal rounds
Optimal Computational Split-state Non-malleable Codes
Candidate Indistinguishability Obfuscation and Functional Encryption for All Circuits
Black-Box Constructions of Protocols for Secure Computation
Round-Optimal Black-Box Two-Party Computation
Secure Computation with Minimal Interaction, Revisited
Secure Multiparty Computation with Minimal Interaction
Founding Cryptography on Oblivious Transfer – Efficiently
On the Composition of Zero-Knowledge Proof Systems
Advances in Cryptology – CRYPTO 2004
Non-malleable extractors and codes, with their many tampered extensions
Textbook non-malleable commitments
Smooth Projective Hashing and Two-Message Oblivious Transfer
Constant round non-malleable protocols using one way functions
The Exact Round Complexity of Secure Computation
Theory of Cryptography
Statistically sender-private OT from LPN and derandomization

This page was built for publication: Round-optimal black-box MPC in the plain model