Revocable Attribute-based Key Agreement Protocol without Random Oracles
|
| Title | Revocable Attribute-based Key Agreement Protocol without Random Oracles |
| Authors | |
| Abstract | In this paper, we present a two-party attribute-based key agreement protocol, which is secure in the standard model (without random oracles), under the truncated decision q-ABDHE assumption. Then we give a modified version of this scheme, in which the users can be revoked efficiently. The attribute-based key agreement protocol is based on the attribute-based encryption scheme, which is a generalization of identity-based cryptosystems, incorporates attributes as inputs to its cryptographic primitives. These kinds of schemes not only preserve the advantages of traditional identity-based key agreement protocol, but also provide some new properties, such as hiding the identity information of the individual, increasing the flexibility of key management, and providing efficient means to revoke users from the system. |
| Publisher | ACADEMY PUBLISHER |
| Date | 2009-10-01 |
| Source | Journal of Networks Vol 4, No 8 (2009): Special Issue: Performance Evaluation of Communication Networks |
| Rights | Copyright © ACADEMY PUBLISHER - All Rights Reserved.To request permission, please check out URL: http://www.academypublisher.com/copyrightpermission.html. |