Traceable and Privacy-Preserving Non-Interactive Data Sharing in Mobile Crowdsensing

被引:0
作者
Song, Fuyuan [1 ]
Qin, Zheng [1 ,2 ]
Liang, Jinwen [1 ]
Xiong, Pulei [3 ]
Lin, Xiaodong [4 ]
机构
[1] Hunan Univ, Coll Comp Sci & Elect Engn, Changsha 410082, Hunan, Peoples R China
[2] State Key Lab Cryptol, POB 5159, Beijing 100878, Peoples R China
[3] Natl Res Council Canada, Ottawa, ON K1A 0R6, Canada
[4] Univ Guelph, Sch Comp Sci, Guelph, ON N1G 2W1, Canada
来源
2021 18TH INTERNATIONAL CONFERENCE ON PRIVACY, SECURITY AND TRUST (PST) | 2021年
基金
中国国家自然科学基金;
关键词
Traceability; data sharing; privacy-preserving; mobile crowdsensing;
D O I
10.1109/PST52912.2021.9647802
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
Data sharing is one of the key technologies, which provides the practice of making data collected from a crowd of mobile devices available to others using a cloud infrastructure, known as mobile crowdsensing (MCS). However, the collected data may contain sensitive information, and sharing them in public clouds without proper protection could cause serious security problems, such as privacy leakage, unauthorized access, and secret key abuse. To address the above issues, in this paper, we propose a Traceable and privacy-preserving non-Interactive Data Sharing (TIDS) scheme in mobile crowdsensing. Specifically, to achieve privacy-preserving fine-grained data sharing, an attribute-based access policy is generated by a data owner without interacting with data users in the TIDS. Furthermore, we design a ciphertext conversion mechanism to support flexible data sharing. Also, by utilizing traceable Ciphertext-Policy AttributeBased Encryption (CP-ABE), TIDS supports a trusted authority to trace malicious users who abuse their secret keys without incurring additional computational overhead. Security analysis demonstrates that TIDS can protect the confidentiality of the outsourced data. Experimental results show that TIDS can achieve efficient data sharing in mobile crowdsensing applications.
引用
收藏
页数:9
相关论文
共 30 条
[1]  
Abdalla M, 2007, LECT NOTES COMPUT SC, V4450, P361
[2]  
Beimel A., 1996, SECURE SCHEMES SECRE
[3]   Identity-based encryption from the Weil pairing [J].
Boneh, D ;
Franklin, M .
SIAM JOURNAL ON COMPUTING, 2003, 32 (03) :586-615
[4]   Multiparty Key Exchange, Efficient Traitor Tracing, and More from Indistinguishability Obfuscation [J].
Boneh, Dan ;
Zhandry, Mark .
ALGORITHMICA, 2017, 79 (04) :1233-1285
[5]  
Boneh D, 2008, CCS'08: PROCEEDINGS OF THE 15TH ACM CONFERENCE ON COMPUTER AND COMMUNICATIONS SECURITY, P501
[6]   A Flexible Privacy-Preserving Data Sharing Scheme in Cloud-Assisted IoT [J].
Deng, Hua ;
Qin, Zheng ;
Sha, Letian ;
Yin, Hui .
IEEE INTERNET OF THINGS JOURNAL, 2020, 7 (12) :11601-11611
[7]   Betrayal, Distrust, and Rationality: Smart Counter-Collusion Contracts for Verifiable Cloud Computing [J].
Dong, Changyu ;
Wang, Yilei ;
Aldweesh, Amjad ;
McCorry, Patrick ;
van Moorsel, Aad .
CCS'17: PROCEEDINGS OF THE 2017 ACM SIGSAC CONFERENCE ON COMPUTER AND COMMUNICATIONS SECURITY, 2017, :211-227
[8]   Secure Keyword Search and Data Sharing Mechanism for Cloud Computing [J].
Ge, Chunpeng ;
Susilo, Willy ;
Liu, Zhe ;
Xia, Jinyue ;
Szalachowski, Pawel ;
Fang Liming .
IEEE TRANSACTIONS ON DEPENDABLE AND SECURE COMPUTING, 2021, 18 (06) :2787-2800
[9]   Identity-based conditional proxy re-encryption with fine grain policy [J].
Ge, Chunpeng ;
Susilo, Willy ;
Wang, Jiandong ;
Fang, Liming .
COMPUTER STANDARDS & INTERFACES, 2017, 52 :1-9
[10]  
Goyal V., 2006, P 13 ACM C COMP COMM, P89, DOI DOI 10.1145/1180405.1180418