More efficient CCA-secure unidirectional proxy re-encryption schemes without random oracles

  • Hongbing Wang
  • , Zhenfu Cao*
  • *Corresponding author for this work

Research output: Contribution to journalArticlepeer-review

7 Scopus citations

Abstract

In this paper, we present a more efficient chosen-ciphertext secure proxy re-encryption scheme in the standard model with less ciphertext size and without any strong unforgeable one-time signature. Our scheme is unidirectional and single-hop. The security of our scheme is under the reasonable complexity assumption-the decisional bilinear Diffie-Hellman assumption in bilinear groups. There are no proxy re-encryption schemes achieving chosen-ciphertext security in the standard model without a strong unforgeable one-time signature in the literature.

Original languageEnglish
Pages (from-to)173-181
Number of pages9
JournalSecurity and Communication Networks
Volume6
Issue number2
DOIs
StatePublished - Feb 2013
Externally publishedYes

Keywords

  • Bilinear map
  • Chosen-ciphertext security
  • Proxy re-encryption
  • Single-hop
  • Standard model
  • Unidirectional

Fingerprint

Dive into the research topics of 'More efficient CCA-secure unidirectional proxy re-encryption schemes without random oracles'. Together they form a unique fingerprint.

Cite this