On the implementation of a pairing-based cryptographic protocol in a constrained device

Authors:
Sébastien Canard;Nicolas Desmoulins;Julien Devigne;Jacques Traoré
Affiliations:
Orange Labs, Applied Crypto Group, Caen, France;Orange Labs, Applied Crypto Group, Caen, France;Orange Labs, Applied Crypto Group, Caen, France,UCBN, GREYC, Caen, France;Orange Labs, Applied Crypto Group, Caen, France
Venue:
Pairing'12 Proceedings of the 5th international conference on Pairing-Based Cryptography
Year:
2012

Citing 7
Cited 0

How to prove yourself: practical solutions to identification and signature problems

Proceedings on Advances in cryptology---CRYPTO '86
Identity-Based Encryption from the Weil Pairing

SIAM Journal on Computing
Algorithms for Multi-exponentiation

SAC '01 Revised Papers from the 8th Annual International Workshop on Selected Areas in Cryptography
Group signatures

EUROCRYPT'91 Proceedings of the 10th annual international conference on Theory and application of cryptographic techniques
High-speed software implementation of the optimal ate pairing over Barreto-Naehrig curves

Pairing'10 Proceedings of the 4th international conference on Pairing-based cryptography
Group signatures are suitable for constrained devices

ICISC'10 Proceedings of the 13th international conference on Information security and cryptology
Server-Aided verification: theory and practice

ASIACRYPT'05 Proceedings of the 11th international conference on Theory and Application of Cryptology and Information Security

Quantified Score

Hi-index	0.00

Visualization

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.