【2016年第1期】大数据隐私保护技术综述（下）

最新推荐文章于 2021-12-30 21:19:25 发布

唐名威

最新推荐文章于 2021-12-30 21:19:25 发布

阅读量1.2k

点赞数

原文链接：http://www.j-bigdataresearch.com.cn/CN/10.11959/j.issn.2096-0271.2016001

版权

6 大数据访问控制技术

大数据访问控制技术主要用于决定哪些用户可以以何种权限访问哪些大数据资源，从而确保合适的数据及合适的属性在合适的时间和地点，给合适的用户访问，其主要目标是解决大数据使用过程中的隐私保护问题。早期的访问控制技术，如自主访问控制（discretionary access control，DAC）^[51]、强制访问控制（mandatory access control，MAC）^[52]等都面向封闭环境，访问控制的粒度都比较粗，难以满足大数据时代开放式环境下对访问控制的精细化要求。

大数据给传统访问控制技术带来的挑战如下。

●大数据的时空特性，大数据下的访问控制模型需要在传统访问控制的基础上，充分考虑用户的时间信息和位置信息。

●在大数据时代的开放式环境下，用户来自于多种组织、机构或部门，单个用户又通常具有多种数据访问需求^[53]，如何合理设定角色并为每个用户动态分配角色是新的挑战。

●大数据面向的应用需求众多，不同的应用需要不同的访问控制策略。以社交网站为例：对于用户个人主页的数据，需要基于用户社交关系的访问控制；对于网站数据，需要基于用户等级的访问控制等。

传统的访问控制方式，包括自主访问控制和强制访问控制技术，难以应对上述挑战。因此，大数据时代的访问控制技术主要包括基于角色的访问控制和基于属性的访问控制方法。

6.1 基于角色的访问控制

基于角色的访问控制（role-based access control，RBAC）^[54]中，不同角色的访问控制权限不尽相同。通过为用户分配角色，可实现对数据的访问权限控制。由此，在基于角色的访问控制中，角色挖掘是前提。通常，角色是根据工作能力、职权及责任确定的。大数据场景下的角色挖掘，需要大量人工参与角色定义、角色划分及角色授权等问题，衍生出了所谓角色工程（role engineering）^[55]。角色工程的最终目的是根据个体在某一组织内所担当的角色或发挥的作用来实现最佳安全管理。有效的角色工程可以为用户权限提供最优分配、鉴别异常用户、检测并删除冗余或过量的角色、使角色定义及用户权限保持最新、降低随之发生的各类风险等。大数据时代，可用于角色挖掘的数据丰富多样，对角色权限的配置也更加灵活复杂。一方面需要通过挖掘己方数据，合理配置权限，实现数据的访问可控；另一方面，需要挖掘可收集到的对方数据，找出重要目标角色，以便重点关注。因此，大数据下的角色工程需要从攻击和防护的角度综合考虑。

RBAC最初也主要应用于封闭环境之中。针对大数据时空关联性，一些研究者提出将时空信息融合到RBAC当中。如Ray等人提出了LARB（location-aware role-based）访问控制模型，在RBAC的基础之上引入了位置信息，通过考虑用户的位置来确定用户是否具有访问数据的权限^[56]。Damiani等人提出的GEO-RBAC，也在分配用户角色时综合考虑了用户的空间位置信息^[57]。张颖君等人提出的基于尺度的时空RBAC访问控制模型，引入了尺度的概念，使得访问控制策略的表达能力得到增强，同时也增强了模型的安全性^[58]。

随着大数据环境下角色规模的迅速增长，设计算法自动实现角色的提取与优化逐渐成为近年来的研究热点。参考文献[59]尝试将角色最小化，即找出能满足预定义的用户—授权关系的一组最小角色集合。参考文献[60]提出最小扰动混合角色挖掘方法，首先以自顶向下的方法预先定义部分角色，然后以自底向上的方法挖掘候选角色集合。自动化角色挖掘大大减少了人工工作量，但也面临时间复杂度高的问题，部分问题甚至属于NP完全问题。参考文献[61]提出了一种简单的启发式算法SMA来简化角色求解。参考文献[62]针对大数据及噪声数据场景，提出选择稳定的候选角色，并进一步将角色挖掘问题分解以降低复杂度。

