On the round complexity of black-box secure MPC
From MaRDI portal
Publication:2128561
DOI10.1007/978-3-030-84245-1_8zbMATH Open1486.94111OpenAlexW3191698925MaRDI QIDQ2128561FDOQ2128561
Authors: Yuval Ishai, Dakshita Khurana, Amit Sahai, Akshayaram Srinivasan 
Publication date: 22 April 2022
Full work available at URL: https://doi.org/10.1007/978-3-030-84245-1_8
Recommendations
Cites Work
- Non-malleable codes
- On the Composition of Zero-Knowledge Proof Systems
- Title not available (Why is that?)
- Founding Cryptography on Oblivious Transfer – Efficiently
- Secure Arithmetic Computation with No Honest Majority
- Advances in Cryptology - CRYPTO 2003
- Theory of Cryptography
- Multiparty computation with low communication, computation and interaction via threshold FHE
- Candidate indistinguishability obfuscation and functional encryption for all circuits
- Constant round non-malleable protocols using one way functions
- Advances in Cryptology – CRYPTO 2004
- Leakage-resilient non-malleable codes
- Non-malleable extractors and codes, with their many tampered extensions
- Constant-Round Multiparty Computation Using a Black-Box Pseudorandom Generator
- Title not available (Why is that?)
- The Exact Round Complexity of Secure Computation
- Stronger leakage-resilient and non-malleable secret sharing schemes for general access structures
- Title not available (Why is that?)
- 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
- Four-round concurrent non-malleable commitments from one-way functions
- Four round secure computation without setup
- Round optimal concurrent MPC via strong simulation
- Round optimal concurrent non-malleability from polynomial hardness
- Promise zero knowledge and its applications to round optimal MPC
- Optimal computational split-state non-malleable codes
- Concurrent non-malleable commitments (and more) in 3 rounds
- Efficient non-interactive secure computation
- Round-optimal black-box two-party computation
- Secure computation with minimal interaction, revisited
- Secure multiparty computation with minimal interaction
- Textbook non-malleable commitments
- Round-optimal secure multi-party computation
- Non-interactive secure 2PC in the offline/online and batch settings
- Non-interactive secure computation based on cut-and-choose
- Round optimal secure multiparty computation from minimal assumptions
- A new approach to round-optimal secure multiparty computation
- Actively secure garbled circuits with constant communication overhead in the plain model
- Reusable non-interactive secure computation
- Black-box constructions of protocols for secure computation
- Secure protocol transformations
- Multi-source non-malleable extractors and applications
- Efficient pseudorandom correlation generators: silent OT extension and more
- Information-theoretic 2-round MPC without round collapsing: adaptive security, and more
- A black-box construction of fully-simulatable, round-optimal oblivious transfer from strongly uniform key agreement
- Title not available (Why is that?)
Cited In (14)
- Round-optimal secure multi-party computation
- Three-round secure multiparty computation from black-box two-round oblivious transfer
- Succinct arguments for RAM programs via projection codes
- Round-optimal black-box secure computation from two-round malicious OT
- Black-box reusable NISC with random oracles
- Two-round MPC without round collapsing revisited -- towards efficient malicious protocols
- Round optimal black-box ``commit-and-prove
- Two-round MPC: information-theoretic and black-box
- Round-efficient black-box construction of composable multi-party computation
- Round-optimal black-box two-party computation
- Round-optimal black-box protocol compilers
- List oblivious transfer and applications to round-optimal black-box multiparty coin tossing
- Round-optimal black-box MPC in the plain model
- Round-optimal and communication-efficient multiparty computation
Uses Software
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)
