Designated Attribute-Based Proofs for RFID Applications

Alpár, Gergely; Batina, Lejla; Lueks, Wouter

doi:10.1007/978-3-642-36140-1_5

Cited by 5 publications

(2 citation statements)

References 16 publications

(26 reference statements)

Supporting

Mentioning

Contrasting

Order By: Relevance

“…They have been implemented on smart cards [19,32] resulting in a U-Prove authentication processed under 1 second, while that in Idemix is between 1 and 1.5 seconds. These technologies have also been placed into light-weight infrastructures in [5,6,23]. However, none of the previous research projects proposes to adopt ABC technologies within the IoT.…”

Section: Use Of Attributesmentioning

confidence: 99%

New directions in IoT privacy using attribute-based authentication

Alpár

Batina

Batten

et al. 2016

Proceedings of the ACM International Conference on Computing Frontiers

Self Cite

View full text Add to dashboard Cite

The Internet of Things (IoT) is a ubiquitous system that incorporates not only the current Internet of computers, but also smart objects and sensors. IoT technologies often rely on centralised architectures that follow the current business models. This makes e cient data collection and processing possible, which can be beneficial from a business perspective, but has many ramifications for users privacy. As communication within the IoT happens among many devices from various contexts, they need to authenticate each other to know that they talk to the intended party. Authentication, typically including identification, is the proof of identity information. However, transactions linked to the same identifier are traceable, and ultimately make people also traceable, hence their privacy is threatened. We propose a framework to counter this problem. We argue that applying attribute-based (AB) authentication in the context of IoT empowers users to maintain control over what data their devices disclose. At the same time AB authentication provides the possibility of data minimisation and unlinkability of user transactions. Therefore, this approach improves substantially user privacy in the IoT.

show abstract

Section: Use Of Attributesmentioning

confidence: 99%

New directions in IoT privacy using attribute-based authentication

Alpár

Batina

Batten

et al. 2016

Proceedings of the ACM International Conference on Computing Frontiers

Self Cite

View full text Add to dashboard Cite

show abstract

“…The relative computation cost of a pairing is approximately twenty times higher than that of the scalar multiplication. The model presented by Gergely et al [13] is very efficient in a sensor network but does not guarantee anonymity since the verifier has a database of identifiers. Fuentes et al [14] present a very interesting result in Vehicular ad hoc network but their scheme lacks generality.…”

Section: Introductionmentioning

confidence: 99%

I2PA: An Efficient ABC for IoT

2019

View full text Add to dashboard Cite

Internet of Things (IoT) is very attractive because of its promises. However, it brings many challenges, mainly issues about privacy preserving and lightweight cryptography. Many schemes have been designed so far but none of them simultaneously takes into account these aspects. In this paper, we propose an efficient ABC scheme for IoT devices. We use ECC without pairing, blind signing and zero knowledge proof. Our scheme supports block signing, selective disclosure and randomization. It provides data minimization and transactions' unlinkability. Our construction is efficient since smaller key size can be used and computing time can be reduced. As a result, it is a suitable solution for IoT devices characterized by three major constraints namely low energy power, small storage capacity and low computing power.

show abstract

High-Speed Dating Privacy-Preserving Attribute Matching for RFID

Batina¹,

Hermans

Hoepman³

et al. 2014

Radio Frequency Identification: Security and Privacy Issues

Self Cite

View full text Add to dashboard Cite

Abstract. This paper presents a new approach for RFID tag attribute matching problem. Unlike previous approaches, most notably the T-Match protocol, presented in [9], we do not need a central database server or any connectivity between readers. Furthermore, we do not need expensive homomorphic encryption or multiparty computation and we extend attribute matching to multiple attributes per tag; a feature that broadens the range of possible applications of the protocol. We achieve this increased flexibility and decreased complexity by moving some relatively cheap cryptographic computations to the tags. Specifically, one of the protocols presented in this paper only needs a (lightweight) hash function implemented on the tags. Two other protocols additionally need asymmetric encryption, which is feasible on more powerful tags that support elliptic-curve scalar multiplication.

show abstract

Designated Attribute-Based Proofs for RFID Applications

Cited by 5 publications

References 16 publications

New directions in IoT privacy using attribute-based authentication

New directions in IoT privacy using attribute-based authentication

I2PA: An Efficient ABC for IoT

High-Speed Dating Privacy-Preserving Attribute Matching for RFID

Contact Info

Product

Resources

About