How to Combine Homomorphic Encryption and Garbled Circuits Improved Circuits and Computing the Minimum Distance Efficiently

Abstract

We show how two existing paradigms for two-party secure function evaluation (SFE) in the semi-honest model can be combined securely and efficiently – those based on additively homomorphic encryption (HE) with those based on garbled circuits (GC) and vice versa. Additionally, we propose new GC constructions for addition, subtraction, multiplication, and… (More)

Topics

8 Figures and Tables

Statistics

02040201520162017
Citations per Year

Citation Velocity: 12

Averaging 12 citations per year over the last 3 years.

Learn more about how we calculate this metric in our FAQ.

Cite this paper

@inproceedings{Kolesnikov2009HowTC, title={How to Combine Homomorphic Encryption and Garbled Circuits Improved Circuits and Computing the Minimum Distance Efficiently}, author={Vladimir Kolesnikov and Ahmad-Reza Sadeghi and Thomas Schneider}, year={2009} }