Instruct: Identify the main and secondary category of Arxiv papers based on the titles and abstracts
Query: Lightweight Distance bound Protocol for Low Cost RFID Tags   Almost all existing RFID authentication schemes (tag/reader) are vulnerable
to relay attacks, because of their inability to estimate the distance to the
tag. These attacks are very serious since it can be mounted without the notice
of neither the reader nor the tag and cannot be prevented by cryptographic
protocols that operate at the application layer. Distance bounding protocols
represent a promising way to thwart relay attacks, by measuring the round trip
time of short authenticated messages. All the existing distance bounding
protocols use random number generator and hash functions at the tag side which
make them inapplicable at low cost RFID tags. This paper proposes a lightweight
distance bound protocol for low cost RFID tags. The proposed protocol based on
modified version of Gossamer mutual authentication protocol. The implementation
of the proposed protocol meets the limited abilities of low-cost RFID tags.

2
The categories of this paper are: math
6
The categories of this paper are: astro-ph
3
The categories of this paper are: physics
7
The categories of this paper are: hep-th
9
The categories of this paper are: nlin
22
The categories of this paper are: chao-dyn
17
The categories of this paper are: q-fin
8
The categories of this paper are: hep-ex
12
The categories of this paper are: nucl-th
23
The categories of this paper are: solv-int
37
The categories of this paper are: supr-con
33
The categories of this paper are: plasm-ph
34
The categories of this paper are: chem-ph
29
The categories of this paper are: funct-an
20
The categories of this paper are: acc-phys
16
The categories of this paper are: stat