Information and Computation
Efficient Identity Based Signature Schemes Based on Pairings
SAC '02 Revised Papers from the 9th Annual International Workshop on Selected Areas in Cryptography
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
Identification of Bad Signatures in Batches
PKC '00 Proceedings of the Third International Workshop on Practice and Theory in Public Key Cryptography: Public Key Cryptography
An Identity-Based Signature from Gap Diffie-Hellman Groups
PKC '03 Proceedings of the 6th International Workshop on Theory and Practice in Public Key Cryptography: Public Key Cryptography
Short Signatures from the Weil Pairing
Journal of Cryptology
Group signatures with verifier-local revocation
Proceedings of the 11th ACM conference on Computer and communications security
A comparison of MNT curves and supersingular curves
Applicable Algebra in Engineering, Communication and Computing
Securing vehicular ad hoc networks
Journal of Computer Security - Special Issue on Security of Ad-hoc and Sensor Networks
EUROCRYPT '07 Proceedings of the 26th annual international conference on Advances in Cryptology
Batch Verification of Short Signatures
EUROCRYPT '07 Proceedings of the 26th annual international conference on Advances in Cryptology
Aggregate and verifiably encrypted signatures from bilinear maps
EUROCRYPT'03 Proceedings of the 22nd international conference on Theory and applications of cryptographic techniques
Finding invalid signatures in pairing-based batches
Cryptography and Coding'07 Proceedings of the 11th IMA international conference on Cryptography and coding
HIBE with short public parameters without random oracle
ASIACRYPT'06 Proceedings of the 12th international conference on Theory and Application of Cryptology and Information Security
Short 2-move undeniable signatures
VIETCRYPT'06 Proceedings of the First international conference on Cryptology in Vietnam
Enhanced aggregate signatures from pairings
CISC'05 Proceedings of the First SKLOIS conference on Information Security and Cryptology
Efficient identity based ring signature
ACNS'05 Proceedings of the Third international conference on Applied Cryptography and Network Security
Efficient identity-based encryption without random oracles
EUROCRYPT'05 Proceedings of the 24th annual international conference on Theory and Applications of Cryptographic Techniques
Lightweight email signatures (extended abstract)
SCN'06 Proceedings of the 5th international conference on Security and Cryptography for Networks
Compact group signatures without random oracles
EUROCRYPT'06 Proceedings of the 24th annual international conference on The Theory and Applications of Cryptographic Techniques
Sequential aggregate signatures and multisignatures without random oracles
EUROCRYPT'06 Proceedings of the 24th annual international conference on The Theory and Applications of Cryptographic Techniques
ICISC'05 Proceedings of the 8th international conference on Information Security and Cryptology
Efficient uncoordinated FHSS anti-jamming communication
Proceedings of the tenth ACM international symposium on Mobile ad hoc networking and computing
REACT: An RFID-based privacy-preserving children tracking scheme for large amusement parks
Computer Networks: The International Journal of Computer and Telecommunications Networking
Group testing and batch verification
ICITS'09 Proceedings of the 4th international conference on Information theoretic security
ACNS'10 Proceedings of the 8th international conference on Applied cryptography and network security
A suite of non-pairing ID-based threshold ring signature schemes with different levels of anonymity
ProvSec'10 Proceedings of the 4th international conference on Provable security
ZKPDL: a language-based system for efficient zero-knowledge proofs and electronic cash
USENIX Security'10 Proceedings of the 19th USENIX conference on Security
Identification of multiple invalid pairing-based signatures in constrained batches
Pairing'10 Proceedings of the 4th international conference on Pairing-based cryptography
Server-aided signatures verification secure against collusion attack
Proceedings of the 6th ACM Symposium on Information, Computer and Communications Security
ADHOC-NOW'11 Proceedings of the 10th international conference on Ad-hoc, mobile, and wireless networks
A pre-computable signature scheme with efficient verification for RFID
ISPEC'12 Proceedings of the 8th international conference on Information Security Practice and Experience
Knox: privacy-preserving auditing for shared data with large groups in the cloud
ACNS'12 Proceedings of the 10th international conference on Applied Cryptography and Network Security
Proceedings of the 2012 ACM conference on Computer and communications security
Proceedings of the 2012 ACM conference on Computer and communications security
Group signatures for secure and privacy preserving vehicular ad hoc networks
Proceedings of the 8h ACM symposium on QoS and security for wireless and mobile networks
Server-aided signatures verification secure against collusion attack
Information Security Tech. Report
Short-Term linkable group signatures with categorized batch verification
FPS'12 Proceedings of the 5th international conference on Foundations and Practice of Security
Using SMT solvers to automate design tasks for encryption and signature schemes
Proceedings of the 2013 ACM SIGSAC conference on Computer & communications security
Improvements on an authentication scheme for vehicular sensor networks
Expert Systems with Applications: An International Journal
| Hi-index | 0.00 |
In many applications, it is desirable to work with signatures that are short, and yet where many messages from different signers be verified very quickly. RSA signatures satisfy the latter condition, but are generally thousands of bits in length. Recent developments in pairing-based cryptography produced a number of "short" signatures which provide equivalent security in a fraction of the space. Unfortunately, verifying these signatures is computationally intensive due to the expensive pairing operation. Toward achieving "short and fast" signatures, Camenisch, Hohenberger and Pedersen (Eurocrypt 2007) showed how to batch verify two pairing-based schemes so that the total number of pairings was independent of the number of signatures to verify. In this work, we present both theoretical and practical contributions. On the theoretical side, we introduce new batch verifiers for a wide variety of regular, identity-based, group, ring and aggregate signature schemes. These are the first constructions for batching group signatures, which answers an open problem of Camenisch et al. On the practical side, we implement each of these algorithms and compare each batching algorithm to doing individual verifications. Our goal is to test whether batching is practical; that is, whether the benefits of removing pairings significantly outweigh the cost of the additional operations required for batching, such as group membership testing, randomness generation, and additional modular exponentiations and multiplications. We experimentally verify that the theoretical results of Camenisch et al. and this work, indeed, provide an efficient, effective approach to verifying multiple signatures from (possibly) different signers.