Efficient probabilistic public-key encryption schemes with | n|+k bit plaintexts

[1] Diffie W, Hellman M E. New directions in cryptography[J]. IEEE Transaction of Information Theory, 1976, 22(6): 644-654 [2] Rivest R, Shamir A, Adleman L. A method for obtaining digital signatures and public-key cryptosystems[J]. Communications ACM, 1978, 21(2): 120-126 [3] Paillier P, Pointcheval D. Efficient public-key cryptosystem provably secure against active adversaries Lam KY, Okamoto E. Theory and Applications of Cryptology and Information Security. London: Springer-Verlag Press, 1999: 163-179 [4] Paillier P. Public-key cryptosystems based on composite degree residuosity classes Stern J. Advances in Cryptoology-EUROCRYPT-99. Berlin: Springer-Verlag Press, 1999: 223-238 [5] Sakurai K, Takagi T. New semantically secure public-key cryptosystems from the RSA-primitive NaccacheD, Paillier P. Practice and Theory in Public Key Cryptosystems. Paris: Springer-Verlag Press, 2002: 1-16 [6] Cramer R, Shoup V. Universal hash proofs and a paradigm for adaptive chosen ciphertext secure public-key encryption Knudsen L R. Advances in Cryptoology-EUROCRYPTO-02. Berlin: Springer-Verlag, 2002: 45-94 [7] David G, Mart n S, Morillo P, et al. A practical public key cryptosystemfrom paillier and rabin schemes Desmedt Y. International Workshop on Theory and Practice in Public Key Cryptography. Miami: Springer,2003: 279-291 [8] Onodera T, Tanaka K E. Shufle for paillier-s encryption scheme[J]. IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences, 2005, E88-A(5): 1241-1248 [9] Catalano D, Gennaro R, Graham N H, et al. The bit security of paillier-s encryption scheme and its application Pfitzmann B. Advances in Cryptoology-Eurocrypto-01. Berlin: Springer-Verlag, 2001: 229-243 [10] Jiang Z T, Sun X, Wang Y M. Security analysis and improvement of a double-trapdoor encryption scheme[J]. Applied Mathematics and Computation, 2005, 169(1): 41-50