Abstract

The issue of the privacy-preserving of information has become more prominent, especially regarding the privacy-preserving problem in a cloud environment. Homomorphic encryption can be operated directly on the ciphertext; this encryption provides a new method for privacy-preserving. However, we face a challenge in understanding how to construct a practical fully homomorphic encryption on non-integer data types. This paper proposes a revised floating-point fully homomorphic encryption scheme (FFHE) that achieves the goal of floating-point numbers operation without privacy leakage to unauthorized parties. We encrypt a matrix of plaintext bits as a single ciphertext to reduce the ciphertext expansion ratio and reduce the public key size by encrypting with a quadratic form in three types of public key elements and pseudo-random number generators. Additionally, we make the FFHE scheme more applicable by generalizing the homomorphism of addition and multiplication of floating-point numbers to analytic functions using the Taylor formula. We prove that the FFHE scheme for ciphertext operation may limit an additional loss of accuracy. Specifically, the precision of the ciphertext operation’s result is similar to unencrypted floating-point number computation. Compared to other schemes, our FFHE scheme is more practical for privacy-preserving in the cloud environment with its low ciphertext expansion ratio and public key size, supporting multiple operation types and high precision.

Highlights

  • In this age of big data, the amount of data that identifies individuals is increasing

  • People are enjoying the convenience created by these data; at the same time, leakage of personal data has attracted more attention because these data are accessible to third parties, especially in a cloud environment, and because the service provider can access users’ plaintexts in a cloud server

  • Through packaging a matrix of plaintext bits as a single ciphertext, we reduce the expansion rate of the ciphertext to Õ(λ3)

Read more

Summary

Introduction

In this age of big data, the amount of data that identifies individuals is increasing. Designing a homomorphic encryption scheme to achieve floating-point number calculation without compromising the privacy of the outsourced data is a challenging issue. We propose a floating-point fully homomorphic encryption scheme (FFHE) to overcome the above problems. FFHE can support addition and multiplication operations on floating-point numbers. (ii) We follow Gentry’s blueprint and construct a floatingpoint fully homomorphic encryption scheme (FFHE) that can support addition and multiplication operations on floating-point numbers based on our proposed revised somewhat homomorphic encryption (RSHE).

Related Work
Preliminary
The Somewhat Homomorphic DGHV Scheme
Calculation Types Generalization of FFHE
Conclusion
Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call