A probabilistic public key encryption switching scheme for secure cloud storage
Radhakrishna Bhat, N. R. Sunitha, S. S. Iyengar
Abstract
Abstract The high demand for user-centric applications such as secure cloud storage laid the foundation for the development of user-centric security schemes with multiple security features in recent years. But, the current state-of-art techniques primarily emphasized only one type of security feature i.e., either homomorphism or non-malleability. To fill this gap and provide a common platform for both homomorphic and non-malleable cloud applications, we have introduced a new public key-based probabilistic encryption switching method. The proposed scheme generates $${\mathcal {O}}$$ <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML"> <mml:mi>O</mml:mi> </mml:math> ( m +2 log N ) bits of ciphertext where $$m\in {\mathbb {N}}$$ <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML"> <mml:mrow> <mml:mi>m</mml:mi> <mml:mo>∈</mml:mo> <mml:mi>N</mml:mi> </mml:mrow> </mml:math> and $$m<n$$ <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML"> <mml:mrow> <mml:mi>m</mml:mi> <mml:mo><</mml:mo> <mml:mi>n</mml:mi> </mml:mrow> </mml:math> , $$n\in {\mathbb {N}}$$ <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML"> <mml:mrow> <mml:mi>n</mml:mi> <mml:mo>∈</mml:mo> <mml:mi>N</mml:mi> </mml:mrow> </mml:math> is the plaintext size, N is the RSA composite. The superior performance of the proposed scheme has been tested in comparison to existing methods and is reported in this paper.