Privacy and Security Issues in e-Ticketing: Optimisation of Smart Card-based Attribute-proving
Jaap-Henk Hoepman, Bart Jacobs, Pim Vullers · Radboud Repository (Radboud University) · 2010
Abstract This short note concentrates on an optimisation of the attribute-proving protocol by Batina et al. [1], and provides the improved performance figures. The protocol relies on elliptic curve cryptography with bilinear pairings. These pairings provide signatures that are stable under multiplication with a blinding factor. In this way multiple proofs are unlinkable, and thus provides a privacy-friendly solution. The optimisation involves better exploitation of the (limited) elliptic curve primitives that are available on the current generation of Java Card smart cards. It leads to a reduction of the on-card running times (wrt. to [1]) of roughly a factor three. Total running times with this new protocol are below one second. A further reduction with a factor two or three is needed to achieve performance that is acceptable in practice. Key words: anonymous credentials, elliptic curve cryptography, smart