Pages that link to "Item:Q1690262"
From MaRDI portal
The following pages link to Adaptively indistinguishable garbled circuits (Q1690262):
Displaying 14 items.
- Limits on the power of garbling techniques for public-key encryption (Q775977) (← links)
- Adaptive garbled RAM from laconic oblivious transfer (Q775994) (← links)
- Succinct garbling schemes from functional encryption through a local simulation paradigm (Q1631342) (← links)
- FE and iO for Turing machines from minimal assumptions (Q1631345) (← links)
- Efficient adaptively secure zero-knowledge from garbled circuits (Q1753863) (← links)
- Threshold garbled circuits and ad hoc secure computation (Q2056781) (← links)
- Limits on the adaptive security of Yao's garbling (Q2128573) (← links)
- Adaptive security of practical garbling schemes (Q2152063) (← links)
- Adaptively secure garbling schemes for parallel computations (Q2175942) (← links)
- On the power of secure two-party computation (Q2303458) (← links)
- Garbling of signals and outcome equivalence (Q2436305) (← links)
- A survey of lattice based expressive attribute based encryption (Q2668411) (← links)
- On treewidth, separators and Yao's garbling (Q2697873) (← links)
- Adaptive distributional security for garbling schemes with \(\mathcal{O}(|x|)\) online complexity (Q6595677) (← links)