Efficient and Provably-Secure Identity-Based Signatures and Signcryption from Bilinear Maps
Top Cited Papers
- 1 January 2005
- book chapter
- conference paper
- Published by Springer Science and Business Media LLC in Lecture Notes in Computer Science
- p. 515-532
- https://doi.org/10.1007/11593447_28
Abstract
No abstract availableKeywords
This publication has 26 references indexed in Scilit:
- On the Selection of Pairing-Friendly GroupsLecture Notes in Computer Science, 2004
- Secure Identity Based Encryption Without Random OraclesLecture Notes in Computer Science, 2004
- Efficient Selective-ID Secure Identity-Based Encryption Without Random OraclesLecture Notes in Computer Science, 2004
- Short Signatures Without Random OraclesLecture Notes in Computer Science, 2004
- Security Proofs for Identity-Based Identification and Signature SchemesLecture Notes in Computer Science, 2004
- Multipurpose Identity-Based SigncryptionLecture Notes in Computer Science, 2003
- An Identity-Based Signature from Gap Diffie-Hellman GroupsLecture Notes in Computer Science, 2002
- On the Security of Joint Signature and EncryptionLecture Notes in Computer Science, 2002
- Identity-Based Encryption from the Weil PairingLecture Notes in Computer Science, 2001
- Random oracles are practicalPublished by Association for Computing Machinery (ACM) ,1993