WhatsApp at (+91-9098855509) Support
ijprems Logo
  • Home
  • About Us
    • Editor Vision
    • Editorial Board
    • Privacy Policy
    • Terms & Conditions
    • Publication Ethics
    • Peer Review Process
  • For Authors
    • Publication Process(up)
    • Submit Paper Online
    • Pay Publication Fee
    • Track Paper
    • Copyright Form
    • Paper Format
    • Topics
  • Fees
  • Indexing
  • Conference
  • Contact
  • Archieves
    • Current Issue
    • Past Issue
  • More
    • FAQs
    • Join As Reviewer
  • Submit Paper

Recent Papers

Dedicated to advancing knowledge through rigorous research and scholarly publication

  1. Home
  2. Recent Papers

Verifiable and Multi Keyword Searchable Attribute Based Encryption SchemeforCloud

Pooja J J

Download Paper

Paper Contents

Abstract

In attribute-based searchable encryption (ABSE) scheme, data owners can encrypt their data with access policy for security consideration, and encrypt keywords to obtain keyword index for privacy keyword search, and data users can search interesting keyword on keyword indexes by keyword search trapdoor. However, many existing searchable encryption schemes only support single keyword search and most of the existing attribute-based encryption (ABE) schemes have high computational costs at user client. These problems significantly limit the application of attribute-based searchable encryption schemes in practice. In this paper, we propose a verifiable and multi-keyword searchable attribute-based encryption (VMKS- ABE) scheme for cloud storage, in our new scheme, multi-keyword can be searched and the search privacy is protected. That is, the cloud server can search the multi-keyword with keyword search trapdoor but it does not know any information about the keywords searched. In the proposed scheme, many computing tasks are outsourced to the cloud proxy server, which greatly reduces the computing burden at the user client. Besides, the scheme also supports the verification of the correctness of the outsourced private key. The proposed scheme is proved secure that the keyword index is indistinguishable under the adaptive keyword attacks in the general group model, and the ciphertext is selective secure under selective plaintext attacks in the random oracle model. The security and experimental results show that our scheme is suitable forpracticability.

Copyright

Copyright © 2025 Pooja J. This is an open access article distributed under the Creative Commons Attribution License.

Paper Details
Paper ID: IJPREMS50500033387
ISSN: 2321-9653
Publisher: ijprems
Page Navigation
  • Abstract
  • Copyright
About IJPREMS

The International Journal of Progressive Research in Engineering, Management and Science is a peer-reviewed, open access journal that publishes original research articles in engineering, management, and applied sciences.

Quick Links
  • Home
  • About Our Journal
  • Editorial Board
  • Publication Ethics
Contact Us
  • IJPREMS - International Journal of Progressive Research in Engineering Management and Science, motinagar, ujjain, Madhya Pradesh., india
  • Chat with us on WhatsApp: +91 909-885-5509
  • Email us: editor@ijprems.com
  • Sun-Sat: 9:00 AM - 9:00 PM

© 2025 International Journal of Progressive Research in Engineering, Management and Science. All Rights Reserved.

Terms & Conditions | Privacy Policy | Publication Ethics | Peer Review Process | Contact Us