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

Time-constrained strong multi-designated verifier signature suitable for Internet of things–based collaborative fog computing systems

Author

Listed:
  • Han-Yu Lin

Abstract

Fog computing is viewed as an extended technique of cloud computing. In Internet of things–based collaborative fog computing systems, a fog node aggregating lots of data from Internet of things devices has to transmit the information to distributed cloud servers that will collaboratively verify it based on some predefined auditing policy. However, compromised fog nodes controlled by an adversary might inject bogus data to cheat or confuse remote servers. It also causes the waste of communication and computation resources. To further control the lifetime of signing capability for fog nodes, an appropriate mechanism is crucial. In this article, the author proposes a time-constrained strong multi-designated verifier signature scheme to meet the above requirement. In particular, a conventional non-delegatable strong multi-designated verifier signature scheme with low computation is first given. Based on its constructions, we show how to transform it into a time-constrained variant. The unforgeability of the proposed schemes is formally proved based on the famous elliptic curve discrete logarithm assumption. The security requirement of strong signer ambiguity for our substantial constructions is also analyzed by utilizing the intractable assumption of decisional Diffie–Hellman. Moreover, some comparisons in terms of the signature size and computational costs for involved entities among related mechanisms are made.

Suggested Citation

  • Han-Yu Lin, 2021. "Time-constrained strong multi-designated verifier signature suitable for Internet of things–based collaborative fog computing systems," International Journal of Distributed Sensor Networks, , vol. 17(3), pages 15501477211, March.
  • Handle: RePEc:sae:intdis:v:17:y:2021:i:3:p:15501477211001760
    DOI: 10.1177/15501477211001760
    as

    Download full text from publisher

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

    File URL: https://libkey.io/10.1177/15501477211001760?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:17:y:2021:i:3:p:15501477211001760. 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.