Online/offline verification of short signatures

Authors:
Yilian Zhang;Zhide Chen;Fuchun Guo
Affiliations:
Key Lab of Network Security and Cryptology, School of Mathematics and Computer Science, Fujian Normal University, Fuzhou, China;Key Lab of Network Security and Cryptology, School of Mathematics and Computer Science, Fujian Normal University, Fuzhou, China;Centre for Computer and Information Security Research, School of Computer Science and Software Engineering, University of Wollongong, Wollongong, NSW, Australia
Venue:
Inscrypt'10 Proceedings of the 6th international conference on Information security and cryptology
Year:
2010

Citing 14
Cited 0

On-line/off-line digital signatures

CRYPTO '89 Proceedings on Advances in cryptology
Improved Online/Offline Signature Schemes

CRYPTO '01 Proceedings of the 21st Annual International Cryptology Conference on Advances in Cryptology
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
Batch Verification of Short Signatures

EUROCRYPT '07 Proceedings of the 26th annual international conference on Advances in Cryptology
Optimal Online/Offline Signature: How to Sign a Message without Online Computation

ProvSec '08 Proceedings of the 2nd International Conference on Provable Security
Realizing Hash-and-Sign Signatures under Standard Assumptions

EUROCRYPT '09 Proceedings of the 28th Annual International Conference on Advances in Cryptology: the Theory and Applications of Cryptographic Techniques
Divisible On-Line/Off-Line Signatures

CT-RSA '09 Proceedings of the The Cryptographers' Track at the RSA Conference 2009 on Topics in Cryptology
Is the Notion of Divisible On-Line/Off-Line Signatures Stronger than On-Line/Off-Line Signatures?

ProvSec '09 Proceedings of the 3rd International Conference on Provable Security
Improved on-line/off-line threshold signatures

PKC'07 Proceedings of the 10th international conference on Practice and theory in public-key cryptography
Online/offline signature schemes for devices with limited computing capabilities

CT-RSA'08 Proceedings of the 2008 The Cryptopgraphers' Track at the RSA conference on Topics in cryptology
Off-line/on-line signatures: theoretical aspects and experimental results

PKC'08 Proceedings of the Practice and theory in public key cryptography, 11th international conference on Public key cryptography
Efficient identity-based encryption without random oracles

EUROCRYPT'05 Proceedings of the 24th annual international conference on Theory and Applications of Cryptographic Techniques
New online/offline signature schemes without random oracles

PKC'06 Proceedings of the 9th international conference on Theory and Practice of Public-Key Cryptography
Online/Offline signatures and multisignatures for AODV and DSR routing security

ACISP'06 Proceedings of the 11th Australasian conference on Information Security and Privacy

Quantified Score

Hi-index	0.00

Visualization

Abstract

Fast signature verification is desirable in many applications, especially when signature recipients need to make response quickly. In this paper, we present an efficient online/offline verification of short signature (OVS) scheme without random oracles. Besides message signing, signature verification can be also separated into offline phase and online phase. Only one multi-exponentiation is required for the verifier in the online phase. In addition, our signature is short which gives about 480 bits for 80-bit security. Our scheme indeed improves the efficiency of signature verification since no pairing operation is required in the online phase. We also give a generic construction of OVS schemes using the idea of double trapdoor chameleon hash.