Adaptive Security of Yao’s Garbled Circuits
From MaRDI portal
Publication:3179366
DOI10.1007/978-3-662-53641-4_17zbMath1406.94068OpenAlexW2539309220MaRDI QIDQ3179366
Zahra Jafargholi, Daniel Wichs
Publication date: 21 December 2016
Published in: Theory of Cryptography (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-662-53641-4_17
Related Items (14)
Limits on the adaptive security of Yao's garbling ⋮ Succinct garbling schemes from functional encryption through a local simulation paradigm ⋮ Adaptive security of practical garbling schemes ⋮ Adaptively secure garbling schemes for parallel computations ⋮ Bounded Collusion ABE for TMs from IBE ⋮ Compact adaptively secure ABE for \(\mathsf{NC}^1\) from \(k\)-Lin ⋮ On treewidth, separators and Yao's garbling ⋮ The cost of adaptivity in security games on graphs ⋮ On the exact round complexity of secure three-party computation ⋮ On the power of secure two-party computation ⋮ Compact NIZKs from standard assumptions on bilinear maps ⋮ Threshold garbled circuits and ad hoc secure computation ⋮ Security analysis and improvements for the IETF MLS standard for group messaging ⋮ Depth-Robust Graphs and Their Cumulative Memory Complexity
Cites Work
- A proof of security of Yao's protocol for two-party computation
- 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 Constrained PRFs
- A Quasipolynomial Reduction for Generalized Selective Decryption on Trees
- Adaptively Secure Garbling with Applications to One-Time Programs and Secure Outsourcing
- Fully Key-Homomorphic Encryption, Arithmetic Circuit ABE and Compact Garbled Circuits
This page was built for publication: Adaptive Security of Yao’s Garbled Circuits
