The DOI matches its Crossref record; 2 of the 2 references it cites were found in a registry or an index.
Authenticated group key agreement and friends
Abstract
Many modern computing environments involve dynamic peer groups. Distributed simulation, multi-user games, conferencing and replicated servers are just a few examples. Given the openness of today's networks, communication among group members must be secure and, at the same time, efficient. This paper studies the problem of authenticated key agreement in dynamic peer groups with the emphasis on efficient and provably secure key authentication, key confirmation and integrity. It begins by considering 2-party authenticated key agreement and extends the results to Group Diffie-Hellman key agreement. In the process, some new security properties (unique to groups) are discussed. 1 Introduction This paper is concerned with security services in the context of dynamic peer groups (DPGs). Such groups are common in many network protocol layers and in many areas of modern computing and the solution to their security needs, in particular key management, are still open research challenges [19]. Exa...
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Handbook of applied cryptography
(1997) · Choice Reviews Online · doi:10.5860/choice.34-4512 · Cited by 10,357
Entity Authentication and Key Distribution
Bellare, M., & Rogaway, P. (2007) · Lecture Notes in Computer Science · doi:10.1007/3-540-48329-2_21 · Cited by 1,752
Cited by
Key establishment in large dynamic groups using one-way function trees
Sherman, A. T., & McGrew, D. A. (2003) · IEEE Transactions on Software Engineering · doi:10.1109/tse.2003.1199073 · Cited by 713
Tree-based group key agreement
Kim, Y., Perrig, A., & Tsudik, G. (2004) · ACM Transactions on Information and System Security · doi:10.1145/984334.984337 · Cited by 492
Self-citationSimple and fault-tolerant key agreement for dynamic collaborative groups
Kim, Y., Perrig, A., & Tsudik, G. (2000) · Proceedings of the 7th ACM conference on Computer and Communications Security · doi:10.1145/352600.352638 · Cited by 488
Self-citationScalable Protocols for Authenticated Group Key Exchange
Katz, J., & Yung, M. (2003) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-45146-4_7 · Cited by 393
A survey on peer-to-peer key management for mobile ad hoc networks
Merwe, J. V. D., Dawoud, D., & McDonald, S. (2007) · ACM Computing Surveys · doi:10.1145/1216370.1216371 · Cited by 343
Metadata
- Authors
- Ateniese, G., Steiner, M., & Tsudik, G.
- Venue
- Proceedings of the 5th ACM conference on Computer and communications security
- Publisher
- ACM
- Published
- 1998-11
- Pages
- 17-26
- ISSN
- 1543-7221 (ISSN-L)
- OpenAlex
- W2049088527
- Cited by
- 176
- References
- 2
- FWCI
- 4.51
- Type
- conference paper
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Authenticated group key agreement and friends. https://app.cochat.ai/papers/10.1145/288090.288097
- The paper
- Ateniese, G., Steiner, M., & Tsudik, G. (1998). Authenticated group key agreement and friends. Proceedings of the 5th ACM conference on Computer and communications security. https://doi.org/10.1145/288090.288097
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.