Basics of Efficient Secure Function Evaluation

  • Thomas Schneider


We start this chapter with common notation and definitions used in this book (Sect. 2.1). Afterwards, we summarize cryptographic primitives which are used in state-of-the-art protocols for practically efficient SFE in Sect. 2.2. Finally, we show how these primitives, in particular GC, can be used for practically efficient SFE protocols in the two- and multi-party setting (Sect. 2.3).


Random Oracle Homomorphic Encryption Setup Phase Oblivious Transfer Arithmetic Circuit 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Copyright information

© Springer-Verlag Berlin Heidelberg 2012

Authors and Affiliations

  1. 1.European Center for Security and Privacy by Design (EC-SPRIDE)Technische Universität DarmstadtDarmstadtGermany

Personalised recommendations