Pages that link to "Item:Q1690209"
From MaRDI portal
The following pages link to Designing fully secure protocols for secure two-party computation of constant-domain functions (Q1690209):
Displaying 13 items.
- Partial fairness in secure two-party computation (Q421046) (← links)
- MPC with friends and foes (Q2096545) (← links)
- On fully secure MPC with solitary output (Q2175916) (← links)
- \(1/p\)-secure multiparty computation without an honest majority and the best of both worlds (Q2210437) (← links)
- Characterizing the Cryptographic Properties of Reactive 2-Party Functionalities (Q4910282) (← links)
- Communication preserving protocols for secure function evaluation (Q5176017) (← links)
- On perfectly secure 2PC in the OT-hybrid model (Q5918800) (← links)
- On perfectly secure 2PC in the OT-hybrid model (Q5919118) (← links)
- On perfectly secure two-party computation for symmetric functionalities with correlated randomness (Q6169419) (← links)
- On secure computation of solitary output functionalities with and without broadcast (Q6582168) (← links)
- Three party secure computation with friends and foes (Q6582170) (← links)
- Complete characterization of fairness in secure two-party computation of Boolean functions (Q6621746) (← links)
- Can Alice and Bob guarantee output to Carol? (Q6637537) (← links)
