Two-party round-optimal session-policy attribute-based authenticated key exchange without random oracles

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

Abstract

In this paper, we propose a new one-round session-policy attribute-based (implicitly) authenticated key exchange (SP-ABAKE) scheme which allows expressive access controls and is secure in the standard model (StdM). Our scheme enjoys the best of both worlds: efficiency and security. The number of rounds is one (optimal) while the known secure scheme in the StdM is not one-round protocol. Our scheme is comparable in communication complexity with the most efficient known scheme whereas it cannot be proved in the StdM. Also, our scheme is proved to satisfy security against advanced attacks like key compromise impersonation under a non-interactive number-theoretic assumption. We construct our scheme based on Waters' ciphertext-policy attribute-based encryption with the generic conversion technique to the CCA-security from the CPA-security. © 2012 Springer-Verlag.

Cite

CITATION STYLE

APA

Yoneyama, K. (2012). Two-party round-optimal session-policy attribute-based authenticated key exchange without random oracles. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 7259 LNCS, pp. 467–489). https://doi.org/10.1007/978-3-642-31912-9_31

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