Corpus ID: 3866511

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

@inproceedings{Kolesnikov2009HowTC,
  title={How to Combine Homomorphic Encryption and Garbled Circuits - Improved Circuits and Computing the Minimum Distance Efficiently},
  author={V. Kolesnikov and A. Sadeghi and T. Schneider},
  year={2009}
}

V. Kolesnikov, A. Sadeghi, T. Schneider

Published 2009

Mathematics

We show how two existing paradigms for two-party secure function evaluation (SFE) in the semi-honest model can be combined securely and eciently { those based on additively homomorphic en- cryption (HE) with those based on garbled circuits (GC) and vice versa. Additionally, we propose new GC constructions for addition, subtrac- tion, multiplication, and comparison functions. Our circuits are approx- imately two times smaller (in terms of garbled tables) than previous constructions. This implies… CONTINUE READING

thomaschneider.de

Save to Library

Create Alert

Cite

Launch Research Feed