A digital signature scheme secure against adaptive chosen-message attacks
SIAM Journal on Computing - Special issue on cryptography
A provably secure short signature scheme based on discrete logarithms
Information Sciences: an International Journal
A practical scheme for non-interactive verifiable secret sharing
SFCS '87 Proceedings of the 28th Annual Symposium on Foundations of Computer Science
A public key cryptosystem and a signature scheme based on discrete logarithms
IEEE Transactions on Information Theory
Efficient threshold proxy signature protocol for mobile agents
Information Sciences: an International Journal
Signcryption from randomness recoverable public key encryption
Information Sciences: an International Journal
Journal of Network and Computer Applications
New receipt-free voting scheme using double-trapdoor commitment
Information Sciences: an International Journal
Efficient multiple-collision trapdoor hash family
Security and Communication Networks
Provably secure threshold public-key encryption with adaptive security and short ciphertexts
Information Sciences: an International Journal
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
Hi-index | 0.07 |
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. Nonetheless, all existing on-line/off-line signature schemes based on this paradigm suffer from the key exposure problem of chameleon hashing. To avoid this problem, the signer should pre-compute and store a 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 and then incorporate it to construct a more efficient generic on-line/off-line signature scheme without key exposure. Furthermore, we also present the first key-exposure-free generic on-line/off-line threshold signature scheme without a trusted dealer. Additionally, we prove that the proposed schemes have achieved the desired security requirements.