基于隐私匹配的服务代理发现方法

doi:10.11959/j.issn.1000-436x.2016164

通信学报 ›› 2016, Vol. 37 ›› Issue (8): 136-143.doi: 10.11959/j.issn.1000-436x.2016164

基于隐私匹配的服务代理发现方法

耿魁¹,万盛¹,李凤华^1,²,何媛媛²,王瀚仪²

¹ 西安电子科技大学综合业务网理论与关键技术国家重点实验室，陕西西安 710071
² 中国科学院信息工程研究所信息安全国家重点实验室，北京 100093

出版日期:2016-08-25 发布日期:2016-09-01
基金资助:
国家自然科学基金委—广东联合基金资助项目;国家高技术研究发展计划（“863”计划）基金资助项目;国家自然科学基金资助项目

Privacy matching-based service proxy discovery scheme

Kui GENG¹,Sheng WAN¹,Feng-hua LI^1,²,Yuan-yuan HE²,Han-yi WANG²

¹ State Key Laboratory of Integrated Service Networks,Xidian University,Xi'an 710071,China
² State Key Laboratory of Information Security,Institute of Information Engineering,CAS,Beijing 100093,China

Online:2016-08-25 Published:2016-09-01
Supported by:
The Key Program of the National Natural Science Foundation of China-Guangdong Union Foundation;The National High Technology Research and Development Program of China (863 Program);The National Natural Science Foundation of China

摘要/Abstract

摘要：

针对代理发现中用户对代理的性能、成本和安全性等方面的需求，以及需求匹配过程中的隐私保护问题，基于 Paillier 同态加密算法，提出一种新的综合考虑代理和用户属性及其偏好的私有数据信息匹配算法，包括建立基于欧氏距离的相似度函数、利用加密算法进行匹配、计算相似度和确定匹配的代理链4个步骤。该算法引入半可信主代理从全局层面管理所有子代理的业务类型和连接状况，并承担主要的计算开销，同时将欧氏距离与Paillier同态加密算法有机结合，支持具有偏好信息的多元属性数据匹配，能够有效保障用户和子代理的安全性。最终，通过安全性分析与性能仿真，证明所提出方案的安全性和有效性。

关键词: 代理, 服务代理发现, 隐私匹配, 同态加密

Abstract:

According to user's requirements on the proxy performance,cost and safety in proxy discovery,and the pri-vacy-preserving issue during the process of the demand private matching,a new private matching algorithm was pre-sented based on Paillier homomorphic encryption,comprehensively considered the attributes of user and agents and their priority.It included four steps:building the similarity function based on Euclidean distance,carrying on the private matching by encryption algorithm,calculating the similarity and screening the proxy chain.Proposed scheme introduced semi trusted primary proxy from the global level,which is to manage all the sub proxy's business type and the connection status,and do the main computational overhead.At the same time,Euclidean distance and Paillier homomorphic encryp-tion algorithm were combined to support the multivariate attributes with priority to match,which can effectively protect the privacy of user and sub proxy.Finally,security analysis and evaluation results show the effectiveness and safety of proposed scheme.

Key words: proxy, service proxy discovery, privacy matching, homomorphic encryption

耿魁,万盛,李凤华,何媛媛,王瀚仪. 基于隐私匹配的服务代理发现方法[J]. 通信学报, 2016, 37(8): 136-143.

Kui GENG,Sheng WAN,Feng-hua LI,Yuan-yuan HE,Han-yi WANG. Privacy matching-based service proxy discovery scheme[J]. Journal on Communications, 2016, 37(8): 136-143.

图/表 5

图1

表1

表2

表3

图2

参考文献 18

