IDEAS home Printed from https://ideas.repec.org/a/igg/jisp00/v16y2022i1p1-19.html
   My bibliography  Save this article

Efficient ECC-Based CP-ABE Scheme With Constant-Sized Key and Scalable User Revocation

Author

Listed:
  • Divyashikha Sethia

    (Delhi Technological University, India)

  • Raj Sahu

    (Delhi Technological University, India)

Abstract

A lightweight encryption technique with low storage overheads is essential to secure data access from Resrouce-Constrained Devices (RCD). It must protect against unsolicited users with scalable user revocation with uninterrupted access to valid users. A user must be able to access RCD over low-energy wireless communication interfaces through a user reader device (mobile). Attribute-based encryption is an efficient technique for securely sharing sensitive data with multiple stakeholders without the requirement of sharing multiple security keys. This paper proposes a novel ECC-based scalable user revocation (EASER) ciphertext policy attribute-based encryption (CP-ABE) encryption scheme to secure and selectively share data from RCD with multiple stakeholders. It is based on ECC, with lower decryption time and constant-sized secret keys with low storage overhead. EASER extends Odelu et al.'s ECC-based CP-ABE scheme for scalable user revocation and mitigates a proven key-collusion attack. It is suitable for securing RCD and provides secure, selective access from a user reader device.

Suggested Citation

  • Divyashikha Sethia & Raj Sahu, 2022. "Efficient ECC-Based CP-ABE Scheme With Constant-Sized Key and Scalable User Revocation," International Journal of Information Security and Privacy (IJISP), IGI Global, vol. 16(1), pages 1-19, January.
    • Handle: RePEc:igg:jisp00:v:16:y:2022:i:1:p:1-19
    as

    Download full text from publisher

    File URL: http://services.igi-global.com/resolvedoi/resolve.aspx?doi=10.4018/IJISP.311468
    Download Restriction: no
    ---><---

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:igg:jisp00:v:16:y:2022:i:1:p:1-19. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Journal Editor (email available below). General contact details of provider: https://www.igi-global.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.