Multi-Value-Independent Ciphertext-Policy Attribute Based Encryption with Fast Keyword Search
Autor: | Xiaolei Dong, Haijiang Wang, Zhenfu Cao |
---|---|
Rok vydání: | 2020 |
Předmět: |
020203 distributed computing
021110 strategic defence & security studies Information Systems and Management Plaintext-aware encryption Computer Networks and Communications business.industry Computer science 0211 other engineering and technologies 02 engineering and technology Encryption Computer security computer.software_genre Computer Science Applications Multiple encryption Ciphertext indistinguishability Hardware and Architecture Probabilistic encryption Ciphertext 0202 electrical engineering electronic engineering information engineering Attribute-based encryption business Semantic security computer |
Zdroj: | IEEE Transactions on Services Computing. 13:1142-1151 |
ISSN: | 2372-0204 |
Popis: | ABKS has drawn much attention from research and industry in recent years, an ABKS scheme is an encryption scheme that supports keyword search and access control. Attribute-Based Encryption is a public key encryption that enables users to encrypt and decrypt message based on attributes. In a typical implementation, the size of the ciphertext is proportional to the number of attributes associated with it and the decryption time is proportional to the number of attributes used during decryption. Inherit from ABE technology, the computation cost and ciphertext size in most ABKS schemes grow with the complexity of the access policy. On the other hand, we found that the traditional ABKS schemes cannot resist our secret-key-recovery attack. To deal with the above problems, we present new ciphertext policy attribute based encryption with fast keyword search constructions. Our constructions preserve the fine-grained access control inherited from the ABE system while supporting hidden policy and fast keyword search. Our constructions feature multi-value-independent compared with the existing attribute based searchable encryption schemes. The performance analysis demonstrates the efficiency of our constructions. We offer rigorous security proof of our second scheme, which is IND-CKA and IND-CPA secure. |
Databáze: | OpenAIRE |
Externí odkaz: |