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
    24 Citations

    Figures and Tables from this paper

    Practical Applications of Homomorphic Encryption
    • 10
    • PDF
    Randomized decryption (RD) mode of operation for homomorphic cryptography - increasing encryption, communication and storage efficiency
    • M. Beck
    • Computer Science
    • 2015 IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS)
    • 2015
    • 1
    An efficient protocol for private iris-code matching by means of garbled circuits
    • 23
    • PDF
    Threshold Properties of Prime Power Subgroups with Application to Secure Integer Comparisons
    • 6
    • PDF
    How Practical is Homomorphically Encrypted Program Execution? An Implementation and Performance Evaluation
    • M. Brenner, H. Perl, Matthew Smith
    • Computer Science
    • 2012 IEEE 11th International Conference on Trust, Security and Privacy in Computing and Communications
    • 2012
    • 20
    • Highly Influenced
    • PDF
    Secure Adaptive Filtering
    • 22
    • PDF
    Piecewise Function Approximation With Private Data
    • 3
    • PDF
    A smart-gentry based software system for secret program execution
    • 4
    • PDF
    Secret program execution in the cloud applying homomorphic encryption
    • 80
    • PDF

    References

    SHOWING 1-10 OF 59 REFERENCES
    Efficient Two-Party Secure Computation on Committed Inputs
    • 152
    • PDF
    Practical and Secure Solutions for Integer Comparison
    • 106
    • PDF
    Homomorphic encryption and secure comparison
    • 176
    A New Approach for Algebraically Homomorphic Encryption
    • 38
    • PDF
    Practical Secure Evaluation of Semi-Private Functions
    • 65
    • PDF
    Fully homomorphic encryption using ideal lattices
    • C. Gentry
    • Mathematics, Computer Science
    • STOC '09
    • 2009
    • 4,349
    • PDF
    Covert two-party computation
    • 35
    • PDF
    Improved Garbled Circuit: Free XOR Gates and Applications
    • 589
    • PDF