Homomorphic encryption system (HES) schemes are anticipated to play a significant role in cloud-based applications. Moving to cloud-based storage and analytic services securely are two of the most important advantages of HES. Several HES schemes have been recently proposed. However, the majority of them either have limited capabilities or are impractical in real-world applications. Various HES schemes provide the ability to perform computations for statistical analysis (e.g. average, mean and variance) on encrypted data. Domingo-Ferrer is one scheme that has privacy homomorphism properties to perform the basic mathematical operations (addition, subtraction and multiplication) in a convenient and secure way. However, it works only in the positive numbers' range which is considered as a limitation because several applications require both positive and negative ranges in which to work, especially those that have to implement analytical services in cloud computing. In this paper, we extend Domingo-Ferrer's scheme to be able to perform arithmetic operations for both positive and negative numbers. We also propose using a lightweight data aggregation function to compute both maximum and minimum values of the aggregated data that works for both positive and negative numbers.
[1]
Makoto Yokoo,et al.
Secure multi-agent dynamic programming based on homomorphic encryption and its application to combinatorial auctions
,
2002,
AAMAS '02.
[2]
Craig Gentry,et al.
A fully homomorphic encryption scheme
,
2009
.
[3]
Craig Gentry,et al.
Computing arbitrary functions of encrypted data
,
2010,
CACM.
[4]
Mikhail J. Atallah,et al.
Techniques for Secure and Reliable Computational Outsourcing
,
2013
.
[5]
Andrew Chi-Chih Yao,et al.
How to generate and exchange secrets
,
1986,
27th Annual Symposium on Foundations of Computer Science (sfcs 1986).
[6]
Craig Gentry,et al.
Fully Homomorphic Encryption over the Integers
,
2010,
EUROCRYPT.
[7]
Amit Sahai,et al.
Secure Multi-Party Computation
,
2013
.
[8]
Adi Shamir,et al.
A method for obtaining digital signatures and public-key cryptosystems
,
1978,
CACM.
[9]
Pascal Paillier,et al.
Public-Key Cryptosystems Based on Composite Degree Residuosity Classes
,
1999,
EUROCRYPT.
[10]
J. Ferrer.
A new privacy homomorphism and applications
,
1996
.