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} }
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
Figures and Tables from this paper
24 Citations
On the Black-box Use of Somewhat Homomorphic Encryption in NonInteractive Two-Party Protocols
- Mathematics, Computer Science
- SIAM J. Discret. Math.
- 2016
- 2
- PDF
Randomized decryption (RD) mode of operation for homomorphic cryptography - increasing encryption, communication and storage efficiency
- 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
- Computer Science
- 2012 19th IEEE International Conference on Image Processing
- 2012
- 23
- PDF
Threshold Properties of Prime Power Subgroups with Application to Secure Integer Comparisons
- Computer Science, Mathematics
- IACR Cryptol. ePrint Arch.
- 2018
- 6
- PDF
How Practical is Homomorphically Encrypted Program Execution? An Implementation and Performance Evaluation
- Computer Science
- 2012 IEEE 11th International Conference on Trust, Security and Privacy in Computing and Communications
- 2012
- 20
- Highly Influenced
- PDF
Secure Adaptive Filtering
- Computer Science
- IEEE Transactions on Information Forensics and Security
- 2011
- 22
- PDF
Piecewise Function Approximation With Private Data
- Computer Science
- IEEE Transactions on Information Forensics and Security
- 2016
- 3
- PDF
A smart-gentry based software system for secret program execution
- Computer Science
- Proceedings of the International Conference on Security and Cryptography
- 2011
- 4
- PDF
Secret program execution in the cloud applying homomorphic encryption
- Computer Science
- 5th IEEE International Conference on Digital Ecosystems and Technologies (IEEE DEST 2011)
- 2011
- 80
- PDF
References
SHOWING 1-10 OF 59 REFERENCES
Practical and Secure Solutions for Integer Comparison
- Mathematics, Computer Science
- Public Key Cryptography
- 2007
- 106
- PDF
A New Approach for Algebraically Homomorphic Encryption
- Computer Science
- IACR Cryptol. ePrint Arch.
- 2008
- 38
- PDF
Practical Secure Evaluation of Semi-Private Functions
- Computer Science
- IACR Cryptol. ePrint Arch.
- 2009
- 65
- PDF
Efficient Two Party and Multi Party Computation Against Covert Adversaries
- Computer Science
- EUROCRYPT
- 2008
- 96
- PDF
Improved Garbled Circuit: Free XOR Gates and Applications
- Mathematics, Computer Science
- ICALP
- 2008
- 589
- PDF