A digital signature scheme secure against adaptive chosen-message attacks
SIAM Journal on Computing - Special issue on 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
Energy aware lossless data compression
Proceedings of the 1st international conference on Mobile systems, applications and services
Multi-signatures in the plain public-Key model and a general forking lemma
Proceedings of the 13th ACM conference on Computer and communications security
A provably secure short signature scheme based on discrete logarithms
Information Sciences: an International Journal
Efficient and provably-secure certificateless short signature scheme from bilinear pairings
Computer Standards & Interfaces
Efficient Batch Verification of Short Signatures for a Single-Signer Setting without Random Oracles
IWSEC '08 Proceedings of the 3rd International Workshop on Security: Advances in Information and Computer Security
Efficient Short Signatures from Pairing
ITNG '09 Proceedings of the 2009 Sixth International Conference on Information Technology: New Generations
Secure hash-and-sign signatures without the random oracle
EUROCRYPT'99 Proceedings of the 17th international conference on Theory and application of cryptographic techniques
Efficient ID-based digital signatures with message recovery
CANS'07 Proceedings of the 6th international conference on Cryptology and network security
Identity-based partial message recovery signatures (or how to shorten ID-Based signatures)
FC'05 Proceedings of the 9th international conference on Financial Cryptography and Data Security
| Hi-index | 0.00 |
Short digital signatures are essential to ensure the authenticity of messages in low-bandwidth communication channels and are used to reduce the communication complexity of any transmission. A new short signature scheme based on the bilinear pairing in the standard model is introduced. The proposed scheme has short public parameters and the size of the signature achieves 160 bits. In addition, under the n-Exponent Computational Diffie-Hellman Problem (n-CDH), the new scheme is provable security. To the best of authors knowledge, this is the first scheme whose signature size achieves 160 bits based on the bilinear pairing.