Pages that link to "Item:Q290398"
From MaRDI portal
The following pages link to Fast cut-and-choose-based protocols for malicious and covert adversaries (Q290398):
Displaying 16 items.
- Parallel coin-tossing and constant-round secure two-party computation (Q1402368) (← links)
- On the leakage of corrupted garbled circuits (Q1616633) (← links)
- JIMU: faster LEGO-based secure computation using additive homomorphic hashes (Q1703939) (← links)
- Efficient covert two-party computation (Q1749305) (← links)
- Secure two-party computation via cut-and-choose oblivious transfer (Q1928765) (← links)
- Asymptotically quasi-optimal cryptography (Q2170004) (← links)
- Fast garbling of circuits under standard assumptions (Q2413616) (← links)
- Fast Cut-and-Choose Based Protocols for Malicious and Covert Adversaries (Q2849382) (← links)
- MiniLEGO: Efficient Secure Two-Party Computation from General Assumptions (Q4924431) (← links)
- Faster Secure Two-Party Computation in the Single-Execution Setting (Q5270369) (← links)
- Oblivious transfer based on single-qubit rotations (Q5272497) (← links)
- Scalable Multi-party Private Set-Intersection (Q5738787) (← links)
- Actively secure garbled circuits with constant communication overhead in the plain model (Q6109074) (← links)
- Geometry-based garbled circuits relying solely on one evaluation algorithm under standard assumption (Q6573661) (← links)
- Robust publicly verifiable covert security: limited information leakage and guaranteed correctness with low overhead (Q6595685) (← links)
- Toward malicious constant-rate 2PC via arithmetic garbling (Q6637552) (← links)
