TASTY
From MaRDI portal
Software:21844
swMATH9865MaRDI QIDQ21844FDOQ21844
Author name not available (Why is that?)
Cited In (19)
- Constant-round private function evaluation with linear complexity
- Implementing AES via an actively/covertly secure dishonest-majority MPC protocol
- Garbling XOR gates ``for free in the standard model
- (If) size matters: size-hiding private set intersection
- 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
- High-performance multi-party computation for binary circuits based on oblivious transfer
- Rate-limited secure function evaluation
- Encryption switching protocols
- Cryptographic algorithms for privacy-preserving online applications
- Efficient secure two-party computation using symmetric cut-and-choose
- Faster maliciously secure two-party computation using the GPU
- Automatic protocol selection in secure two-party computations
- An efficient protocol for oblivious DFA evaluation and applications
- More efficient oblivious transfer extensions
- On compiling Boolean circuits optimized for secure multi-party computation
- \texttt{MOTIF}: (almost) free branching in GMW. Via vector-scalar multiplication
- Accelerating homomorphic computations on rational numbers
This page was built for software: TASTY
