Adaptively indistinguishable garbled circuits
From MaRDI portal
Publication:1690262
DOI10.1007/978-3-319-70503-3_2zbMATH Open1406.94067OpenAlexW2765275671MaRDI QIDQ1690262FDOQ1690262
Authors: Zahra Jafargholi, Alessandra Scafuro, Daniel Wichs 
Publication date: 19 January 2018
Full work available at URL: https://doi.org/10.1007/978-3-319-70503-3_2
Recommendations
- Adaptively secure garbled circuits from one-way functions
- Adaptive security of practical garbling schemes
- Limits on the adaptive security of Yao's garbling
- Adaptively secure garbling with near optimal online complexity
- Adaptively Secure Garbling with Applications to One-Time Programs and Secure Outsourcing
Cited In (16)
- Efficient adaptively secure zero-knowledge from garbled circuits
- Garbling of signals and outcome equivalence
- FE and iO for Turing machines from minimal assumptions
- Succinct garbling schemes from functional encryption through a local simulation paradigm
- 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
- Threshold garbled circuits and ad hoc secure computation
- Limits on the adaptive security of Yao's garbling
- A survey of lattice based expressive attribute based encryption
- Adaptive garbled RAM from laconic oblivious transfer
- Limits on the power of garbling techniques for public-key encryption
- On the power of secure two-party computation
- Adaptively secure garbled circuits from one-way functions
- Adaptive security of practical garbling schemes
- Adaptively secure garbling schemes for parallel computations
This page was built for publication: Adaptively indistinguishable garbled circuits
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1690262)
