Some RSA-based encryption schemes with tight security reduction

Kaoru Kurosawa, Tsuyoshi Takagi

研究成果: Chapter in Book/Report/Conference proceedingChapter

7 被引用数 (Scopus)

抄録

In this paper, we study some RSA-based semantically secure encryption schemes (IND-CPA) in the standard model. We first derive the exactly tight one-wayness of Rabin-Paillier encryption scheme which assumes that factoring Blum integers is hard. We next propose the first IND-CPA scheme whose one-wayness is equivalent to factoring general n = pq (not factoring Blum integers). Our reductions of one-wayness are very tight because they require only one decryption-oracle query.

本文言語英語
ホスト出版物のタイトルLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
編集者Chi Sung Laih
出版社Springer Verlag
ページ19-36
ページ数18
ISBN(印刷版)3540205926
DOI
出版ステータス出版済み - 2003
外部発表はい

出版物シリーズ

名前Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
2894
ISSN(印刷版)0302-9743
ISSN(電子版)1611-3349

All Science Journal Classification (ASJC) codes

  • 理論的コンピュータサイエンス
  • コンピュータ サイエンス(全般)

フィンガープリント

「Some RSA-based encryption schemes with tight security reduction」の研究トピックを掘り下げます。これらがまとまってユニークなフィンガープリントを構成します。

引用スタイル