[1] |
ATALLAH M J , DU W . Secure multi-party computational geome-try[M]. Algorithms and Data Structures. Springer Berlin HeidelBerg, 2001:165-179.
|
[2] |
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, c2001:13-22.
|
[3] |
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.
|
[4] |
孙茂华, 罗守山, 辛阳 , 等. 安全两方线段求交协议及其在保护隐私凸包交集中的应用[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.
|
[5] |
YANG B , SUN A D , ZHANG W Z . Secure two-party protocols on planar circles[J]. Journal of Information, 2011,8(1):29-40.
|
[6] |
耿涛, 李海成, 罗守山 , 等. 保护私有信息的动点距离判定协议及其推广[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.
|
[7] |
仲红, 孙彦飞, 燕飞飞 , 等. 保护私有信息的空间最近点对协议[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.
|
[8] |
周敏, 杨波, 万军洲 , 等. 保留隐私的计算最近点对协议[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.
|
[9] |
李顺东, 司天歌, 戴一奇 . 集合包含与几何包含的多方保密计算[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.
|
[10] |
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.
|
[11] |
THOMAS T . Secure two-party protocols for point inclusion problem[J]. International Journal of Network Security, 2009,9(1):1-7.
|
[12] |
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. c2009:100-105.
|
[13] |
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.
|
[14] |
CHEN L , LIN B . Privacy-preserving point-inclusion two-party computation protocol[C]// 2013 Fifth International Conference on Computational and Information Sciences(ICCIS). c2013:257-260.
|
[15] |
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.
|
[16] |
TRONCOSO-PASTORIZA J R , KATZENBEISSER S , CELIK M , et al. A secure multidimensional point inclusion protocol[C]// The 9th Workshop on Multimedia &Security. c2007:109-120.
|
[17] |
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.
|
[18] |
YAO-PASTORIZA A C . Protocols for secure computations[C]// The 23th Annual IEEE Symposium on Foundations of Computer Science. Chicago, USA, c1982:160-164.
|
[19] |
IOANNIDIS I , GRAMA A . An efficient protocol for Yao's millio-naires' problem[C]// The 36th Annual Hawaii International Conference on System Sciences. c2003:6.
|
[20] |
PAILLIER P . Public-key cryptosystems based on composite degree residuosity classes[C]// Advances in Cryptology—EUROCRYPT'99. Springer Berlin HeidelBerg, c1999:223-238.
|
[21] |
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.
|