The following pages link to TASTY (Q21844):
Displayed 19 items.
- Garbling XOR gates ``for free'' in the standard model (Q315547) (← links)
- Rate-limited secure function evaluation (Q329720) (← links)
- On compiling Boolean circuits optimized for secure multi-party computation (Q1696583) (← links)
- High-performance multi-party computation for binary circuits based on oblivious transfer (Q2044760) (← links)
- More efficient oblivious transfer extensions (Q2408589) (← links)
- Cryptographic algorithms for privacy-preserving online applications (Q2668547) (← links)
- \texttt{MOTIF}: (almost) free branching in GMW. Via vector-scalar multiplication (Q2691578) (← links)
- Accelerating Homomorphic Computations on Rational Numbers (Q2822686) (← links)
- Encryption Switching Protocols (Q2835592) (← links)
- Efficient Secure Two-Party Computation Using Symmetric Cut-and-Choose (Q2849384) (← links)
- An Efficient Protocol for Oblivious DFA Evaluation and Applications (Q2890023) (← links)
- Secure Multi-Party Computation of Boolean Circuits with Applications to Privacy in On-Line Marketplaces (Q2890025) (← links)
- Implementing AES via an Actively/Covertly Secure Dishonest-Majority MPC Protocol (Q2912800) (← links)
- A New Approach to Practical Active-Secure Two-Party Computation (Q2914295) (← links)
- Faster Maliciously Secure Two-Party Computation Using the GPU (Q2922667) (← links)
- (If) Size Matters: Size-Hiding Private Set Intersection (Q3084346) (← links)
- Constant-Round Private Function Evaluation with Linear Complexity (Q3102210) (← links)
- MiniLEGO: Efficient Secure Two-Party Computation from General Assumptions (Q4924431) (← links)
- Automatic Protocol Selection in Secure Two-Party Computations (Q5168566) (← links)