On Instantiating Pairing-Based Protocols with Elliptic Curves of Embedding Degree One

Since the discovery of identity-based encryption schemes in 2000, bilinear pairings have been used in the design of hundreds of cryptographic protocols. The most commonly used pairings are constructed from elliptic curves over finite fields with small embedding degree. These pairings can have differ...

Full description

Saved in:
Bibliographic Details
Published in:IEEE transactions on computers 2017-06, Vol.66 (6), p.1061-1070
Main Authors: Chatterjee, Sanjit, Menezes, Alfred, Rodrıguez-Henrıquez, Francisco
Format: Article
Language:English
Subjects:
Bilinear pairings
BLS signature scheme
Cryptographic protocols
Cryptography
Curves
Elliptic curves
Elliptic curves with embedding degree one
Embedding
Encryption
Fields (mathematics)
Identity-based encryption
Noise measurement
Security
Tate pairing
Weil pairing
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:Since the discovery of identity-based encryption schemes in 2000, bilinear pairings have been used in the design of hundreds of cryptographic protocols. The most commonly used pairings are constructed from elliptic curves over finite fields with small embedding degree. These pairings can have different security, performance, and functionality characteristics, and were therefore classified into Types 1, 2, 3 and 4. In this paper, we observe that this conventional classification is not applicable to pairings from elliptic curves with embedding degree one. It is important to understand the security, efficiency, and functionality of these pairings in light of recent attacks on certain pairings constructed from elliptic curves with embedding degree greater than one. We define three kinds of pairings from elliptic curves with embedding degree one, discuss some subtleties with using them to implement pairing-based protocols, and provide an estimated cost of implementing them on modern processors.
ISSN:0018-9340
1557-9956
DOI:10.1109/TC.2016.2633340