Encoding Functions with Constant Online Rate or How to Compress Garbled Circuits Keys

DOI10.1007/978-3-642-40084-1_10zbMath1298.94076OpenAlexW2406391701MaRDI QIDQ2849393

Benny Applebaum, Yuval Ishai, Eyal Kushilevitz, Brent Waters

Publication date: 17 September 2013

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

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

Mathematics Subject Classification ID

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

Related Items

Limits on the adaptive security of Yao's garbling, Incompressible functions, relative-error extractors, and the power of nondeterministic reductions, Adaptive Security of Yao’s Garbled Circuits, Adaptive security of practical garbling schemes, New ways to garble arithmetic circuits, Encoding Functions with Constant Online Rate, or How to Compress Garbled Circuit Keys, On treewidth, separators and Yao's garbling, On the power of secure two-party computation, Network Oblivious Transfer, On the Power of Secure Two-Party Computation, Adaptively Secure Garbled Circuits from One-Way Functions, Garbled Circuits as Randomized Encodings of Functions: a Primer, Non-interactive Secure 2PC in the Offline/Online and Batch Settings