Analysis of Key-Exchange Protocols and Their Use for Building Secure Channels
EUROCRYPT '01 Proceedings of the International Conference on the Theory and Application of Cryptographic Techniques: Advances in Cryptology
Ciphertext-Policy Attribute-Based Encryption
SP '07 Proceedings of the 2007 IEEE Symposium on Security and Privacy
Multi-Dimensional Range Query over Encrypted Data
SP '07 Proceedings of the 2007 IEEE Symposium on Security and Privacy
Chosen-Ciphertext Security from Identity-Based Encryption
SIAM Journal on Computing
Provably secure ciphertext policy ABE
Proceedings of the 14th ACM conference on Computer and communications security
Efficient One-Round Key Exchange in the Standard Model
ACISP '08 Proceedings of the 13th Australasian conference on Information Security and Privacy
One-round key exchange in the standard model
International Journal of Applied Cryptography
Threshold Attribute-Based Signatures and Their Application to Anonymous Credential Systems
AFRICACRYPT '09 Proceedings of the 2nd International Conference on Cryptology in Africa: Progress in Cryptology
A Provably Secure Two-Party Attribute-Based Key Agreement Protocol
IIH-MSP '09 Proceedings of the 2009 Fifth International Conference on Intelligent Information Hiding and Multimedia Signal Processing
Attribute-based signature and its applications
ASIACCS '10 Proceedings of the 5th ACM Symposium on Information, Computer and Communications Security
Conjunctive, subset, and range queries on encrypted data
TCC'07 Proceedings of the 4th conference on Theory of cryptography
Predicate encryption supporting disjunctions, polynomial equations, and inner products
EUROCRYPT'08 Proceedings of the theory and applications of cryptographic techniques 27th annual international conference on Advances in cryptology
Attribute-based encryption with partially hidden encryptor-specified access structures
ACNS'08 Proceedings of the 6th international conference on Applied cryptography and network security
Fully secure functional encryption with general relations from the decisional linear assumption
CRYPTO'10 Proceedings of the 30th annual conference on Advances in cryptology
ACISP'10 Proceedings of the 15th Australasian conference on Information security and privacy
Attribute-based authenticated key exchange
ACISP'10 Proceedings of the 15th Australasian conference on Information security and privacy
Strongly secure two-pass attribute-based authenticated key exchange
Pairing'10 Proceedings of the 4th international conference on Pairing-based cryptography
Predicate-based authenticated key exchange resilient to ephemeral key leakage
WISA'10 Proceedings of the 11th international conference on Information security applications
One-time signatures and Chameleon hash functions
SAC'10 Proceedings of the 17th international conference on Selected areas in cryptography
CT-RSA'11 Proceedings of the 11th international conference on Topics in cryptology: CT-RSA 2011
Efficient attribute-based signatures for non-monotone predicates in the standard model
PKC'11 Proceedings of the 14th international conference on Practice and theory in public key cryptography conference on Public key cryptography
PKC'11 Proceedings of the 14th international conference on Practice and theory in public key cryptography conference on Public key cryptography
Generic constructions for chosen-ciphertext secure attribute based encryption
PKC'11 Proceedings of the 14th international conference on Practice and theory in public key cryptography conference on Public key cryptography
Fuzzy identity-based encryption
EUROCRYPT'05 Proceedings of the 24th annual international conference on Theory and Applications of Cryptographic Techniques
EUROCRYPT'10 Proceedings of the 29th Annual international conference on Theory and Applications of Cryptographic Techniques
| Hi-index | 0.00 |
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.