One-Wayness Equivalent to General Factoring

Kaoru Kurosawa; Tsuyoshi Takagi

Paper 2005/382

One-Wayness Equivalent to General Factoring

Kaoru Kurosawa and Tsuyoshi Takagi

Abstract

This paper shows the first practical semantically secure public-key encryption scheme such that its one-wayness is equivalent to {\it general} factoring in the {\it standard} model (in the sense of IND-CPA). Next our proof technique is applied to Rabin-Paillier encryption scheme and a variant of RSA-Paillier encryption scheme to prove their exactly tight one-wayness.

Note: In particular, Sec.7 is new.

Metadata

Available format(s): PDF
Category: Public-key cryptography
Publication info: Published elsewhere. A preliminary version was presented at ASIACRYPT 2003.
Contact author(s): kurosawa @ cis ibaraki ac jp
History: 2005-10-25: revised; 2005-10-23: received; See all versions
Short URL: https://ia.cr/2005/382
License: CC BY

BibTeX

@misc{cryptoeprint:2005/382,
      author = {Kaoru Kurosawa and Tsuyoshi Takagi},
      title = {One-Wayness Equivalent to General Factoring},
      howpublished = {Cryptology ePrint Archive, Paper 2005/382},
      year = {2005},
      note = {\url{https://eprint.iacr.org/2005/382}},
      url = {https://eprint.iacr.org/2005/382}
}