Efficient coding for secure computing with additively-homomorphic encrypted data
Summary: A framework is introduced for efficiently computing with encrypted data. We assume a semi-honest security model with two computing parties. Two different coding techniques are used with additively homomorphic encryption, such that many values can be put into one large encryption, and additions and multiplications can be performed on all values simultaneously. For more complicated operations such as comparisons and equality tests, bit-wise secret sharing is proposed as an additional technique that has a low computational and communication complexity, and which allows for precomputing. The framework is shown to significantly improve the computational complexity of state-of-the-art solutions on generic operations such as secure comparisons and secure set intersection.
- Additive mixing modulation for public key encryption based on distributed dynamics
- Encrypted integer division and secure comparison
- Efficient and privacy-preserving tree-based inference via additive homomorphic encryption
- A novel secure observer-based controller and attack detection scheme for networked control systems
This page was built for publication: Efficient coding for secure computing with additively-homomorphic encrypted data
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2019835)
