Pages that link to "Item:Q3540034"
From MaRDI portal
The following pages link to Implementing Two-Party Computation Efficiently with Security Against Malicious Adversaries (Q3540034):
Displaying 17 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)
- On the power of secure two-party computation (Q2303458) (← links)
- Fast garbling of circuits under standard assumptions (Q2413616) (← links)
- On the Power of Secure Two-Party Computation (Q2829222) (← links)
- Secure Multi-Party Computation of Boolean Circuits with Applications to Privacy in On-Line Marketplaces (Q2890025) (← links)
- Secure Two-Party Computation of Squared Euclidean Distances in the Presence of Malicious Adversaries (Q3600327) (← links)
- Garbled Circuits as Randomized Encodings of Functions: a Primer (Q5021129) (← links)
- Adaptively Secure Two-Party Computation from Indistinguishability Obfuscation (Q5261691) (← links)
- Faster Secure Two-Party Computation in the Single-Execution Setting (Q5270369) (← links)
- Proving Correctness and Security of Two-Party Computation Implemented in Java in Presence of a Semi-honest Sender (Q5498725) (← links)
- One-Sided Adaptively Secure Two-Party Computation (Q5746345) (← links)
- Breaking and fixing garbled circuits when a gate has duplicate input wires (Q6176274) (← links)
- Geometry-based garbled circuits relying solely on one evaluation algorithm under standard assumption (Q6573661) (← links)
