TASTY
From MaRDI portal
Software:21844
swMATH9865MaRDI QIDQ21844FDOQ21844
Author name not available (Why is that?)
Cited In (19)
- MiniLEGO: Efficient Secure Two-Party Computation from General Assumptions
- Accelerating Homomorphic Computations on Rational Numbers
- Automatic Protocol Selection in Secure Two-Party Computations
- Garbling XOR gates ``for free in the standard model
- Constant-Round Private Function Evaluation with Linear Complexity
- High-performance multi-party computation for binary circuits based on oblivious transfer
- Rate-limited secure function evaluation
- Cryptographic algorithms for privacy-preserving online applications
- Implementing AES via an Actively/Covertly Secure Dishonest-Majority MPC Protocol
- 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
- (If) Size Matters: Size-Hiding Private Set Intersection
- More efficient oblivious transfer extensions
- On compiling Boolean circuits optimized for secure multi-party computation
- Encryption Switching Protocols
- \texttt{MOTIF}: (almost) free branching in GMW. Via vector-scalar multiplication
- Efficient Secure Two-Party Computation Using Symmetric Cut-and-Choose
- Faster Maliciously Secure Two-Party Computation Using the GPU
- An Efficient Protocol for Oblivious DFA Evaluation and Applications
This page was built for software: TASTY
