Achieving Fuzzy Matching Data Sharing for Secure Cloud-Edge Communication

作     者：Chuan Zhang Mingyang Zhao Yuhua Xu Tong Wu Yanwei Li Liehuang Zhu Haotian Wang Chuan Zhang;Mingyang Zhao;Yuhua Xu;Tong Wu;Yanwei Li;Liehuang Zhu;Haotian Wang

作者机构：School of Cyberspace Science and TechnologyBeijing Institute of TechnologyBeijing 100081China School of Computer Science and TechnologyBeijing Institute of TechnologyBeijing 100081China Yangtze Delta Region Academy of Beijing Institute of TechnologyJiaxing 314019China National Computer Network Emergency Response Technical Team/Coordination Center of ChinaBeijing 100029China College of Arts and ScienceUniversity of PennsylvaniaPhiladelphia 19104USA 

出 版 物：《China Communications》 (中国通信（英文版）)

年 卷 期：2022年第19卷第7期

页      面：257-276页

核心收录：

学科分类：0839[工学-网络空间安全] 08[工学] 081201[工学-计算机系统结构] 0812[工学-计算机科学与技术（可授工学、理学学位）] 

基　　金：supported by the China Postdoctoral Science Foundation (Grant Nos. 2021TQ0042, 2021M700435, 2021TQ0041) the National Natural Science Foundation of China (Grant No. 62102027) the Shandong Provincial Key Research and Development Program (2021CXGC010106) 

主　　题：fuzzy-matching privacy-preserving set intersection cloud-edge communication data sharing 

摘      要：In this paper,we propose a novel fuzzy matching data sharing scheme named FADS for cloudedge *** allows users to specify their access policies,and enables receivers to obtain the data transmitted by the senders if and only if the two sides meet their defined certain policies ***,we first formalize the definition and security models of fuzzy matching data sharing in cloud-edge ***,we construct a concrete instantiation by pairing-based cryptosystem and the privacy-preserving set intersection on attribute sets from both sides to construct a concurrent matching over the *** the matching succeeds,the data can be ***,nothing will be *** addition,FADS allows users to dynamically specify the policy for each time,which is an urgent demand in practice.A thorough security analysis demonstrates that FADS is of provable security under indistinguishable chosen ciphertext attack(IND-CCA)in random oracle model against probabilistic polynomial-time(PPT)adversary,and the desirable security properties of privacy and authenticity are *** experiments provide evidence that FADS is with acceptable efficiency.