Masked triples. Amortizing multiplication triples across conditionals
From MaRDI portal
Publication:2061960
DOI10.1007/978-3-030-75248-4_12zbMath1479.94188OpenAlexW4252131125MaRDI QIDQ2061960
Vladimir Kolesnikov, Stanislav Peceny, David G. Heath
Publication date: 21 December 2021
Full work available at URL: https://doi.org/10.1007/978-3-030-75248-4_12
Cryptography (94A60) Data encryption (aspects in computer science) (68P25) Circuits, networks (94C99)
Related Items
Secure multiparty computation with free branching, Garbling, stacked and staggered. Faster \(k\)-out-of-\(n\) garbled function evaluation
Cites Work
- Unnamed Item
- Unnamed Item
- Overdrive: making SPDZ great again
- More efficient universal circuit constructions
- Free IF: how to omit inactive branches and implement \(\mathcal{S}\)-universal garbled circuit (almost) for free
- \(\mathrm{SPD}\mathbb {Z}_{2^k}\): efficient MPC \(\mod 2^k\) for dishonest majority
- Stacked garbling for disjunctive zero-knowledge proofs
- Stacked garbling. Garbled circuit proportional to longest execution path
- Efficient 3-party distributed ORAM
- Valiant's universal circuits revisited: an overall improvement and a lower bound
- Efficient pseudorandom correlation generators: silent OT extension and more
- \texttt{MOTIF}: (almost) free branching in GMW. Via vector-scalar multiplication
- A Unified Approach to MPC with Preprocessing Using OT
- Valiant’s Universal Circuit is Practical
- Improved OT Extension for Transferring Short Secrets
- Dishonest Majority Multi-Party Computation for Binary Circuits
- Multiparty Computation from Somewhat Homomorphic Encryption
- A New Approach to Practical Active-Secure Two-Party Computation
- Practical Covertly Secure MPC for Dishonest Majority – Or: Breaking the SPDZ Limits
- Semi-homomorphic Encryption and Multiparty Computation
- A Practical Universal Circuit Construction and Secure Evaluation of Private Functions
- Universal circuits (Preliminary Report)
- Advances in Cryptology - CRYPTO 2003
