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

Lecture notes in computer science

Communication-Efficient 2-Round Group Key Establishment from Pairings

Kashi Neupane, Rainer Steinwandt

Published Jan 1, 2011• 10 citations
Publisher
DOI
10.1007/978-3-642-19074-2_5

Related papers

Long-Term Secure Two-Round Group Key Establishment from Pairings

Kashi Neupane

Communications in computer and information science•Jan 1, 2014•1 citation

Long-Term Secure One-Round Group Key Establishment from Multilinear Mappings

Kashi Neupane

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

One-Round Authenticated Group Key Establishment Using Multilinear Maps

Kashi Neupane

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

A Scalable ID-based Constant-round AGKE Protocol with Logarithmic Computation Complexity

Xiufeng Zhao, Qiuliang Xu, Hao Wang +1 more

Group key establishment is one of the basic building blocks in securing group communication. In this paper, motivated by Desmedt's BD-II protocol, we propose a secure ID-Based group key establishment protocol which has a constant number of rounds and requires only  computation and communication. Our scheme achieves key negotiate by scalar multiplication other than using pairing computation which requires expensive computation cost. Moreover, we have adapted aggregate signature technique verifying the validity of transcripts simultaneously, which greatly improves the computational efficiency. We have proved the security of protocol under the intractability of DDH problem in the RO model.

Journal of Networks•Sep 30, 2011•1 citation

On the Minimum Communication Effort for Secure Group Key Exchange

Frederik Armknecht, Jun Furukawa

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

Generic construction of deniable group key establishment from group key establishment

Bao Li

A generic way to construct a deniable group key establishment protocol from an unauthenticated group key es-tablishment protocol was proposed.The construction could be seen as a compiler.By using Schnorr's zero-knowledge identification scheme,this compiler could transform an unauthenticated group key establishment to a deniable group key establishment protocol with only additional two round communications and one round verification.It is very efficient and practical.The security and deniability proof is in the Random Oracle model.A concrete transforming example of the con-struction was also presented.

Journal of Communications•Jan 1, 2011•1 citation
Group key establishment is one of the basic building blocks in securing group communication. In this paper, motivated by Desmedt's BD-II protocol, we propose a secure ID-Based group key establishment protocol which has a constant number of rounds and requires only  computation and communication. Our scheme achieves key negotiate by scalar multiplication other than using pairing computation which requires expensive computation cost. Moreover, we have adapted aggregate signature technique verifying the validity of transcripts simultaneously, which greatly improves the computational efficiency. We have proved the security of protocol under the intractability of DDH problem in the RO model.
A generic way to construct a deniable group key establishment protocol from an unauthenticated group key es-tablishment protocol was proposed.The construction could be seen as a compiler.By using Schnorr's zero-knowledge identification scheme,this compiler could transform an unauthenticated group key establishment to a deniable group key establishment protocol with only additional two round communications and one round verification.It is very efficient and practical.The security and deniability proof is in the Random Oracle model.A concrete transforming example of the con-struction was also presented.