Cited in
(30)- Efficient and scalable universal circuits
- Wysteria
- 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
- VIFF
- MiniLEGO
- TASTY
- Crypto++
- GNUC
- VMCrypt
- Sharemind
- SCAPI
- fhe
- FleXOR
- JustGarble
- ObliVM
- ABY
- ZIDS
- 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
- HyCC
- Obliv-C
- TinyGarble
- Secure non-interactive simulation: feasibility and rate
- More efficient oblivious transfer extensions
- Frigate
- Pushing the limits of Valiant's universal circuits: simpler, tighter and more compact
This page was built for software: FairplayMP
