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

Information Sciences

Pitfalls in a server-aided authenticated group key establishment

María Isabel González Vasco, Ángel Luis Pérez del Pozo, Adriana Suárez Corona

Published May 12, 2016• 1 citation
Publisher
DOI
10.1016/j.ins.2016.05.004

Related papers

An Improved Protocol for Server-Aided Authenticated Group Key Establishment

Junghyun Nam, Juryon Paik, Byunghee Lee +2 more

Lecture notes in computer science•Jan 1, 2011•2 citations

(Password) Authenticated Key Establishment: From 2-Party to Group

Michel Ferreira Abdalla, Jens-Matthias Bohli, María Isabel González Vasco +1 more

Lecture notes in computer science•Jan 1, 2007•47 citations

Security Analysis of a Server-Aided RSA Key Generation Protocol

Tianjie Cao, Xianping Mao, Dongdai Lin

Lecture notes in computer science•Jan 1, 2006•9 citations

One-Round Authenticated Group Key Establishment Using Multilinear Maps

Kashi Neupane

Communications in computer and information science•Jan 1, 2018•3 citations

Server-Controlled Identity-Based Authenticated Key Exchange

Hua Guo, Yi Mu, Xiyong Zhang +1 more

Lecture notes in computer science•Jan 1, 2009•1 citation

LAKE

Kemal Biçakcı, Bruno Crispo A, Gabriele Oligeri

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.

ACM Transactions on Internet Technology•Dec 1, 2013•0 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.