TASTY
From MaRDI portal
Cited in
(37)- Cryptographic algorithms for privacy-preserving online applications
- Efficient secure two-party computation using symmetric cut-and-choose
- Constant-round private function evaluation with linear complexity
- \texttt{MOTIF}: (almost) free branching in GMW. Via vector-scalar multiplication
- (If) size matters: size-hiding private set intersection
- More efficient oblivious transfer extensions
- Implementing AES via an actively/covertly secure dishonest-majority MPC protocol
- Faster maliciously secure two-party computation using the GPU
- Wysteria
- On compiling Boolean circuits optimized for secure multi-party computation
- An efficient protocol for oblivious DFA evaluation and applications
- Secure multi-party computation of Boolean circuits with applications to privacy in on-line marketplaces
- A new approach to practical active-secure two-party computation
- MiniLEGO: efficient secure two-party computation from general assumptions
- Accelerating homomorphic computations on rational numbers
- Automatic protocol selection in secure two-party computations
- VIFF
- MiniLEGO
- FairplayMP
- VMCrypt
- Sharemind
- SCAPI
- fhe
- FleXOR
- JustGarble
- EMP-toolkit
- ObliVM
- ABY
- SCiFI
- High-performance multi-party computation for binary circuits based on oblivious transfer
- Frigate
- Garbling XOR gates ``for free in the standard model
- HyCC
- Obliv-C
- TinyGarble
- Rate-limited secure function evaluation
- Encryption switching protocols
This page was built for software: TASTY
