Privacy Protection for RFID with Hidden Subset Identifiers

Cichoń, Jacek; Klonowski, Marek; Kutyłowski, Mirosław

doi:10.1007/978-3-540-79576-6_18

Cited by 16 publications

(19 citation statements)

References 5 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The protocols CKK 1 , CKK 2 and CKK σ,L suggested by Cichoń, Klonowski and Kutyłowski in [4] are restricted types of…”

Section: The Ckk-protocolsmentioning

confidence: 99%

“…As a possible alternative to HB-type protocols, another class of lightweight authentication protocols (so called CKK-protocols) were introduced by Cichoń, Klonowski, and Kutyłowski [4]. These protocols can be generalized to linear (n, k, L)-protocols, in which the secret key (the identification information in the RFID tag) consists of the specification of L n-dimensional linear subspaces V 1 , .…”

Section: Introductionmentioning

confidence: 99%

“…, L}. In [4], the CKK 2 -protocol, a special linear (n, k, 2)-protocol, and the CKK σ,L -protocol, a special linear (n, k, L)-protocol, were suggested for practical application.…”

Section: Introductionmentioning

confidence: 99%

“…In Subsect. 2.2 we take a look at CKK-protocols [4], the first type of linear protocols occuring in the literature. We present a fast passive (polynomial time) attack against the CKK 2 -protocol which allows to recover the secret key for the proposed parameters (n, k) = (128, 30) in less than a second on a standard PC, while an earlier (exponential time) attack on CKK 2 published in [7] requires a couple of hours on comparable hardware.…”

Section: Introductionmentioning

confidence: 99%

“…4 we discuss some aspects of the practical use of (n, k, L) ++ -protocols. General (n, k, L)-protocols have a huge keylength of L · n · n + k. One idea could be to use CKK σ,L -protocols (see [4]), a special (n, 1, L)-protocol which is still unbroken. Other ideas for reducing the keylength in similar cases were discussed in the literature, e.g., using keys defined by Toeplitz matrices instead of random matrices [11], or defined by special Toeplitz matrices generated by Linear Feedback Shift Registers (LFSRs) [3].…”

Section: Introductionmentioning

confidence: 99%

See 4 more Smart Citations

More on the Security of Linear RFID Authentication Protocols

Krause¹,

Stegemann²

2009

Selected Areas in Cryptography

View full text Add to dashboard Cite

Abstract. The limited computational resources available in RFID tags implied an intensive search for lightweight authentication protocols in the last years. The most promising suggestions were those of the HBfamiliy (HB + , HB # , TrustedHB, ...) initially introduced by Juels and Weis, which are provably secure (via reduction to the Learning Parity with Noise (LPN) problem) against passive and some kinds of active attacks. Their main drawbacks are large amounts of communicated bits and the fact that all known HB-type protocols have been proven to be insecure with respect to certain types of active attacks. As a possible alternative, authentication protocols based on choosing random elements from L secret linear n-dimensional subspaces of GF(2) n+k (so called CKK-protocols) were introduced by Cichoń, Klonowski, and Kutyłowski. These protocols are special cases of (linear) (n, k, L)-protocols which we investigate in this paper. We present several active and passive attacks against (n, k, L)-protocols and propose (n, k, L) ++ -protocols which we can prove to be secure against certain types of active attacks. We obtain some evidence that the security of (n, k, L)-protocols can be reduced to the hardness of the learning unions of linear subspaces (LULS) problem. We then present a learning algorithm for LULS based on solving overdefined systems of degree L in Ln variables. Under the hardness assumption that LULS-problems cannot be solved significantly faster, linear (n, k, L)-protocols (with properly chosen n, k, L) could be interesting for practical applications.

show abstract

“…The protocols CKK 1 , CKK 2 and CKK σ,L suggested by Cichoń, Klonowski and Kutyłowski in [4] are restricted types of…”

Section: The Ckk-protocolsmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

“…, L}. In [4], the CKK 2 -protocol, a special linear (n, k, 2)-protocol, and the CKK σ,L -protocol, a special linear (n, k, L)-protocol, were suggested for practical application.…”

Section: Introductionmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

See 3 more Smart Citations

More on the Security of Linear RFID Authentication Protocols

Krause¹,

Stegemann²

2009

Selected Areas in Cryptography

View full text Add to dashboard Cite

show abstract

RFID Security: A Method for Tracking Prevention

Bernacki

Kołaczek

2016

Communications in Computer and Information Science

View full text Add to dashboard Cite

Abstract. RFID-tags are very small and low-cost electronic devices that can store some data. The most popular are passive tags that do not have own power source, which allows for far-reaching miniaturization. The primary use of RFID-tags is to replace barcodes. Their industrial importance is constantly growing because in contrast to barcodes, manual manipulation of the object code is not required. RFID-tags are also used for detection and identification of objects. This enables tracking of objects in technological processes. At the moment, the most widespread use of RFID tags is identification of sold goods. However, the possibility of tracking carries the risk that improper subject can track the tags and consequently track a person who is in possesion of tagged subject. Therefore in this paper a method for tracking prevention is considered.

show abstract