大数据时代的访问控制应用场景广泛，需求也不尽相同。一些研究通过广泛收集研究对象的应用数据，试图挖掘出其中的关键角色，从而有针对性地采取处理措施。参考文献[63]提出在RBAC的基础上增加责任的概念，即responsibility-RBAC，对用户职责进行显式确认，以根据实际应用场景优化角色的数量。

6.2 基于属性的访问控制

基于属性的访问控制（attribute-based access control，ABAC）^[64]通过将各类属性，包括用户属性、资源属性、环境属性等组合起来用于用户访问权限的设定。RBAC以用户为中心，而没有将额外的资源信息，如用户和资源之间的关系、资源随时间的动态变化、用户对资源的请求动作（如浏览、编辑、删除等）以及环境上下文信息进行综合考虑。而基于属性的访问控制ABAC通过对全方位属性的考虑，可以实现更加细粒度的访问控制。

大数据环境下，越来越多的信息存储在云平台上。根据云平台的特点，基于属性集加密访问控制^[65]、基于密文策略属性集的加密^[66]、基于层次式属性集合的加密^[67]等相继被提出。这些模型都以数据资源的属性加密作为基本手段，采用不同的策略增加权限访问的灵活性。如HASBE通过层次化的属性加密，可以实现云平台上数据的更加细粒度的访问控制，层次化也使得模型更加灵活，具有更好的可扩展性。除了提供属性加密访问控制之外，ABAC也被当作云基础设施上访问控制中的一项服务^[68]。

ABE将属性与密文和用户私钥关联，能够灵活地表示访问控制策略。但对于存储在云端的大数据，当数据拥有者想要改变访问控制策略时，需要先将加密数据从云端取回本地，解密原有数据，之后再使用新的策略重新加密数据，最后将密文传回云端。在这一过程中，密文需要来回传输，会消耗大量带宽，从而引发异常，引起攻击者的注意^[69]，对数据的解密和重新加密也会使得计算复杂度显著增大。为此，Yang等人提出了一种高效的访问控制策略动态更新方法^[70]。当访问控制策略发生变化时，数据拥有者首先使用密钥更新策略UKeyGen生成更新密钥UK_m，并将其和属性变化情况（如增加、减少特定属性）一起发送到云端。之后，在云端上按照密文更新策略CTUpdate对原有的密文进行更新，而不用对原有密文进行解密。

云端代理重加密将基于属性的加密与代理重加密技术结合，实现云中的安全、细粒度、可扩展的数据访问控制^[71-73]。新的用户获取授权或原有用户释放授权时的重加密工作由云端代理，减轻数据拥有者的负担。同时对数据拥有者来说，云端可能并非是完全可信的，在利用云端进行代理重加密的同时还应防止数据被云端窥探。用户提交给云的是密文，云端无法解密，云端利用重加密算法转换为另一密文，新的密文只能被授权用户解密，而在整个过程中云端服务器看到的始终是密文，看不到明文。云中用户频繁地获取和释放授权，使得数据密文重加密工作繁重，由云端代理重加密工作，可以大大减轻数据拥有者的负担。同时，云端无法解密密文，也就无法窥探数据内容。

Sun等人^[74]提出了支持高效用户撤销的属性关键词搜索方案，实现了可扩展且基于用户制定访问策略的高细粒度搜索授权，通过代理重加密和懒惰重加密技术，将用户撤销过程中系统繁重的密钥更新工作交给半可信的云服务器。Wang等人^[75]针对多中心云计算环境的数据安全访问特点，将多中心属性加密和外包计算相结合，提出了一种轻量级的安全的访问控制方案。该方案具有解密密钥短、加解密计算开销小等优势，适用于轻量级设备。该方案可以无缝应用到群组隐私信息保护中，实现了群组成员之间的隐私信息定向发布和共享、群组外的隐私信息保护功能。

