Sharemind
From MaRDI portal
Software:34408
swMATH22617MaRDI QIDQ34408FDOQ34408
Author name not available (Why is that?)
Cited In (16)
- A domain-specific language for computing on encrypted data. (Invited talk)
- On the exact round complexity of secure three-party computation
- Secret-shared RAM indefinite private and secure RAM execution of perfectly unrevealed programs
- Network oblivious transfer
- Homomorphic extensions of CRT-based secret sharing
- Secure outsourced computation
- High-precision secure computation of satellite collision probabilities
- Improving the efficiency of AES protocols in multi-party computation
- Secure multi-party computation of Boolean circuits with applications to privacy in on-line marketplaces
- Rate-limited secure function evaluation
- An efficient passive-to-active compiler for honest-majority MPC over rings
- Cryptographic algorithms for privacy-preserving online applications
- A formal treatment of the role of verified compilers in secure computation
- How to simulate it in Isabelle: towards formal proof for secure multi-party computation
- On compiling Boolean circuits optimized for secure multi-party computation
- Generic constant-round oblivious sorting algorithm for MPC
This page was built for software: Sharemind
