CN113392663A - Accurate and stable batch authentication protocol for large-scale RFID system - Google Patents

Accurate and stable batch authentication protocol for large-scale RFID system Download PDF

Info

Publication number
CN113392663A
CN113392663A CN202110640717.2A CN202110640717A CN113392663A CN 113392663 A CN113392663 A CN 113392663A CN 202110640717 A CN202110640717 A CN 202110640717A CN 113392663 A CN113392663 A CN 113392663A
Authority
CN
China
Prior art keywords
vector
information
detected
reader
label
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Granted
Application number
CN202110640717.2A
Other languages
Chinese (zh)
Other versions
CN113392663B (en
Inventor
高振国
王海军
陈丹杰
彭振文
陈文强
王靖
骆炎民
洪欣
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Huaqiao University
Original Assignee
Huaqiao University
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by Huaqiao University filed Critical Huaqiao University
Priority to CN202110640717.2A priority Critical patent/CN113392663B/en
Publication of CN113392663A publication Critical patent/CN113392663A/en
Application granted granted Critical
Publication of CN113392663B publication Critical patent/CN113392663B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Images

Classifications

    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06K—GRAPHICAL DATA READING; PRESENTATION OF DATA; RECORD CARRIERS; HANDLING RECORD CARRIERS
    • G06K7/00—Methods or arrangements for sensing record carriers, e.g. for reading patterns
    • G06K7/10—Methods or arrangements for sensing record carriers, e.g. for reading patterns by electromagnetic radiation, e.g. optical sensing; by corpuscular radiation
    • G06K7/10009—Methods or arrangements for sensing record carriers, e.g. for reading patterns by electromagnetic radiation, e.g. optical sensing; by corpuscular radiation sensing by radiation using wavelengths larger than 0.1 mm, e.g. radio-waves or microwaves
    • G06K7/10297—Methods or arrangements for sensing record carriers, e.g. for reading patterns by electromagnetic radiation, e.g. optical sensing; by corpuscular radiation sensing by radiation using wavelengths larger than 0.1 mm, e.g. radio-waves or microwaves arrangements for handling protocols designed for non-contact record carriers such as RFIDs NFCs, e.g. ISO/IEC 14443 and 18092
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06K—GRAPHICAL DATA READING; PRESENTATION OF DATA; RECORD CARRIERS; HANDLING RECORD CARRIERS
    • G06K17/00—Methods or arrangements for effecting co-operative working between equipments covered by two or more of main groups G06K1/00 - G06K15/00, e.g. automatic card files incorporating conveying and reading operations
    • G06K17/0022—Methods or arrangements for effecting co-operative working between equipments covered by two or more of main groups G06K1/00 - G06K15/00, e.g. automatic card files incorporating conveying and reading operations arrangements or provisions for transferring data to distant stations, e.g. from a sensing device
    • G06K17/0029—Methods or arrangements for effecting co-operative working between equipments covered by two or more of main groups G06K1/00 - G06K15/00, e.g. automatic card files incorporating conveying and reading operations arrangements or provisions for transferring data to distant stations, e.g. from a sensing device the arrangement being specially adapted for wireless interrogation of grouped or bundled articles tagged with wireless record carriers
    • Y—GENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
    • Y02—TECHNOLOGIES OR APPLICATIONS FOR MITIGATION OR ADAPTATION AGAINST CLIMATE CHANGE
    • Y02D—CLIMATE CHANGE MITIGATION TECHNOLOGIES IN INFORMATION AND COMMUNICATION TECHNOLOGIES [ICT], I.E. INFORMATION AND COMMUNICATION TECHNOLOGIES AIMING AT THE REDUCTION OF THEIR OWN ENERGY USE
    • Y02D10/00—Energy efficient computing, e.g. low power processors, power management or thermal management

Landscapes

  • Engineering & Computer Science (AREA)
  • Physics & Mathematics (AREA)
  • Health & Medical Sciences (AREA)
  • Computer Networks & Wireless Communication (AREA)
  • Toxicology (AREA)
  • General Physics & Mathematics (AREA)
  • Theoretical Computer Science (AREA)
  • Computer Security & Cryptography (AREA)
  • General Engineering & Computer Science (AREA)
  • Electromagnetism (AREA)
  • General Health & Medical Sciences (AREA)
  • Artificial Intelligence (AREA)
  • Computer Vision & Pattern Recognition (AREA)
  • Near-Field Transmission Systems (AREA)

Abstract

The invention relates to the technical field of RFID (radio frequency identification devices), and discloses an accurate and stable batch authentication protocol for a large-scale RFID system, which comprises the following steps: the RFID reader initiates an authentication command, and after all tags to be detected receive the command, a simple bloom filter vector BF is constructed in a distributed manner by using the information attached to the commandtThe vector stores the information of the set to be detected, and the reader constructs a similar vector BF according to the information of the registered labelsBy mixing BFtAnd BFsComparing and rejecting BFtThe information of the registered label contained in the detection result is vector BF, and whether the fake label exists in the label set to be detected and the number of the fake labels can be accurately obtained through BF. The estimation result obtained by the invention is more accurate, and the performance is stable in multiple authentication processes.

Description

Accurate and stable batch authentication protocol for large-scale RFID system
Technical Field
The invention relates to the field of RFID wireless communication, in particular to an accurate and stable batch authentication protocol for a large-scale RFID system.
Background
Radio Frequency Identification (RFID) technology is a technology for performing non-contact data communication between a reader and a tag to achieve target identification. The application of the RFID is very wide, and the RFID is commonly used for access control management, logistics monitoring and identity recognition. Before the batch authentication protocol appears, the authentication function of the RFID usually compares the tags to be detected one by one, and this authentication method has very low efficiency until the batch authentication protocol appears.
To achieve better performance, many scholars are working on the field of RFID batch authentication protocols. To date, RFID batch authentication protocols can be divided into two categories: one is to detect only the presence of counterfeit tags without making a counterfeit estimate, and the other is to detect not only the presence but also the number of counterfeit tags. The existing RFID batch authentication protocol is complex to operate and low in success rate when detecting the number of fake tags in a tag set.
Disclosure of Invention
The invention aims to provide an accurate and stable batch authentication protocol for a large-scale RFID system, and solves the problems brought forward by the background.
In order to achieve the purpose, the invention provides the following technical scheme:
an accurate and stable large-scale RFID system batch authentication protocol comprises the following steps:
a. when the RFID reader sends an identity authentication command, three main information are attached: the length w of a BF vector, the number k of hash functions and k random number seeds R;
b. when the tag set T to be detected receives an identity authentication command and the attached information, generating k hash functions according to the received k random number seeds R, generating a simple bloom filter vector according to w, randomly selecting k bit slots by using the k hash functions for each tag to be detected, responding 1 to each selected bit slot in the vector, and then sending the generated vector to a reader;
c. the reader generates a bloom filter vector BF with the length of wtAnd detecting each bit in the vector sent by the label to be detected, and if the ith bit value is detected to be 1, BF is detectedtIs 1;
d. the reader generates a corresponding bloom filter vector BF according to the information of the known label set Ss；
e. Reader will BFsAnd BFtPerforming an AND operation to obtain the common information of the set S and the set T, and combining the result with BFtPerforming XOR operation and deleting BFtStoring the final result as a vector BF according to the residual information of the real label;
f. the reader can estimate whether the set T of the tags to be detected has fake tags and the number of the fake tags according to the information of the vector BF.
Preferably, in the step a, the vector length w of the BF and the number k of the hash functions are described, the value of the vector length w is closely related to the authentication performance, the larger the length w of the bloom filter vector BF is theoretically, the higher the accuracy of the counterfeit estimation is, because the larger w is, the lower the collision probability of the hash function is, but the larger w is, the longer the energy consumption of the authentication time is increased, the smallest w meeting the performance requirement is selected through formula reasoning, similarly, the too small k causes relatively large fluctuation of the counterfeit estimation result, when the too large k is, it takes time for the set T to acquire k random numbers, and the value of k is selected to be 3 under the balance.
Preferably, in the step b, the generated k hash functions are subject to uniform distribution.
Preferably, the information of the real tag set S in step d is stored in a database, and the reader can generate a vector BF according to the information and the parameters w, k, RsThis vector stores information of the set of real tags S.
Preferably, in step e, the vector BF obtained by the readertThe method comprises the information of a label set T to be detected, wherein the T comprises the information of real labels and fake labels, and in order to estimate the number of the fake labels more accurately, in the operation step, a vector BF is usedtAnd removing the information related to the real label to obtain a vector BF.
Preferably, in step f, the number of counterfeit labels in the set T to be tested is estimated according to the information of the vector BF.
The invention has the beneficial effects that: the invention provides an accurate and stable batch authentication protocol for a large-scale RFID system, which can accurately estimate the number of fake tags in a set of tags to be detected at one time, and for a given real tag set S with known information, the set T of tags to be detected makes: (1) judging whether a fake label exists in the label set T to be detected; (2) estimating the number of counterfeit labels in the label set T to be detected; (3) the present invention estimates the number of counterfeit labels
Figure BDA0003107515790000031
The relation between the actual number c of fake labels and the relative error epsilon and the error probability delta satisfies
Figure BDA0003107515790000032
The method is suitable for identity authentication of a large-scale RFID system, the estimation result obtained by the method is more accurate in the batch authentication process, and the performance is stable in the multiple authentication processes.
Drawings
FIG. 1 is a schematic flow chart of the present invention.
Fig. 2 is a system configuration diagram of the present invention.
Detailed Description
The technical solutions in the embodiments of the present invention will be clearly and completely described below with reference to the drawings in the embodiments of the present invention, and it is obvious that the described embodiments are only a part of the embodiments of the present invention, and not all of the embodiments.
Referring to fig. 1-2, the RFID reader needs to determine whether there are counterfeit tags in the set to be detected and the number of counterfeit tags, and the reader sends an identity authentication command to the set T of tags to be detected, where the command is accompanied by three parameter information: the parameter settings of the length w of the BF vector (bloom filter vector), the number k of hash functions, and k random number seeds R, w, and k will be described in detail below, where R is randomly generated by the reader.
After the tag set T to be detected receives the identity authentication command and three parameter information attached to the identity authentication command, each tag constructs a bloom filter vector with the length of w, k hash functions are constructed according to k random number seeds R, k bit slots are selected according to own ID information and the k hash functions, the k bit slots are marked as 1, and the 1 represents own identity information. This vector is then sent to the reader.
After the reader receives the vector sent by the tag set T to be detected, the bit slot of the vector is detected, the position marked as 1 is recorded and combined into a bloom filter vector BF with the length of wtThis vector BFtThe information (including the real label information and the fake label information) of the label set T to be detected is stored in the tag.
The reader similarly constructs a bloom filter vector BF with the length of w according to the known information of the real label set S and the parameters w, k and RsThis vector BFsIn which information of the real tag set S is stored.
Reader will BFsAnd BFtA simple bit and operation is carried out to obtain the common information in the tag set T to be detected and the real tag set S, and the result of the bit and operation and BF are carried outtAnd carrying out exclusive OR, and removing the real label information in the label set T to be detected to obtain a final vector BF.
The meaning of any ith bit being 1 in the vector BF is: vector BFsIs 0 in the ith bit of (1) and is in the vector BFtIs 1 in (1). Therefore, the probability that an arbitrary ith bit is 1 in the vector BF is:
Figure BDA0003107515790000051
wherein n is the number of tags in the real tag set S, and c is the number of counterfeit tags in the set T to be detected. The probability that a random variable Z takes 1 is equal to the probability, and obviously the random variable Z conforms to the Bernoulli distribution, then the random variable Z is observed for w times, and the average value is
Figure BDA0003107515790000052
Wherein ZiRepresents the ith observation for variable Z. Then according to law of large numbers when w is sufficiently large, there are
Figure BDA0003107515790000053
Solving this equation for c yields
Figure BDA0003107515790000054
Wherein
Figure BDA0003107515790000055
This equation means that the present invention can estimate the number of counterfeit tags in the set of tags T to be detected from the information of the BF vector.
From equation
Figure BDA0003107515790000056
It can be obtained that the parameters k and w set by the reader both affect the accuracy of the final estimation of the present invention. First, discussing the value of k, the function of k is to fix various uncertain distributions of the tag information within a range, and the value of k cannot be too large or too small. If the value of k is too large, the efficiency of the whole authentication process is low, and if the value of k is too small, the randomness of the hash function cannot be ensured, and the robustness of the whole system is reduced. In the experimental process, a large number of k values are selected for simulation, and the constant value 3 of k is selected under comprehensive consideration. The value of w follows, according to the equation
Figure BDA0003107515790000061
Figure BDA0003107515790000062
And the accuracy requirement
Figure BDA0003107515790000063
(where ε is the relative error and δ is the error probability) can be found as follows:
Figure BDA0003107515790000064
wherein
Figure BDA0003107515790000065
Figure BDA0003107515790000066
Figure BDA0003107515790000067
Is defined as follows
Figure BDA0003107515790000068
Wherein
Figure BDA0003107515790000069
And
Figure BDA00031075157900000610
by the central limit theorem, Y is known to be a progressive normal distribution, and then given the error probability δ, there are:
Figure BDA00031075157900000611
where erf is a gaussian error function, so long as the following two conditions are guaranteed:
Figure BDA00031075157900000612
Figure BDA00031075157900000613
can ensure the precision to meet the requirement
Figure BDA00031075157900000614
Wherein in condition 1
Figure BDA00031075157900000615
In Condition 2
Figure BDA00031075157900000616
Figure BDA00031075157900000617
Through simulation to obtain
Figure BDA00031075157900000618
And
Figure BDA00031075157900000619
and w, found to be
Figure BDA00031075157900000620
And
Figure BDA00031075157900000621
the probability of the present invention meeting the above requirement is 99.73%.
In the process of batch authentication, a complex data structure is not used, and bloom filter vectors which are very quick to search and insert are adopted, so that the process is quick, a lot of storage space is not needed, the method is extremely suitable for batch authentication of large-scale RFID systems, the authentication result is accurate, and the performance is stable in multiple authentication processes.
The above description is only for the preferred embodiment of the present invention, but the scope of the present invention is not limited thereto, and any person skilled in the art should be considered to be within the technical scope of the present invention, and the technical solutions and the inventive concepts thereof according to the present invention should be equivalent or changed within the scope of the present invention.

Claims (6)

1. An accurate and stable large-scale RFID system batch authentication protocol is characterized by comprising the following steps:
a. when the RFID reader sends an identity authentication command, three main information are attached: the length w of a BF vector, the number k of hash functions and k random number seeds R;
b. when the tag set T to be detected receives an identity authentication command and the attached information, generating k hash functions according to the received k random number seeds R, generating a simple bloom filter vector according to w, randomly selecting k bit slots by using the k hash functions for each tag to be detected, responding 1 to each selected bit slot in the vector, and then sending the generated vector to a reader;
c. the reader generates a bloom filter vector BF with the length of wtAnd detecting each bit in the vector sent by the label to be detected, and if the ith bit value is detected to be 1, BF is detectedtIs 1;
d. the reader generates a corresponding bloom filter vector BF according to the information of the known label set Ss；
e. Reader will BFsAnd BFtPerforming an AND operation to obtain the common information of the set S and the set T, and combining the result with BFtPerforming XOR operation and deleting BFtStoring the final result as a vector BF according to the residual information of the real label;
f. the reader can estimate whether the set T of the tags to be detected has fake tags and the number of the fake tags according to the information of the vector BF.
2. The accurate and stable large-scale RFID system batch authentication protocol according to claim 1, wherein: in the step a, the values of the vector length w of the described BF and the number k of hash functions are related to the authentication performance, the larger the length w of the bloom filter vector BF is, the higher the accuracy rate of impersonation estimation is, but the larger the length w is, the longer the authentication time can be, the energy consumption is increased, and the minimum w meeting the performance requirement is selected through formula reasoning; similarly, too small k may cause relatively large fluctuation in the result of fake estimation, and it is time-consuming for the set T to acquire k random numbers when k is too large, and in conclusion, the value of k is selected to be 3.
3. The accurate and stable large-scale RFID system batch authentication protocol according to claim 1, wherein: in the step b, the generated k hash functions are subjected to uniform distribution.
4. The accurate and stable large-scale RFID system batch authentication protocol according to claim 1, wherein: d, storing the information of the real label set S in a database, and generating a vector BF by the reader according to the information and the parameters w, k and RsThis vector stores information of the set of real tags S.
5. The accurate and stable large-scale RFID system batch authentication protocol according to claim 1, wherein: e, in the step, obtaining the vector BF by the readertThe method comprises the information of a label set T to be detected, wherein the T comprises the information of real labels and fake labels, and in order to estimate the number of the fake labels more accurately, in the operation process, a vector BF (degree of freedom) is firstly carried outtThe information about the real label in the label library is removed first to obtain the information about the fake label.
6. The accurate and stable large-scale RFID system batch authentication protocol according to claim 1, wherein: and f, calculating the number of fake labels in the set T to be checked according to the information of the vector BF.
CN202110640717.2A 2021-06-09 2021-06-09 Batch authentication method suitable for large-scale RFID system Active CN113392663B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN202110640717.2A CN113392663B (en) 2021-06-09 2021-06-09 Batch authentication method suitable for large-scale RFID system

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN202110640717.2A CN113392663B (en) 2021-06-09 2021-06-09 Batch authentication method suitable for large-scale RFID system

Publications (2)

Publication Number Publication Date
CN113392663A true CN113392663A (en) 2021-09-14
CN113392663B CN113392663B (en) 2022-05-20

Family

ID=77618712

Family Applications (1)

Application Number Title Priority Date Filing Date
CN202110640717.2A Active CN113392663B (en) 2021-06-09 2021-06-09 Batch authentication method suitable for large-scale RFID system

Country Status (1)

Country Link
CN (1) CN113392663B (en)

Citations (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN103795543A (en) * 2014-02-12 2014-05-14 中国石油大学(华东) Bidirectional security authentication method for RFIP system
CN106785399A (en) * 2016-12-27 2017-05-31 华侨大学 A kind of slim high-gain UHF RFID anti-metal tag antennas
CN110121159A (en) * 2019-03-29 2019-08-13 西安电子科技大学 Lightweight RFID safety authentication, car networking communication system under car networking scene
CN110677487A (en) * 2019-09-30 2020-01-10 陕西师范大学 Outsourcing data duplicate removal cloud storage method supporting privacy and integrity protection
US20200074124A1 (en) * 2018-08-28 2020-03-05 Safetraces, Inc. Product tracking and rating system using dna tags

Patent Citations (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN103795543A (en) * 2014-02-12 2014-05-14 中国石油大学(华东) Bidirectional security authentication method for RFIP system
CN106785399A (en) * 2016-12-27 2017-05-31 华侨大学 A kind of slim high-gain UHF RFID anti-metal tag antennas
US20200074124A1 (en) * 2018-08-28 2020-03-05 Safetraces, Inc. Product tracking and rating system using dna tags
CN110121159A (en) * 2019-03-29 2019-08-13 西安电子科技大学 Lightweight RFID safety authentication, car networking communication system under car networking scene
CN110677487A (en) * 2019-09-30 2020-01-10 陕西师范大学 Outsourcing data duplicate removal cloud storage method supporting privacy and integrity protection

Non-Patent Citations (1)

* Cited by examiner, † Cited by third party
Title
王海军: "《RFID原理及应用课程教学改革与实践》", 《福建电脑》 *

Also Published As

Publication number Publication date
CN113392663B (en) 2022-05-20

Similar Documents

Publication Publication Date Title
Su et al. Fast splitting-based tag identification algorithm for anti-collision in UHF RFID system
Shahzad et al. Fast and accurate estimation of RFID tags
Zhu et al. Optimal framed aloha based anti-collision algorithms for RFID systems
Myung et al. An adaptive memoryless protocol for RFID tag collision arbitration
Shahzad et al. Every bit counts: Fast and scalable RFID estimation
Park et al. Identification of RFID tags in framed-slotted ALOHA with robust estimation and binary selection
US8299900B2 (en) Anonymous tracking using a set of wireless devices
Ai et al. Nowhere to hide: Efficiently identifying probabilistic cloning attacks in large-scale RFID systems
CN103955657B (en) A kind of frame slot ultrahigh frequency RFID system anti-collision method based on blind separation
CN109446869B (en) Anti-collision method and device for RFID system, computer readable storage medium and equipment
CN111444734B (en) RFID tag number estimation method and system
CN101517972B (en) Estimation of the cardinality of a set of wireless devices
Arjona et al. Scalable RFID tag estimator with enhanced accuracy and low estimation time
Liu et al. A novel tag searching protocol with time efficiency and searching accuracy in RFID systems
CN113392663B (en) Batch authentication method suitable for large-scale RFID system
CN109800832A (en) A kind of exception information collection method based on large-scale radio-frequency identification system
CN101551845B (en) Identification and response method for electronic label, device and system
US10067218B2 (en) Systems and methods for estimating a tag's location
CN104063627B (en) A kind of optimal Q determination method for parameter and device
Shahzad et al. Fast and accurate tracking of population dynamics in RFID systems
Xie et al. A tag-correlation-based approach to fast identification of group tags
Kalache et al. Performances comparison of RFID anti-collision algorithms
Quan et al. Performance analysis of tag anti-collision algorithms for RFID systems
Pupunwiwat et al. Unified Q-ary tree for RFID tag anti-collision resolution
EP3206158A1 (en) Rfid reader and method for recognizing rfid tags

Legal Events

Date Code Title Description
PB01 Publication
PB01 Publication
SE01 Entry into force of request for substantive examination
SE01 Entry into force of request for substantive examination
GR01 Patent grant
GR01 Patent grant