大数据为访问控制带来了诸多挑战，但也暗藏机遇。随着计算能力的进一步提升，无论是基于角色的访问控制还是基于属性的访问控制，访问控制的效率将得到快速提升。同时，更多的数据将被收集起来用于角色挖掘或者属性识别，从而可以实现更加精准、更加个性化的访问控制。总体而言，目前专门针对大数据的访问控制还处在起步阶段，未来将角色与属性相结合的细粒度权限分配将会有很大的发展空间。

7 结束语

如何在不泄露用户隐私的前提下，提高大数据的利用率，挖掘大数据的价值，是目前大数据研究领域的关键问题。本文首先介绍了大数据带来的隐私保护问题，然后介绍了大数据隐私的概念和大数据生命周期的隐私保护模型，接着从大数据生命周期的发布、存储、分析和使用4个阶段出发，对大数据隐私保护中的技术现状和发展趋势进行了分类阐述，对该技术的优缺点、适用范围等进行分析，探索了大数据隐私保护技术进一步发展的方向。

参考文献

[1] 方滨兴,刘克,吴曼青,等. 大搜索技术白皮书[R/OL].(2015-01-06)[2015-05-23 ]. http://wenku.baidu.com/link? url=gqavgz5O7VROHQgJH4_egRVHB_JtcskcX-vWvRgEdzhfMuyidxhO_kdGemK8Qve-z0z-dBIJRpSqZj7oCYLd0i-2iT1mXE2B1B5p4nPW0TO.

FANG B X, LIU K, WU M Q, et al. White paper on big search[R/OL]. (2015-01-06)[2015-05-23]. http://wenku.baidu.com/link?url=gqavgz5O7VROHQgJH4_egRVHB_JtcskcX-vWvRgEdzhfMuyidxhO_kdGemK8Qve-z0z-dBIJRpSqZj7oCYLd0i-2iT1mXE2B1B5p4nPW0TO.

[2] 周水庚, 李丰, 陶宇飞, 等. 面向数据库应用的隐私保护研究综述[J]. 计算机学报, 2009,32(5): 847-861.

ZHOU S G, LI F, TAO Y F, et al. Privacy preservation in database applications: a survey[J]. Chinese Journal of Computers, 2009, 32(5): 847-861.

[3] SAMARATI P, SWEENEY L. Generalizing data to provide anonymity when disclosing information[C]// Proceedings of the 17th ACM Sigact-Sigmod-Sigart Symposium on Principles of Database System, June 1-3, 1998, Seattle, Washington, USA. New York: ACM Press, 1998.

[4] SWEENY L. k-anonymity: a model for protecting privacy[J]. International Journal on Uncertainty, Fuzziness and Knowledge Based Systems, 2012, 10(5): 557-570.

[5] BARBARO M, ZELLER T. A face is exposed for AOL searcher No. 4417749[N/OL]. New York Times, (2006-08-09)[2013-09-10]. http://www.nytimes.com/2006/08/09/technology/09aol.html.

[6] NARAYANAN A, SHMATIKOV V. How to break anonymity of the netflix prize dataset[J]. Eprint Arxiv Cs, 2006, arXiv:cs/0610105.

[7] MACHANAVAJJHALA A, GEHRKE J, KIFER D, et al. l-diversity: privacy beyond k-anonymity[J]. ACM Transactions on Knowledge Discovery from Data, 2007, 1(1): 24.

[8] LI N, LI T, VENKATASUBRAMANIAN S. t-closeness: privacy beyond k-anonymity and l-diversity[C]// Proceedings of IEEE 23rd International Conference on Data Engineering, April 11-15, 2007, Istanbul, Turkey. Piscataway: IEEE Press, 2007: 106-115.

[9] NIU B, LI Q H, ZHU X Y, et al. Enhancing privacy through caching in location-based services[C]//Proceedings of IEEE INFOCOM, April 26-May 1, 2015, Hong Kong, China. Piscataway: IEEE Press, 2015: 1017-1025.

[10] LI A, JIN S, ZHANG L, et al. A sequential decision-theoretic model for medical diagnostic system [J]. Technology and Health Care, 2015, 23(s1): S37-S42.

