• Corpus ID: 3866511

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

  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 T. Schneider},
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… 

Figures and Tables from this paper

Communication-Efficient (Client-Aided) Secure Two-Party Protocols and Its Application
This paper constructs semi-honest secure communication-efficient two-party protocols using Beaver triple extension, which is a new tool for treating multi-fan-in gates, and it is confirmed via experiments that such a disadvantage has small effects on the whole online performance in the typical WAN environments.
Practical Applications of Homomorphic Encryption
A simple algebraically homomorphic scheme over the integers that is based on the factorization of an approximate semiprime integer is discussed and a couple of known protocols that can be implemented with it are provided.
Randomized decryption (RD) mode of operation for homomorphic cryptography - increasing encryption, communication and storage efficiency
  • Martin Beck
  • Computer Science, Mathematics
    2015 IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS)
  • 2015
This work presents a mode of operation for homomorphic cryptographic systems such that pseudo-random values are decrypted and used as a pseudo one time pad to construct a stream cipher, and the resulting ciphertexts can be trivially transformed into an homomorphic encryption of the concealed data.
An efficient protocol for private iris-code matching by means of garbled circuits
This paper focuses on privacy-preserving iris-based authentication and proposes the adoption of a matching protocol based only on garbled circuits which offers longer term security over existing solutions based on homomorphic encryption or hybrid techniques.
Threshold Properties of Prime Power Subgroups with Application to Secure Integer Comparisons
We present a semantically secure somewhat homomorphic public-key cryptosystem working in sub-groups of \(\mathbb {Z}_{n}^{*}\) of prime power order. Our scheme introduces a novel threshold
How Practical is Homomorphically Encrypted Program Execution? An Implementation and Performance Evaluation
This work expands its work to evaluate how practical current homomorphic cryptography based on the Smart-Vercauteren system is for executing arbitrary programs on untrusted resources and presents the implementation of a method to compute non-linear secret programs on anUntrusted resource using encrypted circuits embedded in an encrypted virtual machine.
Secure Adaptive Filtering
This work proposes several novel secure protocols for a privacy-preserving execution of the least mean squares (LMS) algorithm, combining different SPED techniques, and paying special attention to the error analysis of the finite-precision implementations.
Piecewise Function Approximation With Private Data
Two secure two party computation protocols for piecewise function approximation on private data rely on a piecewise approximation of the to-be-computed function easing the implementation in an STPC setting and exploits a hybrid construction where GC and homomorphic encryption are used together.
A smart-gentry based software system for secret program execution
This paper uses the own implementation of the Smart-Gentry crypto-system as a foundation and defines a processor architecture which is capable of executing encrypted programs on encrypted data, and presents the first method to compute a non-linear arbitrary secret program on an untrusted resource using fully homomorphic encrypted circuits.
Secret program execution in the cloud applying homomorphic encryption
This work presents a method to compute a secret program on an untrusted resource using fully homomorphic encrypted circuits using an algebraic homomorphism as a cryptographic foundation and defines a sample system architecture for which it provides a software implementation.


Efficient Two-Party Secure Computation on Committed Inputs
A homomorphic, semantically secure variant of the Camenisch-Shoup verifiable cryptosystem, which uses shorter keys, is unambiguous, and allows efficient proofs that a committed plaintext is encrypted under a committed key.
Practical and Secure Solutions for Integer Comparison
This paper develops solutions for integer comparison, which take as input two lists of encrypted bits representing x and y and produce an encrypted bit indicating whether x > y as output and proposes new logarithmicround and constant-round protocols for this setting.
Homomorphic encryption and secure comparison
It is shown how the proposed protocol for secure comparison of integers based on homomorphic encryption can be used to improve security of online auctions, and that it is efficient enough to be used in practice.
Secure Hamming Distance Based Computation and Its Applications
This paper presents protocols which are secure in the sense of full simulatability against malicious adversaries, including a protocol the authors call m -point-SPIR, which is an efficient variant of symmetric private information retrieval (SPIR).
Practical Secure Evaluation of Semi-Private Functions
This paper bridges the gap between SFE and PF-SFE with SFE of what they call semi-private functions (SPF-S FE), i.e., one function out of a given class of functions is evaluated without revealing which one.
Fully homomorphic encryption using ideal lattices
This work proposes a fully homomorphic encryption scheme that allows one to evaluate circuits over encrypted data without being able to decrypt, and describes a public key encryption scheme using ideal lattices that is almost bootstrappable.
Efficient Two Party and Multi Party Computation Against Covert Adversaries
The techniques used in the two party case directly generalize to improve the efficiency of two party computation protocols secure against standard malicious adversaries.
Evaluating 2-DNF Formulas on Ciphertexts
A homomorphic public key encryption scheme that allows the public evaluation of ψ given an encryption of the variables x1,...,xn and can evaluate quadratic multi-variate polynomials on ciphertexts provided the resulting value falls within a small set.
A Generalisation, a Simplification and some Applications of Paillier’s Probabilistic Public-Key System
We propose a generalisation of Paillier's probabilistic public key system, in which the expansion factor is reduced and which allows to adjust the block length of the scheme even after the public key
On the Security of ElGamal Based Encryption
It is shown directly that the decision Diffie-Hellman assumption implies the security of the original ElGamal encryption scheme (with messages from a subgroup) without modification.