[1]	ZHENG Y , LI M , LOU W , et al. Location based handshake and private proximity test with location tags[J]. IEEE Transactions on Dependable and Secure Computing, 2015,1.
[2]	SUN J , ZHANG R , ZHANG Y , et al. Privacy-preserving spatiotemporal matching[C]// 32th IEEE International Conference on Computer Communications. c2013:800-808.
[3]	LU R , LIN X , SHEN X , et al. SPOC:a secure and privacy-preserving op-portunistic computing framework for mobile-healthcare emergency[J]. IEEE Transactions on Parallel and Distributed Systems, 2013,24(3):614-623.
[4]	AGRAWAL R , EVFIMIEVSKI A , SRIKANT R . Information sharing across private databases[C]// 32th IEEE International Conference on Computer Communications. 30th ACM SIGMOD International Con-ference on Management of Data, c2003:86-97.
[5]	VAIDYA J , CLIFTON C . SPOC:a secure and privacy-preserving op-portunistic computing framework for mobile-healthcare emergency[J]. IEEE Transactions on Parallel and Distributed Systems, 2005,1(13):593-622.
[6]	NIU B , ZHU X , ZHANG T , et al. P-match:priority-aware friend discovery for proximity-based mobile social networks[C]// 10th IEEE International Conference on Mobile Ad-Hoc and Sensor Systems. c2013:351-355.
[7]	LI R , WU C . An unconditionally secure protocol for multi-party set intersection[M]// 5th Springer Applied Cryptography and Network Se-curity. c2007:226-236.
[8]	KERSCHBAUM F . Outsourced private set intersection using homo-morphicencryption[C]// 7th ACM Symposium on Information,Com-puter and Communications Security. c2012:85-86.
[9]	LI M , YU S , CAO N , et al. Privacy-preserving distributed profile matching in proximity-based mobile social networks[J]. IEEE Trans-actions on Wireless Communications, 2013,12(5):2024-2033.
[10]	ZHANG R , ZHANG J , ZHANG Y , et al. Privacy-preserving profile matching for proximity-based mobile social networking[J]. IEEE Trans-actions on Wireless Communications, 2013,31(9):656-668.
[11]	THAPA A , LI M , SALINAS S , et al. Asymmetric social proximity based private matching protocols for online social networks[J]. IEEE Transactions on Parallel and Distributed Systems, 2015,26(6):1547-1559.
[12]	CHU W T CHANG F C . A privacy-preserving bipartite graph match-ing framework for multimedia analysis and retrieval[C]// 5th ACM In-ternational Conference on Multimedia Retrieval. c2015:243-250.
[13]	JECKMANS A TANG Q HARTEL P . Poster:privacy-preserving profile similarity computation in online social networks[C]// 18th ACM Conference on Computer and Communications Security. c2011:793-796.
[14]	WANG B LI B LI H . Gmatch:secure and privacy-preserving group matching in social networks[C]// 55th IEEE Global Communications Conference. c2012:726-731.
[15]	WANG B LI B LI H , et al. Achieving secure friend discovery in social strength-aware PMSNs[C]// 34th IEEE Military Communications Conference. c2015:947-953.
[16]	PAILLIER P . Public-key cryptosystems based on composite degree residuosity classes[J]. Springer Cryptology-EUROCRYPT, 1999,547(1):223-238.
[17]	RANE S SUN W VETRO A . Privacy-preserving approximation of L1 distance for multimedia applications[C]// Multimedia and Expo (ICME). c2010:492-497.
[18]	ZHANG R ZHANG R SUN J , et al. Fine-grained private matching for proximity-based mobile social networking[C]// INFOCOM. c2012:1969-1977.

方案	参与方	离线计算开销	在线计算开销	通信量/bit
	用户	2m(w?1)exp₁+m(w?1)mul₂	hexp₂	m(w?1)2 048+1 184
本文方案	主代理	—	kexp₄+kmul₄	k[m(w?1)2 048+1 184]+2 048h
	子代理	—	m(w?1)mul₂+2exp₁	4 096
	用户	2[m(w?1)+1]exp₁+[m(w?1)+1]mul₂	kmul₂,kexp₂	m(w?1)2 048
文献[17]方案	主代理	—	—	k[m(w?1)+1]2 048
	子代理	m(w?1)mul₁	m(w?1)exp₂+m(w?1)mul₁+2exp₁+mul₂	2 048
	用户	2m(w?1)exp₁,m(w?1)mul₂	kexp₂	m(w?1)2 048+1 184
