[1] FREEDM M J, NISSIM K, PINKAS B. Efficient private matching and set intersection[C]//Proceedings of the 2004 International Conference on the Theory and Applications of Cryptographic Techniques, LNCS 3027. Berlin:Springer, 2004:1-19. [2] 孙茂华,宫哲.一种保护隐私集合并集外包计算协议[J].密码学报,2016,3(2):114-125.(SUN M H, GONG Z. A privacy-preserving outsourcing set union protocol[J]. Journal of Cryptologic Research, 2016, 3(2):114-125.) [3] 朱国斌,谭元巍,赵洋,等.高效的安全几何交集计算协议[J].电子科技大学学报,2014,43(5):781-786.(ZHU G B, TAN Y W, ZHAO Y, et al. An efficient and secure geometric intersection computation protocol[J]. Journal of University of Electronic Science and Technology of China, 2014, 43(5):781-786.) [4] AGGARWAL C C, YU P S. Privacy-preserving data mining:models and algorithms[M]//Advances in Database Systems 34. New York:Springer US, 2008:11-52. [5] BALDI P, BARONIO R, DE CRISTOFARO E, et al. Countering GATTACA:efficient and secure testing of fully-sequenced human genomes[C]//CCS'11:Proceedings of the 18th ACM Conference on Computer and Communications Security. New York:ACM, 2011:691-702. [6] MEZZOUR G, PERRIG A, GLIGOR V, et al. Privacy-preserving relationship path discovery in social networks[C]//CANS 2009:Proceedings of the 2009 International Conference on Cryptology and Network Security, LNCS 5888. Berlin:Springer, 2009:189-208. [7] NAGARAJA S, MITTAL P, HONG C Y, et al. BotGrep:finding P2P bots with structured graph analysis[C]//Proceedings of the 19th USENIX Conference on Security. Berkeley, CA:USENIX Association, 2010:7-7. [8] KISSNER L, SONG D. Privacy-preserving set operations[C]//CRYPTO'05:Proceedings of the 25th Annual International Conference on Advances in Cryptology, LNCS 3621. Berlin:Springer, 2005:241-257. [9] DACHMAN-SOLED D, MALKIN T, RAYKOVA M, et al. Efficient robust private set intersection[C]//Proceedings of the 2009 International Conference on Applied Cryptography and Network Security, LNCS 5536. Berlin:Springer, 2009:125-142. [10] HAZAY C, NISSIM K. Efficient set operations in the presence of malicious adversaries[C]//PKC'10:Proceedings of the 13th International Conference on Practice and Theory in Public Key Cryptography. Berlin:Springer, 2010:312-331. [11] DE CRISTOFARO E, TSUDIK G. Practical private set intersection protocols with linear complexity[C]//Proceedings of the 2010 International Conference on Financial Cryptography and Data Security, LNCS 6052. Berlin:Springer, 2010:143-159. [12] ATENIESE G, DE CRISTOFARO E, TSUDIK G. (If) size matters:Size-hiding private set intersection[C]//PKC 2011:Proceedings of the14th International Conference on Practice and Theory in Public Key Cryptography, LNCS 6571. Berlin:Springer, 2011:156-173. [13] DONG C Y, CHEN L Q, WEN Z K. When private set intersection meets big data:an efficient and scalable protocol[C]//CCS'13:Proceedings of the 2013 ACM SIGSAC conference on Computer & communications security. New York:ACM, 2013:789-800. [14] DEBNATH S K, DUTTA R. A fair and efficient mutual private set intersection protocol from a two-way oblivious pseudorandom function[C]//ICISC 2014:Proceedings of the 17th International Conference on Information Security and Cryptology, LNCS 8949. Berlin:Springer, 2014:343-359. [15] ABADI A, TERZIS S, DONG C Y. O-PSI:delegated private set intersection on outsourced datasets[C]//SEC 2015:Proceedings of the 2015 IFIP International Information Security Conference on ICT Systems Security and Privacy Protection, IFIPAICT 455. Berlin:Springer, 2015:3-17. [16] RINDAL P, ROSULEK M. Improved private set intersection against malicious adversaries[C]//EUROCRYPT 2017:Proceedings of the 36th Annual International Conference on the Theory and Applications of Cryptographic Techniques, LNCS 10210. Berlin:Springer, 235-259. [17] BONEH D, FRANKLIN M K. Identity-based encryption from the Weil paring[C]//CRYPTO 2001:Proceedings of the 21st Annual International Cryptology Conference on Advances in Cryptology, LNCS 2139. Berlin:Springer, 2001:213-229. [18] RYU E K, YOON E J, YOO K Y. An efficient ID-based authenticated key agreement protocol from pairings[C]//Networking 2004:Proceedings of the 2004 International Conference on Research in Networking, LNCS 3042. Berlin:Springer, 2004:1458-1463. [19] RABIN M O. How to exchange secrets by oblivious transfer, TR-81[R]. Cambridge, MA:Harvard University, Aiken Computation Laboratory, 1981. [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] SHAMIR A. How to share a secret[J]. Communications of the ACM, 1979, 22(11):612-613. [22] SCHNEIER B. Applied Cryptography-Protocols, Algorithms, and Source Code in C[M]. 2nd ed. New York:John Wiley & Sons, 1995:113-117. [23] GOLDREICH O. Foundation of Cryptography:Volume 2, Basic Applications[M]. Cambridge, MA:Cambridge University Press, 2009:620-625. [24] 冯登国,张敏,李昊.大数据安全与隐私保护[J].计算机学报,2014,37(1):246-258.(FENG D G, ZHANG M, LI H. Big data security and privacy protection[J]. Chinese Journal of Computers, 2014, 37(1):246-258.) |