Garbling XOR Gates “For Free” in the Standard Model

DOI10.1007/978-3-642-36594-2_10zbMath1315.94048OpenAlexW1526433049MaRDI QIDQ4910277

Benny Applebaum

Publication date: 18 March 2013

Published in: Theory of Cryptography (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-36594-2_10

Mathematics Subject Classification ID

Cryptography (94A60)

Related Items

Adaptive security of practical garbling schemes ⋮ CPA-to-CCA transformation for KDM security ⋮ Efficient Public-Key Cryptography with Bounded Leakage and Tamper Resilience ⋮ NanoGRAM: garbled RAM with \(\widetilde{O}(\log N)\) overhead ⋮ Large scale, actively secure computation from LPN and free-XOR garbled circuits ⋮ Garbled Circuits as Randomized Encodings of Functions: a Primer