Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

ACM Transactions on Internet Technology

LAKE: A Server-Side Authenticated Key-Establishment with Low Computational Workload

Kemal Biçakcı, Bruno Crispo, Gabriele Oligeri

Published Dec 1, 2013• 0 citations
Publisher

Abstract

Server-side authenticated key-establishment protocols are characterized by placing a heavy workload on the server. We propose LAKE: a new protocol that enables amortizing servers’ workload peaks by moving most of the computational burden to the clients. We provide a formal analysis of the LAKE protocol under the Canetti-Krawczyk model and prove it to be secure. To the best of our knowledge, this is the most computationally efficient authenticated key-establishment ever proposed in the literature.

DOI
10.1145/2542214.2542216

Related papers

Modified Client-Server-Client Authenticated Key Agreement Protocols for Resource-Limited Environments

Zuowen Tan

An authenticated key agreement protocol only allows the intended parties to compute the session key. In this paper, new client-server-client authenticated key agreement protocols in the public key setting have been proposed. The new protocols are proven secure in the formal security model. Compared with the client-server-client authenticated key agreement protocols in the literature, the proposed protocols possess stronger security and higher efficiency.

網際網路技術學刊•Mar 1, 2012•0 citations

Strongly Secure Identity-based Authenticated Key Exchange Protocol

Jian Shu

Recently,LaMacchia et al.proposed the extended Canetti-Krawczyk(eCK) model,which captures all security properties of authenticated key enchange protocols.Most of existing identity-based authenticated key exchange protocols are not secure in the eCK model.This paper proposes an identity-based authenticated key exchange protocol,and the security of proposed protocol can be proved in the eCK model.When compaer with other schemes,the proposed protocol achieves efficiency in terms of computation and communication.The proposal achieve strong security,and can be proved under the random oracle assumption and the Gap Bilinear Diffie-Hellman assumption.

Journal of Chinese Computer Systems•Jan 1, 2011•0 citations

Certificateless Key Agreement Protocols under Strong Models

Denise Goya, Dionathan Nakamura, Routo Terada

Two new authenticated key agreement protocols in the certificateless setting are presented in this paper. Both are proved secure in the extended Canetti-Krawczyk model, under the BDH assumption. The first one is more efficient than the Lippold et al.'s (LBG) protocol, and is proved secure in the same security model. The second protocol is proved secure under the Swanson et al.'s security model, a weaker model. As far as we know, our second proposed protocol is the first one proved secure in the Swanson et al.'s security model. If no pre-computations are done, the first protocol is about 26% faster than LBG, and the second protocol is about 49% faster than LBG, and about 31% faster than the first one. If pre-computations of some operations are done, our two protocols remain faster.

IEICE Transactions on Fundamentals of Electronics Communications and Computer Sciences•Jan 1, 2016•6 citations

An Efficient Authenticated Key Exchange Protocol with a Tight Security Reduction.

Jooyoung Lee, Choon‐Sik Park

In this paper, we present a new authenticated key exchange(AKE) protocol, called NETS, and prove its security in the extended Canetti-Krawczyk model under the random oracle assumption and the gap Diffie-Hellman(GDH) assumption. Our protocol enjoys a simple and tight security reduction compared to those of HMQV and CMQV without using the Forking Lemma. Each session of the NETS protocol requires only three exponentiations per party, which is comparable to the efficiency of MQV, HMQV and CMQV.

•Jan 1, 2008•27 citations

Efficient eCK-secure Authenticated Key Exchange Protocols in the Standard Model.

Zheng Yang

The extended Canetti–Krawczyk (eCK) security models, are widely used to provide security arguments for authenticated key exchange protocols that capture leakage of various kinds of secret information like the long-term private key and session-specific secret state. In this paper, we study the open problem on constructing eCK secure AKE protocol without random oracles and NAXOS like trick. A generic construction GC-KKN satisfying those requirements is first given relying on standard cryptographic primitives following the guideline of efficiency. On the second a concrete protocol is proposed which is the first eCK secure protocol in the standard model under both standard assumptions and post-specified peer setting. Both proposed schemes can be more efficiently implemented with secure device than previous eCK secure protocols in the standard model, where the secure device might be normally used to store the long-term private key and implement algorithms of protocol which require to be resilience of state leakage.

