Collusion-resistant unidirectional proxy re-encryption scheme from lattices

Kee Sung Kim, ik rae Jeong

Research output: Contribution to journalArticle

9 Citations (Scopus)

Abstract

Most of the previous proxy re-encryption schemes rely on the average-case hardness problems such as the integer factorization problems and the discrete logarithm problems. Therefore, they cannot guarantee its security under quantum analysis, since there exist quantum algorithms efficiently solving the factorization and logarithm problems. In the paper, we propose the first proxy re-encryption scheme based on the hard worst-case lattice problems. Our scheme has many useful properties as follows: Unidirectional, collusion-resistant, noninteractive, proxy invisible, key optimal, and nontransitive.We also provided the formal security proof of the proposed scheme in the random oracle model.

Original languageEnglish
Article number000003
Pages (from-to)1-7
Number of pages7
JournalJournal of Communications and Networks
Volume18
Issue number1
DOIs
Publication statusPublished - 2016 Feb 1

Keywords

  • Collusion-resistance
  • Proxy re-encryption
  • Unidirectional lattice

ASJC Scopus subject areas

  • Computer Networks and Communications
  • Information Systems

Fingerprint Dive into the research topics of 'Collusion-resistant unidirectional proxy re-encryption scheme from lattices'. Together they form a unique fingerprint.

  • Cite this