On the Implementation of a Pairing-based Cryptographic Protocol in a Constrained Device

In this paper, we consider a pairing-based cryptographic protocol and the way to implement it on a restricted device such as a mobile phone or a smart card. Our aim is to show the dierent ways to do it, regarding (i) the capacity for the restricted device to implement a bilinear pairing and/or (ii) the performance regarding the implemented bilinear pairing. We show that there are dierent possibilities and study the security and e‑ciency of each of them. To illustrate our purpose, we make use of the Boneh-Boyen-Shacham group signature, which needs one on-line pairing computation.