[1]Douglas L. The importance of ‘big data’: A definition[OL]. [20151015]. http:www.gartner.comdoc2057451importancebigdatadefinition[2]Lynch C. Big data[OL]. [20151015]. http:www.nature.comnewsspecialsbigdataindex.html[3]Dealing with data[OL]. [20151015]. http:www.sciencemag.orgsitespecialdata[4]Sweeney L. kanonymity: A model for protecting privacy[J]. International Journal of Uncertainty, Fuzziness and KnowledgeBased Systems, 2002, 10(5): 557570[5]Machanavajjhala A, Kifer D, Gehrke J, et al. ldiversity: Privacy beyond kanonymity[J]. ACM Trans on Knowledge Discovery from Data (TKDD), 2007, 1(1): 3:13:52[6]Li N, Li T, Venkatasubramanian S. tcloseness: Privacy beyond kanonymity and ldiversity[C] Proc of ICDE. Piscataway, NJ: IEEE, 2007: 106115[7]Zhang X, Yang L T, Liu C, et al. A scalable twophase topdown specialization approach for data anonymization using mapreduce on cloud[J]. IEEE Trans on Parallel and Distributed Systems, 2014, 25(2): 363373[8]Fung B, Wang K, Chen R, et al. Privacypreserving data publishing: A survey of recent developments[J]. ACM Computing Surveys (CSUR), 2010, 42(4): 14:114:53[9]Nergiz M E, Clifton C, Nergiz A E. Multirelational kanonymity[J]. IEEE Trans on Knowledge and Data Engineering, 2009, 21(8): 11041117[10]Iwuchukwu T, Naughton J F. Kanonymization as spatial indexing: Toward scalable and incremental anonymization[C] Proc of the 33rd Int Conf on Very Large Data Bases. New York: ACM, 2007: 746757[11]Zhang X, Liu C, Nepal S, et al. SaCFRAPP: A scalable and costeffective framework for privacy preservation over big data on cloud[J]. Concurrency and Computation: Practice and Experience, 2013, 25(18): 25612576[12]de Montjoye Y A, Hidalgo C A, Verleysen M, et al. Unique in the Crowd: The privacy bounds of human mobility[J]. Scientific Reports, 2013, 20(3): 13761382[13]Lindell Y, Pinkas B. An efficient protocol for secure twoparty computation in the presence of malicious adversaries[C] Proc of Advances in CryptologyEUROCRYPT 2007. Berlin: Springer, 2007: 5278[14]Pinkas B, Schneider T, Smart N P, et al. Secure twoparty computation is practical[C] Proc of Advances in CryptologyASIACRYPT 2009. Berlin: Springer, 2009: 250267[15]Ishai Y, Prabhakaran M, Sahai A. Secure arithmetic computation with no honest majority[M] Theory of Cryptography. Berlin: Springer, 2009: 294314[16]Peter A, Tews E, Katzenbeisser S. Efficiently outsourcing multiparty computation under multiple keys[J]. IEEE Trans on Information Forensics and Security, 2013, 8(12): 20462058[17]Dong C, Chen L, Wen Z. When private set intersection meets big data: An efficient and scalable protocol[C] Proc of 2013 ACM SIGSAC Conf on Computer & Communications Security. New York: ACM, 2013: 789800[18]Song D, Wagner D, Perrig A. Practical techniques for searches on encrypted data[C] Proc of IEEE Symp on Security and Privacy (S&P00). Piscataway, NJ: IEEE, 2000: 4455[19]Goh E J. Secure indexes, 2003216[ROL]. IACR ePrint Cryptography Archive, 2003 [20151015]. http:eprint.iacr.org2003216[20]Curtmola R, Garay J, Kamara S, et al. Searchable symmetric encryption: Improved definitions and efficient constructions[C] Proc of ACM Conf on Computer and Communications Security (CCS06). New York: ACM, 2006: 7988[21]Boldyreva A, Chenette N, Lee Y, et al. Orderpreserving symmetric encryption[G] LNCS 5479: Proc of EUROCRYPT 2009. Berlin: Springer, 2009: 224241[22]Boldyreva A, Chenette N, ONeill A. Orderpreserving encryption revisited: Improved security analysis and alternative solutions[G] LNCS 6841: Proc of CRYPTO 2011. Berlin: Springer, 2011: 578595[23]Boneh D, Crescenzo G, et al. Public encryption with keyword search[G] LNCS 3027: Proc of Eurocrypt04. Berlin: Springer, 2004: 506522[24]Abdalla M, Bellare M, et al. Searchable encryption revisited: Consistency properties, relation to anonymous IBE, and extensions[G] LNCS 3621: Proc of CRYPTO 2005. Berlin: Springer, 2005: 205222[25]Golle P, Staddon J, Waters B R. Secure conjunctive keyword search over encrypted data[C] Proc of ACNS04. Berlin: Springer, 2004: 3145[26]Wang C, Cao N, Li J, et al. Secure ranked keyword search over encrypted cloud data[C] Proc of ICDCS 2010. Los Alamitos, CA: IEEE Computer Society, 2010: 253262[27]Li M, Yu S C, Cao N, et al. Authorized private keyword search over encrypted data in cloud computing[C] Proc of ICDCS2011.Piscataway, NJ: IEEE, 2011: 383392[28]Gentry C. Fully homomorphic encryption using ideal lattices[C] Proc of the 41st Annual ACM Symp on Theory of Computing (STOC09). New York: ACM, 2009: 169169[29]Van Dijk M, Gentry C, Halevi S, et al. Fully homomorphic encryption over the integers[C] Proc of Advances in CryptologyEUROCRYPT 2010. Berlin: Springer, 2010: 2443[30]Smart N P, Vercauteren F. Fully homomorphic encryption with relatively small key and ciphertext sizes[C] Proc of Public Key CryptographyPKC 2010. Berlin: Springer, 2010: 420443[31]Stehlé D, Steinfeld R. Faster fully homomorphic encryption[C] Proc of Advances in CryptologyASIACRYPT 2010. Berlin: Springer, 2010: 377394[32]Chunsheng G, Jixing G. Cryptanalysis of smartvercauteren and GentryHalevis fully homomorphic encryption[J]. International Journal of Security & Its Applications, 2012, 6(2): 103108[33]Coron J S, Mandal A, Naccache D, et al. Fully homomorphic encryption over the integers with shorter public keys[C] Proc of Advances in CryptologyCRYPTO 2011. Berlin: Springer, 2011: 487504[34]Gentry C, Halevi S. Implementing gentrys fullyhomomorphic encryption scheme[C] Proc of Advances in CryptologyEUROCRYPT 2011. Berlin: Springer, 2011: 129148[35]Brakerski Z, Vaikuntanathan V. Efficient fully homomorphic encryption from (standard) LWE[C] Proc of the 52nd IEEE Annual Symp on Foundations of Computer Science (FOCS). Piscataway, NJ: IEEE, 2011: 97106[36]Brakerski Z, Vaikuntanathan V. Fully homomorphic encryption from ringLWE and security for key dependent messages[C] Proc of Advances in CryptologyCRYPTO 2011. Berlin: Springer, 2011: 505524[37]Gentry C, Halevi S. Fully homomorphic encryption without squashing using depth3 arithmetic circuits[C] Proc of the 52nd IEEE Annual Symp on Foundations of Computer Science (FOCS). Piscataway, NJ: IEEE, 2011: 107109[38]Brakerski Z, Gentry C, Vaikuntanathan V. (Leveled) fully homomorphic encryption without bootstrapping[C] Proc of the 3rd Innovations in Theoretical Computer Science Conf. New York: ACM, 2012: 309325[39]Gentry C, Halevi S, Smart N P. Fully homomorphic encryption with polylog overhead[C] Proc of Advances in CryptologyEUROCRYPT 2012. Berlin: Springer, 2012: 465482[40]Gentry C, Halevi S, Smart N. Homomorphic evaluation of the AES circuit[C] Proc of Advances in CryptologyCRYPTO 2012. Berlin: Springer, 2012: 850867[41]Cheon J H, Coron J S, Kim J, et al. Batch fully homomorphic encryption over the integers[C] Proc of Advances in CryptologyEUROCRYPT 2013. Berlin: Springer, 2013: 315335[42]Boldyreva A, Chenette N, ONeill A. Orderpreserving encryption revisited: Improved security analysis and alternative solutions[C] Proc of Advancesin CryptologyCRYPTO 2011. Berlin: Springer, 2011: 578595[43]Hall R, Fienberg S E, Nardi Y. Secure multiple linear regression based on homomorphic encryption[J]. Journal of Official Statistics, 2011, 27(4): 669691[44] Graepel T, Lauter K, Naehrig M. ML confidential: Machine learning on encrypted data[C] Proc of Information Security and CryptologyICISC 2012. Berlin: Springer, 2013: 121[45]Wang S, Agrawal D, El Abbadi A. A comprehensive framework for secure query processing on relational data in the cloud[M] Secure Data Management. Berlin: Springer, 2011: 5269[46]Popa R A, Redfield C, Zeldovich N, et al. Cryptdb: Protecting confidentiality with encrypted query processing[C] Proc of the 23rd ACM Symp on Operating Systems Principles. New York: ACM, 2011: 85100[47]Wang C, Ren K, Yu S, et al. Achieving usable and privacyassured similarity search over outsourced cloud data[C] Proc of IEEE INFOCOM. Piscataway, NJ: IEEE, 2012: 451459[48]Hu H, Xu J, Ren C, et al. Processing private queries over untrusted data cloud through privacy homomorphism[C] Proc of the 27th IEEE Int Conf on Data Engineering (ICDE). Piscataway, NJ: IEEE, 2011: 601612[49]Chow R, Golle P, Jakobsson M, et al. Controlling data in the cloud: Outsourcing computation without outsourcing control[C] Proc of ACM Workshop on Cloud Computing Security. New York: ACM, 2009: 8590[50]Popa R A, Redfield C, Zeldovich N, et al. Cryptdb: Protecting confidentiality with encrypted query processing[C] Proc of the 23rd ACM Symp on Operating Systems Principles. New York: ACM, 2011: 85100[51]Murugesan M, Jiang W, Clifton C, et al. Efficient privacypreserving similar document detection[J]. The International Journal on Very Large Data Bases, 2010, 19(4): 457475[52]Wang S, Ooi B C, Tung A, et al. Efficient skyline query processing on peertopeer networks[C] Proc of the 23rd IEEE Int Conf on Data Engineering (ICDE 2007). Piscataway, NJ: IEEE, 2007: 11261135[53]Metzler D, Croft W B. Combining the language model and inference network approaches to retrieval[J]. Information Processing & Management, 2004, 40(5): 735750 |