On security proof of McCullagh Barreto's key agreement protocol and its variants
International Journal of Security and Networks
Pairing '08 Proceedings of the 2nd international conference on Pairing-Based Cryptography
An Identity-Based Key Agreement Protocol for the Network Layer
SCN '08 Proceedings of the 6th international conference on Security and Cryptography for Networks
Discrete Applied Mathematics
Information Sciences: an International Journal
An ID-based authenticated key exchange protocol based on bilinear Diffie-Hellman problem
Proceedings of the 4th International Symposium on Information, Computer, and Communications Security
Novel and Efficient Identity-Based Authenticated Key Agreement Protocols from Weil Pairings
UIC '09 Proceedings of the 6th International Conference on Ubiquitous Intelligence and Computing
Strongly Secure Certificateless Key Agreement
Pairing '09 Proceedings of the 3rd International Conference Palo Alto on Pairing-Based Cryptography
Server-Controlled Identity-Based Authenticated Key Exchange
ProvSec '09 Proceedings of the 3rd International Conference on Provable Security
Simulatable certificateless two-party authenticated key agreement protocol
Information Sciences: an International Journal
Enhanced McCullagh-Barreto identity-based key exchange protocols with master key forward security
International Journal of Security and Networks
IWSEC'07 Proceedings of the Security 2nd international conference on Advances in information and computer security
Blind identity-based encryption and simulatable oblivious transfer
ASIACRYPT'07 Proceedings of the Advances in Crypotology 13th international conference on Theory and application of cryptology and information security
An interpretation of identity-based cryptography
Foundations of security analysis and design IV
An efficient user authentication and key exchange protocol for mobile client-server environment
Computer Networks: The International Journal of Computer and Telecommunications Networking
A pairing-free identity-based authenticated key agreement protocol with minimal message exchanges
Information Sciences: an International Journal
Certificateless key agreement in the standard model
AISC '10 Proceedings of the Eighth Australasian Conference on Information Security - Volume 105
A DAA scheme using batch proof and verification
TRUST'10 Proceedings of the 3rd international conference on Trust and trustworthy computing
Get shorty via group signatures without encryption
SCN'10 Proceedings of the 7th international conference on Security and cryptography for networks
Information Sciences: an International Journal
On the efficiency and security of pairing-based protocols in the type 1 and type 4 settings
WAIFI'10 Proceedings of the Third international conference on Arithmetic of finite fields
Okamoto-Tanaka revisited: fully authenticated diffie-hellman with minimal overhead
ACNS'10 Proceedings of the 8th international conference on Applied cryptography and network security
Fair E-payment protocol based on certificateless signature and authenticated key exchange
ICICA'10 Proceedings of the First international conference on Information computing and applications
ACISP'10 Proceedings of the 15th Australasian conference on Information security and privacy
Hierarchical ID-based authenticated key exchange resilient to ephemeral key leakage
IWSEC'10 Proceedings of the 5th international conference on Advances in information and computer security
Constructing certificateless encryption and ID-based encryption from ID-based key agreement
Pairing'10 Proceedings of the 4th international conference on Pairing-based cryptography
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
A DAA scheme requiring less TPM resources
Inscrypt'09 Proceedings of the 5th international conference on Information security and cryptology
An efficient dynamic authenticated key exchange protocol with selectable identities
Computers & Mathematics with Applications
An ID-based multi-signer universal designated multi-verifier signature scheme
Information and Computation
Strongly secure identity-based authenticated key agreement protocols
Computers and Electrical Engineering
Identity-based key exchange protocols without pairings
Transactions on computational science X
An efficient identity-based blind signature scheme without bilinear pairings
Computers and Electrical Engineering
Securing location-aware services based on online/offline signatures in VANETs
ARES'11 Proceedings of the IFIP WG 8.4/8.9 international cross domain conference on Availability, reliability and security for business, enterprise and health information systems
Toward pairing-free certificateless authenticated key exchanges
ISC'11 Proceedings of the 14th international conference on Information security
An ID-based proxy multi signature scheme without bilinear pairings
InfoSecHiComNet'11 Proceedings of the First international conference on Security aspects in information technology
A round-optimal three-party ID-based authenticated key agreement protocol
Information Sciences: an International Journal
An improved two-party identity-based authenticated key agreement protocol using pairings
Journal of Computer and System Sciences
An authenticated key exchange mechanism using one-time shared key
ICCSA'05 Proceedings of the 2005 international conference on Computational Science and Its Applications - Volume Part II
Making the diffie-hellman protocol identity-based
CT-RSA'10 Proceedings of the 2010 international conference on Topics in Cryptology
On the design and implementation of an efficient DAA scheme
CARDIS'10 Proceedings of the 9th IFIP WG 8.8/11.2 international conference on Smart Card Research and Advanced Application
One-round identity-based key exchange with Perfect Forward Security
Information Processing Letters
A pairing-free certificateless authenticated key agreement protocol
International Journal of Communication Systems
Computer Networks: The International Journal of Computer and Telecommunications Networking
Computationally-Fair group and identity-based key-exchange
TAMC'12 Proceedings of the 9th Annual international conference on Theory and Applications of Models of Computation
A (corrected) DAA scheme using batch proof and verification
INTRUST'11 Proceedings of the Third international conference on Trusted Systems
ICISC'11 Proceedings of the 14th international conference on Information Security and Cryptology
An efficient certificateless two-party authenticated key agreement protocol
Computers & Mathematics with Applications
Efficient and dynamic key management for multiple identities in identity-based systems
Information Sciences: an International Journal
Authenticated key exchange with entities from different settings and varied groups
ProvSec'12 Proceedings of the 6th international conference on Provable Security
An efficient and provably-secure certificateless signature scheme without bilinear pairings
International Journal of Communication Systems
Further analysis of pairing-based traitor tracing schemes for broadcast encryption
Security and Communication Networks
A new efficient authenticated multiple-key exchange protocol from bilinear pairings
Computers and Electrical Engineering
| Hi-index | 0.00 |
In recent years, a large number of identity- based key agreement protocols from pairings have been proposed. Some of them are elegant and practical. However, the security of this type of protocol has been surprisingly hard to prove, even in the random oracle model. The main issue is that a simulator is not able to deal with reveal queries, because it requires solving either a computational problem or a decisional problem, both of which are generally believed to be hard (i.e., computationally infeasible). The best solution so far for security proofs uses the gap assumption, which means assuming that the existence of a decisional oracle does not change the hardness of the corresponding computational problem. The disadvantage of using this solution to prove security is that such decisional oracles, on which the security proof relies, cannot be performed by any polynomial time algorithm in the real world, because of the hardness of the decisional problem. In this paper we present a method incorporating a built-in decisional function into the protocols. The function transfers a hard decisional problem in the proof to an easy decisional problem. We then discuss the resulting efficiency of the schemes and the relevant security reductions, in the random oracle model, in the context of different pairings one can use. We pay particular attention, unlike most other papers in the area, to the issues which arise when using asymmetric pairings.