Sharemind
From MaRDI portal
Cited in
(39)- EasyUC
- Obliv-C
- TinyGarble
- HyCC
- MOTION
- JIFF
- MP-SPDZ
- How to simulate it in Isabelle: towards formal proof for secure multi-party computation
- On compiling Boolean circuits optimized for secure multi-party computation
- VIFF
- Trustedpals
- An efficient passive-to-active compiler for honest-majority MPC over rings
- Improving the efficiency of AES protocols in multi-party computation
- TASTY
- Homomorphic extensions of CRT-based secret sharing
- FairplayMP
- GNUC
- Cryptographic algorithms for privacy-preserving online applications
- A formal treatment of the role of verified compilers in secure computation
- Secret-shared RAM indefinite private and secure RAM execution of perfectly unrevealed programs
- High-precision secure computation of satellite collision probabilities
- Network oblivious transfer
- VMCrypt
- Secure multi-party computation of Boolean circuits with applications to privacy in on-line marketplaces
- A domain-specific language for computing on encrypted data. (Invited talk)
- Secure outsourced computation
- Generic constant-round oblivious sorting algorithm for MPC
- Rate-limited secure function evaluation
- EDSL
- SCAPI
- JustGarble
- fhe
- ObliVM
- ABY
- PICCO
- On the exact round complexity of secure three-party computation
- Wysteria
- Frigate
- Silver
This page was built for software: Sharemind
