[1] Yao A C. Protocols for secure computations//Proceedings of the 23rd Annual IEEE Symposium on Foundations of Computer Science. Los Alamitos: IEEE Computer Society Press, 1982: 160-164.
[2] Goldreich O. Secure multi-party computation (working draft). . http://www.wisdom.weizmann.ac.il/~oded/pp.html.
[3] Goldreich O, Micali S, Wigderson A. How to play any mental game// The 19th Annual ACM Conference on Theory of Computing. New York: ACM, 1987: 218-229.
[4] Atallah M J, Kerschbaum F, Du W L. Secure and private sequence comparisons//Proceedings of the 2003 ACM Workshop on Privacy in the Electronic Society. Washington: ACM, 2003: 39-44.
[5] 秦波, 秦慧, 周克复, 等. 常数复杂性的百万富翁协议[J]. 西安理工大学学报, 2005, 21(2): 149-152. Qin Bo, Qin Hui, Zhou Kefu, et al. Millionaires' protocol with constant complexity[J]. Journal of Xian University of Technology, 2005, 21(2): 149-152.
[6] 刘文, 罗守山, 陈萍. 保护私有信息的点线关系判定协议及其应用[J]. 北京邮电大学学报, 2008, 31(2): 72-75. Liu Wen, Luo Shoushan, Chen Ping. Privacy-preserving point-line relation determination protocol and its applications[J]. Journal of Beijing University of Posts and Telecommunications, 2008, 31(2): 72-75.
[7] 肖倩, 罗守山, 陈萍, 等. 半诚实模型下安全多方排序问题的研究[J]. 电子学报, 2008, 36(4): 709-714. Xiao Qian, Luo Shoushan, Chen Ping, et al. Research on the problem of secure multi-party ranking under semi-honest model[J]. Acta Electronica Sinica, 2008, 36(4): 709-714.
[8] Goldwasser S, Micali S. Probabilistic encryption[J]. Journal of Computer and System Sciences, 1984, 28(2): 270-299.
[9] Paillier P. Public-key cryptosystems based on composite degree residuosity classes// EUROCRYPT'99. Heidelberg: Springer-Verlag, 1999: 223-238.
[10] 李洪兴, 汪培庄. 模糊数学[M]. 北京: 国防工业出版社, 1994: 116-117. |
