The following pages link to FairplayMP (Q23861):
Displayed 11 items.
- Spin-the-bottle sort and annealing sort: oblivious sorting via round-robin random comparisons (Q476439) (← links)
- High-performance multi-party computation for binary circuits based on oblivious transfer (Q2044760) (← links)
- Pushing the limits of Valiant's universal circuits: simpler, tighter and more compact (Q2128569) (← links)
- Secure non-interactive simulation: feasibility and rate (Q2170112) (← links)
- Efficient and scalable universal circuits (Q2188968) (← links)
- More efficient oblivious transfer extensions (Q2408589) (← links)
- Cryptographic algorithms for privacy-preserving online applications (Q2668547) (← links)
- Secure Multi-Party Computation of Boolean Circuits with Applications to Privacy in On-Line Marketplaces (Q2890025) (← links)
- An equational approach to secure multi-party computation (Q2986886) (← links)
- Approximating Eigenvectors with Fixed-Point Arithmetic: A Step Towards Secure Spectral Clustering (Q3379536) (← links)
- Efficient Constant Round Multi-party Computation Combining BMR and SPDZ (Q3457072) (← links)