On the round complexity of black-box secure MPC
From MaRDI portal
Publication:2128561
DOI10.1007/978-3-030-84245-1_8zbMath1486.94111OpenAlexW3191698925MaRDI QIDQ2128561
Akshayaram Srinivasan, Yuval Ishai, Dakshita Khurana, Amit Sahai
Publication date: 22 April 2022
Full work available at URL: https://doi.org/10.1007/978-3-030-84245-1_8
Related Items (7)
Round-optimal black-box protocol compilers ⋮ Black-box reusable NISC with random oracles ⋮ Round-optimal black-box secure computation from two-round malicious OT ⋮ Succinct arguments for RAM programs via projection codes ⋮ Two-round MPC without round collapsing revisited -- towards efficient malicious protocols ⋮ Round-optimal black-box MPC in the plain model ⋮ List oblivious transfer and applications to round-optimal black-box multiparty coin tossing
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- 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
- A new approach to round-optimal secure multiparty computation
- Four-round concurrent non-malleable commitments from one-way functions
- Four round secure computation without setup
- Round optimal concurrent MPC via strong simulation
- Actively secure garbled circuits with constant communication overhead in the plain model
- Round optimal concurrent non-malleability from polynomial hardness
- Promise zero knowledge and its applications to round optimal MPC
- Multi-source non-malleable extractors and applications
- Round optimal secure multiparty computation from minimal assumptions
- 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
- Reusable non-interactive secure computation
- Efficient pseudorandom correlation generators: silent OT extension and more
- Stronger leakage-resilient and non-malleable secret sharing schemes for general access structures
- Optimal Computational Split-state Non-malleable Codes
- Candidate Indistinguishability Obfuscation and Functional Encryption for All Circuits
- Secure Protocol Transformations
- Concurrent Non-Malleable Commitments (and More) in 3 Rounds
- Multiparty Computation with Low Communication, Computation and Interaction via Threshold FHE
- Efficient Non-interactive Secure Computation
- 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
- Secure Arithmetic Computation with No Honest Majority
- Non-Malleable Codes
- On the Composition of Zero-Knowledge Proof Systems
- Leakage-Resilient Non-malleable Codes
- Non-interactive Secure 2PC in the Offline/Online and Batch Settings
- Advances in Cryptology – CRYPTO 2004
- Non-malleable extractors and codes, with their many tampered extensions
- Textbook non-malleable commitments
- Non-Interactive Secure Computation Based on Cut-and-Choose
- Constant round non-malleable protocols using one way functions
- Advances in Cryptology - CRYPTO 2003
- Constant-Round Multiparty Computation Using a Black-Box Pseudorandom Generator
- The Exact Round Complexity of Secure Computation
- Theory of Cryptography
- Round-optimal secure multi-party computation
This page was built for publication: On the round complexity of black-box secure MPC
