The following pages link to FleXOR (Q35008):
Displaying 10 items.
- Three halves make a whole? Beating the half-gates lower bound for garbled circuits (Q2120069) (← links)
- Garbled circuits with sublinear evaluator (Q2169991) (← links)
- Fast garbling of circuits under standard assumptions (Q2413616) (← links)
- Linicrypt: A Model for Practical Cryptography (Q2829955) (← links)
- How to Circumvent the Two-Ciphertext Lower Bound for Linear Garbling Schemes (Q2953802) (← links)
- Garbled Circuits as Randomized Encodings of Functions: a Primer (Q5021129) (← links)
- Faster Secure Two-Party Computation in the Single-Execution Setting (Q5270369) (← links)
- Non-interactive Secure 2PC in the Offline/Online and Batch Settings (Q5270370) (← links)
- Hashing Garbled Circuits for Free (Q5270371) (← links)
- TinyKeys: a new approach to efficient multi-party computation (Q5918657) (← links)