Using Transposition Padding to Get CCA2 Security From Any Deterministic Encryption Schemes

Abstract

We study how to make any deterministic encryption scheme probabilistic and secure against adaptively chosen ciphertext attacks. A new transpositional padding encryption scheme is proposed, with which we construct a universal scheme, namely, a transpositional padding encryption scheme, which has three novel attributes: 1) it can pad a given plaintext into several different values once the randomness is chosen while the previous padding schemes only pad a given plaintext into a fixed value; 2) it introduces the randomness into a ciphertext without employing hash function or random oracle, and; 3) it enables the encrypted message to contain more useful information that may exceed the upper limit of plaintext space. Then, we give this encryption scheme an instantiation of RSA, which is proven to be indistinguishable under adaptively chosen ciphertext attacks without random oracle that assumes a variant of the standard RSA problem. The variant problem is a novel arithmetic problem, and it is weaker than the standard RSA problem.