Efficient Secret Authenticatable Anonymous Signcryption Scheme with Identity Privacy
PAISI, PACCF and SOCO '08 Proceedings of the IEEE ISI 2008 PAISI, PACCF, and SOCO international workshops on Intelligence and Security Informatics
A Novel ID-Based Anonymous Signcryption Scheme
APWeb/WAIM '09 Proceedings of the Joint International Conferences on Advances in Data and Web Management
Cryptanalysis of Two Ring Signcryption Schemes
Information Security and Cryptology
An efficient and provable secure identity-based ring signcryption scheme
Computer Standards & Interfaces
On the Security of Identity Based Ring Signcryption Schemes
ISC '09 Proceedings of the 12th International Conference on Information Security
A strong designated verifier ring signcryption scheme
WiCOM'09 Proceedings of the 5th International Conference on Wireless communications, networking and mobile computing
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
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
Identity based ring signature: why, how and what next
EuroPKI'05 Proceedings of the Second European conference on Public Key Infrastructure
| Hi-index | 0.00 |
In this paper, we present a new concept called an identity based ring signcryption scheme (IDRSC). We argue that this is an important cryptographic primitive that must be used to protect privacy and authenticity of a collection of users who are connected through an ad-hoc network, such as Bluetooth. We also present an efficient IDRSC scheme based on bilinear pairing. As a regular signcryption scheme, our scheme combines the functionality of signature and encryption schemes. However, the idea is to have an identity based system. In our scheme, a user can anonymously signcrypts a message on behalf of the group. We show that our scheme outperforms a traditional identity based scheme, that is obtained by a standard sign-then-encrypt mechanism, in terms of the length of the ciphertext.We also provide a formal proof of our scheme with the chosen cipher-text security under the Decisional Bilinear Diffie-Hellman assumption, which is believed to be intractable.