Privacy-Preserving ECC-Based Grouping Proofs for RFID

Batina, Lejla; Lee, Yong Ki; Seys, Stefaan; Singelée, Dave; Verbauwhede, Ingrid

doi:10.1007/978-3-642-18178-8_14

Cited by 19 publications

(55 citation statements)

References 6 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…More precisely, the ECC-based grouping proofs as in [2] require two or three point multiplications and, even in the latter case, running time to complete the proof should stay below 300 ms. In addition our selective disclosure protocol achieves similar performance as hierarchical proofs [1] in which the performance depends on the number of levels in the hierarchy. Similar remarks are valid for the memory requirements of a single tag.…”

Section: Feasibility Of Our Proposalmentioning

confidence: 83%

“…Furthermore, showing an ABC does not require more exponentiations on the tag's side than some other protocols demonstrated to be computationally feasible on RFID chips [1,3]. We demonstrate how RFID systems can benefit from the concepts of ABCs in such a way that a tag proves all or a subset of its secret attributes to designated verifier readers.…”

Section: Introductionmentioning

confidence: 89%

“…Considering the example of hierarchical proofs, our solution could be deployed meeting exactly the same requirements as envisioned by the tree structure of the hierarchical proofs [1]. To obtain the same functionality, one could sort the attributes according to their order of importance.…”

Section: Envisioned Rfid Applicationsmentioning

confidence: 99%

“…Numerous protocols were designed aiming at security and privacy of RFID systems based (exclusively) on the Elliptic Curve (EC) point multiplication [6,15]. Starting from an authentication of a single tag, a number of more complex protocols emerged such as grouping proofs [13] and hierarchical proofs [1]. It has become obvious that this trend will continue as lightweight cryptography is turning into the main component of modern communication networks and new applications are ever emerging.…”

Section: Introductionmentioning

confidence: 99%

See 3 more Smart Citations

Designated Attribute-Based Proofs for RFID Applications

Alpár

Batina

Lueks

2013

Radio Frequency Identification. Security and Privacy Issues

Self Cite

View full text Add to dashboard Cite

Abstract. Recent research has shown that using public-key cryptography in order to meet privacy requirements for RFID tags is not only necessary, but also now practically feasible. This has led to the development of new protocols like the Randomized Schnorr [6] identification protocol. This protocol ensures that the identity of a tag only becomes known to authorised readers. In this paper we generalize this protocol by introducing an attribute-based identification scheme. The proposed scheme preserves the designation of verification (i.e., only an authorised reader is able to learn the identity of a tag) while it allows tags to prove any subset of their attributes to authorised readers. The proposed scheme is proven to be secure and narrow-strong private.

show abstract

Section: Feasibility Of Our Proposalmentioning

confidence: 83%

Section: Introductionmentioning

confidence: 89%

Section: Envisioned Rfid Applicationsmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

Designated Attribute-Based Proofs for RFID Applications

Alpár

Batina

Lueks

2013

Radio Frequency Identification. Security and Privacy Issues

Self Cite

View full text Add to dashboard Cite

show abstract

“…Recently, Batina et al have proposed a new privacy-preserving elliptic curve based grouping-proof protocol with colluding tag prevention (denoted by CTP protocol) [13]. The protocol is claimed to be resistant against all active attacks applied on the previous grouping proof protocols and also fulfil the privacy against a narrow-strong adversary.…”

Section: Introductionmentioning

confidence: 99%

Colluding Tags Attack on the Ecc-Based Grouping Proofs for Rfids

Abyaneh

2011

Proceedings of the International Conference on Security and Cryptography

View full text Add to dashboard Cite

Abstract.Recently, a new privacy-preserving elliptic curve based grouping proof protocol with colluding tag prevention(CTP) has been proposed. The CTP protocol is claimed to be resistant against colluding tags attacks in which the involved tags can exchange some messages via another reader before the protocol starts without revealing their private keys. In this paper, we show that the CTP protocol is vulnerable to some colluding tag attacking scenario. In addition, we propose a new elliptic curve based grouping protocol which can fix the problem. Our proposal is based on a formally proved privacy preserving authentication protocol and has the advantage of being resistant against colluding tags attacks with the same amount of computation.

show abstract

Extending ECC-based RFID authentication protocols to privacy-preserving multi-party grouping proofs

Batina

Lee

Seys

et al. 2011

Pers Ubiquit Comput

Self Cite

View full text Add to dashboard Cite

Since the introduction of the concept of grouping proofs by Juels, which permit RFID tags to generate evidence that they have been scanned simultaneously, various new schemes have been proposed. Their common property is the use of symmetric-key primitives. However, it has been shown that such schemes often entail scalability, security and/or privacy problems. In this article, we extend the notion of public-key RFID authentication protocols and propose a privacy-preserving multi-party grouping-proof protocol which relies exclusively on the use of elliptic curve cryptography (ECC). It allows to generate a proof which is verifiable by a trusted verifier in an offline setting, even when readers or tags are potentially untrusted, and it is privacy-preserving in the setting of a narrowstrong attacker. We also demonstrate that our RFID grouping-proof protocol can easily be extended to use cases with more than two tags, without any additional cost for an RFID tag. To illustrate the implementation feasibility of our proposed solutions, we present a novel ECC hardware architecture designed for RFID.

show abstract

Privacy-Preserving ECC-Based Grouping Proofs for RFID

Cited by 19 publications

References 6 publications

Designated Attribute-Based Proofs for RFID Applications

Designated Attribute-Based Proofs for RFID Applications

Colluding Tags Attack on the Ecc-Based Grouping Proofs for Rfids

Extending ECC-based RFID authentication protocols to privacy-preserving multi-party grouping proofs

Contact Info

Product

Resources

About