Paper 2005/259

Efficient Delegation of Pairing Computation

Bo Gyeong Kang, 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.

Metadata
Available format(s)
PDF PS
Category
Cryptographic protocols
Publication info
Published elsewhere. Unknown where it was published
Keywords
elliptic curve cryptosystem
Contact author(s)
jhpark @ etri re kr
History
2005-08-11: received
Short URL
https://ia.cr/2005/259
License
Creative Commons Attribution
CC BY

BibTeX

@misc{cryptoeprint:2005/259,
      author = {Bo Gyeong Kang and Moon Sung Lee and Je Hong Park},
      title = {Efficient Delegation of Pairing Computation},
      howpublished = {Cryptology ePrint Archive, Paper 2005/259},
      year = {2005},
      note = {\url{https://eprint.iacr.org/2005/259}},
      url = {https://eprint.iacr.org/2005/259}
}
Note: In order to protect the privacy of readers, eprint.iacr.org does not use cookies or embedded third party content.