Two-round MPC: information-theoretic and black-box
From MaRDI portal
Publication:1629402
DOI10.1007/978-3-030-03807-6_5zbMath1443.94058OpenAlexW2898630366MaRDI QIDQ1629402
Sanjam Garg, Yuval Ishai, Akshayaram Srinivasan
Publication date: 11 December 2018
Full work available at URL: https://doi.org/10.1007/978-3-030-03807-6_5
Related Items (21)
Three-round secure multiparty computation from black-box two-round oblivious transfer ⋮ On the round complexity of black-box secure MPC ⋮ Perfect secure computation in two rounds ⋮ Round-optimal black-box protocol compilers ⋮ Reusable Two-Round MPC from LPN ⋮ Optimal bounded-collusion secure functional encryption ⋮ Round-optimal black-box secure computation from two-round malicious OT ⋮ Two-round MPC without round collapsing revisited -- towards efficient malicious protocols ⋮ Quadratic multiparty randomized encodings beyond honest majority and their applications ⋮ GUC-secure commitments via random oracles: new impossibility and feasibility ⋮ Endemic oblivious transfer via random oracles, revisited ⋮ Secure computation with shared EPR pairs (or: how to teleport in zero-knowledge) ⋮ Towards efficiency-preserving round compression in MPC. Do fewer rounds mean more computation? ⋮ On actively-secure elementary MPC reductions ⋮ On communication models and best-achievable security in two-round MPC ⋮ Perfect Secure Computation in Two Rounds ⋮ The round complexity of statistical MPC with optimal resiliency ⋮ Combiners for functional encryption, unconditionally ⋮ The rise of Paillier: homomorphic secret sharing and public-key silent OT ⋮ Multiparty reusable non-interactive secure computation from LWE ⋮ Broadcast-optimal two-round MPC
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On the round complexity of OT extension
- Homomorphic secret sharing from Paillier encryption
- Perfect secure computation in two rounds
- Two-round multiparty secure computation from minimal assumptions
- \(k\)-round multiparty computation from \(k\)-round oblivious transfer via garbled interactive circuits
- Threshold cryptosystems from threshold fully homomorphic encryption
- On the message complexity of secure multiparty computation
- Round-optimal secure multiparty computation with honest majority
- Oblivious transfer and privacy amplification
- Security and composition of multiparty cryptographic protocols
- Spooky Encryption and Its Applications
- Breaking the Circuit Size Barrier for Secure Computation Under DDH
- More Efficient Oblivious Transfer Extensions with Security for Malicious Adversaries
- Efficient Non-interactive Secure Computation
- Oblivious transfers and intersecting codes
- Constant-Round MPC with Fairness and Guarantee of Output Delivery
- Actively Secure OT Extension with Optimal Overhead
- Secure Multiparty Computation with Minimal Interaction
- A Framework for Efficient and Composable Oblivious Transfer
- Founding Cryptography on Oblivious Transfer – Efficiently
- Secure Multi-party Computation Minimizing Online Rounds
- New directions in cryptography
- On the Power of Correlated Randomness in Secure Computation
- Foundations of Homomorphic Secret Sharing
- Advances in Cryptology - CRYPTO 2003
- Efficient Non-interactive Proof Systems for Bilinear Groups
- Group-Based Secure Computation: Optimizing Rounds, Communication, and Computation
- Two Round Multiparty Computation via Multi-key FHE
- Two-Round Secure MPC from Indistinguishability Obfuscation
- On lattices, learning with errors, random linear codes, and cryptography
This page was built for publication: Two-round MPC: information-theoretic and black-box
