The DOI matches its Crossref record; 2 of the 2 references it cites were found in a registry or an index.
VeRA - Version Number and Rank Authentication in RPL
Abstract
Designing a routing protocol for large low-power and lossy networks (LLNs), consisting of thousands of constrained nodes and unreliable links, presents new challenges. The IPv6 Routing Protocol for Low-power and Lossy Networks (RPL), have been developed by the IETF ROLL Working Group as a preferred routing protocol to provide IPv6 routing functionality in LLNs. RPL provides path diversity by building and maintaining directed acyclic graphs (DAG) rooted at one (or more) gateway. However, an adversary that impersonates a gateway or has compromised one of the nodes close to the gateway can divert a large part of network traffic forward itself and/or exhaust the nodes' batteries. Therefore in RPL, special security care must be taken when the Destination Oriented Directed Acyclic Graph (DODAG) root is updating the Version Number by which reconstruction of the routing topology can be initiated. The same care also must be taken to prevent an internal attacker (compromised DODAG node) to publish decreased Rank value, which causes a large part of the DODAG to connect to the DODAG root via the attacker and give it the ability to eavesdrop a large part of the network traffic forward itself. Unfortunately, the currently available security services in RPL will not protect against a compromised internal node that can construct and disseminate fake messages. In this paper, a new security service is described that prevents any misbehaving node from illegitimately increasing the Version Number and compromise illegitimate decreased Rank values.
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
A method for obtaining digital signatures and public-key cryptosystems
Rivest, R. L., Shamir, A., & Adleman, L. (1978) · Communications of the ACM · doi:10.1145/359340.359342 · Cited by 13,462
Password authentication with insecure communication
Lamport, L. (1981) · Communications of the ACM · doi:10.1145/358790.358797 · Cited by 2,789
Cited by
IoT security: Review, blockchain solutions, and open challenges
Khan, M. A., & Salah, K. (2018) · Future Generation Computer Systems · doi:10.1016/j.future.2017.11.022 · Cited by 2,488
Security of the Internet of Things: Vulnerabilities, Attacks, and Countermeasures
Butun, I., Osterberg, P., & Song, H. (2020) · IEEE Communications Surveys & Tutorials · doi:10.1109/comst.2019.2953364 · Cited by 707
Gaddour, O., & Koubâa, A. (2012) · Computer Networks · doi:10.1016/j.comnet.2012.06.016 · Cited by 323
Secure routing for internet of things: A survey
Airehrour, D., Gutierrez, J., & Ray, S. K. (2016) · Journal of Network and Computer Applications · doi:10.1016/j.jnca.2016.03.006 · Cited by 323
A survey: Attacks on RPL and 6LoWPAN in IoT
Pongle, P., & Chavan, G. (2015) · 2015 International Conference on Pervasive Computing (ICPC) · doi:10.1109/pervasive.2015.7087034 · Cited by 282
Metadata
- Authors
- Dvir, A., Holczer, T., & Buttyan, L.
- Venue
- 2011 IEEE Eighth International Conference on Mobile Ad-Hoc and Sensor Systems
- Publisher
- IEEE
- Published
- 2011-10
- Pages
- 709-714
- OpenAlex
- W1988828201
- Cited by
- 218
- References
- 2
- FWCI
- 3.71
- 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: VeRA - Version Number and Rank Authentication in RPL. https://app.cochat.ai/papers/10.1109/mass.2011.76
- The paper
- Dvir, A., Holczer, T., & Buttyan, L. (2011). VeRA - Version Number and Rank Authentication in RPL. 2011 IEEE Eighth International Conference on Mobile Ad-Hoc and Sensor Systems. https://doi.org/10.1109/mass.2011.76
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.