Identity-based cryptosystems and signature schemes
Proceedings of CRYPTO 84 on Advances in cryptology
An optimal class of symmetric key generation systems
Proc. of the EUROCRYPT 84 workshop on Advances in cryptology: theory and application of cryptographic techniques
Reducing elliptic curve logarithms to logarithms in a finite field
STOC '91 Proceedings of the twenty-third annual ACM symposium on Theory of computing
Efficient Identity Based Signature Schemes Based on Pairings
SAC '02 Revised Papers from the 9th Annual International Workshop on Selected Areas in Cryptography
Identity-Based Encryption from the Weil Pairing
CRYPTO '01 Proceedings of the 21st Annual International Cryptology Conference on Advances in Cryptology
Efficient Algorithms for Pairing-Based Cryptosystems
CRYPTO '02 Proceedings of the 22nd Annual International Cryptology Conference on Advances in Cryptology
Key Distribution Systems Based on Identification Information
CRYPTO '87 A Conference on the Theory and Applications of Cryptographic Techniques on Advances in Cryptology
Short Signatures from the Weil Pairing
ASIACRYPT '01 Proceedings of the 7th International Conference on the Theory and Application of Cryptology and Information Security: Advances in Cryptology
Hierarchical ID-Based Cryptography
ASIACRYPT '02 Proceedings of the 8th International Conference on the Theory and Application of Cryptology and Information Security: Advances in Cryptology
A One Round Protocol for Tripartite Diffie-Hellman
ANTS-IV Proceedings of the 4th International Symposium on Algorithmic Number Theory
PET'07 Proceedings of the 7th international conference on Privacy enhancing technologies
Pairing-Based Onion Routing with Improved Forward Secrecy
ACM Transactions on Information and System Security (TISSEC)
A round-optimal three-party ID-based authenticated key agreement protocol
Information Sciences: an International Journal
| Hi-index | 0.00 |
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.