Limits on the adaptive security of Yao's garbling
From MaRDI portal
Publication:2128573
DOI10.1007/978-3-030-84245-1_17zbMATH Open1486.94113OpenAlexW3188368005MaRDI QIDQ2128573FDOQ2128573
Authors: Chethan Kamath, Karen Klein, Krzysztof Pietrzak, Daniel Wichs
Publication date: 22 April 2022
Full work available at URL: https://doi.org/10.1007/978-3-030-84245-1_17
Recommendations
Cites Work
- A proof of security of Yao's protocol for two-party computation
- Encoding functions with constant online rate or how to compress garbled circuits keys
- Functional Encryption for Turing Machines
- Fully key-homomorphic encryption, arithmetic circuit ABE and compact garbled circuits
- Adaptively secure garbling with near optimal online complexity
- Adaptively indistinguishable garbled circuits
- Adaptive security of practical garbling schemes
- Adaptively Secure Garbled Circuits from One-Way Functions
- Instantiating random oracles via UCEs
- Succinct garbling schemes from functional encryption through a local simulation paradigm
- Be adaptive, avoid overcommitting
- 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
Cited In (4)
This page was built for publication: Limits on the adaptive security of Yao's garbling
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2128573)