Public key encryption schemes with bounded CCA security and optimal ciphertext length based on the CDH assumption

Mayana Pereira, Rafael Dowsley, Goichiro Hanaoka, Anderson C.A. Nascimento

Research output: Chapter in Book/Report/Conference proceedingConference PaperResearchpeer-review

6 Citations (Scopus)

Abstract

In [2] a public key encryption scheme was proposed against adversaries with a bounded number of decryption queries based on the decisional Diffie-Helman Problems. In this paper, we show that the same result can be easily obtained based on weaker computational assumption, namely: the computational Diffie-Helman assumption.

Original languageEnglish
Title of host publicationInformation Security - 13th International Conference, ISC 2010, Revised Selected Papers
EditorsSpyros Magliveras, Ivana Ilic, Mike Burmester, Gene Tsudik
PublisherSpringer
Pages299-306
Number of pages8
ISBN (Print)9783642181771
DOIs
Publication statusPublished - 2010
Externally publishedYes
EventInformation Security Conference 2010 - Boca Raton, United States of America
Duration: 25 Oct 201028 Oct 2010
Conference number: 13th
https://link.springer.com/book/10.1007/978-3-642-18178-8 (Proceedings)

Publication series

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

Conference

ConferenceInformation Security Conference 2010
Abbreviated titleISC 2010
Country/TerritoryUnited States of America
CityBoca Raton
Period25/10/1028/10/10
Internet address

Keywords

  • Bounded chosen ciphertext secure public key encryption
  • Computational Diffie-Hellman assumption

Cite this