Non-Interactive ID-Based Proxy Re-Signature Scheme for IoT Based on Mobile Edge Computing

被引:18
作者
Zhang, Jianhong [1 ,2 ,3 ]
Bai, Wenle [1 ]
Wang, Yuehai [1 ]
机构
[1] North China Univ Technol, Sch Elect & Informat Engn, Beijing 100144, Peoples R China
[2] Guangxi Key Lab Cryptog & Informat Secur, Guilin 541004, Peoples R China
[3] Guangxi Normal Univ, Guangxi Key Lab Multisource Informat Min & Secur, Guilin 541004, Peoples R China
关键词
ID-PRS; integer factorization problem; mobile edge computing; free-pairing; non-interactive;
D O I
10.1109/ACCESS.2019.2899828
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
The Internet of Things (IoT) is the internetworking of terminal physical devices depends on application programming interfaces and sensors to be connected to the Internet for collecting and exchanging data. According to the characteristics of IoT, it can provide rich services for the terminal user. However, the centralized cloud computing-based storage architecture in IoT faces many challenges, such as data security, identity privacy, and high latency. To overcome these challenges, this paper introduces an IoT network storage architecture based on mobile edge computing, which not only achieves low-latency message response and computation offloading of the terminal user but also preserves identity-privacy of the terminal user. Afterward, we presented a novel non-interactive pairing-free ID-based proxy re-signature scheme (ID-PRS), which is a kernel technique to construct the aforementioned storage architecture. Compared with most of proxy re-signature schemes constructed based on traditional public-key-infrastructure, the proposed scheme avoids expensive pairing operation and intricate certificate-maintenance. And it is demonstrated to be provably secure under the classic security assumptions: integer factoring problem and the RSA assumption. Finally, in contrast to the other two ID-PRS schemes, the proposed ID-PRS scheme has more advantages in terms of security, functionability, and computation costs. Thus, it is very suitable to be applied to the resource-constrained mobile users.
引用
收藏
页码:37865 / 37875
页数:11
相关论文
共 30 条
[11]  
Hitchcock Y, 2004, LECT NOTES COMPUT SC, V3348, P17
[12]  
Hong X, 2017, CLUSTER COMPUT, P1
[13]  
Hu XM, 2015, 2015 IEEE ADVANCED INFORMATION TECHNOLOGY, ELECTRONIC AND AUTOMATION CONTROL CONFERENCE (IAEAC), P166, DOI 10.1109/IAEAC.2015.7428540
[14]   Efficient Revocable ID-Based Signature With Cloud Revocation Server [J].
Jia, Xiaoying ;
He, Debiao ;
Zeadally, Sherali ;
Li, Li .
IEEE ACCESS, 2017, 5 :2945-2954
[15]  
Kim K., 2009, INT J NETWORK SECURI, V9, P8
[16]  
Lee E, 2018, COMPUT J, V61, P1772, DOI [10.1093/comjnl/bxy036, 10.1093/computer_journal/bxy036]
[17]   Efficient revocable identity-based encryption via subset difference methods [J].
Lee, Kwangsu ;
Lee, Dong Hoon ;
Park, Jong Hwan .
DESIGNS CODES AND CRYPTOGRAPHY, 2017, 85 (01) :39-76
[18]  
Louk M, 2015, 2015 INTERNATIONAL CONFERENCE ON INFORMATION NETWORKING (ICOIN), P493, DOI 10.1109/ICOIN.2015.7057954
[19]  
Manzoor A., 2018, BLOCKCHAIN BASED PRO
[20]   A position-aware Merkle tree for dynamic cloud data integrity verification [J].
Mao, Jian ;
Zhang, Yan ;
Li, Pei ;
Li, Teng ;
Wu, Qianhong ;
Liu, Jianwei .
SOFT COMPUTING, 2017, 21 (08) :2151-2164