Abstract
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).
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Notes
- 1.
If \(\mathcal S \) is malicious, it must additionally be ensured that he indeed computed the intended functionality by means of verifiable computing (cf. Sect. 4.3.3.2).
- 2.
We note that the GC construction of Yu et al. [233, Sect. 3.3] is less efficient as garbled tables are larger and require slightly more computation.
- 3.
This is the reason for our choice of notation \(\mathsf {OT} _{t^{\prime }}^{n}\) instead of \(n \times \mathsf {OT} ^{t^{\prime }}\).
- 4.
If needed, SFE can be extended s.t. the function is known to only one of the parties and hidden from the other as described in Sect. 2.3.1.3.
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
Copyright information
© 2012 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Schneider, T. (2012). Basics of Efficient Secure Function Evaluation. In: Engineering Secure Two-Party Computation Protocols. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-30042-4_2
Download citation
DOI: https://doi.org/10.1007/978-3-642-30042-4_2
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-30041-7
Online ISBN: 978-3-642-30042-4
eBook Packages: Computer ScienceComputer Science (R0)