Identity-based cryptosystems and signature schemes
Proceedings of CRYPTO 84 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
Modern Cryptography: Theory and Practice
Modern Cryptography: Theory and Practice
The random oracle methodology, revisited
Journal of the ACM (JACM)
Efficient Identity Based Signature/Signcryption Scheme in the Standard Model
ISDPE '07 Proceedings of the The First International Symposium on Data, Privacy, and E-Commerce
Identity based signcryption scheme without random oracles
Computer Standards & Interfaces
Two-tier signatures, strongly unforgeable signatures, and Fiat-Shamir without random oracles
PKC'07 Proceedings of the 10th international conference on Practice and theory in public-key cryptography
An improved semantically-secure identity-based signcryption scheme in the standard model
Computers and Electrical Engineering
CCA2 secure IBE: standard model efficiency through authenticated symmetric encryption
CT-RSA'08 Proceedings of the 2008 The Cryptopgraphers' Track at the RSA conference on Topics in cryptology
Attacks against Two Identity-Based Signcryption Schemes
NSWCTC '10 Proceedings of the 2010 Second International Conference on Networks Security, Wireless Communications and Trusted Computing - Volume 01
Cryptanalysis of Efficient Identity Based Signature/Signcryption Schemes in the Standard Model
IPTC '10 Proceedings of the 2010 International Symposium on Intelligence Information Processing and Trusted Computing
Generic transformation from weakly to strongly unforgeable signatures
Journal of Computer Science and Technology
Efficient identity-based signcryption in the standard model
ProvSec'11 Proceedings of the 5th international conference on Provable security
General conversion for obtaining strongly existentially unforgeable signatures
INDOCRYPT'06 Proceedings of the 7th international conference on Cryptology in India
Efficient and provably-secure identity-based signatures and signcryption from bilinear maps
ASIACRYPT'05 Proceedings of the 11th international conference on Theory and Application of Cryptology and Information Security
Improved identity-based signcryption
PKC'05 Proceedings of the 8th international conference on Theory and Practice in Public Key Cryptography
Efficient identity-based encryption without random oracles
EUROCRYPT'05 Proceedings of the 24th annual international conference on Theory and Applications of Cryptographic Techniques
Towards confidentiality of ID-Based signcryption schemes under without random oracle model
PAISI'10 Proceedings of the 2010 Pacific Asia conference on Intelligence and Security Informatics
Strongly unforgeable signatures based on computational diffie-hellman
PKC'06 Proceedings of the 9th international conference on Theory and Practice of Public-Key Cryptography
Practical identity-based encryption without random oracles
EUROCRYPT'06 Proceedings of the 24th annual international conference on The Theory and Applications of Cryptographic Techniques
Efficient identity-based signatures secure in the standard model
ACISP'06 Proceedings of the 11th Australasian conference on Information Security and Privacy
Hi-index | 0.00 |
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.