Use of elliptic curves in cryptography
Lecture notes in computer sciences; 218 on Advances in cryptology---CRYPTO 85
How to prove yourself: practical solutions to identification and signature problems
Proceedings on Advances in cryptology---CRYPTO '86
A digital signature scheme secure against adaptive chosen-message attacks
SIAM Journal on Computing - Special issue on cryptography
Minimum disclosure proofs of knowledge
Journal of Computer and System Sciences - 27th IEEE Conference on Foundations of Computer Science October 27-29, 1986
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
CRYPTO '89 Proceedings of the 9th Annual International Cryptology Conference on Advances in Cryptology
On the key exposure problem in chameleon hashes
SCN'04 Proceedings of the 4th international conference on Security in Communication Networks
Generic on-line/off-line threshold signatures
PKC'06 Proceedings of the 9th international conference on Theory and Practice of Public-Key Cryptography
New online/offline signature schemes without random oracles
PKC'06 Proceedings of the 9th international conference on Theory and Practice of Public-Key Cryptography
Mitigating phishing with ID-based online/offline authentication
AISC '08 Proceedings of the sixth Australasian conference on Information security - Volume 81
Identity-Based Online/Offline Encryption
Financial Cryptography and Data Security
Optimal Online/Offline Signature: How to Sign a Message without Online Computation
ProvSec '08 Proceedings of the 2nd International Conference on Provable Security
Divisible On-Line/Off-Line Signatures
CT-RSA '09 Proceedings of the The Cryptographers' Track at the RSA Conference 2009 on Topics in Cryptology
An Efficient Identity-Based Online/Offline Encryption Scheme
ACNS '09 Proceedings of the 7th International Conference on Applied Cryptography and Network Security
How to Prove Security of a Signature with a Tighter Security Reduction
ProvSec '09 Proceedings of the 3rd International Conference on Provable Security
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
Journal of Network and Computer Applications
New receipt-free voting scheme using double-trapdoor commitment
Information Sciences: an International Journal
Identity-based online/offline key encapsulation and encryption
Proceedings of the 6th ACM Symposium on Information, Computer and Communications Security
Efficient online/offline signatures with computational leakage resilience in online phase
Inscrypt'10 Proceedings of the 6th international conference on Information security and cryptology
Securing location-aware services based on online/offline signatures in VANETs
ARES'11 Proceedings of the IFIP WG 8.4/8.9 international cross domain conference on Availability, reliability and security for business, enterprise and health information systems
Online/Offline ring signature scheme
ICICS'09 Proceedings of the 11th international conference on Information and Communications Security
Security and Communication Networks
Efficient ID-based non-malleable trapdoor commitment
Computers and Electrical Engineering
Efficient and robust identity-based handoff authentication in wireless networks
NSS'12 Proceedings of the 6th international conference on Network and System Security
Efficient online/offline signcryption without key exposure
International Journal of Grid and Utility Computing
An ID-based online/offline signature scheme without random oracles for wireless sensor networks
Personal and Ubiquitous Computing
Hi-index | 0.00 |
The "hash-sign-switch" paradigm was firstly proposed by Shamir and Tauman with the aim to design an efficient on-line/off-line signature scheme. However, all existing on-line/off-line signature schemes based on Shamir-Tauman's paradigm suffer from the key exposure problem of chameleon hashing. That is, if the signer applies the same hash value more than once to obtain two signatures on two different messages, the recipient can obtain a hash collision and use it to recover the signer's trapdoor information. Therefore, the signer should pre-compute and store plenty of different chameleon hash values and the corresponding signatures on the hash values in the off-line phase, and send the collision and the signature for a certain hash value in the on-line phase. Hence, the computation and storage cost for the off-line phase and the communication cost for the on-line phase in Shamir-Tauman's signature scheme are still a little more overload.In this paper, we first introduce a special double-trapdoor hash family based on the discrete logarithm assumption to solve this problem. We then apply the "hash-sign-switch" paradigm to propose a much more efficient generic on-line/off-line signature scheme. Additionally, we use a one-time trapdoor/hash key pair for each message signing, which prevents the recipient from recovering the trapdoor information of the signer and computing other collisions.