Filters








16 Hits in 8.4 sec

Strongly Secure One Round Authenticated Key Exchange Protocol with Perfect Forward Security [chapter]

Hai Huang
2011 Lecture Notes in Computer Science  
First, our protocol is shown secure in the eCK model under the gap Diffie-Hellman (GDH) assumption.  ...  This paper investigates the two-pass authenticated key exchange protocol in the enhanced Canetti-Krawczyk (eCK) with perfect forward security.  ...  First, without the NAXOS transformation our protocol is shown secure in the eCK model under the gap Diffie-Hellman (GDH) assumption.  ... 
doi:10.1007/978-3-642-24316-5_28 fatcat:jhjcdpldfbhdbncneyuoc7ytpi

TMQV: A Strongly eCK-Secure Diffie-Hellman Protocol without Gap Assumption [chapter]

Jiaxin Pan, Libin Wang
2011 Lecture Notes in Computer Science  
In this paper, we propose an authenticated key exchange (AKE) protocol under the computational Diffie-Hellman (CDH) assumption with respect to the strengthened eCK-security (seCK-security) of Sarr et al  ...  To date, many AKE protocols either are provably secure under a rather strong and nonstandard assumption named as the gap Diffie-Hellman (GDH) assumption, or fall to practical attacks on the intermediate  ...  Sarr for helpful discussions on improving the security proof.  ... 
doi:10.1007/978-3-642-24316-5_27 fatcat:j53mo6cjafg6xeynbmqfwwmsf4

Strongly Secure Authenticated Key Exchange without NAXOS' Approach [chapter]

Minkyu Kim, Atsushi Fujioka, Berkant Ustaoğlu
2009 Lecture Notes in Computer Science  
In this paper, we show that it is possible to construct eCK-secure protocol without the NAXOS' approach by proposing two eCK-secure protocols.  ...  One is secure under the GDH assumption and the other under the CDH assumption; their efficiency and security assurances are comparable to the well-known HMQV [12] protocol.  ...  Using NAXOS' approach many protocols [25, 11, 16, 17] were argued secure in the eCK model under the random oracle assumption.  ... 
doi:10.1007/978-3-642-04846-3_12 fatcat:5avzaqy3drfhznblqmaix2kkoa

Tightly-Secure Authenticated Key Exchange without NAXOS' Approach Based on Decision Linear Problem

Mojahed Mohamed, Xiaofen Wang, Xiaosong Zhang
2016 OALib  
Design secure Authenticated Key Exchange (AKE) protocol without NAXOS approach is remaining as an open problem.  ...  In this paper, we present another AKE-secure without NAXOS approach based on decision linear assumption in the random oracle model.  ...  Kim, Minkyu, Atsushi Fujioka, and Berkant Ustaolu [10] proposed two strongly secure authenticated key exchange protocols without NAXOSapproach, one of their protocol supposed to be secure under the GDH  ... 
doi:10.4236/oalib.1103033 fatcat:ihqfxeip45finep4tfuvsgxd6e

Strongly Authenticated Key Exchange Protocol from Bilinear Groups without Random Oracles [chapter]

Zheng Yang, Jörg Schwenk
2012 Lecture Notes in Computer Science  
In contrast to previous schemes, we present an eCK secure protocol in the standard model, without NAXOS trick and without knowledge of secret key (KOSK) assumption for public key registration.  ...  The security proof of our scheme is based on standard pairing assumption, collision resistant hash functions, Bilinear Decision Diffie-Hellman (BDDH) and Decision Linear Diffie-Hellman (DLIN) assumptions  ...  Conclusions We have presented an efficient eCK-secure key exchange protocols without random oracles (and without NAXOS trick), that the security against chosen public key attacks without KOSK assumption  ... 
doi:10.1007/978-3-642-33272-2_17 fatcat:lum33jpjujcb3atv6egyc3jpu4

Beyond eCK: Perfect Forward Secrecy under Actor Compromise and Ephemeral-Key Reveal [chapter]

Cas Cremers, Michèle Feltz
2012 Lecture Notes in Computer Science  
Given a two-message Diffie-Hellman type protocol secure in eCK w , our transformation yields a two-message protocol that is secure in eCK-PFS.  ...  We show that it is possible to achieve perfect forward secrecy in two-message or one-round key exchange (KE) protocols that satisfy even stronger security properties than provided by the extended Canetti-Krawczyk  ...  ' protocol Proposition 3 . 3 Under the Computational Diffie-Hellman assumption in the cyclic group G of prime order p, the session string variant of the NAXOS' protocol is secure in the cNR-eCK w model  ... 
doi:10.1007/978-3-642-33167-1_42 fatcat:puq2mzsvfbaolaycemnkhvqxoi

Beyond eCK: perfect forward secrecy under actor compromise and ephemeral-key reveal

Cas Cremers, Michèle Feltz
2013 Designs, Codes and Cryptography  
Given a two-message Diffie-Hellman type protocol secure in eCK w , our transformation yields a two-message protocol that is secure in eCK-PFS.  ...  We show that it is possible to achieve perfect forward secrecy in two-message or one-round key exchange (KE) protocols that satisfy even stronger security properties than provided by the extended Canetti-Krawczyk  ...  ' protocol Proposition 3 . 3 Under the Computational Diffie-Hellman assumption in the cyclic group G of prime order p, the session string variant of the NAXOS' protocol is secure in the cNR-eCK w model  ... 
doi:10.1007/s10623-013-9852-1 fatcat:msixyv5ojzafnogois5kqix2z4

A strongly secure identity-based authenticated group key exchange protocol

