ID-based multi-receiver signcryption scheme in the standard model Online publication date: Sat, 18-Mar-2017
by Zhimin Yu; Zhengjun Jing; Hua Yang; Chunsheng Gu
International Journal of Internet Protocol Technology (IJIPT), Vol. 10, No. 1, 2017
Abstract: Currently, the network multicast in network and internet services are widely used, and how to ensure secure data transmission and non-repudiation has been a hot issue. In order to ensure data confidentiality and non-repudiation in multicast that has lower cost of data transmission and computing, we propose an ID-based multi-receiver signcryption scheme in the standard model based on multilinear maps. In our construction, the number of recipients is unlimited and each receiver decrypts ciphertext using his private key and verifies the identity of the sender. At the same time, the identity-based design has important advantages in that it eliminates the large overhead of having to store and verify a set of verification keys. Based on the hardness assumption of the graded Diffie-Hellman problem, we prove that the proposed scheme can achieve the message confidentiality under selective multi-ID, chosen message attack and the signcryption is unforgeable under selective ID, chosen message attack.
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Internet Protocol Technology (IJIPT):
Login with your Inderscience username and password:
Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.
If you still need assistance, please email subs@inderscience.com
Our Blog 
Follow us on Twitter 
Visit us on Facebook