The DOI matches its Crossref record; 1 of the 1 references it cites were found in a registry or an index.
Efficient self-healing group key distribution with revocation capability
Abstract
This paper presents group key distribution techniques for large and dynamic groups over unreliable channels. The techniques proposed here are based on the self-healing key distribution methods (with revocation capability) recently developed by Staddon et al. [31]. By introducing a novel personal key distribution technique, this paper reduces (1) the communication overhead of personal key share distribution from O(t log q) to O(t log q), (2) the communication overhead of self-healing key distribution with t-revocation capability from O((mt + tm) log q) to O(mt log q), and (3) the storage overhead of the self-healing key distribution with t-revocation capability at each group member from O(m log q) to O(m log q), where t is the maximum number of colluding group members, m is the number of sessions, and q is a prime number that is large enough to accommodate a cryptographic key. All these results are achieved without sacrificing the unconditional security of key distribution. In addition, this paper presents two techniques that allow trade-off between the broadcast size and the recoverability of lost session keys. These two methods further reduce the broadcast message size in situations where there are frequent but short-term disruptions of communication and where there are long-term but infrequent disruptions of communication, respectively. Finally, this paper presents an API implementation of the proposed techniques.
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
Shamir, A. (1979) · Communications of the ACM · doi:10.1145/359168.359176 · Cited by 13,756
Cited by
A survey of key management schemes in wireless sensor networks
Xiao, Y., Rayi, V. K., Sun, B., Du, X., Hu, F., & Galloway, M. (2007) · Computer Communications · doi:10.1016/j.comcom.2007.04.009 · Cited by 582
A survey of security issues in mobile ad hoc and sensor networks
Djenouri, D., Khelladi, L., & Badache, A. N. (2005) · IEEE Communications Surveys & Tutorials · doi:10.1109/comst.2005.1593277 · Cited by 492
Combinatorial Design of Key Distribution Mechanisms for Wireless Sensor Networks
Camtepe, S. A., & Yener, B. (2007) · IEEE/ACM Transactions on Networking · doi:10.1109/tnet.2007.892879 · Cited by 365
Metadata
- Authors
- Liu, D., Ning, P., & Sun, K.
- Venue
- Proceedings of the 10th ACM conference on Computer and communications security
- Publisher
- ACM
- Published
- 2003-10-27
- Pages
- 231-240
- ISSN
- 1543-7221 (ISSN-L)
- OpenAlex
- W2106806183
- Cited by
- 198
- References
- 1
- FWCI
- 8.59
- 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: Efficient self-healing group key distribution with revocation capability. https://app.cochat.ai/papers/10.1145/948109.948141
- The paper
- Liu, D., Ning, P., & Sun, K. (2003). Efficient self-healing group key distribution with revocation capability. Proceedings of the 10th ACM conference on Computer and communications security. https://doi.org/10.1145/948109.948141
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.