The DOI matches its Crossref record; 26 of the 26 references it cites were found in a registry or an index.
${\cal CPAS}$: An Efficient Conditional Privacy-Preserving Authentication Scheme for Vehicular Sensor Networks
Abstract
In this paper, we propose a conditional privacy-preserving authentication scheme, calledCPAS, using pseudo-identity-based signatures for secure vehicle-to-infrastructure communications in vehicular ad hoc networks. The scheme achieves conditional privacy preservation, in which each message launched by a vehicle is mapped to a distinct pseudo-identity, and a trust authority can always retrieve the real identity of a vehicle from any pseudo-identity. In the scheme, a roadside unit (RSU) can simultaneously verify multiple received signatures, thus considerably reducing the total verification time; an RSU can simultaneously verify 2540 signed-messages/s. The time for simultaneously verifying 800 signatures in our scheme can be reduced by 18%, compared with the previous scheme.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
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 1×
“One way of protecting this key is by distributing it among different sites using techniques of threshold cryptography [7], [8]: The master secret key s (α) can easily be distributed in a k-out-of-n fashion by giving each of the n PKGs (TRAs) one share si (αi) of a Shamir secret sharing of s (α) mod q [25].”
MethodIdentity-Based Encryption from the Weil Pairing
Boneh, D., & Franklin, M. (2001) · Lecture Notes in Computer Science · doi:10.1007/3-540-44647-8_13 · Cited by 7,060
Identity-Based Cryptosystems and Signature Schemes
Shamir, A. (2007) · Lecture Notes in Computer Science · doi:10.1007/3-540-39568-7_5 · Cited by 6,635
Douceur, J. R. (2002) · Lecture Notes in Computer Science · doi:10.1007/3-540-45748-8_24 · Cited by 4,419 · cited 1×
“We would like to enforce short-term linkability in order that a malicious vehicle cannot launch Sybil attacks [5], [28], where a single vehicle impersonates multiple vehicles.”
BackgroundShort Signatures from the Weil Pairing
Boneh, D., Lynn, B., & Shacham, H. (2001) · Lecture Notes in Computer Science · doi:10.1007/3-540-45682-1_30 · Cited by 2,993
A Digital Signature Scheme Secure Against Adaptive Chosen-Message Attacks
Goldwasser, S., Micali, S., & Rivest, R. L. (1988) · SIAM Journal on Computing · doi:10.1137/0217017 · Cited by 2,804
Security Arguments for Digital Signatures and Blind Signatures
Pointcheval, D., & Stern, J. (2000) · Journal of Cryptology · doi:10.1007/s001450010003 · Cited by 2,209
Securing vehicular ad hoc networks
Raya, M., & Hubaux, J.-P. (2007) · Journal of Computer Security · doi:10.3233/jcs-2007-15103 · Cited by 1,709
The security of vehicular ad hoc networks
Raya, M., & Hubaux, J.-P. (2005) · Proceedings of the 3rd ACM workshop on Security of ad hoc and sensor networks · doi:10.1145/1102219.1102223 · Cited by 978
Tamper resistance: a cautionary note
Anderson, R., & Kühn, M. (1996) · Cited by 921
Cited by
He, D., Zeadally, S., Xu, B., & Huang, X. (2015) · IEEE Transactions on Information Forensics and Security · doi:10.1109/tifs.2015.2473820 · Cited by 881
A Security and Privacy Review of VANETs
Qu, F., Wu, Z., Wang, F., & Cho, W. (2015) · IEEE Transactions on Intelligent Transportation Systems · doi:10.1109/tits.2015.2439292 · Cited by 478
Zhang, J., Cui, J., Zhong, H., Chen, Z., & Liu, L. (2021) · IEEE Transactions on Dependable and Secure Computing · doi:10.1109/tdsc.2019.2904274 · Cited by 341
A survey on authentication schemes in VANETs for secured communication
Manvi, S. S., & Tangade, S. (2017) · Vehicular Communications · doi:10.1016/j.vehcom.2017.02.001 · Cited by 311
Lo, N.-W., & Tsai, J.-L. (2016) · IEEE Transactions on Intelligent Transportation Systems · doi:10.1109/tits.2015.2502322 · Cited by 307
A Secure Authentication Protocol for Internet of Vehicles
Chen, C.-M., Xiang, B., Liu, Y., & Wang, K.-H. (2019) · IEEE Access · doi:10.1109/access.2019.2891105 · Cited by 305
A review on safety failures, security attacks, and available countermeasures for autonomous vehicles
Cui, J., Liew, L. S., Sabaliauskaite, G., & Zhou, F. (2019) · Ad Hoc Networks · doi:10.1016/j.adhoc.2018.12.006 · Cited by 298
b-SPECS+: Batch Verification for Secure Pseudonymous Authentication in VANET
Horng, S.-J., Tzeng, S.-F., Pan, Y., Fan, P., Wang, X., Li, T., & Khan, M. K. (2013) · IEEE Transactions on Information Forensics and Security · doi:10.1109/tifs.2013.2277471 · Cited by 268
Lin, C., He, D., Huang, X., Kumar, N., & Choo, K.-K. R. (2021) · IEEE Transactions on Intelligent Transportation Systems · doi:10.1109/tits.2020.3002096 · Cited by 259
Enhancing Security and Privacy for Identity-Based Batch Verification Scheme in VANETs
Tzeng, S.-F., Horng, S.-J., Li, T., Wang, X., Huang, P.-H., & Khan, M. K. (2017) · IEEE Transactions on Vehicular Technology · doi:10.1109/tvt.2015.2406877 · Cited by 254
A comprehensive survey on authentication and privacy-preserving schemes in VANETs
Mundhe, P., Verma, S., & Venkatesan, S. (2021) · Computer Science Review · doi:10.1016/j.cosrev.2021.100411 · Cited by 108
Quantum secured 6G technology-based applications in Internet of Everything
Prateek, K., Ojha, N. K., Altaf, F., & Maity, S. (2023) · Telecommunication Systems · doi:10.1007/s11235-022-00979-y · Cited by 45
Metadata
- Authors
- Shim, K.-A.
- Venue
- IEEE Transactions on Vehicular Technology
- Published
- 2012-05
- Volume
- 61
- Issue
- 4
- Pages
- 1874-1883
- ISSN
- 0018-9545 (ISSN-L)
- 1939-9359
- OpenAlex
- W2039768170
- Cited by
- 337
- References
- 26
- FWCI
- 6.31
- Type
- journal article
- 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
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.