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

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

Abstract

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

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.

Figures/Tables 5

References 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.

Metrics

Recommended 0

No Suggested Reading articles found!

方案	参与方	离线计算开销	在线计算开销	通信量/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

RichHTML

PDF

Knowledge

Abstract

Cite this article

share this article

Figures/Tables 5

References 18

Related Articles 15

Metrics

Recommended 0

[1]	Xindi MA, Qinghua LI, Qi JIANG, Zhuo MA, Sheng GAO, Youliang TIAN, Jianfeng MA. Byzantine-robust federated learning over Non-IID data [J]. Journal on Communications, 2023, 44(6): 138-153.
[2]	Shengxing YU, Zhong CHEN. Efficient secure federated learning aggregation framework based on homomorphic encryption [J]. Journal on Communications, 2023, 44(1): 14-28.
[3]	Yatao YANG, Deli LIU, Peihe LIU, Ping ZENG, Song XIAO. BFV-Blockchainvoting: blockchain-based electronic voting systems with BFV full homomorphic encryption [J]. Journal on Communications, 2022, 43(9): 100-111.
[4]	Xuewang ZHANG, Zhihong LI, Jinzhao LIN. Privacy protection scheme based on fair blind signature and hierarchical encryption for consortium blockchain [J]. Journal on Communications, 2022, 43(8): 131-141.
[5]	Haining YU, Hongli ZHANG, Xiangzhan YU, Jiaxing QU, Mengmeng GE. Privacy-preserving trajectory similarity computation method [J]. Journal on Communications, 2022, 43(11): 1-13.
[6]	Sheng GAO, Kang XIANG, Youliang TIAN, Weijie TAN, Tao FENG, Xiaoxue WU. BCP-based joint delegation learning model and protocol [J]. Journal on Communications, 2021, 42(5): 137-148.
[7]	Ruiqi LI, Chunfu JIA, Yafei WANG. Multi-key homomorphic proxy re-encryption scheme based on NTRU and its application [J]. Journal on Communications, 2021, 42(3): 11-22.
[8]	Chunfu JIA, Ruiqi LI, Yafei WANG. Privacy protection scheme of DBSCAN clustering based on homomorphic encryption [J]. Journal on Communications, 2021, 42(2): 1-11.
[9]	Xiaodong YANG, Wanting XI, Jiaqi WANG, Aijia CHEN, Caifen WANG. Electronic evidence sharing scheme of Internet of vehicles based on signcryption and blockchain [J]. Journal on Communications, 2021, 42(12): 236-246.
[10]	Lei HE, Jianfeng MA, Dawei WEI. Attribute-based proxy signature scheme for unmanned aerial vehicle networks [J]. Journal on Communications, 2021, 42(11): 87-96.
[11]	Yousheng ZHOU,Chang TAN,Fei TANG. Multi-dimensional secure query scheme for fog-enhanced IIoT [J]. Journal on Communications, 2020, 41(8): 175-186.
[12]	Shufen NIU,Wenke LIU,Lixia CHEN,Caifen WANG,Xiaoni DU. Electronic medical record data sharing scheme based on searchable encryption via consortium blockchain [J]. Journal on Communications, 2020, 41(8): 204-214.
[13]	Yingying LI,Jianfeng MA,Yinbin MIAO. Encrypted image retrieval in multi-key settings based on edge computing [J]. Journal on Communications, 2020, 41(4): 14-26.
[14]	Youliang TIAN,Qiuxian LI,Duo ZHANG,Linjie WANG. Provably secure rational delegation computation protocol [J]. Journal on Communications, 2019, 40(7): 135-143.
[15]	FENG Chaosheng,LUO Wangping,QIN Zhiguang,YUAN Ding,ZOU Liping. Attribute-based proxy re-encryption scheme with multiple features [J]. Journal on Communications, 2019, 40(6): 177-189.