Work

TASTY

Year: 2010

Type: conference-paper

Abstract: Secure two-party computation allows two untrusting parties to jointly compute an arbitrary function on their respective private inputs while revealing no information beyond the outcome. Existing cryptographic compilers can automatically generate secure computation protocols from high-level specifications, but are often limited in their use and efficiency of generated protocols as they are based on either garbled circuits or (additively) homomorphic encryption only.

Source: Proceedings of the ACM Conference on Computer and Communications Security

DOI: 10.1145/1866307.1866358

Authors: Wilko Henecka, Stefan K ögl, Ahmad-Reza Sadeghi, Thomas Schneider, Immo Wehrenberg

Institution: Ruhr University Bochum

Language: English

Topic: Cryptography and Data Security

Subfield: Artificial Intelligence

Field: Computer Science

Domain: Physical Sciences

Open Access status: green

OpenAlex ID: W2001084165

FWCI: 29.37

Cites: 56

Cited by: 356

Related to: 10