Privacy-preserving attribute-keyword based data publish-subscribe service on cloud platforms

被引:63
作者
Yang, Kan [1 ,2 ]
Zhang, Kuan [2 ]
Jia, Xiaohua [3 ]
Hasan, M. Anwar [2 ]
Shen, Xuemin [2 ]
机构
[1] Univ Memphis, Dept Comp Sci, Memphis, TN 38152 USA
[2] Univ Waterloo, Dept Elect & Comp Engn, Waterloo, ON N2L 3G1, Canada
[3] City Univ Hong Kong, Dept Comp Sci, Kowloon, Hong Kong, Peoples R China
关键词
AKPS; Data publish-subscribe; Searchable encryption; Trapdoor privacy; Tag privacy; Data privacy; DATA ACCESS-CONTROL; EFFICIENT; SECURE;
D O I
10.1016/j.ins.2016.09.020
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
Data publish-subscribe service is an effective approach to selectively share and selectively receive data. Towards the huge amount of data generated in our daily life, cloud systems, with economical but powerful storage and computing resources, are inevitably becoming the most appropriate platform for data publication and subscription. However, cloud server may also curious about both the published data and the interests of the subscribers. In this paper, we propose a privacy-preserving Attribute-Keyword based data Publish-Subscribe (AKPS) scheme for cloud platforms. Specifically, in order to protect the privacy of the published data against the cloud server and other none-subscribers, we employ the attribute based encryption with decryption outsourcing to encrypt the published data, such that the publishers can control the data access by themselves and the major decryption overhead can be shift from the subscribers' devices to the cloud server. To protect the subscribers' interests, we propose a new searchable encryption to enable the subscribers to selectively receive interested data. Different from existing symmetric searchable encryption methods, the AKPS can support multiple publishers and multiple subscribers, while none of two publishers/subscribers share the same secret keys. Moreover, the publishers cannot act as the subscribers, and vice versa. To avoid bypassing access/subscription policy checking procedure, the AKPS smartly ties both access policy and subscription policy by two secrets. One secret is used to bundle the ciphertext and the tags together, while the other secret is used to bundle the subscription trapdoor and the pre-decryption key together. The security proof and performance evaluation show that the proposed AKPS scheme is provable secure in random oracle model and efficient in practice. (C) 2016 Elsevier Inc. All rights reserved.
引用
收藏
页码:116 / 131
页数:16
相关论文
共 26 条
  • [1] Adjedj M, 2009, LECT NOTES COMPUT SC, V5905, P86, DOI 10.1007/978-3-642-10772-6_8
  • [2] [Anonymous], 1996, SECURE SCHEMES SECRE
  • [3] Attrapadung N, 2009, LECT NOTES COMPUT SC, V5536, P168, DOI 10.1007/978-3-642-01957-9_11
  • [4] Boneh D, 2004, LECT NOTES COMPUT SC, V3027, P506
  • [5] Identity-based encryption from the Weil pairing
    Boneh, D
    Franklin, M
    [J]. SIAM JOURNAL ON COMPUTING, 2003, 32 (03) : 586 - 615
  • [6] Boneh D, 2007, LECT NOTES COMPUT SC, V4392, P535
  • [7] Goyal V., 2006, P 2006 INT C PRIVACY, P1
  • [8] Green M., 2011, P 20 USENIX C SEC, P34
  • [9] Hwang YH, 2007, LECT NOTES COMPUT SC, V4575, P2
  • [10] Enabling Efficient Multi-Keyword Ranked Search Over Encrypted Mobile Cloud Data Through Blind Storage
    Li, Hongwei
    Liu, Dongxia
    Dai, Yuanshun
    Luan, Tom H.
    Shen, Xuemin
    [J]. IEEE TRANSACTIONS ON EMERGING TOPICS IN COMPUTING, 2015, 3 (01) : 127 - 138