Garbling scheme for formulas with constant size of garbled gates

DOI10.1007/978-3-662-48797-6_31zbMATH Open1396.81067OpenAlexW2266386193MaRDI QIDQ2811155FDOQ2811155

Authors: Carmen Kempka, Ryo Kikuchi, Susumu Kiyoshima, Koutarou Suzuki 

Publication date: 10 June 2016

Published in: Advances in Cryptology -- ASIACRYPT 2015 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-662-48797-6_31

Recommendations

• Privacy-free garbled circuits for formulas: size zero and information-theoretic
• Partial garbling schemes and their applications
• Hierarchy for classes of garbling schemes
• How to circumvent the two-ciphertext lower bound for linear garbling schemes
• Adaptive security of practical garbling schemes

zbMATH Keywords

garbled circuitsconstant size of garbled gatescorrelation robustnessPRIV-security

Mathematics Subject Classification ID

Quantum computation (81P68)

Cited In (1)

• How to Circumvent the Two-Ciphertext Lower Bound for Linear Garbling Schemes

This page was built for publication: Garbling scheme for formulas with constant size of garbled gates

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2811155)