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

耿魁; 万盛; 李凤华; 何媛媛; 王瀚仪

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

您当前的位置：

首页 >

文章列表页 >

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

学术论文 | 更新时间：2024-10-11

- 基于隐私匹配的服务代理发现方法
- Privacy matching-based service proxy discovery scheme
- 通信学报 2016年37卷第8期页码：136-143
- 作者机构：
- 作者简介：
  
  [ "耿魁（1989-），男，湖北红安人，西安电子科技大学博士生，主要研究方向为网络安全。" ]
  [ "万盛（1987-），男，江苏南通人，西安电子科技大学博士生，主要研究方向为网络安全与隐私保护。" ]
  [ "李凤华（1966-），男，湖北浠水人，博士，中国科学院信息工程研究所副总工、研究员、博士生导师，主要研究方向为网络与系统安全、信息保护、隐私计算。" ]
  [ "何媛媛（1985-），女，湖北松滋人，中国科学院信息工程研究所博士生，主要研究方向为信息安全、隐私保护。" ]
  [ "王瀚仪（1994-），女，吉林省吉林市人，中国科学院信息工程研究所博士生，主要研究方向为网络安全。" ]
- 基金信息：
  
  国家自然科学基金—广东联合基金资助项目;The National Natural Science Foundation of China—Guangdong Union Foundation(U1401251);国家高技术研究发展计划(“863”计划）基金资助项目;The National High Technology Research and Development Program (863 Program)(2015AA016007);国家自然科学基金青年基金资助项目;The National Natural Science Youth Science Foundation of China(61502489)
- DOI：10.11959/j.issn.1000-436x.2016164
  中图分类号： TP393
- 网络出版日期：2016-08，
  
  纸质出版日期：2016-08-25
- 稿件说明：
移动端阅览
耿魁, 万盛, 李凤华, 等. 基于隐私匹配的服务代理发现方法[J]. 通信学报, 2016,37(8):136-143.

Kui GENG, Sheng WAN, Feng-hua LI, et al. Privacy matching-based service proxy discovery scheme[J]. Journal on communications, 2016, 37(8): 136-143.
耿魁, 万盛, 李凤华, 等. 基于隐私匹配的服务代理发现方法[J]. 通信学报, 2016,37(8):136-143. DOI： 10.11959/j.issn.1000-436x.2016164.

Kui GENG, Sheng WAN, Feng-hua LI, et al. Privacy matching-based service proxy discovery scheme[J]. Journal on communications, 2016, 37(8): 136-143. DOI： 10.11959/j.issn.1000-436x.2016164.

摘要

针对代理发现中用户对代理的性能、成本和安全性等方面的需求，以及需求匹配过程中的隐私保护问题，基于 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.

关键词

Keywords

references

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 .

SUN J , ZHANG R , ZHANG Y , et al . Privacy-preserving spatiotemporal matching [C ] // 32th IEEE International Conference on Computer Communications . c 2013 : 800 - 808 .

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 .

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 , c 2003 : 86 - 97 .

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 .

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 . c 2013 : 351 - 355 .

LI R , WU C . An unconditionally secure protocol for multi-party set intersection [M ] // 5th Springer Applied Cryptography and Network Se-curity . c 2007 : 226 - 236 .

KERSCHBAUM F . Outsourced private set intersection using homo-morphicencryption [C ] // 7th ACM Symposium on Information,Com-puter and Communications Security . c 2012 : 85 - 86 .

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 .

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 .

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 .

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 . c 2015 : 243 - 250 .

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 . c 2011 : 793 - 796 .

WANG B LI B LI H . Gmatch:secure and privacy-preserving group matching in social networks [C ] // 55th IEEE Global Communications Conference . c 2012 : 726 - 731 .

WANG B LI B LI H , et al . Achieving secure friend discovery in social strength-aware PMSNs [C ] // 34th IEEE Military Communications Conference . c 2015 : 947 - 953 .

PAILLIER P . Public-key cryptosystems based on composite degree residuosity classes [J ] . Springer Cryptology-EUROCRYPT , 1999 , 547 ( 1 ): 223 - 238 .

RANE S SUN W VETRO A . Privacy-preserving approximation of L1 distance for multimedia applications [C ] // Multimedia and Expo (ICME) . c 2010 : 492 - 497 .

ZHANG R ZHANG R SUN J , et al . Fine-grained private matching for proximity-based mobile social networking [C ] // INFOCOM . c 2012 : 1969 - 1977 .

浏览量

下载量

CSCD

文章被引用时，请邮件提醒。

提交

工具集

关联资源

基于自动化特征组合的隐私保护风险识别机制

基于同态密文转换的隐私保护卷积神经网络推理方案

同态明文-密文矩阵运算及其应用

理性安全的公平两方比较协议

面向Non-IID数据的拜占庭鲁棒联邦学习