•Jan 1, 2013•0 citations

A New Efficient and Strongly Secure Authenticated Key Exchange Protocol

Qingfeng Cheng, Guangguo Han, Chuangui Ma

In 2007, LaMacchia et al.proposed the extended Canetti-Krawczyk (eCK) model for authenticated key exchange (AKE) protocols. In this paper, we first modify the eCK model by adding a new query to make the adversary can reveal all ephemeral secret information. Then we propose a new efficient and strongly secure AKE protocol in the asymmetric setting, called E-NETS (enhanced NETS) protocol, and prove its security in the modified eCK (meCK) model under the random oracle assumption and the gap Diffie-Hellman assumption.

International Conference on Information Assurance and Security (IAS)•Jan 1, 2009•6 citations
Server-side authenticated key-establishment protocols are characterized by placing a heavy workload on the server. We propose LAKE: a new protocol that enables amortizing servers’ workload peaks by moving most of the computational burden to the clients. We provide a formal analysis of the LAKE protocol under the Canetti-Krawczyk model and prove it to be secure. To the best of our knowledge, this is the most computationally efficient authenticated key-establishment ever proposed in the literature.
Recently,LaMacchia et al.proposed the extended Canetti-Krawczyk(eCK) model,which captures all security properties of authenticated key enchange protocols.Most of existing identity-based authenticated key exchange protocols are not secure in the eCK model.This paper proposes an identity-based authenticated key exchange protocol,and the security of proposed protocol can be proved in the eCK model.When compaer with other schemes,the proposed protocol achieves efficiency in terms of computation and communication.The proposal achieve strong security,and can be proved under the random oracle assumption and the Gap Bilinear Diffie-Hellman assumption.
Two new authenticated key agreement protocols in the certificateless setting are presented in this paper. Both are proved secure in the extended Canetti-Krawczyk model, under the BDH assumption. The first one is more efficient than the Lippold et al.'s (LBG) protocol, and is proved secure in the same security model. The second protocol is proved secure under the Swanson et al.'s security model, a weaker model. As far as we know, our second proposed protocol is the first one proved secure in the Swanson et al.'s security model. If no pre-computations are done, the first protocol is about 26% faster than LBG, and the second protocol is about 49% faster than LBG, and about 31% faster than the first one. If pre-computations of some operations are done, our two protocols remain faster.
The extended Canetti–Krawczyk (eCK) security models, are widely used to provide security arguments for authenticated key exchange protocols that capture leakage of various kinds of secret information like the long-term private key and session-specific secret state. In this paper, we study the open problem on constructing eCK secure AKE protocol without random oracles and NAXOS like trick. A generic construction GC-KKN satisfying those requirements is first given relying on standard cryptographic primitives following the guideline of efficiency. On the second a concrete protocol is proposed which is the first eCK secure protocol in the standard model under both standard assumptions and post-specified peer setting. Both proposed schemes can be more efficiently implemented with secure device than previous eCK secure protocols in the standard model, where the secure device might be normally used to store the long-term private key and implement algorithms of protocol which require to be resilience of state leakage.
In 2007, LaMacchia et al.proposed the extended Canetti-Krawczyk (eCK) model for authenticated key exchange (AKE) protocols. In this paper, we first modify the eCK model by adding a new query to make the adversary can reveal all ephemeral secret information. Then we propose a new efficient and strongly secure AKE protocol in the asymmetric setting, called E-NETS (enhanced NETS) protocol, and prove its security in the modified eCK (meCK) model under the random oracle assumption and the gap Diffie-Hellman assumption.