Cryptosystems based on elliptic curve pairing

10Citations
Citations of this article
25Readers
Mendeley users who have this article in their library.
Get full text

Abstract

The purpose of this paper is to introduce pairing over elliptic curve and apply it to ID based key agreement schemes and privacy preserving key agreement schemes. The key words here are ID based scheme, pairing over elliptic curve and privacy reserving scheme. Elliptic curve is one of the popular research topics in cryptography because it has some useful features. One of them is a bilinear function such as Tate pairing. Bilinear function has excellent properties suitable to applications in cryptography. Some schemes are proposed using the bilinear function so far and ID based cryptosystems are the one of the most important applications. ID is any information like name, mail address, phone number, any public information can be used. Another recent problem is privacy. Careless use of ID may leak privacy of the person corresponding to the ID. In this paper we introduce pairing over elliptic curve and propose ID based key agreement schemes and privacy preserving key agreement scheme. © Springer-Verlag Berlin Heidelberg 2005.

Cite

CITATION STYLE

APA

Okamoto, E., & Okamoto, T. (2005). Cryptosystems based on elliptic curve pairing. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 3558 LNAI, pp. 13–23). Springer Verlag. https://doi.org/10.1007/11526018_3

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free