International Association for Cryptologic Research

International Association
for Cryptologic Research

CryptoDB

Paper: Efficient Delegation of Pairing Computation

Authors:
Bo Gyeong Kang
Moon Sung Lee
Je Hong Park
Download:
URL: http://eprint.iacr.org/2005/259
Search ePrint
Search Google
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.
BibTeX
@misc{eprint-2005-12593,
  title={Efficient Delegation of Pairing Computation},
  booktitle={IACR Eprint archive},
  keywords={cryptographic protocols / elliptic curve cryptosystem},
  url={http://eprint.iacr.org/2005/259},
  note={ jhpark@etri.re.kr 13004 received 8 Aug 2005},
  author={Bo Gyeong Kang and Moon Sung Lee and Je Hong Park},
  year=2005
}