Collusion-resistant unidirectional proxy re-encryption scheme from lattices

• Published in: Journal of communications and networks Vol. 18; no. 1; pp. 1 - 7
• Main Authors: Kim, Kee Sung, Jeong, Ik Rae
• Format: Journal Article
• Language: English
• Published: Seoul Editorial Department of Journal of Communications and Networks 01.02.2016; The Institute of Electrical and Electronics Engineers, Inc. (IEEE); 한국통신학회
• Subjects: Collusion-resistance; Encryption; Lattices; proxy re-encryption; Public key; Transforms; unidirectional lattice; Zinc; 전자/정보통신공학; unidirectional lattice; Collusion-resistance; proxy re-encryption
• ISSN: 1229-2370; 1976-5541
• DOI: 10.1109/JCN.2016.000003

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.