Identity-based server-aided decryption

8Citations
Citations of this article
22Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Identity-Based Cryptosystem plays an important role in the modern cryptography world, due to the elimination of the costly certificate. However, all practical identity-based encryption schemes require pairing operation in the decryption stage. Pairing is a heavy mathematical algorithm, especially for resource-constrained devices such as smart cards or wireless sensors. In other words, decryption can hardly be done in these devices if identity-based cryptosystem is employed. We solve this problem by proposing a new notion called Identity-Based Server-Aided Decryption. It is similar to normal identity-based encryption scheme, but it further enables the receiver to decrypt the ciphertext without needing to compute pairing with the assistance of an external server. Secure mechanisms are provided to detect whether the server has computed correctly and prevent the server from getting any information about the plaintext or the user secret key. We give two concrete instantiations of this notion. © 2011 Springer-Verlag.

Cite

CITATION STYLE

APA

Liu, J. K., Chu, C. K., & Zhou, J. (2011). Identity-based server-aided decryption. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 6812 LNCS, pp. 337–352). https://doi.org/10.1007/978-3-642-22497-3_22

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free