FairplayMP
From MaRDI portal
Software:23861
swMATH11926MaRDI QIDQ23861FDOQ23861
Author name not available (Why is that?)
Cited In (11)
- High-performance multi-party computation for binary circuits based on oblivious transfer
- Spin-the-bottle sort and annealing sort: oblivious sorting via round-robin random comparisons
- Cryptographic algorithms for privacy-preserving online applications
- An equational approach to secure multi-party computation
- Approximating Eigenvectors with Fixed-Point Arithmetic: A Step Towards Secure Spectral Clustering
- Efficient Constant Round Multi-party Computation Combining BMR and SPDZ
- Secure Multi-Party Computation of Boolean Circuits with Applications to Privacy in On-Line Marketplaces
- Secure non-interactive simulation: feasibility and rate
- More efficient oblivious transfer extensions
- Pushing the limits of Valiant's universal circuits: simpler, tighter and more compact
- Efficient and scalable universal circuits
This page was built for software: FairplayMP
