Efficient Identity Based Signature Schemes Based on Pairings
- 17 February 2003
- book chapter
- conference paper
- Published by Springer Science and Business Media LLC in Lecture Notes in Computer Science
- p. 310-324
- https://doi.org/10.1007/3-540-36492-7_20
Abstract
No abstract availableKeywords
This publication has 14 references indexed in Scilit:
- Handbook of Applied CryptographyPublished by Informa UK Limited ,2018
- An Identity Based Encryption Scheme Based on Quadratic ResiduesLecture Notes in Computer Science, 2001
- Short Signatures from the Weil PairingLecture Notes in Computer Science, 2001
- Supersingular Curves in CryptographyLecture Notes in Computer Science, 2001
- Identity-Based Encryption from the Weil PairingLecture Notes in Computer Science, 2001
- A One Round Protocol for Tripartite Diffie–HellmanLecture Notes in Computer Science, 2000
- Efficient generation of shared RSA keysLecture Notes in Computer Science, 1997
- Split knowledge generation of RSA parametersPublished by Springer Science and Business Media LLC ,1997
- Message Recovery for Signature Schemes Based on the Discrete Logarithm ProblemDesigns, Codes and Cryptography, 1996
- Reducing elliptic curve logarithms to logarithms in a finite fieldIEEE Transactions on Information Theory, 1993