Name
Abstract | ||
|---|---|---|
Designing an ID based signcryption scheme in the standard model is among the most interesting and important problems in cryptography. However, all the existing systems in the ID based setting, in the standard model, do not have either the unforgeability property or the indistinguishability property or both of them. In this paper, we present the first provably secure ID based signcryption scheme in the standard model with both these properties. The unforgeability property of this scheme is based on the hardness of Computational Diffie-Hellman problem and the indistinguishability property of this scheme is based on the hardness of Decisional Bilinear Diffie-Hellman problem. Our scheme is strongly unforgeable in the strong attack mode called insider security. Moreover, our scheme possess an interesting property called public verifiability of the ciphertext. Our scheme integrates cleverly, a modified version of Waters' IBE and a suitably modified version of the ID based signature scheme in the standard model proposed by Paterson et al. However, our security reductions are more efficient. Specifically, while the security reductions for indistinguishability is similar to the bounds of Waters' scheme, the unforgeability reductions are way better than the bounds for Paterson et al.'s scheme. |
Year | DOI | Venue |
|---|---|---|
2012 | 10.1007/978-3-642-33272-2_4 | IACR Cryptology ePrint Archive |
Keywords | DocType | Volume |
provably secure id,indistinguishability property,insider security,unforgeability property,security reduction,signcryption scheme,signature scheme,unforgeability reduction,interesting property,standard model,provable security | Conference | 2012 |
Citations | PageRank | References |
6 | 0.42 | 23 |
Authors | ||
4 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Sharmila Deva Selvi | 1 | 138 | 23.41 |
| Sree Vivek | 2 | 140 | 20.72 |
| Dhinakaran Vinayagamurthy | 3 | 159 | 5.86 |
| C. Pandu Rangan | 4 | 1434 | 149.57 |