[1] GAYATHRI K S, THOMAS T, JAYASUDHA J. Security issues of media sharing in social cloud[J]. Procedia Engineering, 2012, 38(4):3806-3815. [2] FREEDMAN M J, NISSIM K, PINKAS B. Efficient private matching and set intersection[C]//Proceedings of the 2004 International Conference on Theory and Applications of Cryptographic Techniques, LNCS 3027. Berlin:Springer, 2004:1-19. [3] CHEIELEWSKI L, HOEPMAN J. Fuzzy private matching (extended abstract)[C]//ARES 08:Proceedings of the Third International Conference on Availability, Reliability and Security. Piscataway, NJ:IEEE, 2008:327-334. [4] YE Q, STEINFELD R, PIEPRZYK J, et al. Efficient fuzzy matching and intersection on private datasets[C]//Proceedings of the 2009 International Conference on Information Security and Cryptology, LNCS 5984. Berlin:Springer, 2009:211-228. [5] HAZAY C, NISSIM K. Efficient set operations in the presence of malicious adversaries[J]. Journal of Cryptology, 2012, 25(3):383-433. [6] KAMARA S, MOHASSEL P, RAYKOVA M, et al. Scaling private set intersection to billion-element sets[C]//Proceedings of the 2014 International Conference on Financial Cryptography and Data Security, LNCS 8437. Berlin:Springer, 2014:195-215. [7] ABADI A, TERZIS S, DONG C. O-PSI:delegated private set intersection on outsourced datasets[C]//Proceedings of the 201530th IFIP TC 11 International Conference on ICT Systems Security and Privacy Protection, IFIP Advances in Information and Communication Technology 455. Cham, Switzerland:Springer International Publishing, 2015:3-17. [8] DEBANTH S K, DUTTA R. Efficient private set intersection cardinality in the presence of malicious adversaries[C]//Proceedings of the 9th International Conference on Provable Security, LNCS 9451. Cham, Switzerland:Springer International Publishing, 2015:326-339. [9] SHI R H, MU Y, ZHONG H, et al. An efficient quantum scheme for private set intersection[J]. Quantum Information Processing, 2016, 15(1):363-371. [10] 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. [11] HAHN C, HUR J. Scalable and secure private set intersection for big data[C]//Proceedings of the 2016 International Conference on Big Data and Smart Computing. Washington, DC:IEEE Computer Society, 2016:285-288. [12] SHAMIR A. How to share a secret[J]. Communication of the ACM,1979, 22(11):612-613. [13] SCHNEIER B, SUTHERLAND P. Applied Cryptography-Protocols, Algorithms, and Source Code in C[M]. 2nd ed. New York:John Wiley & Sons, 1995:113-117. [14] RABIN M O. How to exchange secrets by oblivious transfer, TR-81[R]. Cambridge, MA:Harvard University, Aiken Computation Laboratory, 1981. [15] BEAVER D. Correlated pseudorandomness and the complexity of private computations[C]//ISTOC'96:Proceedings of the Twenty-eighth Annual ACM Symposium on Theory of Computing. New York:ACM, 1996:479-488. [16] ISHAI Y, KILIAN J, NISSIM K, et al. Extending oblivious transfers efficiently[C]//Advances in Cryptology-CRYPTO 2003, LNCS 2729. Berlin:Springer, 2003:145-161. [17] NAOR M, PINKAS B. Efficient oblivious transfer protocols[C]//Proceedings of the Twelfth Annual ACM-SIAM Symposium on Discrete Algorithms. Philadelphia:Society for Industrial and Applied Mathematics, 2001:448-457. [18] BLOOM B H. Space/time trade-offs in hash coding with allowable errors[J]. Communications of the ACM, 1970, 13(7):422-426. [19] GOLDREICH O. The Foundations of Cryptography-Volume 2, Basic Applications[M]. Cambridge:Cambridge University Press, 2009:620-625. [20] WEI DAI. Crypto++ library:5.6.0 benchmarks[EB/OL].[2016-03-11]. http://www.cryptopp.com. |