Pages that link to "Item:Q2489932"
From MaRDI portal
The following pages link to Secure multi-party computation made simple (Q2489932):
Displaying 12 items.
- Asynchronous privacy-preserving iterative computation on peer-to-peer networks (Q455943) (← links)
- Spin-the-bottle sort and annealing sort: oblivious sorting via round-robin random comparisons (Q476439) (← links)
- On \(d\)-multiplicative secret sharing (Q604627) (← links)
- Error decodable secret sharing and one-round perfectly secure message transmission for general adversary structures (Q662167) (← links)
- On-line secret sharing (Q664393) (← links)
- Strong \((n, t, n)\) verifiable secret sharing scheme (Q991242) (← links)
- The cost of IEEE arithmetic in secure computation (Q2146109) (← links)
- The meeting businessmen problem: requirements and limitations (Q2443007) (← links)
- Efficient fully secure computation via distributed zero-knowledge proofs (Q2691587) (← links)
- Multiplicative and verifiably multiplicative secret sharing for multipartite adversary structures (Q2701489) (← links)
- Operations over Linear Secret Sharing Schemes (Q3297683) (← links)
- MPC vs. SFE : Unconditional and Computational Security (Q3600361) (← links)
