Pairing-Based Cryptography at High Security Levels
- 1 January 2005
- book chapter
- Published by Springer Nature in Lecture Notes in Computer Science
- Vol. 2005, 13-36
- https://doi.org/10.1007/11586821_2
Abstract
No abstract availableKeywords
This publication has 37 references indexed in Scilit:
- Pairing-Friendly Elliptic Curves of Prime OrderLecture Notes in Computer Science, 2006
- Elliptic Curves Suitable for Pairing Based CryptographyDesigns, Codes and Cryptography, 2005
- Collusion Resistant Broadcast Encryption with Short Ciphertexts and Private KeysLecture Notes in Computer Science, 2005
- Hierarchical Identity Based Encryption with Constant Size CiphertextLecture Notes in Computer Science, 2005
- Short Group SignaturesLecture Notes in Computer Science, 2004
- Short Signatures from the Weil PairingLecture Notes in Computer Science, 2001
- Identity-Based Encryption from the Weil PairingLecture Notes in Computer Science, 2001
- Function Field Sieve Method for Discrete Logarithms over Finite FieldsInformation and Computation, 1999
- The Improbability That an Elliptic Curve Has Subexponential Discrete Log Problem under the Menezes—Okamoto—Vanstone AlgorithmJournal of Cryptology, 1998
- Breaking RSA may not be equivalent to factoringLecture Notes in Computer Science, 1998