On the round complexity of black-box secure MPC
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 5485433 (Why is no real title available?)
- scientific article; zbMATH DE number 1256767 (Why is no real title available?)
- scientific article; zbMATH DE number 4185033 (Why is no real title available?)
- scientific article; zbMATH DE number 7650419 (Why is no real title available?)
- A black-box construction of fully-simulatable, round-optimal oblivious transfer from strongly uniform key agreement
- A new approach to round-optimal secure multiparty computation
- Actively secure garbled circuits with constant communication overhead in the plain model
- Advances in Cryptology - CRYPTO 2003
- Advances in Cryptology – CRYPTO 2004
- Black-box constructions of protocols for secure computation
- Candidate indistinguishability obfuscation and functional encryption for all circuits
- Concurrent non-malleable commitments (and more) in 3 rounds
- Constant round non-malleable protocols using one way functions
- Constant-Round Multiparty Computation Using a Black-Box Pseudorandom Generator
- Efficient non-interactive secure computation
- Efficient pseudorandom correlation generators: silent OT extension and more
- Founding Cryptography on Oblivious Transfer – Efficiently
- Four round secure computation without setup
- Four-round concurrent non-malleable commitments from one-way functions
- Information-theoretic 2-round MPC without round collapsing: adaptive security, and more
- Leakage-resilient non-malleable codes
- Multi-source non-malleable extractors and applications
- Multiparty computation with low communication, computation and interaction via threshold FHE
- Non-interactive secure 2PC in the offline/online and batch settings
- Non-interactive secure computation based on cut-and-choose
- Non-malleable codes
- Non-malleable extractors and codes, with their many tampered extensions
- On the Composition of Zero-Knowledge Proof Systems
- Optimal computational split-state non-malleable codes
- Promise zero knowledge and its applications to round optimal MPC
- Reusable non-interactive secure computation
- Round optimal concurrent MPC via strong simulation
- Round optimal concurrent non-malleability from polynomial hardness
- Round optimal secure multiparty computation from minimal assumptions
- Round-optimal black-box two-party computation
- Round-optimal secure multi-party computation
- Secure Arithmetic Computation with No Honest Majority
- Secure computation with minimal interaction, revisited
- Secure multiparty computation with minimal interaction
- Secure protocol transformations
- Stronger leakage-resilient and non-malleable secret sharing schemes for general access structures
- Textbook non-malleable commitments
- The Exact Round Complexity of Secure Computation
- Theory of Cryptography
- Two-round MPC: information-theoretic and black-box
- Two-round multiparty secure computation from minimal assumptions
- \(k\)-round multiparty computation from \(k\)-round oblivious transfer via garbled interactive circuits
Cited in
(14)- Round-optimal black-box secure computation from two-round malicious OT
- Black-box reusable NISC with random oracles
- List oblivious transfer and applications to round-optimal black-box multiparty coin tossing
- Round-optimal black-box MPC in the plain model
- Round optimal black-box ``commit-and-prove
- Two-round MPC: information-theoretic and black-box
- Succinct arguments for RAM programs via projection codes
- Round-optimal black-box protocol compilers
- Round-optimal and communication-efficient multiparty computation
- Round-optimal secure multi-party computation
- Three-round secure multiparty computation from black-box two-round oblivious transfer
- Two-round MPC without round collapsing revisited -- towards efficient malicious protocols
- Round-optimal black-box two-party computation
- Round-efficient black-box construction of composable multi-party computation
This page was built for publication: On the round complexity of black-box secure MPC
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2128561)
