How to Garble Arithmetic Circuits

DOI10.1137/120875193zbMath1302.94034OpenAlexW2162717286MaRDI QIDQ5494942

Benny Applebaum, Yuval Ishai, Eyal Kushilevitz

Publication date: 30 July 2014

Published in: SIAM Journal on Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/120875193

zbMATH Keywords

cryptographyarithmetic circuitmultiparty computationgarbled circuit

Mathematics Subject Classification ID

Cryptography (94A60) Data encryption (aspects in computer science) (68P25)

Related Items (7)

FE and iO for Turing machines from minimal assumptions ⋮ Actively secure arithmetic computation and VOLE with constant computational overhead ⋮ Computing primitive idempotents in finite commutative rings and applications ⋮ From private simultaneous messages to zero-information Arthur-Merlin protocols and back ⋮ Additive randomized encodings and their applications ⋮ A Framework with Randomized Encoding for a Fast Privacy Preserving Calculation of Non-linear Kernels for Machine Learning Applications in Precision Medicine ⋮ Unnamed Item

This page was built for publication: How to Garble Arithmetic Circuits