浏览全部资源
扫码关注微信
1. 北京交通大学计算机与信息技术学院,北京100044
2. 北京邮电大学信息安全中心,北京100876
3. 河南理工大学计算机科学与技术学院,河南 焦作454000
[ "张静(1978-),女,河南焦作人,北京交通大学博士生、副教授,主要研究方向为信息安全、安全多方计算等。" ]
[ "罗守山(1962-),男,安徽合肥人,北京邮电大学教授、博士生导师,主要研究方向为信息安全、密码学理论、安全多方计算等。" ]
[ "杨义先(1961-),男,四川盐亭人,北京邮电大学教授、博士生导师,主要研究方向为信息安全、密码学等。" ]
[ "辛阳(1977-),男,山东烟台人,北京邮电大学副教授,主要研究方向为信息安全、密码学等。" ]
网络出版日期:2016-04,
纸质出版日期:2016-04-25
移动端阅览
张静, 罗守山, 杨义先, 等. 保护私有信息的点包含协议研究[J]. 通信学报, 2016,37(4):87-95.
Jing ZHANG, Shou-shan LUO, Yi-xian YANG, et al. Research on the privacy-preserving point-in-polygon protocol[J]. Journal of communications, 2016, 37(4): 87-95.
张静, 罗守山, 杨义先, 等. 保护私有信息的点包含协议研究[J]. 通信学报, 2016,37(4):87-95. DOI: 10.11959/j.issn.1000-436x.2016075.
Jing ZHANG, Shou-shan LUO, Yi-xian YANG, et al. Research on the privacy-preserving point-in-polygon protocol[J]. Journal of communications, 2016, 37(4): 87-95. DOI: 10.11959/j.issn.1000-436x.2016075.
摘 要:对现有保护私有信息的点包含协议进行研究,针对算法复杂度高、协议本身的的局限性等问题,在半诚实模型下,提出一种保护隐私的判断点与凸包位置关系协议。首先,利用OT
n
1
与矢量的几何性质,将传统的点线位置判断问题扩展,设计一种茫然安全点线位置关系判断协议;然后,将此协议作为基础协议,结合安全二分检索法提出最终解决方案。利用 Goldreich 证明法对协议进行安全性证明,同时分析协议的正确性与算法复杂度。分析结果表明,协议在效率上优于现有方案,并具有可扩展性。
A privacy-preserving point-in-polygon protocol was proposed under semi-honest model
to deal with the prob-lem of high complexity and limitation of the existing protocols. First
an blivious point-line protocol was designed by extending the traditional point-line protocol
making the use of 1-out-n oblivious transfer and the geometric properties of the vector. Then
based on this protocol and combined with the secure binary search protocol
the final solution was put forward. The security of the protocol was proved with ich method. Meanwihle
the validity and the complexity of the protocol were also be analyzed. It is shown that this new protocol gets the advantage over the existing one in terms of efficiency and enjoys excellent expandability.
ATALLAH M J , DU W . Secure multi-party computational geome-try [M ] . Algorithms and Data Structures . Springer Berlin HeidelBerg , 2001 : 165 - 179 .
DU W L , ATALLAH M J . Secure multi-party computation problems and their applications: a review and open problems [C ] // The 2001 Workshop on New Security Paradigms , c 2001 : 13 - 22 .
YANG B , SHAO Z Y , ZHANG W Z . Secure two-party protocols on planar convex hulls [J ] . Journal of Information , 2012 , 9 ( 4 ): 915 - 929 .
孙茂华 , 罗守山 , 辛阳 , 等 . 安全两方线段求交协议及其在保护隐私凸包交集中的应用 [J ] . 通信学报 , 2013 , 34 ( 1 ): 30 - 42 .
SUN M H , LUO S S , XIN Y , et al . Secure two-party line segments in-tersection scheme and its application in privacy-preserving convex hull intersection [J ] . Journal of Communications , 2013 , 34 ( 1 ): 30 - 42 .
YANG B , SUN A D , ZHANG W Z . Secure two-party protocols on planar circles [J ] . Journal of Information , 2011 , 8 ( 1 ): 29 - 40 .
耿涛 , 李海成 , 罗守山 , 等 . 保护私有信息的动点距离判定协议及其推广 [J ] . 北京邮电大学学报 , 2012 , 35 ( 3 ): 47 - 51 .
GENG T , LI H C , LUO S S , et al . A privacy-preserving dynamic point distance determination protocol and its extension [J ] . Journal of Beijing University of Posts and Telecommunications , 2012 , 35 ( 3 ): 47 - 51 .
仲红 , 孙彦飞 , 燕飞飞 , 等 . 保护私有信息的空间最近点对协议 [J ] . 计算机工程与应用 , 2011 , 48 ( 4 ): 87 - 89 .
ZHONG H , SUN Y F , YAN F F , et al . Protocol for privacy-preserving space closet-pair of points [J ] . Computer Engineering and Applicatio 2011 , 2011 , 48 ( 4 ): 87 - 89 .
周敏 , 杨波 , 万军洲 , 等 . 保留隐私的计算最近点对协议 [J ] . 西南师范大学学报 : 自然科学版 , 2013 , 38 ( 2 ): 111 - 115 .
ZHOU M , YANG B , WAN J Z , et al . A protocol for privacy-preserving closest-pair of points [J ] . Journal of Southwest China Normal U iver-sityJ] , 2013 , 38 ( 2 ): 111 - 115 .
李顺东 , 司天歌 , 戴一奇 . 集合包含与几何包含的多方保密计算 [J ] . 计算机研究与发展 , 2005 , 42 ( 10 ): 1647 - 1653 .
LI S D , SI T G , DAI Y Q . Secure multi-party computation of set-inclusion and graph-inclusion [J ] . Journal of Computer Research and Development , 2005 , 42 ( 10 ): 1647 - 1653 .
LUO Y L , HUANG L S , ZHONG H , et al . A secure protocol for de-termining whether a point is inside a convex polygon [J ] . Chinese Journal of Electronic , 2006 , 15 ( 4 ): 578 - 582 .
THOMAS T . Secure two-party protocols for point inclusion problem [J ] . International Journal of Network Security , 2009 , 9 ( 1 ): 1 - 7 .
YUN Y , LIU S H , WEI Y , et al . Efficient secure protocols to determine whether a point is inside a convex hull [C ] // International Symposium on Information Engineering and Electronic Commerce, IEEC'09 . c 2009 : 100 - 105 .
LI S D , DAO S W , DAI Y Q . Efficient secure multiparty computation-al geometry [J ] . Chinese Journal of Electronics , 2010 , 19 ( 2 ): 324 - 328 .
CHEN L , LIN B . Privacy-preserving point-inclusion two-party computation protocol [C ] // 2013 Fifth International Conference on Computational and Information Sciences (ICCIS). c 2013 : 257 - 260 .
LI S D , WU C Y , WANG D S , et al . Secure multiparty computation of solid geometric problems and their applications [J ] . Information Sciences , 2014 , 282 : 401 - 413 .
TRONCOSO-PASTORIZA J R , KATZENBEISSER S , CELIK M , et al . A secure multidimensional point inclusion protocol [C ] // The 9th Workshop on Multimedia &Security . c 2007 : 109 - 120 .
TZENG W G . Efficient 1-out-of-n oblivious transfer schemes with universally usable parameters [J ] . IEEE Transactions on Computers , 2004 , 53 ( 2 ): 232 - 240 .
YAO-PASTORIZA A C . Protocols for secure computations [C ] // The 23th Annual IEEE Symposium on Foundations of Computer Science . Chicago, USA , c 1982 : 160 - 164 .
IOANNIDIS I , GRAMA A . An efficient protocol for Yao's millio-naires' problem [C ] // The 36th Annual Hawaii International Conference on System Sciences . c 2003 : 6 .
PAILLIER P . Public-key cryptosystems based on composite degree residuosity classes [C ] // Advances in Cryptology—EUROCRYPT'99 . Springer Berlin HeidelBerg , c 1999 : 223 - 238 .
LUO YL , HUANG L S , CHEN G L , et al . Privacy-preserving distance measurement and its applications [J ] . Chinese Journal of Electronics , 2006 , 15 ( 2 ): 237 - 241 .
0
浏览量
886
下载量
0
CSCD
关联资源
相关文章
相关作者
相关机构