Pages that link to "Item:Q1648850"

The following pages link to Adaptively secure garbling with near optimal online complexity (Q1648850):

Displaying 18 items.

• Adaptive garbled RAM from laconic oblivious transfer (Q775994) (← links)
• A simple construction of iO for Turing machines (Q1631340) (← links)
• Succinct garbling schemes from functional encryption through a local simulation paradigm (Q1631342) (← links)
• Adaptively indistinguishable garbled circuits (Q1690262) (← links)
• New constructions of hinting PRGs, OWFs with encryption, and more (Q2096498) (← 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)
• Fast garbling of circuits under standard assumptions (Q2413616) (← links)
• On treewidth, separators and Yao's garbling (Q2697873) (← links)
• The cost of adaptivity in security games on graphs (Q2697875) (← links)
• (Q4409123) (← links)
• Adaptively Secure Garbling with Applications to One-Time Programs and Secure Outsourcing (Q4911582) (← links)
• Optimizing Online Permutation-Based AE Schemes for Lightweight Applications (Q5056019) (← links)
• Bounded functional encryption for Turing machines: adaptive security from general assumptions (Q6114255) (← links)
• Collusion-resistant functional encryption for RAMs (Q6135396) (← links)
• Adaptive distributional security for garbling schemes with \(\mathcal{O}(|x|)\) online complexity (Q6595677) (← links)
• Laconic function evaluation, functional encryption and obfuscation for RAMs with sublinear computation (Q6636505) (← links)