Name
Abstract | ||
|---|---|---|
Signcryption is a cryptographic primitive that provides authentication and confidentiality simultaneously in a single logical step. It is often required that multiple senders have to signcrypt a single message to a certain receiver. Obviously, it is inefficient to signcrypt the messages separately. An efficient alternative is to go for multi-signcryption. The concept of multi-signcryption is similar to that of multi-signatures with the added property - confidentiality. Recently, Jianhong et al. proposed an identity based multi-signcryption scheme. They claimed that their scheme is secure against adaptive chosen ciphertext attack and it is existentially unforgeable. In this paper, we show that their scheme is not secure against chosen plaintext attack and is existentially forgeable, we also provide a fix for the scheme and prove formally that the improved scheme is secure against both adaptive chosen ciphertext attack and existential forgery. |
Year | DOI | Venue |
|---|---|---|
2009 | 10.1007/978-3-642-04642-1_7 | IACR Cryptology ePrint Archive |
Keywords | Field | DocType |
cryptanalysis,improved scheme,provable security,single logical step,existentially forgeable,signcryption,random oracle model.,certain receiver,multi-signcryption,ciphertext attack,multi-signcryption scheme,existentially unforgeable,added property,single message,bilinear pairing,plaintext attack,. identity based cryptography,chosen ciphertext attack,random oracle model | Authentication,Ciphertext indistinguishability,Semantic security,Chosen-plaintext attack,Computer science,Computer security,Adaptive chosen-ciphertext attack,Cryptographic primitive,Theoretical computer science,Signcryption,Malleability,Distributed computing | Journal |
Volume | ISSN | Citations |
2009 | 0302-9743 | 3 |
PageRank | References | Authors |
0.40 | 15 | 3 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Sharmila Deva Selvi | 1 | 138 | 23.41 |
| Sree Vivek | 2 | 140 | 20.72 |
| C. Pandu Rangan | 3 | 1434 | 149.57 |