Pages that link to "Item:Q2891475"

The following pages link to On the Security of the “Free-XOR” Technique (Q2891475):

Displaying 16 items.

• Garbling XOR gates ``for free'' in the standard model (Q315547) (← links)
• On multiparty garbling of arithmetic circuits (Q1710662) (← links)
• High-performance multi-party computation for binary circuits based on oblivious transfer (Q2044760) (← links)
• \textsf{LogStack}: stacked garbling with \(O(b \log b)\) computation (Q2056778) (← links)
• Efficient constant-round MPC with identifiable abort and public verifiability (Q2096540) (← links)
• Stacked garbling. Garbled circuit proportional to longest execution path (Q2096548) (← links)
• Three halves make a whole? Beating the half-gates lower bound for garbled circuits (Q2120069) (← links)
• Threshold Schnorr with stateless deterministic signing from standard assumptions (Q2120070) (← links)
• Adaptive security of practical garbling schemes (Q2152063) (← links)
• \textsc{EpiGRAM}: practical garbled RAM (Q2169989) (← links)
• Garbled circuits with sublinear evaluator (Q2169991) (← links)
• Secure two-party computation in a quantum world (Q2229292) (← links)
• Fast garbling of circuits under standard assumptions (Q2413616) (← links)
• Block cipher invariants as eigenvectors of correlation matrices (Q5915627) (← links)
• Low cost constant round MPC combining BMR and oblivious transfer (Q5919016) (← links)
• Breaking and fixing garbled circuits when a gate has duplicate input wires (Q6176274) (← links)