[1] YAO A C. Protocols for secure computations[C]//SFCS 1982: Proceedings of the 23rd Annual Symposium on Foundations of Computer Science. Washington, DC: IEEE Computer Society, 1982: 160-164. [2] GOLDREICH O, MICALI S, WIGDERSON A. How to play any mental game[C]//Proceedings of the 19th Annual ACM Conference on Theory of Computing. New York: ACM, 1987:218-229. [3] GOLDREICH O. Foundations of Cryptography: Basic Applications [M]. London: Cambridge University Press, 2004:693-747. [4] 张恩, 蔡永泉. 理性的安全两方计算协议[J]. 计算机研究与发展, 2013, 50(7): 1409-1417.(ZHANG E, CAI Y Q. Rational secure two-party computation protocol[J]. Journal of Computer Research and Development, 2013, 50(7): 1409-1417.) [5] GKOULALAS-DIVANIS A, LOUKIDES G, SUN J. Publishing data from electronic health records while preserving privacy: a survey of algorithms[J]. Journal of Biomedical Informatics, 2014, 50: 4-19. [6] ZHENG Q, XU S. Verifiable delegated set intersection operations on outsourced encrypted data[C]//Proceedings of the 2015 IEEE International Conference on Cloud Engineering. Washington, DC: IEEE Computer Society, 2015:175-184. [7] PATSAKIS C, ZIGOMITROS A, SOLANAS A. Privacy-aware genome mining: server-assisted protocols for private set intersection and pattern matching[C]//Proceedings of the 2015 IEEE 28th International Symposium on Computer-Based Medical Systems. Piscataway, NJ: IEEE, 2015: 276-279. [8] SARPONG S, XU C, ZHANG X. PPAM: privacy-preserving attributes matchmaking protocol for mobile social networks secure against malicious users[J]. International Journal of Network Security, 2016, 18(4): 625-632. [9] GASTI P, RASMUSSEN K B. Privacy-preserving user matching[C]//Proceedings of the 14th ACM Workshop on Privacy in the Electronic Society. New York: ACM, 2015: 111-120. [10] EMILIANO D C, KIM J. Linear-complexity private set intersection protocols secure in malicious model[C]//ASIACRYPT 2010: Proceedings of the 16th International Conference on the Theory and Application of Cryptology and Information Security. Berlin: Springer, 2010: 213-231. [11] DONG C, CHEN L, CAMENISCH J, et al. Fair private set intersection with a semi-trusted arbiter[C]//Proceedings of the 27th Annual IFIP WG 11.3 Conference on Data and Applications Security and Privacy XXVII. Berlin: Springer, 2013: 128-144. [12] FREEDMAN M J, NISSIM K, PINKAS B. Efficient private matching and set intersection[C]//EUROCRYPT 2004: Proceedings of the 2004 International Conference on the Theory and Applications of Cryptographic Techniques. Berlin: Springer, 2004:1-19. [13] NIU B, ZHU X, LIU J, et al. Weight-aware private matching scheme for proximity-based mobile social networks[C]//Proceedings of the 2013 IEEE Global Communications Conference. Piscataway, NJ: IEEE, 2013: 3170-3175. [14] AGRAWAL R, EVFIMIEVSKI A, SRIKANT R. Information sharing across private databases[C]//SIGMOD 2003: Proceedings of the 2003 ACM SIGMOD International Conference on Management of Data. New York: ACM, 2003: 86-97. [15] STANISLAW J, LIU X. Fast secure computation of set intersection[C]//SCN 2010: Proceedings of the 7th International Conference on Security and Cryptography for Networks, LNCS 6280. Berlin: Springer, 2010, 6280:418-435. [16] HAZAYC, LINDELLY. Efficient protocols for set intersection and pattern matching with security against malicious and covert adversaries[C]//TCC 2008: Proceedings of the Fifth Theory of Cryptography Conference on Theory of Cryptography, LNCS 4948. Berlin: Springer, 2008: 155-175. [17] JARECKI S, LIU X. Efficient oblivious pseudorandom function with applications to adaptive ot and secure computation of set intersection[C]//TCC 2009: Proceedings of the 6th Theory of Cryptography Conference on Theory of Cryptography, LNCS 5444. Berlin: Springer, 2009: 577-594. [18] KAMARA S, MOHASSEL P, RAYKOVA M, et al. Scaling private set intersection to billion-element sets[C]//FC 2014: Proceedings of the 18th International Conference on Financial Cryptography and Data Security, LNCS 8437. Berlin: Springer, 2014:195-215. [19] KERSCHBAUM F. Outsourced private set intersection using homomorphic encryption [C]//Proceedings of the 7th ACM Symposium on Information, Computer and Communications Security. New York: ACM, 2012: 85-86. [20] BLOOM B H. Space/time trade-offs in Hash coding with allowable errors[J]. Communications of the ACM, 1970, 13(7):422-426. [21] DONG C, CHEN L, WEN Z. When private set intersection meets big data: an efficient and scalable protocol[C]//Proceedings of the 2013 ACM SIGSAC Conference on Computer & Communications Security. New York: ACM, 2013: 789-800. [22] CHOI S G, KATZ J, KUMARESAN R, et al. Multi-client non-interactive verifiable computation[C]//TCC 2013: Proceedings of the 10th Theory of Cryptography Conference on Theory of Cryptography. Berlin: Springer, 2013: 499-518. [23] NAOR M, PINKAS B. Efficient oblivious transfer protocols [C]//SODA 2001: Proceedings of the Twelfth Annual ACM-SIAM Symposium on Discrete Algorithms. New York: ACM, 2001: 448-457. [24] CRISTOFARO E D, TSUDIK G. Practical private set intersection protocols with linear complexity[C]//FC 2010: 14th International Conference on Financial Cryptography and Data Security, LNCS 6052. Berlin: Springer, 2010:143-159. [25] HUANG Y, EVANS D, KATZ J. Private set intersection: are garbled circuits better than custom protocols?[EB/OL]. [2015-10-10]. http://www.cs.virginia.edu/~evans/pubs/ndss2012/psi.pdf. |