文献[18]方案	主代理	—	—	k[m(w?1)2 048+1 184]+2 048k
	子代理	—	m(w?1)mul₂+exp₁	2 048

运算	平均值	最大值	最小值	中位数	标准差
mul₁/μs	0.352 3	0.43	0.33	0.34	1.3×10^?3
mul₂/μs	2.562	2.64	2.53	2.55	5.4×10^?4
exp₁/ms	2.833	3.02	2.79	2.828	0.097
exp₂/ms	5.022	10.535	4.357	4.373	2.917

运算	平均值	最大值	最小值	中位数	标准差
mul₃/μs	0.272 6	0.90	0.21	0.23	0.014 2
mul₄/μs	2.083	4.81	1.67	1.75	0.466 7
exp₃/ms	1.957	3.69	1.475	1.713	0.31
exp₄/ms	3.76	6.9	2.92	3.24	0.76

基于隐私匹配的服务代理发现方法

Privacy matching-based service proxy discovery scheme

在线阅读

PDF下载

可视化

摘要/Abstract

引用本文

使用本文

图/表 5

参考文献 18

相关文章 15

Metrics

推荐阅读 0

[1]	马鑫迪, 李清华, 姜奇, 马卓, 高胜, 田有亮, 马建峰. 面向Non-IID数据的拜占庭鲁棒联邦学习[J]. 通信学报, 2023, 44(6): 138-153.
[2]	余晟兴, 陈钟. 基于同态加密的高效安全联邦学习聚合框架[J]. 通信学报, 2023, 44(1): 14-28.
[3]	杨亚涛, 刘德莉, 刘培鹤, 曾萍, 肖嵩. BFV-Blockchainvoting：支持BFV全同态加密的区块链电子投票系统[J]. 通信学报, 2022, 43(9): 100-111.
[4]	张学旺, 黎志鸿, 林金朝. 基于公平盲签名和分级加密的联盟链隐私保护方案[J]. 通信学报, 2022, 43(8): 131-141.
[5]	于海宁, 张宏莉, 余翔湛, 曲家兴, 葛蒙蒙. 隐私保护的轨迹相似度计算方法[J]. 通信学报, 2022, 43(11): 1-13.
[6]	高胜, 向康, 田有亮, 谭伟杰, 冯涛, 吴晓雪. 基于BCP的联合委托学习模型及协议[J]. 通信学报, 2021, 42(5): 137-148.
[7]	李瑞琪, 贾春福, 王雅飞. 基于NTRU的多密钥同态代理重加密方案及其应用[J]. 通信学报, 2021, 42(3): 11-22.
[8]	贾春福, 李瑞琪, 王雅飞. 基于同态加密的DBSCAN聚类隐私保护方案[J]. 通信学报, 2021, 42(2): 1-11.
[9]	杨小东, 席婉婷, 王嘉琪, 陈艾佳, 王彩芬. 基于签密和区块链的车联网电子证据共享方案[J]. 通信学报, 2021, 42(12): 236-246.
[10]	贺蕾, 马建峰, 魏大卫. 面向无人机网络的属性代理签名方案[J]. 通信学报, 2021, 42(11): 87-96.
[11]	周由胜,谭畅,唐飞. 面向雾增强型工业物联网的多维安全查询方案[J]. 通信学报, 2020, 41(8): 175-186.
[12]	牛淑芬,刘文科,陈俐霞,王彩芬,杜小妮. 基于联盟链的可搜索加密电子病历数据共享方案[J]. 通信学报, 2020, 41(8): 204-214.
[13]	李颖莹,马建峰,苗银宾. 基于边缘计算的支持多密钥的加密图像检索[J]. 通信学报, 2020, 41(4): 14-26.
[14]	田有亮,李秋贤,张铎,王琳杰. 可证明安全的理性委托计算协议[J]. 通信学报, 2019, 40(7): 135-143.
[15]	陈黎丽,王震,郭云川,华佳烽,姚宇超,李凤华. 安全数据采集代理顽健部署策略研究[J]. 通信学报, 2019, 40(6): 51-65.