Cryptology ePrint Archive: Report 2005/259

Efficient Delegation of Pairing Computation

Bo Gyeong Kang and Moon Sung Lee and Je Hong Park

Abstract: Pairing computation requires a lot of efforts for portable small devices such as smart cards. It was first considered concretely by Chevallier-Mames et al. that the cards delegate computation of pairings to a powerful device. In this paper, we propose more efficient protocols than those of Chevallier-Mames et al. in two cases, and provide two new variants that would be useful in real applications.

Category / Keywords: cryptographic protocols / elliptic curve cryptosystem

Date: received 8 Aug 2005

Contact author: jhpark at etri re kr

Available format(s): Postscript (PS) | Compressed Postscript (PS.GZ) | PDF | BibTeX Citation

Version: 20050811:071923 (All versions of this report)

Discussion forum: Show discussion | Start new discussion


[ Cryptology ePrint archive ]