A Family of Probabilistic Triple-bit Encryptions for Secure Cloud Applications
Radhakrishna Bhat · 2021 2nd International Conference on Secure Cyber Computing and Communications (ICSCCC) · 2021
In order to strengthen secure cloud storage and retrieval, we propose a new family of triple-bit encryption switching protocols which can encrypt any plaintext m ∈ {0, 1}nand generate the ciphertexts of2n/3·log Nsize where k=log N, N is the RSA composite, n ∈ ℕ and is a multiple of an integer 3. The proposed protocols support encryption switching (i.e., switching from homomorphic setting to non-malleability). The semantic security of all the proposed protocols is guaranteed under standard quadratic residuosity assumption and the non-malleability is guaranteed under resilient to adaptive chosen ciphertext attack. The proposed scheme can encrypt a binary string of any length with any probability distribution and also provide the optional tamper evidence. Finally, a tamper-proof secure information retrieval method over the untrusted cloud has been presented.