Advertisement

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

  • Sébastien Canard
  • Nicolas Desmoulins
  • Julien Devigne
  • Jacques Traoré
Part of the Lecture Notes in Computer Science book series (LNCS, volume 7708)

Abstract

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 different 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 different possibilities and study the security and efficiency 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.

Keywords

Mobile Phone Group Signature Elliptic Curve Smart Card Scalar Multiplication 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Beuchat, J.-L., González-Díaz, J.E., Mitsunari, S., Okamoto, E., Rodríguez-Henríquez, F., Teruya, T.: High-Speed Software Implementation of the Optimal Ate Pairing over Barreto–Naehrig Curves. In: Joye, M., Miyaji, A., Otsuka, A. (eds.) Pairing 2010. LNCS, vol. 6487, pp. 21–39. Springer, Heidelberg (2010)CrossRefGoogle Scholar
  2. 2.
    Boneh, D., Boyen, X., Shacham, H.: Short Group Signatures. In: Franklin, M. (ed.) CRYPTO 2004. LNCS, vol. 3152, pp. 41–55. Springer, Heidelberg (2004)CrossRefGoogle Scholar
  3. 3.
    Boneh, D., Franklin, M.K.: Identity-Based Encryption from the Weil Pairing. SIAM J. Comput. 32(3), 586–615 (2003)MathSciNetzbMATHCrossRefGoogle Scholar
  4. 4.
    Canard, S., Coisel, I., De Meulenaer, G., Pereira, O.: Group Signatures are Suitable for Constrained Devices. In: Rhee, K.-H., Nyang, D. (eds.) ICISC 2010. LNCS, vol. 6829, pp. 133–150. Springer, Heidelberg (2011)CrossRefGoogle Scholar
  5. 5.
    Chaum, D., van Heyst, E.: Group Signatures. In: Davies, D.W. (ed.) EUROCRYPT 1991. LNCS, vol. 547, pp. 257–265. Springer, Heidelberg (1991)CrossRefGoogle Scholar
  6. 6.
    Cheng, Z., Nistazakis, M.: Implementing Pairing-Based Cryptosystems. In: Proceedings of IWWST 2005 (2005)Google Scholar
  7. 7.
    Fiat, A., Shamir, A.: How to Prove Yourself: Practical Solutions to Identification and Signature Problems. In: Odlyzko, A.M. (ed.) CRYPTO 1986. LNCS, vol. 263, pp. 186–194. Springer, Heidelberg (1987)CrossRefGoogle Scholar
  8. 8.
    Girault, M., Lefranc, D.: Server-Aided Verification: Theory and Practice. In: Roy, B. (ed.) ASIACRYPT 2005. LNCS, vol. 3788, pp. 605–623. Springer, Heidelberg (2005)CrossRefGoogle Scholar
  9. 9.
    Möller, B.: Algorithms for Multi-exponentiation. In: Vaudenay, S., Youssef, A.M. (eds.) SAC 2001. LNCS, vol. 2259, pp. 165–180. Springer, Heidelberg (2001)CrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2013

Authors and Affiliations

  • Sébastien Canard
    • 1
  • Nicolas Desmoulins
    • 1
  • Julien Devigne
    • 1
    • 2
  • Jacques Traoré
    • 1
  1. 1.Orange LabsApplied Crypto GroupCaenFrance
  2. 2.UCBN, GREYCCaenFrance

Personalised recommendations