Pages that link to "Item:Q3540034"

The following pages link to Implementing Two-Party Computation Efficiently with Security Against Malicious Adversaries (Q3540034):

Displayed 10 items.

• Garbling XOR gates ``for free'' in the standard model (Q315547) ‎ (← links)
• Recursive hiding of biometrics-based secret sharing scheme using adversary structure (Q456087) ‎ (← links)
• High-performance multi-party computation for binary circuits based on oblivious transfer (Q2044760) ‎ (← links)
• Adaptive security of practical garbling schemes (Q2152063) ‎ (← links)
• Asymptotically quasi-optimal cryptography (Q2170004) ‎ (← links)
• Fast garbling of circuits under standard assumptions (Q2413616) ‎ (← links)
• Secure Multi-Party Computation of Boolean Circuits with Applications to Privacy in On-Line Marketplaces (Q2890025) ‎ (← links)
• Garbled Circuits as Randomized Encodings of Functions: a Primer (Q5021129) ‎ (← links)
• Faster Secure Two-Party Computation in the Single-Execution Setting (Q5270369) ‎ (← links)
• Breaking and fixing garbled circuits when a gate has duplicate input wires (Q6176274) ‎ (← links)