A Probabilistic Public-Key Encryption with Ensuring Data Integrity in Cloud Computing

Researchers are working hard to face various challenges in the fast-moving field of network security and data exchange. When it comes to encryption techniques, efforts vary to address multiple issues such as computational speed, data size requirements, application scope, etc. that are driven by the purposes of collecting and sharing sensitive data that must be stored and processed securely. This paper proposes an efficient asymmetric cryptosystem that bases on the multiplication of plaintext by a variable public key. The origin of this key is constant, but for each encryption, a random number must be added to it. Therefore, a new public key each time is generated; in other words, a simulation of a one-time pad system. For each message, the sender generates a new secret twin of the public key; The receiver can decrypt all messages encrypted by different twins with a single private key. The proposed probabilistic scheme is linear coding and hence is lightweight, easy to execute, and practical in many areas. We consider the cloud to be an untrusted part that tries to disclose data when decoded by systems, the proposed method provides the additive homomorphic property and ensures data integrity when a homomorphic operation is performed by the cloud; thus, we realize verifiable partial homomorphic encryption.