Constant-size CCA-secure multi-hop unidirectional proxy re-encryption from indistinguishability obfuscation

Junzuo Lai, Zhengan Huang, Man Ho Au, Xianping Mao

Research output: Chapter in book / Conference proceedingConference article published in proceeding or bookAcademic researchpeer-review

4 Citations (Scopus)

Abstract

In this paper, we utilize the recent advances in indistinguishability obfuscation, overcome several obstacles and propose a multi-hop unidirectional proxy re-encryption scheme. The proposed scheme is proved to be CCA-secure in the standard model (i.e., without using the random oracle heuristic), and its ciphertext remains constant-size regardless of how many times it has been transformed.

Original languageEnglish
Title of host publicationInformation Security and Privacy - 23rd Australasian Conference, ACISP 2018, Proceedings
EditorsWilly Susilo, Guomin Yang
PublisherSpringer Verlag
Pages805-812
Number of pages8
ISBN (Print)9783319936376
DOIs
Publication statusPublished - 2018
Event23rd Australasian Conference on Information Security and Privacy, ACISP 2018 - Wollongong, Australia
Duration: 11 Jul 201813 Jul 2018

Publication series

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

Conference

Conference23rd Australasian Conference on Information Security and Privacy, ACISP 2018
Country/TerritoryAustralia
CityWollongong
Period11/07/1813/07/18

Keywords

  • Chosen-ciphertext attack
  • Indistinguishability obfuscation
  • Multi-hop
  • Unidirectional proxy re-encryption

ASJC Scopus subject areas

  • Theoretical Computer Science
  • General Computer Science

Fingerprint

Dive into the research topics of 'Constant-size CCA-secure multi-hop unidirectional proxy re-encryption from indistinguishability obfuscation'. Together they form a unique fingerprint.

Cite this