• DocumentCode
    2360160
  • Title

    RFID distance bounding protocol using m-ary challenges

  • Author

    Kim, Young-Sik ; Kim, Sang-Hyo

  • Author_Institution
    Dept. of Inf. & Commun. Engineeing, Chosun Univ., Gwangju, South Korea
  • fYear
    2011
  • fDate
    28-30 Sept. 2011
  • Firstpage
    782
  • Lastpage
    783
  • Abstract
    In this paper, we propose a RFID distance bounding protocol. Recently, Kim and Avoine proposed distance bounding protocols with mixed challenges which are pre-determined or random. We generalized the first scheme of the Kim and Avoine´s work as a distance bounding protocol with m-ary challenges. Using m-ary challenges, it is possible to reduce the mafia fraud success probability from (3/4)n for m = 2 to (7/16)n for m = 4.
  • Keywords
    probability; protocols; radiofrequency identification; telecommunication security; M-ary challenges; RFID distance bounding protocol; mafia fraud success probability; radiofrequency identification; Educational institutions; Memory management; Modulation; Protocols; Radiofrequency identification; Security; Wireless communication; RFID; distance bounding protocol; distance fraud; mafia fraud;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    ICT Convergence (ICTC), 2011 International Conference on
  • Conference_Location
    Seoul
  • Print_ISBN
    978-1-4577-1267-8
  • Type

    conf

  • DOI
    10.1109/ICTC.2011.6082538
  • Filename
    6082538
    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=2360160