[11] BYUN J W, SOHN Y, BERTINO E, et al. Secure anonymization for incremental dataset[C]//Proceedings of the 3rd VLDB Workshop on Secure Data Management (SDM), September 10-11, 2006, Seoul, Korea. [S.l.: s.n.], 2006.

[12] XIAO X K, TAO Y F. m-invariance: towards privacy preserving re-publication of dynamic datasets[C]// Proceedings of the 2007, ACM SIGMOD International Conference on Management of Data, June 12-14, 2007， Beijing, China. New York: ACM Press, 2007: 689-700.

[13] BU Y Y, FU A W C, WONG R C W, et al. Privacy preserving serial data publishing by role composition[C]// Proceedings of the 34th International Conference on Very Large Data Bases, August 23-28, 2008, Auckland, New Zealand. [S.l.: s.n.], 2008: 845-856.

[14] ZHANG X, LIU C, NEPAL S, et al. A hybrid approach for scalable sub-tree anonymization over big data using MapReduce on cloud [J]. Journal of Computer & System Sciences, 2014, 80(5): 1008-1020.

[15] ZHANG X, LIU C, NEPAL S, et al. Combining top-down and bottom-up: scalable sub-tree anonymization over big data using MapReduce on cloud [J]. IEEE International Conference on Trust, 2013, 52(1): 501-508.

[16] MOHAMMADIAN E, NOFERESTI M, JALILI R. FAST: fast anonymization of big data streams[C]// Proceedings of the 2014 International Conference on Big Data Science and Computing, Aug 4-7, 2014,Beijing, China. [S.l.:s.n.], 2014.

[17] SEDAYAO J, BHARDWAJ R, GORADE N. Making big data, privacy, and anonymization work together in the enterprise: experiences and issues[C]//Proceedings of the 3rd International Congress on Big Data, June 27-July 2, 2014, Anchorage, Alaska, USA. Piscataway: IEEE Press, 2014.

[18] SUN G Z , WEI S , XIE X . De-anonymization technology and applications in the age of big data [J]. Information &Communications Technologies, 2013(6): 52-57.

[19] NARAYANAN A, SHMATIKOV V. Robust de-anonymization of large sparse datasets[C]//Proceedings of the 2008 IEEE Symposium on Security and Privacy, May 18-21, 2008, Oakland, USA. Piscataway: IEEE Press, 2008: 111-122.

[20] National Bureau of Standards. Proposed federal information processing data encryption standard [J]. Creptologia, 1977, 1(3): 292-306.

[21] FIPS. Advanced encryption standard (AES): FIPS PUB 197[S/OL]. [2010-10-16]. http://wenku.baidu.com/link?url=dqgVVuI1EvKAh4fSiHu7mSAgObQji-LiI6C1_KlYWtuiIUFIZaJUZOpkcOWQMPy9U91SHgPcPrt7UWmAQmT3b8WJZ80idSjZ-qLVileRY3a.

[22] RIVEST R L, SHAMIR A, ADLERNAN L M. A method for obtaining digital signatures and public-key cryptosystems [J]. Communications of the ACM, 1978, 21(6): 120-126.

[23] ELGAMAL T. A public key cryptosystem and a signature scheme based on discrete logarithms[J]. IEEE Transactions on Information Theory, 1985, 31(4): 469-472.

[24] LIN H Y, SHEN S T, TZENG W G, et al. Toward data confidentiality via integrating hybrid encryption schemes and Hadoop distributed file system[C]//Proceedings of IEEE 26th International Conference on Advanced Information Networking and Applications (AINA), March 26-29, 2012, Fukuoka, Japan. Washington DC: IEEE Computer Society Press, 2012: 740-747.

[25] GENTRY C. A fully homomorphic encryption scheme [D]. Palo Alto: Stanford University, 2009.

[26] VAN DIJK M, GENTRY C, HALEVI S, et al. Fully homomorphic encryption over the integers[C]// Proceedings of the 29th Annual International Conference on the Theory and Applications of Cryptographic Techniques, May 30-June 3, 2010, Riviera, French. New York: Springer Berlin Heidelberg, 2010: 24-43.

