Hierarchy attribute-based encryption with timing enabled privacy preserving keyword search mechanism for e-health clouds

Author(s):  
Bindu K Gowda ◽  
R Sumathi
Cryptography ◽  
2020 ◽  
Vol 4 (4) ◽  
pp. 28
Author(s):  
Yunhong Zhou ◽  
Shihui Zheng ◽  
Licheng Wang

In the area of searchable encryption, public key encryption with keyword search (PEKS) has been a critically important and promising technique which provides secure search over encrypted data in cloud computing. PEKS can protect user data privacy without affecting the usage of the data stored in the untrusted cloud server environment. However, most of the existing PEKS schemes concentrate on data users’ rich search functionalities, regardless of their search permission. Attribute-based encryption technology is a good method to solve the security issues, which provides fine-grained access control to the encrypted data. In this paper, we propose a privacy-preserving and efficient public key encryption with keyword search scheme by using the ciphertext-policy attribute-based encryption (CP-ABE) technique to support both fine-grained access control and keyword search over encrypted data simultaneously. We formalize the security definition, and prove that our scheme achieves selective indistinguishability security against an adaptive chosen keyword attack. Finally, we present the performance analysis in terms of theoretical analysis and experimental analysis, and demonstrate the efficiency of our scheme.


2021 ◽  
Vol 3 (3) ◽  
pp. 250-262
Author(s):  
Jennifer S. Raj

Several subscribing and content sharing services are largely personalized with the growing use of mobile social media technology. The end user privacy in terms of social relationships, interests and identities as well as shared content confidentiality are some of the privacy concerns in such services. The content is provided with fine-grained access control with the help of attribute-based encryption (ABE) in existing work. Decryption of privacy preserving content suffers high consumption of energy and data leakage to unauthorized people is faced when mobile social networks share privacy preserving data. In the mobile social networks, a secure proxy decryption model with enhanced publishing and subscribing scheme is presented in this paper as a solution to the aforementioned issues. The user credentials and data confidentiality are protected by access control techniques that work on privacy preserving in a self-contained manner. Keyword search based public-key encryption with ciphertext policy attribute-based encryption is used in this model. At the end users, ciphertext decryption is performed to reduce the energy consumption by the secure proxy decryption scheme. The effectiveness and efficiency of the privacy preservation model is observed from the experimental results.


Author(s):  
Fei Meng ◽  
Leixiao Cheng ◽  
Mingqiang Wang

AbstractCountless data generated in Smart city may contain private and sensitive information and should be protected from unauthorized users. The data can be encrypted by Attribute-based encryption (CP-ABE), which allows encrypter to specify access policies in the ciphertext. But, traditional CP-ABE schemes are limited because of two shortages: the access policy is public i.e., privacy exposed; the decryption time is linear with the complexity of policy, i.e., huge computational overheads. In this work, we introduce a novel method to protect the privacy of CP-ABE scheme by keyword search (KS) techniques. In detail, we define a new security model called chosen sensitive policy security: two access policies embedded in the ciphertext, one is public and the other is sensitive and hidden. If user's attributes don't satisfy the public policy, he/she cannot get any information (attribute name and its values) of the hidden one. Previous CP-ABE schemes with hidden policy only work on the “AND-gate” access structure or their ciphertext size or decryption time maybe super-polynomial. Our scheme is more expressive and compact. Since, IoT devices spread all over the smart city, so the computational overhead of encryption and decryption can be shifted to third parties. Therefore, our scheme is more applicable to resource-constrained users. We prove our scheme to be selective secure under the decisional bilinear Diffie-Hellman (DBDH) assumption.


Sign in / Sign up

Export Citation Format

Share Document