The following pages link to Sharemind (Q34408):
Displaying 16 items.
- Rate-limited secure function evaluation (Q329720) (← links)
- How to simulate it in Isabelle: towards formal proof for secure multi-party computation (Q1687724) (← links)
- On compiling Boolean circuits optimized for secure multi-party computation (Q1696583) (← links)
- An efficient passive-to-active compiler for honest-majority MPC over rings (Q2117048) (← links)
- Improving the efficiency of AES protocols in multi-party computation (Q2145388) (← links)
- Homomorphic extensions of CRT-based secret sharing (Q2197441) (← links)
- Cryptographic algorithms for privacy-preserving online applications (Q2668547) (← links)
- A formal treatment of the role of verified compilers in secure computation (Q2669248) (← links)
- Secret-shared RAM indefinite private and secure RAM execution of perfectly unrevealed programs (Q2687034) (← links)
- High-Precision Secure Computation of Satellite Collision Probabilities (Q2827717) (← links)
- Network Oblivious Transfer (Q2829221) (← links)
- Secure Multi-Party Computation of Boolean Circuits with Applications to Privacy in On-Line Marketplaces (Q2890025) (← links)
- A domain-specific language for computing on encrypted data. (Invited talk) (Q2911606) (← links)
- Secure Outsourced Computation (Q3011899) (← links)
- Generic Constant-Round Oblivious Sorting Algorithm for MPC (Q3092362) (← links)
- On the exact round complexity of secure three-party computation (Q5918099) (← links)