[1] YAO A C. Protocols for secure computations[C]//Proceedings of the 23rd Annual Symposium on Foundations of Computer Science. Piscataway:IEEE,1982:160-164. [2] GOLDREICH O,MICALI S,WIGDERSON A. How to play ANY mental game[C]//Proceedings of the 19th Annual ACM Symposium on Theory of Computing. New York:ACM,1987:218-229. [3] BEN-OR M,GOLDWASSER S,WIGDERSON A. Completeness theorems for non-cryptographic fault-tolerant distributed computation[C]//Proceedings of the 20th Annual ACM Symposium on Theory of Computing. New York:ACM,1988:1-10. [4] YAO A C C. How to generate and exchange secrets[C]//Proceedings of the 27th Annual Symposium on Foundations of Computer Science. Piscataway:IEEE,1986:162-167. [5] MOHASSEL P,WEINREB E. Efficient secure linear algebra in the presence of covert or computationally unbounded adversaries[C]//Proceedings of the 28th Annual International Cryptology Conference,LNCS 5157. Berlin:Springer,2008:481-496. [6] 马敏耀, 徐艺, 刘卓. 隐私保护DNA序列汉明距离计算问题[J]. 计算机应用,2019,39(9):2636-2640.(MA M Y,XU Y,LIU Z. Privacy preserving Hamming distance computing problem of DNA sequences[J]. Journal of Computer Applications,2019,39(9):2636-2640.) [7] 李占利, 陈立朝, 陈振华, 等. 基于1-r编码的高效百万富翁问题协议及应用[J]. 密码学报,2019,6(1):50-60.(LI Z L,CHEN L C,CHEN Z H,et al. Design and applications of efficient protocol of millionaires'problem based on 1-r encoding[J]. Journal of Cryptologic Research,2019,6(1):50-60.) [8] LIU W,WANG Y,SUI A,et al. Quantum protocol for millionaire problem[J]. International Journal of Theoretical Physics,2019,58(7):2106-2114. [9] ZHOU Y,SHI W,YANG Y. A quantum protocol for millionaire problem with continuous variables[J]. Communications in Theoretical Physics,2014,61(4):452-456. [10] SHI R,MU Y,ZHONG H,et al. An efficient quantum scheme for private set intersection[J]. Quantum Information Processing, 2016,15(1):363-371. [11] CHUN J Y,HONG D,JEONG I R,et al. Privacy-preserving disjunctive normal form operations on distributed sets[J]. Information Sciences,2013,231:113-122. [12] RINDAL P, ROSULEK M. Improved private set intersection against malicious adversaries[C]//Proceedings of the 36th Annual International Conference on the Theory and Applications of Cryptographic Techniques, LNCS 10210. Cham:Springer, 2017:235-259. [13] 罗小双, 杨晓元, 王绪安. 一类可抵抗恶意攻击的隐私集合交集协议[J]. 计算机应用,2017,37(6):1593-1598.(LUO X S, YANG X Y,WANG X A. A private set intersection protocol against malicious attack[J]. Journal of Computer Applications, 2017,37(6):1593-1598.) [14] 张恩, 金刚刚. 基于同态加密和Bloom过滤器的云外包多方隐私集合比较协议[J]. 计算机应用,2018,38(8):2256-2260. (ZHANG E,JIN G G. Cloud outsourcing multiparty private set intersection protocol based on homomorphic encryption and Bloom filter[J]. Journal of Computer Applications,2018,38(8):2256-2260.) [15] 马敏耀, 陈松良, 左羽. 基于Goldwasser-Micali加密系统的隐私交集基数协议研究[J]. 计算机应用研究,2018,35(9):2748-2751.(MA M Y,CHEN S L,ZUO Y. Research on private set intersection cardinality protocol based on Goldwasser-Micali encryption system[J]. Application Research of Computers,2018,35(9):2748-2751.) [16] MOHASSEL P,RINDAL P. ABY3:a mixed protocol framework for machine learning[C]//Proceedings of the 2018 ACM SIGSAC Conference on Computer and Communications Security. New York:ACM,2018:35-52. [17] 郭奕旻, 周素芳, 窦家维, 等. 高效的区间保密计算及应用[J]. 计算机学报,2017,40(7):1664-1679.(GUO Y M,ZHOU S F, DOU J W,et al. Efficient privacy-preserving interval computation and its applications[J]. Chinese Journal of Computers,2017,40(7):1664-1679.) [18] 窦家维, 王文丽, 李顺东. 区间位置关系的保密判定[J]. 计算机学报,2019,42(5):1031-1044.(DOU J W,WANG W L,LI S D. Privately determining interval location relation[J]. Chinese Journal of Computers,2019,42(5):1031-1044.) [19] 陈振华, 李顺东, 陈立朝, 等. 点和区间关系的全隐私保密判定[J]. 中国科学:信息科学,2018,48(2):187-204.(CHEN Z H,LI S D,CHEN L C,et al. Fully privacy-preserving determination of point-range relationship[J]. SCIENTIA SINICA Informationis,2018,48(2):187-204.) [20] GOLDWASSER S,MICALI S. Probabilistic encryption & how to play mental poker keeping secret all partial information[C]//Proceedings of the 14th Annual ACM Symposium on Theory of Computing. New York:ACM,1982:365-377. [21] GOLDREICH O. Foundations of Cryptography:Volume II Basic Applications[M]. Cambridge:Cambridge University Press, 2004:599-634. |