[27] CHEN X, HUANG Q. The data protection of MapReduce using homomorphic encryption[C]// Proceedings of the 4th IEEE International Conference on Software Engineering and Service Science (ICSESS), May 23-25, 2013, Beijing, China. Piscataway: IEEE Press, 2013: 419-421.

[28] WANG B Y, LI B C, LI H. Public auditing for shared data with efficient user revocation in the cloud[C]// Proceedings of IEEE INFOCOM, April 26-May 1, 2015, Hong Kong, China. Piscataway: IEEE Press, 2015: 2904-2912.

[29] ATENIESE G, BURNS R, CURMOLA R, et al. Provable data possession at untrusted stores[J]. ACM Conference on Computer & Communications Security, 2007, 14(1): 598-609.

[30] JUELS A, KALISKI B S. PORs: proofs of retrievability for large files[C]//Proceedings of the 14th ACM Conference on Computer and Communications Security, October 29-November 2, 2007, Alexandria, VA, USA. New York: ACM Press, 2007: 584-597.

[31] SHACHAM H, WATERS B. Compact proofs of retrievability[J]. Journal of Cryptology, 2013, 26(3): 442-483.

[32] ATENIESE G, PIETRO R, MANCIN L V, et al. Scalable and efficient provable data possession[C]// Proceedings of International Conference on Security & Privacy in Communication Networks, September 22-25, 2008, Istanbul, Turkey. New York: ACM Press, 2008.

[33] ERWAY C, KüPçü A, PAPAMANTHOU C, et al. Dynamic provable data possession[C]// Proceedings of the 16th ACM Conference on Computer and Communications Security, November 9-13, 2009, Chicago, IL, USA. New York: ACM Press, 2009: 213-222.

[34] WANG Q, WANG C, LI J, et al. Enabling public verifiability and data dynamics for storage security in cloud computing[C]//Proceedings of ESORICS, September 21-25, 2009, Saint Malo, France. [S.l.:s.n.], 2009: 355-370.

[35] WANG C, WANG Q, REN K, et al. Privacy-preserving public auditing for data storage security in cloud computing[C]// Proceedings of IEEE INFOCOM, March 15-19, 2010, San Diego, CA, USA. Piscataway: IEEE Press, 2010: 525-533.

[36] WANG B Y, LI B C, LI H． Oruta: privacy preserving public auditing for shared data in the cloud[C]//Proceedings of IEEE 5th International Conference on Cloud Computing, November 22-24, 2012, Honolulu, Hawaii, USA. Piscataway: IEEE Press, 2012: 295-302.

[37] WANG B Y, LI B C, LI H. Knox: privacy preserving auditing for shared data with large groups in the cloud[C]// Proceedings of the 10th International Conference on Applied Cryptography and Network Security, June 26-29, 2012, Singapore. Berlin: Springer, 2012.

[38] THURAISINGHAM B. Big data security and privacy[C]//Proceedings of the 5th ACM Conference on Data and Application Security and Privacy, March 2-4, 2015, San Antonio, TX, USA. New York: ACM Press, 2015: 279-280.

[39] WONG R. Big data privacy[J]. J Inform Tech SoftwEng, 2012(2): e114.

[40] WU X, ZHU X, WU G Q, et al. Data mining with big data[J]. IEEE Transactions on Knowledge and Data Engineering, 2014, 26(1): 97-107.

[41] AGGARWAL C C, PHILIP S Y. A General Survey of Privacy-Preserving Data Mining Models and Algorithms[M]. New York: Springer US, 2008.

[42] ATALLAH M, BERTINO E, ELMAGARMID A, et al. Disclosure limitation of sensitive rules[C]//Proceedings of Workshop on Knowledge and Data Engineering Exchange, November 7, 1999, Chicago, IL, USA. Piscataway: IEEE Press, 1999: 45-52.

