Identity-based cryptosystems and signature schemes
Proceedings of CRYPTO 84 on Advances in cryptology
Efficient Identity Based Signature Schemes Based on Pairings
SAC '02 Revised Papers from the 9th Annual International Workshop on Selected Areas in Cryptography
Identity-Based Encryption from the Weil Pairing
CRYPTO '01 Proceedings of the 21st Annual International Cryptology Conference on Advances in Cryptology
Digital Signcryption or How to Achieve Cost(Signature & Encryption)
CRYPTO '97 Proceedings of the 17th Annual International Cryptology Conference on Advances in Cryptology
On the Security of Joint Signature and Encryption
EUROCRYPT '02 Proceedings of the International Conference on the Theory and Applications of Cryptographic Techniques: Advances in Cryptology
Identity-Based Threshold Signature Scheme from the Bilinear Pairings
ITCC '04 Proceedings of the International Conference on Information Technology: Coding and Computing (ITCC'04) Volume 2 - Volume 2
Robust ID-based threshold signcryption scheme from pairings
InfoSecu '04 Proceedings of the 3rd international conference on Information security
An Identity-Based Signature and Its Threshold Version
AINA '05 Proceedings of the 19th International Conference on Advanced Information Networking and Applications - Volume 1
An identity-based threshold signcryption scheme with semantic security
CIS'05 Proceedings of the 2005 international conference on Computational Intelligence and Security - Volume Part II
Efficient and proactive threshold signcryption
ISC'05 Proceedings of the 8th international conference on Information Security
Hi-index | 0.01 |
In this paper,we analyze an identity-based threshold signcryption (IDTSC)scheme proposed in ICCCAS'2008, although Li and Yu pointed out that the scheme is the first provably secure scheme which is secure against adaptive chosen ciphertext attacks and secure in the sense of unforgeability, we show that the signcryption in the scheme is easily forged by the appointed clerk who is one of the members , the clerk can impersonate the members to forge valid signcryption to any receiver, then we give a secure version which we prove its confidentiality under the Decisional Bilinear Diffie-Hellman assumption and its unforgeability under the Computational Diffie-Hellman assumption in the random oracle model. Scheme turns out to be more efficient than the previously proposed schemes.