Page 301 - 《软件学报》2020年第12期
P. 301
巩林明 等:数轴上保密关系测定协议 3967
[17] Gordon SD, Hazay C, Katz J, Lindell Y. Complete fairness in secure two-party computation. Journal of the ACM, 2008,(6):303.
[18] Shundong L, Daoshun W, Yiqi D, Ping L. Symmetric cryptographic solution to Yao’s millionaires’ problem and an evaluation of
secure multiparty computations. Information Sciences, 2008,178(1):244−255.
[19] Nishide T, Ohta K. Multiparty computation for interval, equality, and comparison without bit-decomposition protocol. In: Proc. of
the Int’l Workshop on Public Key Cryptography. Berlin, Heidelberg: Springer-Verlag, 2007. 343−360.
[20] Guo YM, Zhou SF, Dou JW, Li SD, Wang DS. Efficient privacy-preserving interval computation and its applications. Chinese
Journal of Computers, 2016,39:1−17 (in Chinese with English abstract).
[21] Chen ZH, Li SD, Chen LC, Huang Q, Zhang WG. Fully privacy-preserving determination of point-range relationship. Scientia
Sinica Informationis, 2018,48:187−204 (in Chinese with English abstract).
[22] Gong LM, Li SD, Dou JW, Guo YM, Wang DS. Homomorphic encryption scheme and a protocol on secure computing a line by two
private points. Ruan Jian Xue Bao/Journal of Software, 2017,28(12):3274−3292 (in Chinese with English abstract). http://www.jos.
org.cn/1000-9825/5239.htm [doi: 10.13328/j.cnki.jos.005239]
[23] ElGamal T. A public key cryptosystem and a signature scheme based on discrete logarithms. IEEE Trans. on Information Theory,
1985,31(4):469−472.
[24] Damgård I, Jurik M. A generalisation, a simplication and some applications of paillier’s probabilistic public-key system. In: Proc. of
the Int’l Workshop on Public Key Cryptography. Berlin, Heidelberg: Springer-Verlag, 2001. 119−136.
[25] Goldreich O. Foundations of Cryptography: Vol.2, Basic Applications. Cambridge: Cambridge University Press, 2004. 615−626.
[26] Du W, Atallah MJ. Secure multi-party computation problems and their applications: A review and open problems. In: Proc. of the
2001 Workshop on New Security Paradigms. New York: ACM, 2001. 13−22.
[27] Mu B, Bakiras S. Private proximity detection for convex polygons. Tsinghua Science and Technology, 2016,21(3):270−280.
附中文参考文献:
[13] 李顺东,戴一奇,游启友.姚氏百万富翁问题的高效解决方案.电子学报,2005,33(5):769−773.
[16] 李顺东,王道顺.基于同态加密的高效多方保密计算.电子学报,2013,41(4):798−803.
[20] 郭奕旻,周素芳,窦家维,李顺东,王道顺.高效的区间保密计算及应用.计算机学报,2016,39:1−17.
[21] 陈振华,李顺东,陈立朝,黄琼,张卫国.点和区间关系的全隐私保密判定.中国科学:信息科学,2018,48:187−204.
[22] 巩林明,李顺东,窦家维,郭奕旻,王道顺.同态加密方案及安全两点直线计算协议.软件学报,2017,28(12):3274−3292. http://www.
jos.org.cn/1000-9825/5239.htm [doi: 10.13328/j.cnki.jos.005239]
巩林明(1979-),男,博士,讲师,主要研究 薛涛(1973-),男,博士,教授, CCF 专业会
领域为密码学,信息安全. 员,主要研究领域为分布式计算,云计算安
全,大数据安全.
李顺东(1963-),男,博士,教授,博士生导 王道顺(1964-),男,博士,副教授,博士生
师,主要研究领域为公钥密码,安全多方 导师 , 主 要研究领 域为公钥 密码 , 视觉
计算. 密码.
邵连合(1988-),男,博士,副教授,CCF 专
业会员,主要研究领域为量子信息及量子
信息安全.