Paper 2005/259 Original: eprint.iacr.org/2005/259 ↗
Efficient Delegation of Pairing Computation
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- Category
- Cryptographic protocols
- Publication info
- Preprint.
- History
- 2005-08-11: last updated
- 2005-08-11: published
- Short URL
- https://ia.cr/2005/259
- License
- https://creativecommons.org/licenses/by/4.0/
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},
url = {https://eprint.iacr.org/2005/259}
}