JiKai Teng, ChuanKun Wu, ChunMing Tang, YouLiang Tian
2015 Science China Information Sciences  
A strongly secure identity-based authenticated group key exchange protocol.  ...  It achieves mutual authentication without applying signature, which makes the protocol more practical.  ...  Computional Diffie-Hellman (CDH) Problem. CDH problem in G 1 is to compute abP when given (P, aP, bP ) with P ∈ G 1 , a, b ∈ Z * q .  ... 
doi:10.1007/s11432-014-5271-9 fatcat:najy4lhw4zaalkxiwqwmtbandu

Practical and Tightly-Secure Digital Signatures and Authenticated Key Exchange [chapter]

Kristian Gjøsteen, Tibor Jager
2018 Lecture Notes in Computer Science  
However, for many important cryptographic primitives, including digital signatures and authenticated key exchange (AKE), we are still lacking constructions that are suitable for real-world deployment.  ...  It is essentially the "signed Diffie-Hellman" protocol, but with an additional message, which is crucial to achieve tight security.  ...  Given the huge demand for efficient key exchange protocol in practice, the construction of a simple and efficient, yet tightly-secure, authenticated key exchange protocol without these drawbacks is an  ... 
doi:10.1007/978-3-319-96881-0_4 fatcat:vly43n24jvehhfyc3ihpswstta

No-Match Attacks and Robust Partnering Definitions

Yong Li, Sven Schäge
2017 Proceedings of the 2017 ACM SIGSAC Conference on Computer and Communications Security - CCS '17  
An essential cornerstone of the definition of security for key exchange protocols is the notion of partnering.  ...  Our new notion of partnering not only makes security definitions for key exchange model practice much more closely.  ...  As a running example used here and later on we may more concretely use signed Diffie-Hellman (i.e. the basic Diffie-Hellman key exchange where each DH share is accompanied by a signature over that share  ... 
doi:10.1145/3133956.3134006 dblp:conf/ccs/LiS17 fatcat:r5547dis3ndvtpke5jpb5nn4qm

Strongly Secure Certificateless Key Agreement [chapter]

Georg Lippold, Colin Boyd, Juan Gonzalez Nieto
2009 Lecture Notes in Computer Science  
We introduce a formal model for certificateless authenticated key exchange (CL-AKE) protocols.  ...  We provide the first one-round CL-AKE scheme proven secure in the random oracle model. We introduce two variants of the Diffie-Hellman trapdoor introduced by [CKS08].  ...  bilinear Diffie-Hellman (CBDH) assumption and the computational Diffie-Hellman (CDH) assumption.  ... 
doi:10.1007/978-3-642-03298-1_14 fatcat:7mia5g3bw5dopksrbqopvti5ni

Symbolically analyzing security protocols using tamarin

David Basin, Cas Cremers, Jannik Dreier, Ralf Sasse
2017 ACM SIGLOG News  
Example: Diffie-Hellman Key Exchange Input..  ...  Key Exchange Protocols. We used TAMARIN to analyze many authenticated key exchange protocols with respect to their intended adversary models ].  ... 
doi:10.1145/3157831.3157835 fatcat:au2tz4fvajfm7p4yeyqlwj6aeq

Session-StateReveal is stronger than eCKs EphemeralKeyReveal: using automatic analysis to attack the NAXOS protocol

Cas J.F. Cremers
2010 International Journal of Applied Cryptography  
In the paper "Stronger Security of Authenticated Key Exchange" [11, 12] , a new security model for authenticated key exchange protocols (eCK) is proposed.  ...  The new model is suggested to be at least as strong as previous models for key exchange protocols, such as the CK model [5, 10] .  ...  First, consider the 2-message signed Diffie-Hellman protocol that was proven secure in the CK model in [5] under the assumption that the session-state only contains the random numbers.  ... 
doi:10.1504/ijact.2010.038304 fatcat:7uxnurroj5dtneey7sf45rizwi

Forsakes: A forward-secure authenticated key exchange protocol based on symmetric key-evolving schemes

Rasool Jalili, Mohammad Sadeq Dousti
2015 Advances in Mathematics of Communications  
This paper suggests a model and a definition for forward-secure authenticated key exchange (AKE) protocols, which can be satisfied without depending on the Diffie-Hellman assumption.  ...  Most (if not all) provably-secure AKE protocols satisfying the forward security property use a variant of the Diffie-Hellman (DH) protocol [20] , which requires the heavy modular exponentiations.  ...  For instance, [11, 18, 30] are proven secure in the random oracle model, but use some form of the Diffie-Hellman assumption as well (e.g., Decisional Diffie-Hellman or Gap Diffie-Hellman). • Since we  ... 
doi:10.3934/amc.2015.9.471 fatcat:cgsqkpprhvf77i5cwyvofsejya

Strongly Secure Authenticated Key Exchange from Factoring, Codes, and Lattices [chapter]

Atsushi Fujioka, Koutarou Suzuki, Keita Xagawa, Kazuki Yoneyama
2012 Lecture Notes in Computer Science  
In addition, instantiations under the Diffie-Hellman assumption or its variant can be proved to have strong security without non-standard assumptions such as πPRF and KEA1.  ...  An unresolved problem in research on authenticated key exchange (AKE) is to construct a secure protocol against advanced attacks such as key compromise impersonation and maximal exposure attacks without  ...  However, the security proof is given in the random oracle model (ROM) under a specific number-theoretic assumption (Diffie-Hellman (DH) assumption).  ... 
doi:10.1007/978-3-642-30057-8_28 fatcat:zkf34dduzfc7xluq5bescavftq
« Previous Showing results 1 — 15 out of 16 results