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
- Generic Constant-Round Oblivious Sorting Algorithm for MPC
- Homomorphic extensions of CRT-based secret sharing
- Improving the efficiency of AES protocols in multi-party computation
- Network Oblivious Transfer
- Rate-limited secure function evaluation
- An efficient passive-to-active compiler for honest-majority MPC over rings
- Cryptographic algorithms for privacy-preserving online applications
- High-Precision Secure Computation of Satellite Collision Probabilities
- Secure Outsourced Computation
- Secure Multi-Party Computation of Boolean Circuits with Applications to Privacy in On-Line Marketplaces
- 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
This page was built for software: Sharemind
