Pages that link to "Item:Q2849384"
From MaRDI portal
The following pages link to Efficient Secure Two-Party Computation Using Symmetric Cut-and-Choose (Q2849384):
Displaying 19 items.
- Fast cut-and-choose-based protocols for malicious and covert adversaries (Q290398) (← links)
- Round optimal black-box ``commit-and-prove'' (Q1629413) (← links)
- Better concrete security for half-gates garbling (in the multi-instance setting) (Q2096549) (← links)
- Asymptotically quasi-optimal cryptography (Q2170004) (← links)
- Accumulating automata and cascaded equations automata for communicationless information theoretically secure multi-party computation (Q2330096) (← links)
- Network Oblivious Transfer (Q2829221) (← links)
- How to Circumvent the Two-Ciphertext Lower Bound for Linear Garbling Schemes (Q2953802) (← links)
- More Efficient Constant-Round Multi-party Computation from BMR and SHE (Q3179370) (← links)
- Cross and Clean: Amortized Garbled Circuits with Constant Overhead (Q3179371) (← links)
- Implicit Zero-Knowledge Arguments and Applications to the Malicious Setting (Q3457062) (← links)
- Faster Secure Two-Party Computation in the Single-Execution Setting (Q5270369) (← links)
- Hashing Garbled Circuits for Free (Q5270371) (← links)
- Universal Samplers with Fast Verification (Q5738767) (← 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)
- Malicious security for SCALES. Outsourced computation with ephemeral servers (Q6653038) (← links)
- Fully malicious authenticated PIR (Q6653043) (← links)
