Batch Verifications with ID-Based Signatures
- 1 January 2005
- book chapter
- conference paper
- Published by Springer Science and Business Media LLC in Lecture Notes in Computer Science
- p. 233-248
- https://doi.org/10.1007/11496618_18
Abstract
No abstract availableKeywords
This publication has 20 references indexed in Scilit:
- Efficient ID-Based Blind Signature and Proxy Signature from Bilinear PairingsLecture Notes in Computer Science, 2003
- Aggregate and Verifiably Encrypted Signatures from Bilinear MapsLecture Notes in Computer Science, 2003
- Multipurpose Identity-Based SigncryptionLecture Notes in Computer Science, 2003
- Threshold Signatures, Multisignatures and Blind Signatures Based on the Gap-Diffie-Hellman-Group Signature SchemeLecture Notes in Computer Science, 2002
- An Identity-Based Signature from Gap Diffie-Hellman GroupsLecture Notes in Computer Science, 2002
- Efficient Algorithms for Pairing-Based CryptosystemsLecture Notes in Computer Science, 2002
- Short Signatures from the Weil PairingLecture Notes in Computer Science, 2001
- Attacking and Repairing Batch Verification SchemesLecture Notes in Computer Science, 2000
- Fast batch verification for modular exponentiation and digital signaturesPublished by Springer Science and Business Media LLC ,1998
- Zero-knowledge proofs of identityJournal of Cryptology, 1988