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
Identity based signcryption scheme without random oracles
Computer Standards & Interfaces
On the Security of Provably Secure Multi-Receiver ID-Based Signcryption Scheme
IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
An Efficient Identity-Based Signcryption Scheme for Multiple Receivers
IWSEC '09 Proceedings of the 4th International Workshop on Security: Advances in Information and Computer Security
An improved semantically-secure identity-based signcryption scheme in the standard model
Computers and Electrical Engineering
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 and provably secure multi-receiver identity-based signcryption
ACISP'06 Proceedings of the 11th Australasian conference on Information Security and Privacy
Efficient identity-based signcryption scheme for multiple receivers
ATC'07 Proceedings of the 4th international conference on Autonomic and Trusted Computing
Hi-index | 0.00 |
Signcryption is a novel cryptographic primitive that simultaneously provides the authentication and encryption in a single logic step. To adapt multi-receiver setting, motivated by Waters' identity based encryption scheme, the first multi-receiver identity-based signcryption scheme in the standard model was proposed. Then we prove its semantic security under the assumption of Decisional Bilinear Diffie-Hellman and its unforgeability under the hardness of Computational Diffie-Hellman Problem.