Pages that link to "Item:Q2874556"
From MaRDI portal
The following pages link to Efficient Three-Party Computation from Cut-and-Choose (Q2874556):
Displaying 10 items.
- Two attacks on rank metric code-based schemes: RankSign and an IBE scheme (Q1633440) (← links)
- Secure computation with low communication from cross-checking (Q1710664) (← links)
- Probabilistic termination and composability of cryptographic protocols (Q2318087) (← links)
- Efficient constant-round multi-party computation combining BMR and SPDZ (Q2318094) (← links)
- Probabilistic Termination and Composability of Cryptographic Protocols (Q2829949) (← links)
- More Efficient Constant-Round Multi-party Computation from BMR and SHE (Q3179370) (← links)
- Scalable Multi-party Private Set-Intersection (Q5738787) (← links)
- On the exact round complexity of secure three-party computation (Q5918099) (← links)
- Low cost constant round MPC combining BMR and oblivious transfer (Q5919016) (← links)
- Constant-round multiparty private function evaluation with (quasi-)linear complexities (Q6535112) (← links)
