TASTY

No author found.

Related Items (19)

An Efficient Protocol for Oblivious DFA Evaluation and Applications ⋮ Secure Multi-Party Computation of Boolean Circuits with Applications to Privacy in On-Line Marketplaces ⋮ Garbling XOR gates ``for free in the standard model ⋮ Implementing AES via an Actively/Covertly Secure Dishonest-Majority MPC Protocol ⋮ A New Approach to Practical Active-Secure Two-Party Computation ⋮ Rate-limited secure function evaluation ⋮ Faster Maliciously Secure Two-Party Computation Using the GPU ⋮ More efficient oblivious transfer extensions ⋮ Cryptographic algorithms for privacy-preserving online applications ⋮ On compiling Boolean circuits optimized for secure multi-party computation ⋮ \texttt{MOTIF}: (almost) free branching in GMW. Via vector-scalar multiplication ⋮ Automatic Protocol Selection in Secure Two-Party Computations ⋮ MiniLEGO: Efficient Secure Two-Party Computation from General Assumptions ⋮ High-performance multi-party computation for binary circuits based on oblivious transfer ⋮ (If) Size Matters: Size-Hiding Private Set Intersection ⋮ Accelerating Homomorphic Computations on Rational Numbers ⋮ Constant-Round Private Function Evaluation with Linear Complexity ⋮ Encryption Switching Protocols ⋮ Efficient Secure Two-Party Computation Using Symmetric Cut-and-Choose

This page was built for software: TASTY