A digital signature scheme secure against adaptive chosen-message attacks
SIAM Journal on Computing - Special issue on cryptography
Random oracles are practical: a paradigm for designing efficient protocols
CCS '93 Proceedings of the 1st ACM conference on Computer and communications security
The Representation Problem Based on Factoring
CT-RSA '02 Proceedings of the The Cryptographer's Track at the RSA Conference on Topics in Cryptology
Implementation of cryptosystems based on Tate pairing
Journal of Computer Science and Technology
The exact security of digital signatures-how to sign with RSA and Rabin
EUROCRYPT'96 Proceedings of the 15th annual international conference on Theory and application of cryptographic techniques
On the key exposure problem in chameleon hashes
SCN'04 Proceedings of the 4th international conference on Security in Communication Networks
Identity-based chameleon hash scheme without key exposure
ACISP'10 Proceedings of the 15th Australasian conference on Information security and privacy
Hierarchical identity-based chameleon hash and its applications
ACNS'11 Proceedings of the 9th international conference on Applied cryptography and network security
Comments and improvements on key-exposure free chameleon hashing based on factoring
Inscrypt'10 Proceedings of the 6th international conference on Information security and cryptology
Identity-based chameleon hashing and signatures without key exposure
Information Sciences: an International Journal
| Hi-index | 0.00 |
Chameleon hash is the main primitive to construct a chameleon signature scheme which provides nonrepudiation and non-transferability simultaneously. However, the initial chameleon hash schemes suffer from the key exposure problem: non-transferability is based on an unsound assumption that the designated receiver is willing to abuse his private key regardless of its exposure. Recently, several key-exposure-free chameleon hashes have been constructed based on RSA assumption and SDH (strong Diffie-Hellman) assumption. In this paper, we propose a factoring-based chameleon hash scheme which is proven to enjoy all advantages of the previous schemes. In order to support it, we propose a variant Rabin signature scheme which is proven secure against a new type of attack in the random oracle model.