Affiliations: [a] Beijing University of Posts and Telecommunications, Beijing 100876, P.R. China. {wanglc, glzisc}@bupt.edu.cn, lijingbeiyou@163.com | [b] Nanjing University of Information Science and Technology, Nanjing 210044 P.R. China. qzghhh@126.com
Correspondence:
[†]
Address for correspondence: Jiangsu Engineering Center of Network Monitoring, School of Computer and Software, Nanjing University of Information Science and Technology, Nanjing 210044 P.R. China
Note: [*] An extended abstract of this work is to appear at INCoS 2016 [30], this is the full version.
Abstract: Proxy re-encryption (PRE) enables a semi-trusted proxy to transfer Alice’s secrets into Bob’s secrets but without seeing the secrets. This functionality is very interesting for making balance between the information confidentiality and the mutual accessibility in various scenarios such as public cloud storage systems. During the past decades, many smart PRE schemes were built based on intractability assumptions such as integer factorization problems (IFP) and discrete logarithm problems (DLP). However, Shor’s efficient quantum algorithms for IFP and DLP stand great threats towards the security baseline of these schemes. Enlightened by Gu et al.’s recent work on resisting known quantum attacks, we propose an efficient PRE scheme based on the intractability of the (semi)group factorization problems in this paper. The security of the proposed scheme is analyzed according to some heuristic attacks. Moreover, a special instantiation technique is present in detail, and some illustrations are provided for manifesting the effectiveness and efficiency of the proposed methodology.
Keywords: Proxy re-encryption, quantum attack resistant, group factorization, non-commutative cryptography
