The Exact Round Complexity of Secure Computation

Recommendations

The round complexity of secure computation against covert adversaries
The round complexity of perfectly secure general VSS
On the round complexity of covert computation
On the round complexity of secure quantum computation
The Round Complexity of Verifiable Secret Sharing Revisited
On the exact round complexity of secure three-party computation
On the exact round complexity of secure three-party computation
Advances in Cryptology – CRYPTO 2004
On the communication complexity of secure computation
Perfect secure computation in two rounds

Cited in

(43)

On the exact round complexity of self-composable two-party computation
On the enumeration of minimal non-pairwise compatibility graphs
Round-Efficient Concurrently Composable Secure Computation via a Robust Extraction Lemma
Succinct non-interactive secure computation
Knowledge encryption and its applications to simulatable protocols with low round-complexity
Post-quantum multi-party computation
Round-optimal black-box secure computation from two-round malicious OT
On the round complexity of secure quantum computation
What security can we achieve within 4 rounds?
On the exact round complexity of secure three-party computation
Randomized functions with high round complexity
Broadcast-optimal four-round MPC in the plain model
Perfect secure computation in two rounds
Round optimal black-box ``commit-and-prove
Round-optimal secure multi-party computation
A black-box construction of fully-simulatable, round-optimal oblivious transfer from strongly uniform key agreement
The round complexity of quantum zero-knowledge
Concurrent non-malleable commitments (and more) in 3 rounds
Two-round concurrent 2PC from sub-exponential LWE
On the round complexity of black-box secure MPC
Complexity of secure sets
Maliciously-secure MrNISC in the plain model
What Security Can We Achieve Within 4 Rounds?
Best of both worlds. Revisiting the spymasters double agent problem
List oblivious transfer and applications to round-optimal black-box multiparty coin tossing
Reusable secure computation in the plain model
Round-optimal black-box MPC in the plain model
Almost-total puzzles and their applications
Round-optimal and communication-efficient multiparty computation
More efficient constant-round multi-party computation from BMR and SHE
Round-optimal multi-party computation with identifiable abort
The feasibility of outsourced database search in the plain model
From FE combiners to secure MPC and back
Composable Security in the Tamper-Proof Hardware Model Under Minimal Complexity
Black-box constant-round secure 2PC with succinct communication
Round-optimal black-box multiparty computation from polynomial-time assumptions
Oblivious transfer from trapdoor permutations in minimal rounds
scientific article; zbMATH DE number 2009981 (Why is no real title available?)
A new approach to efficient non-malleable zero-knowledge
On the exact round complexity of best-of-both-worlds multi-party computation
Blockchains enable non-interactive MPC
Statistical security in two-party computation revisited
scientific article; zbMATH DE number 1942420 (Why is no real title available?)

This page was built for publication: The Exact Round Complexity of Secure Computation

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5739211)