A Lattice-Based Homomorphic Proxy Re-Encryption Scheme with Strong Anti-Collusion for Cloud Computing

被引:9
作者
Li, Juyan [1 ,2 ]
Qiao, Zhiqi [1 ]
Zhang, Kejia [1 ]
Cui, Chen [1 ]
机构
[1] Heilongjiang Univ, Coll Data Sci & Technol, Harbin 150080, Peoples R China
[2] Guangxi Key Lab Cryptog & Informat Secur, Guilin 541004, Peoples R China
基金
中国国家自然科学基金;
关键词
LWE; homomorphic proxy re-encryption; strong anti-collusion; key switching; trapdoor sampling; cloud computing; SECURE;
D O I
10.3390/s21010288
中图分类号
O65 [分析化学];
学科分类号
070302 ; 081704 ;
摘要
The homomorphic proxy re-encryption scheme combines the characteristics of a homomorphic encryption scheme and proxy re-encryption scheme. The proxy can not only convert a ciphertext of the delegator into a ciphertext of the delegatee, but also can homomorphically calculate the original ciphertext and re-encryption ciphertext belonging to the same user, so it is especially suitable for cloud computing. Yin et al. put forward the concept of a strong collusion attack on a proxy re-encryption scheme, and carried out a strong collusion attack on the scheme through an example. The existing homomorphic proxy re-encryption schemes use key switching algorithms to generate re-encryption keys, so it can not resist strong collusion attack. In this paper, we construct the first lattice-based homomorphic proxy re-encryption scheme with strong anti-collusion (HPRE-SAC). Firstly, algorithm TrapGen is used to generate an encryption key and trapdoor, then trapdoor sampling is used to generate a decryption key and re-encryption key, respectively. Finally, in order to ensure the homomorphism of ciphertext, a key switching algorithm is only used to generate the evaluation key. Compared with the existing homomorphic proxy re-encryption schemes, our HPRE-SAC scheme not only can resist strong collusion attacks, but also has smaller parameters.
引用
收藏
页码:1 / 20
页数:20
相关论文
共 57 条
  • [1] Generating Shorter Bases for Hard Random Lattices
    Alwen, Joel
    Peikert, Chris
    [J]. THEORY OF COMPUTING SYSTEMS, 2011, 48 (03) : 535 - 553
  • [2] [Anonymous], 2019, INT J NETW SECUR
  • [3] [Anonymous], 2010, THESIS
  • [4] Aono Yoshinori, 2013, Progress in Cryptology - INDOCRYPT 2013. 14th International Conference on Cryptology in India. Proceedings: LNCS 8250, P1, DOI 10.1007/978-3-319-03515-4_1
  • [5] Applebaum B, 2009, LECT NOTES COMPUT SC, V5677, P595, DOI 10.1007/978-3-642-03356-8_35
  • [6] Ateniese G., 2006, ACM Transactions on Information and Systems Security, V9, P1, DOI 10.1145/1127345.1127346
  • [7] Ateniese G, 2009, LECT NOTES COMPUT SC, V5473, P279, DOI 10.1007/978-3-642-00862-7_19
  • [8] Banerjee A., 2013, J INTERNET SERVICES, V3, P38
  • [9] Towards a secure incremental proxy re-encryption for e-healthcare data sharing in mobile cloud computing
    Bhatia, Tarunpreet
    Verma, A. K.
    Sharma, Gaurav
    [J]. CONCURRENCY AND COMPUTATION-PRACTICE & EXPERIENCE, 2020, 32 (05)
  • [10] Secure sharing of mobile personal healthcare records using certificateless proxy re-encryption in cloud
    Bhatia, Tarunpreet
    Verma, A. K.
    Sharma, Gaurav
    [J]. TRANSACTIONS ON EMERGING TELECOMMUNICATIONS TECHNOLOGIES, 2018, 29 (06):