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
An Identity-Based Signature from Gap Diffie-Hellman Groups
PKC '03 Proceedings of the 6th International Workshop on Theory and Practice in Public Key Cryptography: Public Key Cryptography
The exact security of digital signatures-how to sign with RSA and Rabin
EUROCRYPT'96 Proceedings of the 15th annual international conference on Theory and application of cryptographic techniques
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
Efficient identity-based signatures secure in the standard model
ACISP'06 Proceedings of the 11th Australasian conference on Information Security and Privacy
Certificateless signcryption scheme in the standard model
Information Sciences: an International Journal
An improved semantically-secure identity-based signcryption scheme in the standard model
Computers and Electrical Engineering
Analysis and improvement of an ID-based anonymous signcryption model
ICIC'09 Proceedings of the 5th international conference on Emerging intelligent computing technology and applications
Providing basic security mechanisms in broker-less publish/subscribe systems
Proceedings of the Fourth ACM International Conference on Distributed Event-Based Systems
An ID-based anonymous signcryption scheme for multiple receivers secure in the standard model
AST/UCMA/ISA/ACN'10 Proceedings of the 2010 international conference on Advances in computer science and information technology
Efficient identity-based signcryption in the standard model
ProvSec'11 Proceedings of the 5th international conference on Provable security
Further improvement of an identity-based signcryption scheme in the standard model
Computers and Electrical Engineering
Fuzzy biometric signcryption scheme with bilinear pairings in the standard model
PAISI'10 Proceedings of the 2010 Pacific Asia conference on Intelligence and Security Informatics
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
Multi-receiver identity-based signcryption scheme in the standard model
ICICA'11 Proceedings of the Second international conference on Information Computing and Applications
Cryptanalysis of an Identity Based Signcryption without Random Oracles
Fundamenta Informaticae
ID based signcryption scheme in standard model
ProvSec'12 Proceedings of the 6th international conference on Provable Security
Efficient identity-based signcryption without random oracles
AISC '12 Proceedings of the Tenth Australasian Information Security Conference - Volume 125
| Hi-index | 0.00 |
Many identity based signcryption schemes have been proposed so far. However, all the schemes were proven secure in the random oracle model which has received a lot of criticism that the proofs in the random oracle model are not proofs. In this paper, motivated by Waters' identity based encryption scheme, we propose the first identity based signcryption scheme without random oracles. We prove that the proposed scheme is secure in the standard model. Specifically, we prove its semantic security under the hardness of Decisional Bilinear Diffie-Hellman problem and its unforgeability under the Computational Diffie-Hellman assumption.