FleXOR: Flexible Garbling for XOR Gates That Beats Free-XOR

DOI10.1007/978-3-662-44381-1_25zbMath1335.94062OpenAlexW264971478MaRDI QIDQ2874552

Vladimir Kolesnikov, Payman Mohassel, Mike Rosulek

Publication date: 7 August 2014

Published in: Advances in Cryptology – CRYPTO 2014 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-662-44381-1_25

Mathematics Subject Classification ID

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

Related Items (18)

Three halves make a whole? Beating the half-gates lower bound for garbled circuits ⋮ Practical attacks against the walnut digital signature scheme ⋮ Adaptive security of practical garbling schemes ⋮ Garbled circuits with sublinear evaluator ⋮ Fast garbling of circuits under standard assumptions ⋮ How to Circumvent the Two-Ciphertext Lower Bound for Linear Garbling Schemes ⋮ NanoGRAM: garbled RAM with \(\widetilde{O}(\log N)\) overhead ⋮ Garbling, stacked and staggered. Faster \(k\)-out-of-\(n\) garbled function evaluation ⋮ Free IF: how to omit inactive branches and implement \(\mathcal{S}\)-universal garbled circuit (almost) for free ⋮ TinyKeys: a new approach to efficient multi-party computation ⋮ FleXOR ⋮ Linicrypt: A Model for Practical Cryptography ⋮ Stacked garbling. Garbled circuit proportional to longest execution path ⋮ Better concrete security for half-gates garbling (in the multi-instance setting) ⋮ Garbled Circuits as Randomized Encodings of Functions: a Primer ⋮ Faster Secure Two-Party Computation in the Single-Execution Setting ⋮ Non-interactive Secure 2PC in the Offline/Online and Batch Settings ⋮ Hashing Garbled Circuits for Free

This page was built for publication: FleXOR: Flexible Garbling for XOR Gates That Beats Free-XOR