Searching for just a few words should be enough to get started. If you need to make more complex queries, use the tips below to guide you.
Article type: Research Article
Authors: Kolesnikov, Vladimira | Sadeghi, Ahmad-Rezab | Schneider, Thomasc; *
Affiliations: [a] Alcatel-Lucent Bell Laboratories, Murray Hill, NJ, USA. E-mail: kolesnikov@research.bell-labs.com | [b] System Security Lab, Fraunhofer SIT, Intel Collaborative Research Institute for Secure Computing, Technische Universität Darmstadt, Darmstadt, Germany. E-mail: ahmad.sadeghi@trust.cased.de | [c] Engineering Cryptographic Protocols Group, Technische Universität Darmstadt, Darmstadt, Germany. E-mail: thomas.schneider@ec-spride.de
Correspondence: [*] Corresponding author: Thomas Schneider, Engineering Cryptographic Protocols Group, Technische Universität Darmstadt, Mornewegstr. 30, 64293 Darmstadt, Germany. E-mail: thomas.schneider@ec-spride.de
Abstract: General two-party Secure Function Evaluation (SFE) allows mutually distrusting parties to correctly compute any function on their private input data, without revealing the inputs. Two-party SFE can benefit almost any client-server interaction where privacy is required, such as privacy-preserving credit checking, medical classification, or face recognition. Today, SFE is a subject of immense amount of research in a variety of directions and is not easy to navigate. In this article, we systematize the most practically important works of the vast research knowledge on general SFE. We argue that in many cases the most efficient SFE protocols are obtained by combining several basic techniques, e.g., garbled circuits and (additively) homomorphic encryption. As a valuable methodological contribution, we present a framework in which today's most efficient techniques for general SFE can be viewed as building blocks with well-defined interfaces that can be easily combined into a complete efficient solution. Further, our approach naturally allows automated protocol generation (compilation) and has been implemented partially in the TASTY framework. In summary, we provide a comprehensive guide in state-of-the-art SFE, with the additional goal of extracting, systematizing and unifying the most relevant and promising general SFE techniques. Our target audience are graduate students wishing to enter the SFE field and advanced engineers seeking to develop SFE solutions. We hope our guide paints a high-level picture of the field, including most common approaches and their trade-offs and gives precise and numerous pointers to formal treatment of its specific aspects.
Keywords: Framework, protocol design, privacy-preserving protocols, homomorphic encryption, garbled functions
DOI: 10.3233/JCS-130464
Journal: Journal of Computer Security, vol. 21, no. 2, pp. 283-315, 2013
IOS Press, Inc.
6751 Tepper Drive
Clifton, VA 20124
USA
Tel: +1 703 830 6300
Fax: +1 703 830 2300
sales@iospress.com
For editorial issues, like the status of your submitted paper or proposals, write to editorial@iospress.nl
IOS Press
Nieuwe Hemweg 6B
1013 BG Amsterdam
The Netherlands
Tel: +31 20 688 3355
Fax: +31 20 687 0091
info@iospress.nl
For editorial issues, permissions, book requests, submissions and proceedings, contact the Amsterdam office info@iospress.nl
Inspirees International (China Office)
Ciyunsi Beili 207(CapitaLand), Bld 1, 7-901
100025, Beijing
China
Free service line: 400 661 8717
Fax: +86 10 8446 7947
china@iospress.cn
For editorial issues, like the status of your submitted paper or proposals, write to editorial@iospress.nl
如果您在出版方面需要帮助或有任何建, 件至: editorial@iospress.nl