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
Recommendations
Cites Work
- A proof of security of Yao's protocol for two-party computation
- Adaptive security of Yao's garbled circuits
- Adaptive security of practical garbling schemes
- Adaptively Secure Garbling with Applications to One-Time Programs and Secure Outsourcing
- Adaptively indistinguishable garbled circuits
- Adaptively secure garbled circuits from one-way functions
- Adaptively secure garbling with near optimal online complexity
- Be adaptive, avoid overcommitting
- Encoding functions with constant online rate or how to compress garbled circuits keys
- Fully key-homomorphic encryption, arithmetic circuit ABE and compact garbled circuits
- Functional Encryption for Turing Machines
- Instantiating random oracles via UCEs
- Key-evolution schemes resilient to space-bounded leakage
- Succinct garbling schemes from functional encryption through a local simulation paradigm
Cited In (9)
- Adaptively Secure Garbling with Applications to One-Time Programs and Secure Outsourcing
- Be adaptive, avoid overcommitting
- Adaptive distributional security for garbling schemes with \(\mathcal{O}(|x|)\) online complexity
- Adaptive security of Yao's garbled circuits
- On treewidth, separators and Yao's garbling
- Adaptively secure garbling with near optimal online complexity
- Adaptively indistinguishable garbled circuits
- The cost of adaptivity in security games on graphs
- Adaptive security of practical garbling schemes
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)
