Pages that link to "Item:Q2344051"
From MaRDI portal
The following pages link to An efficient protocol for secure two-party computation in the presence of malicious adversaries (Q2344051):
Displaying 15 items.
- Efficient one-sided adaptively secure computation (Q514477) (← links)
- A proof of security of Yao's protocol for two-party computation (Q1015361) (← links)
- The TinyTable protocol for 2-party secure computation, or: Gate-scrambling revisited (Q1675724) (← links)
- Secure two-party computation via cut-and-choose oblivious transfer (Q1928765) (← links)
- Improved OR-Composition of Sigma-Protocols (Q2799092) (← links)
- Implementing Two-Party Computation Efficiently with Security Against Malicious Adversaries (Q3540034) (← links)
- Secure Two-Party Computation of Squared Euclidean Distances in the Presence of Malicious Adversaries (Q3600327) (← links)
- Two-Prover Protocols---Low Error at Affordable Rates (Q4507353) (← links)
- Techniques for Efficient Secure Computation Based on Yao’s Protocol (Q4916013) (← links)
- Garbled Circuits as Randomized Encodings of Functions: a Primer (Q5021129) (← links)
- Adaptively Secure Two-Party Computation from Indistinguishability Obfuscation (Q5261691) (← links)
- An Efficient Protocol for Secure Two-Party Computation in the Presence of Malicious Adversaries (Q5429383) (← 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)
- Element distinctness and bounded input size in private set intersection and related protocols (Q6547968) (← links)
