微信服务号

微信订阅号

2025年5月11日 9:27 星期日
首页 > 过刊浏览>2015年第26卷第4期 >945-959. DOI:10.13328/j.cnki.jos.004794
PDF HTML阅读 XML下载 导出引用 引用提醒
大数据隐私保护密码技术研究综述
作者:
基金项目:

国家自然科学基金(61170058, 61202407, 61202028, 613032067)


Preserving Privacy in Big Data: A Survey from the Cryptographic Perspective
Author:
  • 摘要
    • | |
  • 访问统计
    • |
  • 参考文献 [77]
    • |
  • 相似文献 [20]
    • |
  • 引证文献
    • | |
  • 文章评论
    摘要:

    大数据是一种蕴含大量信息、具有极高价值的数据集合.为了避免大数据挖掘泄露用户的隐私,必须要对大数据进行必要的保护.由于大数据具有总量庞大、结构复杂、处理迅速等特点,传统的保护数据隐私的技术很多都不再适用.从密码学的角度,综述了近年来提出的、适用于大数据的隐私保护技术的研究进展.针对大数据的存储、搜索和计算这3个重要方面,分别阐述了大数据隐私保护的研究背景和主要研究方向,并具体介绍了相关技术的最新研究进展.最后指出未来大数据隐私保护研究的一些重要方向.

    Abstract:

    Big data is a type of data set with rich information and significant value. To avoid leakage of user privacy during big data mining, some necessary measures on big data need to be placed. Since big data has huger volume, more complex structure and less tolerance of delays, traditional privacy preserving technologies are mostly unsuitable for preserving privacy of big data. From a cryptographic perspective, this paper surveys the recent progress on privacy preserving technologies for big data. Three basic problems in big data, namely storage, search and computation, are investigated, and their research background and main research directions are elaborated. The latest research progress of privacy preserving technologies for these problems is also presented. Finally, some important directions of privacy preserving technologies for big data are suggested.

    参考文献
    [1] Taylor J. What is Big Data. 2011. http://www-01.ibm.com/software/data/bigdata
    [2] News Room. Study: Only 1% of World's Data is Analyzed, Less Than 20% Protected. 2012. http://www.webhostmagazine.com/2012/12/study-only-1-of-worlds-data-is-analyzed-less-than-20-protected
    [3] Barwick H. IIIS: The ‘four Vs' of Big Data. 2011. http://www.computerworld.com.au/article/396198/iiis_four_vs_big_data/
    [4] Li G, Cheng X. Research status and scientific thinking of big data. Bulletin of the Chinese Academy of Sciences, 2012,27(6): 647-657 (in Chinese with English abstract).
    [5] Zhou SG, Li F, Tao YF, Xiao XK. Privacy preservation in database applications: A survey. Chinese Journal of Computers, 2009, 32(5):847-861 (in Chinese with English abstract).[doi: 10.3724/SP.J.1016.2009.00847]
    [6] Armbrust M, Fox A, Griffith R, Joseph AD, Katz R, Konwinski A, Lee G, Patterson D, Rabkin A, Stoica I, Zaharia M. A view of cloud computing. Communications of the ACM, 2010,53(4):50-58.[doi: 10.1145/1721654.1721672]
    [7] Feng DG, Zhang M, Zhang Y, Xu Z. Study on cloud computing security. Ruan Jian Xue Bao/Journal of Software, 2011,22(1): 71-83 (in Chinese with English abstract). http://www.jos.org.cn/1000-9825/3958.htm[doi: 10.3724/SP.J.1001.2011.03958]
    [8] Gohring N. Amazon's S3 down for several hours. 2008. http://www.pcworld.com/businesscenter/article/142549/amazons s3 down for several hours.html
    [9] Ateniese G, Di Pietro R, Mancini LV, Tsudik G. Scalable and efficient provable data possession. In: Proc. of the 4th Int'l Conf. on Security and Privacy in Communication Netowrks. New York: ACM Press, 2008. 1-10.[doi: 10.1145/1460877.1460889]
    [10] Erway C, Küpçü A, Papamanthou C, Tamassia R. Dynamic provable data possession. In: Proc. of the 16th ACM Conf. on Computer and Communications Security (CCS). New York: ACM Press, 2009. 213-222.[doi: 10.1145/1653662.1653688]
    [11] Curtmola R, Khan O, Burns R, Ateniese G. MR-PDP: Multiple-Replica provable data possession. In: Proc. of the 28th IEEE Int'l Conf. on Distributed Computing Systems (ICDCS). Beijing: IEEE Computer Society, 2008. 411-420.[doi: 10.1109/ICDCS.2008. 68]
    [12] Juels A, Kaliski BS. PORs: Proofs of retrievability for large files. In: Proc. of the 14th ACM Conf. on Computer and Communications Security (CCS). New York: ACM Press, 2007. 584-597.[doi: 10.1145/1315245.1315317]
    [13] Shacham H, Waters B. Compact proofs of retrievability. In: Advances in Cryptology-ASIACRYPT 2008. Berlin, Heidelberg: Springer-Verlag, 2008. 90-107.[doi: 10.1007/978-3-540-89255-7_7]
    [14] Dodis Y, Vadhan S, Wichs D. Proofs of retrievability via hardness amplification. In: Proc. of the 6th Theory of Cryptography Conference (TCC). Berlin, Heidelberg: Springer-Verlag, 2009. 109-127.[doi: 10.1007/978-3-642-00457-5_8]
    [15] Zheng Q, Xu S. Fair and dynamic proofs of retrievability. In: Proc.of the 1st ACM Conf. on Data and Application Security and Privacy. New York: ACM Press, 2011. 237-248.[doi: 10.1145/1943513.1943546]
    [16] Bowers KD, Juels A, Oprea A. HAIL: A high-availability and integrity layer for cloud storage. In: Proc. of the 16th ACM Conf. on Computer and Communications Security (CCS). New York: ACM Press, 2009. 187-198.[doi: 10.1145/1653662.1653686]
    [17] Deswarte Y, Quisquater J, Saidane A. Remote integrity checking. In: Proc. of the 6th Working Conf. on Integrity and Internal Control in Information Systems (IICIS). Berlin, Heidelberg: Springer-Verlag, 2004. 1-11.[doi: 10.1007/1-4020-7901-X_1]
    [18] Chang EC, Xu J. Remote integrity check with dishonest storage server. In: Proc.of the 13th European Symp. on Research in Computer Security (ESORICS). Berlin, Heidelberg: Springer-Verlag, 2008. 223-237.[doi: 10.1007/978-3-540-88313-5_15]
    [19] Agrawal R, Srikant R. Privacy-Preserving data mining. In: Proc. of the ACM SIGMOD Conf. on Management of Data (SIGMOD). New York: ACM Press, 2000. 439-450.[doi: 10.1145/342009.335438]
    [20] Warner SL. Randomized response: A survey technique for eliminating evasive answer bias. Journal of the American Statistical Association, 1965,60(309):63-69.[doi: 10.1080/01621459.1965.10480775]
    [21] Fienberg SE, McIntyre J. Data swapping: Variations on a theme by dalenius and reiss. In: Proc. of the Privacy in Statistical Databases. Berlin, Heidelberg: Springer-Verlag, 2004. 14-29.[doi: 10.1007/978-3-540-25955-8_2]
    [22] Evfimievski A, Srikant R, Agrawal R, Gehrke J. Privacy preserving mining of association rules. Information Systems, 2004,29(4): 343-364.[doi: 10.1016/j.is.2003.09.001]
    [23] Kantarcioglu M, Clifton C. Privacy-Preserving distributed mining of association rules on horizontally partitioned data. IEEE Trans. on Knowledge and Data Engineering, 2004,16(9):1026-1037.[doi: 10.1109/TKDE.2004.45]
    [24] Vaidya J, Clifton C. Privacy preserving association rule mining in vertically partitioned data. In: Proc. of the 8th ACM SIGKDD Int'l Conf. on Knowledge Discovery and Data Mining (SIGKDD). New York: ACM Press, 2002. 639-644.[doi: 10.1145/775047. 775142]
    [25] Vaidya J, Clifton C. Privacy-Preserving k-means clustering over vertically partitioned data. In: Proc. of the 9th ACM SIGKDD Int'l Conf. on Knowledge Discovery and Data Mining (SIGKDD). New York: ACM Press, 2003. 206-215.[doi: 10.1145/956750. 956776]
    [26] Jagannathan G, Wright RN. Privacy-Preserving distributed k-means clustering over arbitrarily partitioned data. In: Proc. of the 11th ACM SIGKDD Int'l Conf. on Knowledge Discovery and Data Mining (SIGKDD). New York: ACM Press, 2005. 593-599.[doi: 10. 1145/1081870.1081942]
    [27] Sweeney L. k-Anonymity: A model for protecting privacy. Int'l Journal on Uncertainty, Fuzziness and Knowledge-based Systems, 2002,10(5):557-570.[doi: 10.1142/S0218488502001648]
    [28] Sweeney L. Achieving k-anonymity privacy protection using generalization and suppression. Int'l Journal on Uncertainly, Fuzziness and Knowledge-Based Systems, 2002,10(5):571-588.[doi: 10.1142/S021848850200165X]
    [29] LeFevre K, DeWitt DJ, Ramakrishnan R. Incognito: Efficient full-domain k-anonymity. In: Proc. of the ACM SIGMOD Conf. on Management of Data (SIGMOD). New York: ACM Press, 2005. 49-60.[doi: 10.1145/1066157.1066164]
    [30] Machanavajjhala A, Kifer D, Gehrke J, Venkitasubramaniam M. l-Diversity: Privacy beyond k-anonymity. ACM Trans. on Knowledge Discovery from Data, 2007,1(1):1-52.[doi: 10.1145/1217299.1217300]
    [31] Li N, Li T, Venkatasubramanian S. t-Closeness: Privacy beyond k-anonymity and l-diversity. In: Proc. of the 23rd IEEE Int'l Conf. on Data Engineering (ICDE). Istanbul: IEEE Computer Society, 2007. 106-115.[doi: 10.1109/ICDE.2007.367856]
    [32] Zhu Q, Zhao T, Wang S. Privacy preservation algorithm for service-oriented information search. Chinese Journal of Computers, 2010,33(8):1315-1323 (in Chinese with English abstract).[doi: 10.3724/SP.J.1016.2010.01315]
    [33] Fung B, Wang K, Chen R, Yu PS. Privacy-Preserving data publishing: A survey of recent developments. ACM Computing Surveys, 2010,42(4):1-53.[doi: 10.1145/1749603.1749605]
    [34] Dwork C. Differential privacy. In: Proc. of the 33rd Int'l Colloquium on Automata, Languages and Programming (ICALP). Berlin, Heidelberg: Springer-Verlag, 2006. 1-12.[doi: 10.1007/978-1-4419-5906-5_752]
    [35] Dwork C. Differential privacy: A survey of results. In: Proc. of the 5th Int'l Conf. on Theory and Applications of Models of Computation (TAMC). Berlin, Heidelberg: Springer-Verlag, 2008. 1-19.[doi: 10.1007/978-3-540-79228-4_1]
    [36] Dwork C. The differential privacy frontier. In: Proc. of the 6th Int'l Conf. on Theory of Cryptography Conf. (TCC). Berlin, Heidelberg: Springer-Verlag, 2009. 496-502.[doi: 10.1007/978-3-642-00457-5_29]
    [37] Mironov I, Pandey O, Reingold O, Vadhan S. Computational differential privacy. In: Advances in Cryptology-CRYPTO 2009. Berlin, Heidelberg: Springer-Verlag, 2009. 126-142.[doi: 10.1007/978-3-642-03356-8_8]
    [38] Friedman A, Schuster A. Data mining with differential privacy. In: Proc. of the 16th ACM SIGKDD Int'l Conf. on Knowledge Discovery and Data Mining (SIGKDD). New York: ACM Press, 2010. 493-502.[doi: 10.1145/1835804.1835868]
    [39] Paillier P. Public-Key cryptosystems based on composite degree residuosity classes. In: Advances in Cryptology—EURO- CRYPT'99. Berlin, Heidelberg: Springer-Verlag, 1999. 223-238.[doi: 10.1007/3-540-48910-X_16]
    [40] ElGamal T. A public key cryptosystem and a signature scheme based on discrete logarithms. IEEE Trans. on Information Theory, 1985,31(4):469-472.[doi: 10.1109/TIT.1985.1057074]
    [41] Gentry C. Fully homomorphic encryption using ideal lattices. In: Proc. of the 41st Annual ACM Symp. on Theory of Computing (STOC). New York: ACM Press, 2009. 169-178.[doi: 10.1145/1536414.1536440]
    [42] Ateniese G, Burns R, Curtmola R, Herring J, Kissner L, Peterson Z, Song D. Provable data possession at untrusted stores. In: Proc. of the 14th ACM Conf. on Computer and Communications Security (CCS). New York: ACM Press, 2007. 598-609.[doi: 10.1145/1315245.1315318]
    [43] Ateniese G, Kamara S, Katz J. Proofs of storage from homomorphic identification protocols. In: Advances in Cryptology— ASIACRYPT 2009. Berlin, Heidelberg: Springer-Verlag, 2009. 319-333.[doi: 10.1007/978-3-642-10366-7_19]
    [44] Hao Z, Zhong S, Yu N. A privacy-preserving remote data integrity checking protocol with data dynamics and public verifiability. IEEE Trans. on Knowledge and Data Engineering, 2011,23(9):1432-1437.[doi: 10.1109/TKDE.2011.62]
    [45] Wang C, Wang Q, Ren, K, Lou W. Privacy-Preserving public auditing for data storage security in cloud computing. In: Proc. of the 29th IEEE INFOCOM. San Diego: IEEE Communications Society, 2010. 1-9.[doi: 10.1109/INFCOM.2010.5462173]
    [46] Xu C, He X, Abraha-Weldemariam D. Cryptanalysis of Wang's auditing protocol for data storage security in cloud computing. In: Proc. of the 2012 Int'l Conf. on Information Computing and Applications (ICICA), Part II. Berlin, Heidelberg: Springer-Verlag, 2012. 422-428.[doi: 10.1007/978-3-642-34041-3_59]
    [47] Boneh D, Lynn B, Shacham H. Short signatures from the Weil pairing. In: Advances in Cryptology—ASIACRYPT 2001. Berlin, Heidelberg: Springer-Verlag, 2001. 514-532.[doi: 10.1007/3-540-45682-1_30]
    [48] Hao Z, Yu N. A multiple-replica remote data possession checking protocol with public verifiability. In: Proc. of the 2nd Int'l Symp. on Data, Privacy and E-Commerce. Buffalo: IEEE Computer Society, 2010. 84-89.[doi: 10.1109/ISDPE.2010.20]
    [49] Zhu Y, Wang H, Hu Z, Ahn GJ, Hu H, Yau SS. Dynamic audit services for integrity verification of outsourced storages in clouds. In: Proc. of the 2011 ACM Symp. on Applied Computing (SAC). New York: ACM Press, 2011. 1550-1557.[doi: 10.1145/1982185. 1982514]
    [50] Zhu Y, Hu H, Ahn GJ, Yu M. Cooperative provable data possession for integrity verification in multi-cloud storage. IEEE Trans. on Parallel and Distributed Systems, 2012,23(12):2231-2244.[doi: 10.1109/TPDS.2012.66]
    [51] Yang K, Jia X. An efficient and secure dynamic auditing protocol for data storage in cloud computing. IEEE Trans. on Parallel and Distributed Systems, 2013,24(9):1717-1726.[doi: 10.1109/TPDS.2012.278]
    [52] Shacham H, Waters B. Compact proofs of retrievability. In: Advances in Cryptology—ASIACRYPT 2008. Berlin, Heidelberg: Springer-Verlag, 2008. 90-107.[doi: 10.1007/978-3-540-89255-7_7]
    [53] Bowers KD, Juels A, Oprea A. Proofs of retrievability: Theory and implementation. In: Proc. of the 2009 ACM Workshop on Cloud Computing Security. New York: ACM Press, 2009. 43-54.[doi: 10.1145/1655008.1655015]
    [54] Dodis Y, Vadhan S, Wichs D. Proofs of retrievability via hardness amplification. In: Proc. of the 6th Theory of Cryptography Conf. (TCC). Berlin, Heidelberg: Springer-Verlag, 2009. 109-127.[doi: 10.1007/978-3-642-00457-5_8]
    [55] Wang Q, Wang C, Li J, Ren K, Lou W. Enabling public verifiability and data dynamics for storage security in cloud computing. In: Proc. of the 14th European Sym. on Research in Computer Security (ESORICS). Berlin, Heidelberg: Springer-Verlag, 2009. 355- 370.[doi: 10.1007/978-3-642-04444-1_22]
    [56] Wang Q, Wang C, Ren K, Lou W, Li J. Enabling public verifiability and data dynamics for storage security in cloud computing. IEEE Trans. on Parallel and Distributed Systems, 2011,22(5):847-859.[doi: 10.1109/TPDS.2010.183]
    [57] Boneh D, Gentry C, Lynn B, Shacham H. Aggregate and verifiably encrypted signatures from bilinear maps. In: Advances in Cryptology—EUROCRYPT 2003. Berlin, Heidelberg: Springer-Verlag, 2003. 416-432.[doi: 10.1007/3-540-39200-9_26]
    [58] Song DX, Wagner D, Perrig A. Practical techniques for searches on encrypted data. In: Proc. of the IEEE Symp. on Security and Privacy (S&P). Berkeley: IEEE Computer Society, 2000. 44-55.[doi: 10.1109/SECPRI.2000.848445]
    [59] Goh EJ. Secure Indexes. IACR Cryptology ePrint Archive, 2003. http://eprint.iacr.org/2003/216
    [60] Chang YC, Mitzenmacher M. Privacy preserving keyword searches on remote encrypted data. In: Proc. of the 3rd Int'l Conf. on Applied Cryptography and Network Security (ACNS). Berlin, Heidelberg: Springer-Verlag, 2005. 442-455.[doi: 10.1007/11496137_30]
    [61] Bloom B. Space/time trade-offs in hash coding with allowable errors. Communications of the ACM, 1970,13(7):422-426.[doi: 10. 1145/362686.362692]
    [62] Curtmola R, Garay J, Kamara S, Ostrovsky R. Searchable symmetric encryption: Improved definitions and efficient constructions. In: Proc. of the 13th ACM Conf. on Computer and Communications Security (CCS). New York: ACM Press, 2006. 79-88.[doi: 10. 1145/1180405.1180417]
    [63] Van Liesdonk P, Sedghi S, Doumen J, Hartel P, Jonker W. Computationally efficient searchable symmetric encryption. In: Proc. of the Int'l Workshop on Secure Data Management (SDM). Berlin, Heidelberg: Springer-Verlag, 2010. 87-100.[doi: 10.1007/978-3- 642-15546-8_7]
    [64] Kurosawa K, Ohtaki Y. UC-Secure searchable symmetric encryption. In: Proc. of the 16th Int'l Conf. on Financial Cryptography and Data Security (FC). Berlin, Heidelberg: Springer-Verlag, 2012. 285-298.[doi: 10.1007/978-3-642-32946-3_21]
    [65] Canetti R. Universally composable security: A new paradigm for cryptographic protocols. In: Proc. of the 42nd IEEE Sym. on Foundations of Computer Science (FOCS). Las Vegas: IEEE Computer Society, 2001. 136-145.[doi: 10.1109/SFCS.2001.959888]
    [66] Kamara S, Papamanthou C, Roeder T. Dynamic searchable symmetric encryption. In: Proc. of the 19th ACM Conf. on Computer and Communications Security (CCS). New York: ACM Press, 2012. 965-976.[doi: 10.1145/2382196.2382298]
    [67] Kamara S, Papamanthou C. Parallel and dynamic searchable symmetric encryption. In: Proc. of the 17th Int'l Conf. on Financial Cryptography and Data Security (FC). Berlin, Heidelberg: Springer-Verlag, 2013. 258-274.[doi: 10.1007/978-3-642-39884-1_22]
    [68] Chase M, Kamara S. Structured encryption and controlled disclosure. In: Advances in Cryptology—ASIACRYPT 2010. Berlin, Heidelberg: Springer-Verlag, 2010. 577-594.[doi: 10.1007/978-3-642-17373-8_33]
    [69] Golle P, Staddon J, Waters B. Secure conjunctive keyword search over encrypted data. In: Proc. of the Int'l Conf. on Applied Cryptography and Network Security (ACNS). Berlin, Heidelberg: Springer-Verlag, 2004. 31-45.[doi: 10.1007/978-3-540-24852- 1_3]
    [70] Ballard L, Kamara S, Monrose F. Achieving efficient conjunctive keyword searches over encrypted data. In: Proc. of the 7th Int'l Conf. on Information and Communications Security (ICICS). Berlin, Heidelberg: Springer-Verlag, 2005. 414-426.[doi: 10.1007/11602897_35]
    [71] Agrawal R, Kiernan J, Srikant R, Xu Y. Order-Preserving encryption for numeric data. In: Proc. of the ACM SIGMOD Conf. on Management of Data (SIGMOD). New York: ACM Press, 2004. 563-574.[doi: 10.1145/1007568.1007632]
    [72] Boldyreva A, Chenette N, Lee Y, O'neill A. Order-Preserving symmetric encryption. In: Advances in Cryptology—EUROCRYPT 2009. Berlin, Heidelberg: Springer-Verlag, 2009. 224-241.[doi: 10.1007/978-3-642-01001-9_13]
    [73] Wang C, Cao N, Li J, Ren K, Lou W. Secure ranked keyword search over encrypted cloud data. In: Proc. of the 30th IEEE Int'l Conf. on Distributed Computing Systems (ICDCS). Genova: IEEE Computer Society, 2010. 253-262.[doi: 10.1109/ICDCS.2010. 34]
    [74] Tang Q. Privacy preserving mapping schemes supporting comparison. In: Proc. of the 2010 ACM Workshop on Cloud Computing Security. New York: ACM Press, 2010. 53-58.[doi: 10.1145/1866835.1866846]
    [75] Boldyreva A, Chenette N, O'Neill A. Order-Preserving encryption revisited: Improved security analysis and alternative solutions. In: Advances in Cryptology—CRYPTO 2011. Berlin, Heidelberg: Springer-Verlag, 2011. 578-595.[doi: 10.1007/978-3-642- 22792-9_33]
    [76] Popa RA, Li FH, Zeldovich N. An ideal-security protocol for order-preserving encoding. In: Proc. of the 2013 IEEE Symp. on Security and Privacy (S&P). Berkeley: IEEE Computer Society, 2013. 463-477.[doi: 10.1109/SP.2013.38]
    [77] Boneh D, Di Crescenzo G, Ostrovsky R, Persiano G. Public key encryption with keyword search. In: Advances in Cryptology—Eurocrypt 2004. Berlin, Heidelberg: Springer-Verlag, 2004. 506-522.[doi: 10.1007/978-3-540-24676-3_30]
    网友评论
    网友评论
    分享到微博
    发 布
引用本文

黄刘生,田苗苗,黄河.大数据隐私保护密码技术研究综述.软件学报,2015,26(4):945-959

复制
分享
文章指标
  • 点击次数:9413
  • 下载次数: 12608
  • HTML阅读次数: 4185
  • 引用次数: 0
历史
  • 收稿日期:2014-01-20
  • 最后修改日期:2014-04-15
  • 在线发布日期: 2015-02-04
文章二维码
友情链接:中国科学院软件研究所中国计算机学会中国科学院国家自然科学基金委员会CCF数字图书馆Int'l J of Softw Info计算机系统应用
您是第19922697位访问者
版权所有：中国科学院软件研究所 京ICP备05046678号-3
地址：北京市海淀区中关村南四街4号,邮政编码：100190
电话：010-62562563 传真：010-62562533 Email：jos@iscas.ac.cn
技术支持：北京勤云科技发展有限公司

京公网安备 11040202500063号