Symmetric-key homomorphic encryption for encrypted data processing

Authors:
Aldar C-F. Chan
Affiliations:
School of Computing, National University of Singapore
Venue:
ICC'09 Proceedings of the 2009 IEEE international conference on Communications
Year:
2009

Citing 6
Cited 0

Processing encrypted data

Communications of the ACM
A method for obtaining digital signatures and public-key cryptosystems

Communications of the ACM
Cryptography: Theory and Practice

Cryptography: Theory and Practice
A Provably Secure Additive and Multiplicative Privacy Homomorphism

ISC '02 Proceedings of the 5th International Conference on Information Security
Protocols for secure computations

SFCS '82 Proceedings of the 23rd Annual Symposium on Foundations of Computer Science
Public-key cryptosystems based on composite degree residuosity classes

EUROCRYPT'99 Proceedings of the 17th international conference on Theory and application of cryptographic techniques

Quantified Score

Hi-index	0.00

Visualization

Abstract

The difficulty of processing data in encrypted form has long been the barrier to the widespread use of encryption in data storage applications; improved security or privacy would always imply a sacrifice of functionality. Many applications, such as ASP, requiring a significant amount of processing at the data storage servers are hence precluded from using encryption to protect data privacy. To address this problem, this paper works on privacy homomorphism which allows encrypted data to be operated on. Two additive homomorphic schemes, namely Iterated Hill Cipher (IHC) and Modified Rivest Scheme (MRS), are given. They are secure to ciphertext-only attacks and have the nice property that the same data may have different representations in the encrypted domain.