Pages that link to "Item:Q2849393"

The following pages link to Encoding Functions with Constant Online Rate or How to Compress Garbled Circuits Keys (Q2849393):

Displayed 13 items.

• Incompressible functions, relative-error extractors, and the power of nondeterministic reductions (Q301524) ‎ (← links)
• Limits on the adaptive security of Yao's garbling (Q2128573) ‎ (← links)
• Adaptive security of practical garbling schemes (Q2152063) ‎ (← links)
• On the power of secure two-party computation (Q2303458) ‎ (← links)
• On treewidth, separators and Yao's garbling (Q2697873) ‎ (← links)
• Network Oblivious Transfer (Q2829221) ‎ (← links)
• On the Power of Secure Two-Party Computation (Q2829222) ‎ (← links)
• Adaptively Secure Garbled Circuits from One-Way Functions (Q2829946) ‎ (← links)
• Encoding Functions with Constant Online Rate, or How to Compress Garbled Circuit Keys (Q2954373) ‎ (← links)
• Adaptive Security of Yao’s Garbled Circuits (Q3179366) ‎ (← links)
• Garbled Circuits as Randomized Encodings of Functions: a Primer (Q5021129) ‎ (← links)
• Non-interactive Secure 2PC in the Offline/Online and Batch Settings (Q5270370) ‎ (← links)
• New ways to garble arithmetic circuits (Q6061350) ‎ (← links)