Paper 2017/1173
Fully Verifiable Secure Delegation of Pairing Computation: Cryptanalysis and An Efficient Construction
Osmanbey Uzunkol, Öznur Kalkar, and İsa Sertkaya
Abstract
We address the problem of secure and verifiable delegation of general pairing computation. We first analyze some recently proposed pairing delegation schemes and present several attacks on their security and/or verifiability properties. In particular, we show that none of these achieve the claimed security and verifiability properties simultaneously. We then provide a fully verifiable secure delegation scheme
Metadata
- Available format(s)
-
PDF
- Publication info
- Preprint. MINOR revision.
- Keywords
- Verifiable and secure delegationbilinear mapscryptographic protocolscloud securitylightweight cryptography
- Contact author(s)
- osmanbey uzunkol @ gmail com
- History
- 2017-12-06: revised
- 2017-12-06: received
- See all versions
- Short URL
- https://ia.cr/2017/1173
- License
-
CC BY
BibTeX
@misc{cryptoeprint:2017/1173, author = {Osmanbey Uzunkol and Öznur Kalkar and İsa Sertkaya}, title = {Fully Verifiable Secure Delegation of Pairing Computation: Cryptanalysis and An Efficient Construction}, howpublished = {Cryptology {ePrint} Archive, Paper 2017/1173}, year = {2017}, url = {https://eprint.iacr.org/2017/1173} }