This short note concentrates on an optimization of the attribute proving protocol, 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 provide a privacy-friendly solution. The optimization 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) of roughly a factor three. Total running times with this new protocol are below one second.