One-wayness equivalent to general factoring

Kaoru Kurosawa, Tsuyoshi Takagi

Research output: Contribution to journalArticle

2 Citations (Scopus)

Abstract

This paper shows the first practical semantically secure public-key encryption scheme such that its one-wayness is equivalent to general factoring in the standard model [in the sense of indistinguishability against chosen-plaintext attack (IND-CPA)]. Next our proof technique is applied to the Rabin-Paillier encryption scheme and a variant of the RSA-Paillier encryption scheme to prove their one-wayness under the factoring assumption via tight security reductions.

Original languageEnglish
Pages (from-to)4249-4262
Number of pages14
JournalIEEE Transactions on Information Theory
Volume55
Issue number9
DOIs
Publication statusPublished - Sep 4 2009

Fingerprint

factoring
Cryptography

All Science Journal Classification (ASJC) codes

  • Information Systems
  • Computer Science Applications
  • Library and Information Sciences

Cite this

One-wayness equivalent to general factoring. / Kurosawa, Kaoru; Takagi, Tsuyoshi.

In: IEEE Transactions on Information Theory, Vol. 55, No. 9, 04.09.2009, p. 4249-4262.

Research output: Contribution to journalArticle

Kurosawa, Kaoru ; Takagi, Tsuyoshi. / One-wayness equivalent to general factoring. In: IEEE Transactions on Information Theory. 2009 ; Vol. 55, No. 9. pp. 4249-4262.
@article{e3bc5780f0d240d892e8841260c02d73,
title = "One-wayness equivalent to general factoring",
abstract = "This paper shows the first practical semantically secure public-key encryption scheme such that its one-wayness is equivalent to general factoring in the standard model [in the sense of indistinguishability against chosen-plaintext attack (IND-CPA)]. Next our proof technique is applied to the Rabin-Paillier encryption scheme and a variant of the RSA-Paillier encryption scheme to prove their one-wayness under the factoring assumption via tight security reductions.",
author = "Kaoru Kurosawa and Tsuyoshi Takagi",
year = "2009",
month = "9",
day = "4",
doi = "10.1109/TIT.2009.2025532",
language = "English",
volume = "55",
pages = "4249--4262",
journal = "IEEE Transactions on Information Theory",
issn = "0018-9448",
publisher = "Institute of Electrical and Electronics Engineers Inc.",
number = "9",

}

TY - JOUR

T1 - One-wayness equivalent to general factoring

AU - Kurosawa, Kaoru

AU - Takagi, Tsuyoshi

PY - 2009/9/4

Y1 - 2009/9/4

N2 - This paper shows the first practical semantically secure public-key encryption scheme such that its one-wayness is equivalent to general factoring in the standard model [in the sense of indistinguishability against chosen-plaintext attack (IND-CPA)]. Next our proof technique is applied to the Rabin-Paillier encryption scheme and a variant of the RSA-Paillier encryption scheme to prove their one-wayness under the factoring assumption via tight security reductions.

AB - This paper shows the first practical semantically secure public-key encryption scheme such that its one-wayness is equivalent to general factoring in the standard model [in the sense of indistinguishability against chosen-plaintext attack (IND-CPA)]. Next our proof technique is applied to the Rabin-Paillier encryption scheme and a variant of the RSA-Paillier encryption scheme to prove their one-wayness under the factoring assumption via tight security reductions.

UR - http://www.scopus.com/inward/record.url?scp=69449099393&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=69449099393&partnerID=8YFLogxK

U2 - 10.1109/TIT.2009.2025532

DO - 10.1109/TIT.2009.2025532

M3 - Article

AN - SCOPUS:69449099393

VL - 55

SP - 4249

EP - 4262

JO - IEEE Transactions on Information Theory

JF - IEEE Transactions on Information Theory

SN - 0018-9448

IS - 9

ER -