IDEAS home Printed from https://ideas.repec.org/a/sae/intdis/v18y2022i3p15501329221088740.html
   My bibliography  Save this article

Hierarchical secret sharing scheme for WSN based on linear homogeneous recurrence relations

Author

Listed:
  • Yan Lin
  • Hongliang Zhu
  • Guoai Xu
  • Guosheng Xu

Abstract

Wireless sensor network is a key technology in the sensing layer of the Internet of Things. Data security in wireless sensor network is directly related to the authenticity and validity of data transmitted in the Internet of Things. Due to the large number and different types of nodes in wireless sensor networks, layered secret key sharing technology is increasingly used in wireless sensor networks. In a hierarchical secret sharing scheme, participants are divided into sections with different permissions for each team, but the same permissions for participants in the same team. In this article, we follow the approach of the hierarchical secret sharing scheme derived from the linear homogeneous recurrence relations. We design a hierarchical multi-secret sharing scheme for wireless sensor networks on the basis of the elliptic curve public key cryptosystem combined with the linear homogeneous recurrence relations. In the proposed scheme, we do not make sure that the participants are half-truthful. In addition, the participants’ shadows can be reused. Our scheme is computational security. Only one share from each member is required in our hierarchical multi-secret sharing scheme. It is more suitable for wireless sensor networks compared to the up-to-date schemes.

Suggested Citation

  • Yan Lin & Hongliang Zhu & Guoai Xu & Guosheng Xu, 2022. "Hierarchical secret sharing scheme for WSN based on linear homogeneous recurrence relations," International Journal of Distributed Sensor Networks, , vol. 18(3), pages 15501329221, March.
  • Handle: RePEc:sae:intdis:v:18:y:2022:i:3:p:15501329221088740
    DOI: 10.1177/15501329221088740
    as

    Download full text from publisher

    File URL: https://journals.sagepub.com/doi/10.1177/15501329221088740
    Download Restriction: no

    File URL: https://libkey.io/10.1177/15501329221088740?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    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:sae:intdis:v:18:y:2022:i:3:p:15501329221088740. 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: SAGE Publications (email available below). General contact details of provider: .

    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.