Limits on the adaptive security of Yao's garbling

DOI10.1007/978-3-030-84245-1_17zbMath1486.94113OpenAlexW3188368005MaRDI QIDQ2128573

Chethan Kamath, Karen Klein, Daniel Wichs, Krzysztof Pietrzak

Publication date: 22 April 2022

Full work available at URL: https://doi.org/10.1007/978-3-030-84245-1_17

zbMATH Keywords

secure two-party computationproofs of securitysemi-honest adversariesYao's two-party protocol

Mathematics Subject Classification ID

Cryptography (94A60) Boolean functions (94D10)

Related Items

On treewidth, separators and Yao's garbling, The cost of adaptivity in security games on graphs

Cites Work

• A proof of security of Yao's protocol for two-party computation
• Succinct garbling schemes from functional encryption through a local simulation paradigm
• Adaptively secure garbling with near optimal online complexity
• Be adaptive, avoid overcommitting
• Adaptively indistinguishable garbled circuits
• Adaptive security of practical garbling schemes
• Functional Encryption for Turing Machines
• Adaptively Secure Garbled Circuits from One-Way Functions
• Encoding Functions with Constant Online Rate or How to Compress Garbled Circuits Keys
• Instantiating Random Oracles via UCEs
• Adaptive Security of Yao’s Garbled Circuits
• Adaptively Secure Garbling with Applications to One-Time Programs and Secure Outsourcing
• Key-Evolution Schemes Resilient to Space-Bounded Leakage
• Fully Key-Homomorphic Encryption, Arithmetic Circuit ABE and Compact Garbled Circuits