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

RCIA: A New Ultralightweight RFID Authentication Protocol Using Recursive Hash

Author

Listed:
  • Umar Mujahid
  • M. Najam-ul-Islam
  • M. Ali Shami

Abstract

RFID is one of the most protuberant systems in the field of ubiquitous computing. Since RFID tags have limited computation capabilities, numerous ultralightweight authentication protocols have been proposed to provide privacy and security. However all the previously proposed ultralightweight mutual authentication protocols have some security apprehensions and are vulnerable to various desynchronization and full disclosure attacks. This paper proposes a new ultralightweight mutual authentication protocol to provide robust confidentiality, integrity, and authentication (RCIA) in a cost effective manner. RCIA introduces a new ultralightweight primitive recursive hash, which efficiently detects the message tempering and also avoids all possible desynchronization attacks. RCIA involves only bitwise operations such as XOR, AND, left rotation, and recursive hash. Performance evaluation illustrates that RCIA requires less resources on tag in terms of on-chip memory, communication cost, and computational operations.

Suggested Citation

  • Umar Mujahid & M. Najam-ul-Islam & M. Ali Shami, 2015. "RCIA: A New Ultralightweight RFID Authentication Protocol Using Recursive Hash," International Journal of Distributed Sensor Networks, , vol. 11(1), pages 642180-6421, January.
  • Handle: RePEc:sae:intdis:v:11:y:2015:i:1:p:642180
    DOI: 10.1155/2015/642180
    as

    Download full text from publisher

    File URL: https://journals.sagepub.com/doi/10.1155/2015/642180
    Download Restriction: no

    File URL: https://libkey.io/10.1155/2015/642180?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
    ---><---

    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:sae:intdis:v:11:y:2015:i:1:p:642180. 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.