Conference ProceedingsOPEN ACCESS

Hierarchical id-based cryptography

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (2002) 2501 548-566
DOI: 10.1007/3-540-36178-2_34
882Citations
Citations of this article
203Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

We present hierarchical identity-based encryption schemes and signature schemes that have total collusion resistance on an arbitrary number of levels and that have chosen ciphertext security in the random oracle model assuming the difficulty of the Bilinear Diffie-Hellman problem.

Author supplied keywords

Cite

CITATION STYLE

APA

Gentry, C., & Silverberg, A. (2002). Hierarchical id-based cryptography. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 2501, pp. 548–566). Springer Verlag. https://doi.org/10.1007/3-540-36178-2_34

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