Adaptively indistinguishable garbled circuits
From MaRDI portal
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)- A survey of lattice based expressive attribute based encryption
- Adaptive security of Yao's garbled circuits
- Adaptive garbled RAM from laconic oblivious transfer
- Limits on the power of garbling techniques for public-key encryption
- FE and iO for Turing machines from minimal assumptions
- Succinct garbling schemes from functional encryption through a local simulation paradigm
- Adaptively secure garbled circuits from one-way functions
- Limits on the adaptive security of Yao's garbling
- Adaptive security of practical garbling schemes
- Adaptive distributional security for garbling schemes with \(\mathcal{O}(|x|)\) online complexity
- On treewidth, separators and Yao's garbling
- Threshold garbled circuits and ad hoc secure computation
- On the power of secure two-party computation
- Adaptively secure garbling schemes for parallel computations
- Efficient adaptively secure zero-knowledge from garbled circuits
- Garbling of signals and outcome equivalence
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)
