Three-round secure multiparty computation from black-box two-round oblivious transfer
From MaRDI portal
Publication:2128560
DOI10.1007/978-3-030-84245-1_7zbMath1487.94136OpenAlexW3188983287MaRDI QIDQ2128560
Akshayaram Srinivasan, Arpita Patra
Publication date: 22 April 2022
Full work available at URL: https://doi.org/10.1007/978-3-030-84245-1_7
Related Items (4)
Round-optimal black-box protocol compilers ⋮ Round-optimal black-box secure computation from two-round malicious OT ⋮ Quadratic multiparty randomized encodings beyond honest majority and their applications ⋮ Round-optimal black-box MPC in the plain model
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Smooth projective hashing and two-message oblivious transfer
- 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
- Distinguisher-dependent simulation in two rounds and its applications
- Resource-efficient OT combiners with active security
- Information-theoretic 2-round MPC without round collapsing: adaptive security, and more
- Candidate Indistinguishability Obfuscation and Functional Encryption for All Circuits
- Lattice-Based Fully Dynamic Multi-key FHE with Short Ciphertexts
- Efficient Non-interactive Secure Computation
- Multi-key FHE from LWE, Revisited
- Constant-Round MPC with Fairness and Guarantee of Output Delivery
- A Framework for Efficient and Composable Oblivious Transfer
- Founding Cryptography on Oblivious Transfer – Efficiently
- Foundations of Homomorphic Secret Sharing
- On Robust Combiners for Oblivious Transfer and Other Primitives
- Witness encryption and its applications
- 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
- Theory of Cryptography
This page was built for publication: Three-round secure multiparty computation from black-box two-round oblivious transfer