[43] OLIVEIRA S R M, ZAIANE O R. Privacy preserving frequent itemset mining[C]// Proceedings of IEEE International Conference on Data Mining, Japan, December 9-12, 2002, Maebashi City. Piscataway: IEEE Press, 2002: 43-54.

[44] CHANG L W, MOSKOWITZ I S. An Integrated Framework for Database Inference and Privacy Protection[M]. Ifip Tc11/ Wg113 Fourteenth Working Conference on Database Security: Data&Application Security. New York: Springer US, 2000: 161-172.

[45] AGGARWAL C, PEI J, ZHANG B. A framework for privacy preservation against adversarial data mining[C]//Proceedings of the 12th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, August 20-23, 2006, Philadelphia, USA. New York: ACM Press, 2006.

[46] AGRAWAL R, SRIKANT R. Privacy-preserving data mining[J]. ACM SIGMOD Record, 2000, 29(2): 439-450.

[47] MOSKOWITZ L W, CHANG I S. A Decision Theoretical Based System for Information Downgrading[R/OL]. (2011-08-27)[2015-11-20]. http://wenku.baidu.com/link?url=JAg4rujC4hcwRVbIulvyqgkMJaP fMQ41JAr8v4zfRmZwXWwBNndmDUm10WAIvXYEvlCWb2m34GnIBkADnLpgm8za3iyAHiDnChiaPZwthAW.

[48] CHANG L W, MOSKOWITZ I S. Parsimonious downgrading and decision trees applied to the inference problem[C]//Proceedings of the 1998 Workshop on New Security Paradigms, Charlottesville, Virginia, USA, 1998. New York: ACM Press, 1998: 82-89.

[49] OLIVEIRA S R M, ZAIANE O R. Privacy preserving clustering by data transformation[J]. Journal of Information and Data Management, 2010, 1(1): 37.

[50] VAIDYA J, CLIFTON C. Privacy-preserving k-means clustering over vertically partitioned data[C]//Proceedings of the 9th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, August 24-27, 2003, Washington DC, USA. New York: ACM Press, 2003: 206-215.

[51] SANDHU R S, SAMARATI P. Access control: principle and practice[J]. IEEE Communications Magazine, 1994, 32(9): 40-48.

[52] SANDHU R S. Lattice-based access control models[J]. Computer, 1993, 26(11): 9-19.

[53] ZHANG W, LI A, CHEEMA M, et al. Probabilistic n-of-N skyline computation over uncertain data streams[J]. World Wide Web, 2015, 18(5): 1331-1350.

[54] SANDHU R S, COYNE E J, FEINSTEIN H L, et al. Role-based access control models[J]. Computer, 1996(2): 38-47.

[55] KUHLMANN M, SHOHAT D, SCHIMPF G. Role mining-revealing business roles for security administration using data mining technology[C]// Proceedings of the 8th ACM Symposium on Access Control Models and Technologies, June 2-3, 2003, Como, Italy. New York: ACM Press, 2003: 179-186.

[56] RAY I, KUMAR M, YU L J. LRBAC: a location-aware role-based access control model[C]// Proceedings of the 2nd International Conference on Information Systems Security, December 19-21, 2006, Kolkata, India. New York: Springer US, 2006: 147-161.

[57] DAMIANI M L, BERTINO E, CATANIA B, et al. Geo-rbac: a spatially aware rbac[J]. ACM Transactions on Information and System Security (TISSEC), 2007, 10(1): 2.

[58] 张颖君, 冯登国. 基于尺度的时空RBAC模型[J]. 计算机研究与发展, 2015, 47(7): 1252-1260.

ZHANG Y J, FENG D G. A role-based access control model based on space, time and scale[J]. Journal of Computer Research and Development, 2010, 47(7): 1252-1260.

[59] ENE A, HORNE W, MILOSAVLJEVIC N, et al. Fast exact and heuristic methods for role minimization problems[C]//Proceedings of the 13th ACM Symposium on Access Control Models and Technologies, June 11-13, 2008, Estes Park, CO, USA. New York: ACM Press, 2008: 1-10.

