Masked triples. Amortizing multiplication triples across conditionals
type: Item
instance of: scholarly article
title: Masked triples. Amortizing multiplication triples across conditionals
zbMATH Open document ID: 1479.94188
DOI: 10.1007/978-3-030-75248-4_12
author: Vladimir Kolesnikov
author: Stanislav Peceny
author: David G. Heath
publication date: 2021-12-21T00:00:00Z
Mathematics Subject Classification ID: 94A60
Mathematics Subject Classification ID: 94C99
Mathematics Subject Classification ID: 68P25
zbMATH DE Number: 7450210
zbMATH Keywords: MPC
zbMATH Keywords: conditional branching
zbMATH Keywords: beaver triples
MaRDI profile type: Publication
full work available at URL: 978-3-030-75248-4 12
OpenAlex ID: W4252131125
cites work: Efficient pseudorandom correlation generators: silent OT extension and more
cites work: Semi-homomorphic Encryption and Multiparty Computation
cites work: Q4035736
cites work: Efficient 3-party distributed ORAM
cites work: \(\mathrm{SPD}\mathbb {Z}_{2^k}\): efficient MPC \(\mod 2^k\) for dishonest majority
cites work: Practical Covertly Secure MPC for Dishonest Majority – Or: Breaking the SPDZ Limits
cites work: Multiparty Computation from Somewhat Homomorphic Encryption
cites work: A Unified Approach to MPC with Preprocessing Using OT
cites work: More efficient universal circuit constructions
cites work: Stacked garbling. Garbled circuit proportional to longest execution path
cites work: Stacked garbling for disjunctive zero-knowledge proofs
cites work: \texttt{MOTIF}: (almost) free branching in GMW. Via vector-scalar multiplication
cites work: Advances in Cryptology - CRYPTO 2003
cites work: Improved OT Extension for Transferring Short Secrets
cites work: Free IF: how to omit inactive branches and implement \(\mathcal{S}\)-universal garbled circuit (almost) for free
cites work: Overdrive: making SPDZ great again
cites work: A Practical Universal Circuit Construction and Secure Evaluation of Private Functions
cites work: Valiant’s Universal Circuit is Practical
cites work: Dishonest Majority Multi-Party Computation for Binary Circuits
cites work: A New Approach to Practical Active-Secure Two-Party Computation
cites work: Q3932310
cites work: Universal circuits (Preliminary Report)
cites work: Valiant's universal circuits revisited: an overall improvement and a lower bound
description: scientific article; zbMATH DE number 7450210