Secure multiparty computation with free branching
From MaRDI portal
Publication:2170008
DOI10.1007/978-3-031-06944-4_14zbMath1497.94094OpenAlexW4285148745MaRDI QIDQ2170008
Abhishek Jain, Mathias Hall-Andersen, Aditya Hegde, Aarushi Goel
Publication date: 30 August 2022
Full work available at URL: https://doi.org/10.1007/978-3-031-06944-4_14
Related Items (1)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Fast large-scale honest-majority MPC for malicious adversaries
- Overdrive: making SPDZ great again
- Efficient scalable constant-round MPC via garbled circuits
- Concretely efficient large-scale MPC with active security (or tinykeys for tinyot)
- \(\mathrm{SPD}\mathbb {Z}_{2^k}\): efficient MPC \(\mod 2^k\) for dishonest majority
- Order-C secure multiparty computation for highly repetitive circuits
- The more the merrier: reducing the cost of large scale MPC
- \textsf{LogStack}: stacked garbling with \(O(b \log b)\) computation
- Masked triples. Amortizing multiplication triples across conditionals
- Stacked garbling. Garbled circuit proportional to longest execution path
- ATLAS: efficient and scalable MPC in the honest majority setting
- Unconditional communication-efficient MPC via Hall's marriage theorem
- \texttt{MOTIF}: (almost) free branching in GMW. Via vector-scalar multiplication
- Linearly Homomorphic Encryption from $$\mathsf {DDH}$$
- A Unified Approach to MPC with Preprocessing Using OT
- Breaking the Circuit Size Barrier for Secure Computation Under DDH
- Key Homomorphic PRFs and Their Applications
- Multiparty Computation from Somewhat Homomorphic Encryption
- Actively Secure Private Function Evaluation
- Constant-Round Private Function Evaluation with Linear Complexity
- A Framework for Efficient and Composable Oblivious Transfer
- How to Hide Circuits in MPC an Efficient Framework for Private Function Evaluation
- Fully homomorphic encryption using ideal lattices
- Constant-Round Multiparty Computation Using a Black-Box Pseudorandom Generator
- Garbling, stacked and staggered. Faster \(k\)-out-of-\(n\) garbled function evaluation
This page was built for publication: Secure multiparty computation with free branching