[60] 翟志刚, 王建东, 曹子宁, 等. 最小扰动混合角色挖掘方法研究[J]. 计算机研究与发展, 2015, 50(5): 951-960.

ZHAI Z G, WANG J D, CAO Z N, et al. Hybrid role mining methods with minimal perturbation[J]. Journal of Computer Research and Development, 2015, 50(5): 951-960.

[61] BLUNDO C, CIMATO S. A simple role mining algorithm[C]//Proceedings of the 2010 ACM Symposium on Applied Computing, March 22-26, 2010, Sierre, Switzerland. New York: ACM Press, 2010: 1958-1962.

[62] NINO V V. Role mining over big and noisy data theory and some applications[D]. Roma: Roma Tre University, 2011.

[63] FELTUS C, PETIT M, SLOMAN M. Enhancement of business it alignment by including responsibility components in RBAC[C]//Proceedings of the 5th International Workshop on Business/IT Alignment and Interoperability BUSITAL, June 2010, Hammamet, Tunisia. [S.l.:s.n.], 2010.

[64] Attribute-based access control[EB/OL]. [2015-12-08]. https://en.wikipedia.org/wiki/Attribute-based_access_control.

[65] GOYAL V, PANDEY O, SAHAI A, et al. Attribute-based encryption for fine-grained access control of encrypted data[C]//Proceedings of the 13th ACM Conference on Computer and Communications Security, October 30-November 3, 2006, Alexandria, Virginia, USA. New York: ACM Press, 2006: 89-98.

[66] BOBBA R, KHURANA H, PRABHAKARAN M. Attribute-sets: a practically motivated enhancement to attribute-based encryption[C]//Proceedings of the 14th European Symposium on Research in Computer Security, September 21-25, 2009, Saint-Malo, France. [S.l.: s.t.], 2009: 587-604.

[67] WAN Z, LIU J E, DENG R H. HASBE: a hierarchical attribute-based solution for flexible and scalable access control in cloud computing[J]. IEEE Transactions on Information Forensics and Security, 2012, 7(2): 743-754.

[68] JIN X. Attribute-based access control models and implementation in cloud infrastructure as a service[D]. San Antonio: The University of Texas at San Antonio, 2014.

[69] LI A, HAN Y, ZHOU B, et al. Detecting hidden anomalies using sketch for high-speed network data stream monitoring[J]. Applied Mathematics and Information Sciences, 2012, 6(3): 759-765.

[70] YANG K, JIA X, REN K, et al. Enabling efficient access control with dynamic policy updating for big data in the cloud[C]// Proceedings of IEEE INFOCOM, April 27-May 2, 2014, Toronto, Canada. Piscataway: IEEE Press, 2014: 2013-2021.

[71] BLAZE M, BLEUMER G, STRAUSS M. Divertible protocols and atomic proxy cryptography[C]// Proceedings of International Conference on the Theory and Application of Cryptographic Techniques Espoo, May 13, 1998, Finland. Berlin: Springer, 1998: 127-144.

[72] LI A, XU J, GAN L, et al. An efficient approach on answering top-k queries with grid dominant graph index[C]// Proceedings of the 15th Asia-Pacific Web Conference, April 4-6, 2013, Sydney, Australia. Berlin: Springer, 2013: 804-814.

[73] ZHANG W M, CHEN B, YU N H. Improving various reversible data hiding schemes via optimal codes for binary covers[J]. IEEE Transactions on Image Processing, 2012, 21(6): 2991-3003.

[74] SUN W H, YU S C, LOU W J, et al. Protecting your right: attribute-based keyword search with fine-grained owner-enforced search authorization in the cloud[C]//Proceedings of IEEE Conference on Computer Communications, April 27- May 2, 2014, Toronto, Ontario, Canada. Piscataway: IEEE Press, 2014.

[75] WANG Y C, LI F H, XIONG J B, et al. Achieving lightweight and secure access control in multi-authority cloud[C]//Proceedings of the 14th IEEE International Conference on Trust, Security and Privacy in Computing and Communications, August 20-22, 2015, Helsinki, Finland. Piscataway: IEEE Press, 2015: 459-466.