Analysis of improved signcryption scheme with key privacy
Information Processing Letters
Signcryption Scheme in Multi-user Setting without Random Oracles
IWSEC '08 Proceedings of the 3rd International Workshop on Security: Advances in Information and Computer Security
Forgery of Provable Secure Short Signcryption Scheme
IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
Efficient Constructions of Signcryption Schemes and Signcryption Composability
INDOCRYPT '09 Proceedings of the 10th International Conference on Cryptology in India: Progress in Cryptology
On the security of some multi-PKG/multi-recipient signcryption schemes
ASID'09 Proceedings of the 3rd international conference on Anti-Counterfeiting, security, and identification in communication
Security analysis of two signature schemes and their improved schemes
ICCSA'07 Proceedings of the 2007 international conference on Computational science and its applications - Volume Part I
Signcryption with non-interactive non-repudiation without random oracles
Transactions on computational science X
Efficient short signcryption scheme with public verifiability
Inscrypt'06 Proceedings of the Second SKLOIS conference on Information Security and Cryptology
| Hi-index | 0.00 |
In this paper, we analyse the Libert-Quisquater's q-DH signcryption scheme proposed in SCN'2004. Although the paper proved that their scheme is secure against adaptive chosen ciphertext attacks in the random oracle model, we disprove their claim and show that their scheme is not even secure against non-adaptive chosen ciphtertext attacks, which is the weaker security than the adaptive chosen ciphertext attacks. We further show that the semantically secure symmetric encryption scheme defined in their paper is not sufficient to guarantee their signcryption scheme to be secure against adaptive chosen ciphertext attacks.