Some RSA-based encryption schemes with tight security reduction

Kaoru Kurosawa, Tsuyoshi Takagi

Research output: Chapter in Book/Report/Conference proceedingChapter

6 Citations (Scopus)

Abstract

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.

Original languageEnglish
Title of host publicationLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
EditorsChi Sung Laih
PublisherSpringer Verlag
Pages19-36
Number of pages18
ISBN (Print)3540205926
DOIs
Publication statusPublished - 2003

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume2894
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

All Science Journal Classification (ASJC) codes

  • Theoretical Computer Science
  • Computer Science(all)

Fingerprint Dive into the research topics of 'Some RSA-based encryption schemes with tight security reduction'. Together they form a unique fingerprint.

Cite this