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

Chatterjee, Sanjit and Menezes, Alfred and Rodriguez-Henriquez, Francisco (2017) On Instantiating Pairing-Based Protocols with Elliptic Curves of Embedding Degree One. In: IEEE TRANSACTIONS ON COMPUTERS, 66 (6). pp. 1061-1070.

PDF Iee_Tra_Com_66-6_1061_2017.pdf - Published Version Restricted to Registered users only Download (206kB) | Request a copy

Abstract

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.

Item Type:	Journal Article
Publication:	IEEE TRANSACTIONS ON COMPUTERS
Additional Information:	Copy right for this article belongs to the IEEE COMPUTER SOC, 10662 LOS VAQUEROS CIRCLE, PO BOX 3014, LOS ALAMITOS, CA 90720-1314 USA
Department/Centre:	Division of Electrical Sciences > Computer Science & Automation
Date Deposited:	10 Jun 2017 04:38
Last Modified:	10 Jun 2017 04:38
URI:	http://eprints.iisc.ac.in/id/eprint/57148

Actions (login required)

View Item