New semantically secure public-key cryptosystems from the rsa-primitive

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2274, Issue , 2002, Pages 1-16

  Sakurai, Kouichi ^a   Takagi, Tsuyoshi ^b  

^a KYUSHU UNIVERSITY   (Japan)

^b DARMSTADT UNIVERSITY OF TECHNOLOGY   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

CRYPTOGRAPHY; SEMANTICS; STEREO VISION;

ENCRYPTION FUNCTION; LEAST SIGNIFICANT BITS; MOST SIGNIFICANT BIT; ONE-WAY FUNCTIONS; PAILLIER CRYPTOSYSTEM; PUBLIC KEY CRYPTOSYSTEMS; PUBLIC KEYS; SEMANTIC SECURITY;

PUBLIC KEY CRYPTOGRAPHY;

EID: 84958964396     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45664-3_1     Document Type: Conference Paper

References (17)

1. M. Bellare, A. Desai, D. Pointcheval, and P. Rogaway, Relations among notions of security for public-key encryption schemes,” CRYPTO’98, LNCS 1462, (1998), pp.26-45.
2. D. Catalano, R. Gennaro, and N. Howgraw-Graham; “The bit security of Paillier’s encryption scheme and its applications,” Eurocrypt 2001, LNCS 2045, pp.229-243, 2001.
3. D. Catalano, R. Gennaro, N. Howgrave-Graham, and P. Nguyen; “Paillier’s cryptosystem revisited,” to appear in the ACM conference on Computer and Communication Security, 2001.
4. D. Coppersmith, “Finding a small root of a univariate modular equation,” EUROCRYPT’96, LNCS 1070, pp.155–165, 1996.
5. D. Coppersmith, M. Franklin, J. Patarin, M. Reiter, “Low-exponent RSA with related messages,” EUROCRYPT’96, LNCS 1070, (1996), pp.1-9.
6. R. Cramer and V. Shoup, “A practical public key cryptosystem provably secure against adaptive chosen ciphertext attack,” CRYPTO’98, LNCS 1462, pp.13-25, 1998.
7. R. Cramer and V. Shoup, “Universal hash proofs and a paradigm for adaptive chosen ciphertext secure public-Key encryption,” Cryptology ePrint Archive, IACR, http://eprint.iacr.org/, 2001.
8. I. Damgård and M. Jurik; “A generalization, a simplification and some applications of Paillier’s probabilistic public-Key system,” PKC 2001, LNCS 1992, pp.119-136, 2001.
9. R. Fischlin and C.P. Schnorr; “Stronger security proofs for RSA and Rabin bits,” Journal of Cryptology, 13 (2), pp.221-244, 2000.
10. S. Goldwasser and S. Micali; “Probabilistic encryption,” Journal of Computer and System Science, Vol.28, No.2, pp.270-299, 1984.
11. S. Micali and C. Schnorr, “Efficient, perfect random number generators,” Crypto’88, LNCS 403, pp.173-199, 1988.
12. T. Okamoto; “A fast signature scheme based on congruential polynomial operations,” IEEE Transactions on Information Theory, IT-36, pp.47-53, 1990.
13. T. Okamoto and D. Pointcheval, “The Gap-Problems: a new class of problems for the security of cryptographic schemes,” PKC 2001, LNCS 1992, pp.104-118, 2001.
14. T. Okamoto and S. Uchiyama; “A new public-key cryptosystem as secure as factoring,” Eurocrypt’98, LNCS 1403, pp.308-318, 1998.
15. P. Paillier; “Public-key cryptosystems based on composite degree residuosity classes,” Eurocrypt’99, LNCS 1592, pp.223-238, 1999.
16. D. Pointcheval, “New public key cryptosystems based on the dependent-RSA problems,” Eurocryt’99, LNCS 1592, pp. 239-254, 1999.
17. T. Takagi, “Fast RSA-type cryptosystems using n-adic expansion,” CRYPTO’97, LNCS 1294, pp.372-384, 1997.