Efficient online/offline signcryption without key exposure
by Fei Yan; Xiaofeng Chen; Yinghui Zhang
International Journal of Grid and Utility Computing (IJGUC), Vol. 4, No. 1, 2013

Abstract: An online/offline signcryption scheme provides confidentiality and authentication simultaneously, and it is particularly suitable for the application of resource-constrained systems. In this paper, we present a key-exposure free online/offline signcryption scheme. In contrast, it seems that all the existing online/offline signcryption schemes based on Shamir-Tauman's paradigm suffer from the key exposure problem. In the random oracle model, the proposed scheme is proved to be indistinguishable against adaptive chosen-ciphertext attacks (IND-CCA2) and existentially unforgeable against chosen-message attacks (EUF-CMA). Besides, an improved scheme is proposed, which requires none of the recipient's public information in the offline phase and hence makes practical sense.

Online publication date: Thu, 18-Sep-2014

The full text of this article is only available to individual subscribers or to users at subscribing institutions.

 
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
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 Grid and Utility Computing (IJGUC):
Login with your Inderscience username and password:

Username:        Password:          Forgotten your 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