Loading…
Improving the Security of Wireless Communications on High-Speed Trains by Efficient Authentication in SCN-R
Recently, we have witnessed the remarkable development in high-speed railways around the world. To provide a robust and fast wireless network for the onboard passengers, we have earlier proposed smart collaborative networking for railways (SCN-R). In the realization of SCN-R, its security is challen...
Saved in:
Published in: | IEEE transactions on vehicular technology 2019-08, Vol.68 (8), p.7283-7295 |
---|---|
Main Authors: | , , , , , |
Format: | Article |
Language: | English |
Subjects: | |
Citations: | Items that this one cites Items that cite this one |
Online Access: | Get full text |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
cited_by | cdi_FETCH-LOGICAL-c333t-c4fcb41074eb027ab1a964d011649855249e9a645863fc8cc9cc81ca470701083 |
---|---|
cites | cdi_FETCH-LOGICAL-c333t-c4fcb41074eb027ab1a964d011649855249e9a645863fc8cc9cc81ca470701083 |
container_end_page | 7295 |
container_issue | 8 |
container_start_page | 7283 |
container_title | IEEE transactions on vehicular technology |
container_volume | 68 |
creator | Xu, Tong Gao, Deyun Dong, Ping Foh, Chuan Heng Zhang, Hongke Leung, Victor C. M. |
description | Recently, we have witnessed the remarkable development in high-speed railways around the world. To provide a robust and fast wireless network for the onboard passengers, we have earlier proposed smart collaborative networking for railways (SCN-R). In the realization of SCN-R, its security is challenged by potential exploitation of authentication vulnerabilities since traditional authentication mechanisms are unsuitable for scenarios with fast moving objects due to their complex and relatively timely operations. In this paper, we address this issue by proposing a new efficient authentication mechanism, which is based on a new design of chaotic random number generator (RNG). Comparing with the recent proposal relying on the precise boundaries of chaotic map state spaces, our RNG uses two logistic maps to avoid the time-consuming boundary location process. The proposed authentication mechanism uses the RNG to generate and validate the one-time password (OTP). To support different authentication applications, different lengths of OTPs can be used to differentiate and identify the applications. We have implemented our proposed authentication mechanism under real-world conditions, with results showing the feasibility and effectiveness of our authentication mechanism. |
doi_str_mv | 10.1109/TVT.2019.2920988 |
format | article |
fullrecord | <record><control><sourceid>proquest_ieee_</sourceid><recordid>TN_cdi_ieee_primary_8731692</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><ieee_id>8731692</ieee_id><sourcerecordid>2275622052</sourcerecordid><originalsourceid>FETCH-LOGICAL-c333t-c4fcb41074eb027ab1a964d011649855249e9a645863fc8cc9cc81ca470701083</originalsourceid><addsrcrecordid>eNo9kM1LAzEQxYMoWKt3wUvA89Z87ibHUqotFAW76jFk02yb2s3WZFfof29Ki6dhhvfe8H4A3GM0whjJp_KzHBGE5YhIgqQQF2CAJZWZpFxeggFCWGSSM34NbmLcppUxiQfge97sQ_vr_Bp2GwuX1vTBdQfY1vDLBbuzMcJJ2zS9d0Z3rvURth7O3HqTLffWrmAZtEvH6gCnde2Ms76D4z5l-e7sgM7D5eQ1e78FV7XeRXt3nkPw8TwtJ7Ns8fYyn4wXmaGUdplhtakYRgWzFSKFrrCWOVshjHMmBeeESSt1zrjIaW2EMdIYgY1mBSoQRoIOweMpNzX76W3s1Lbtg08vFSEFzwlBnCQVOqlMaGMMtlb74BodDgojdUSqElJ1RKrOSJPl4WRx1tp_uSgoziWhf2XIccw</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>2275622052</pqid></control><display><type>article</type><title>Improving the Security of Wireless Communications on High-Speed Trains by Efficient Authentication in SCN-R</title><source>IEEE Xplore (Online service)</source><creator>Xu, Tong ; Gao, Deyun ; Dong, Ping ; Foh, Chuan Heng ; Zhang, Hongke ; Leung, Victor C. M.</creator><creatorcontrib>Xu, Tong ; Gao, Deyun ; Dong, Ping ; Foh, Chuan Heng ; Zhang, Hongke ; Leung, Victor C. M.</creatorcontrib><description>Recently, we have witnessed the remarkable development in high-speed railways around the world. To provide a robust and fast wireless network for the onboard passengers, we have earlier proposed smart collaborative networking for railways (SCN-R). In the realization of SCN-R, its security is challenged by potential exploitation of authentication vulnerabilities since traditional authentication mechanisms are unsuitable for scenarios with fast moving objects due to their complex and relatively timely operations. In this paper, we address this issue by proposing a new efficient authentication mechanism, which is based on a new design of chaotic random number generator (RNG). Comparing with the recent proposal relying on the precise boundaries of chaotic map state spaces, our RNG uses two logistic maps to avoid the time-consuming boundary location process. The proposed authentication mechanism uses the RNG to generate and validate the one-time password (OTP). To support different authentication applications, different lengths of OTPs can be used to differentiate and identify the applications. We have implemented our proposed authentication mechanism under real-world conditions, with results showing the feasibility and effectiveness of our authentication mechanism.</description><identifier>ISSN: 0018-9545</identifier><identifier>EISSN: 1939-9359</identifier><identifier>DOI: 10.1109/TVT.2019.2920988</identifier><identifier>CODEN: ITVTAB</identifier><language>eng</language><publisher>New York: IEEE</publisher><subject>Authentication ; chaos ; Chaotic communication ; communication system security ; cyber attack ; Encryption ; High speed rail ; IP networks ; Proposals ; random number generator ; Random numbers ; Security ; Wireless communication ; Wireless communications ; Wireless networks</subject><ispartof>IEEE transactions on vehicular technology, 2019-08, Vol.68 (8), p.7283-7295</ispartof><rights>Copyright The Institute of Electrical and Electronics Engineers, Inc. (IEEE) 2019</rights><lds50>peer_reviewed</lds50><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c333t-c4fcb41074eb027ab1a964d011649855249e9a645863fc8cc9cc81ca470701083</citedby><cites>FETCH-LOGICAL-c333t-c4fcb41074eb027ab1a964d011649855249e9a645863fc8cc9cc81ca470701083</cites><orcidid>0000-0002-9283-2570 ; 0000-0002-5842-7264 ; 0000-0003-3529-2640 ; 0000-0002-8641-4057</orcidid></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktohtml>$$Uhttps://ieeexplore.ieee.org/document/8731692$$EHTML$$P50$$Gieee$$H</linktohtml><link.rule.ids>314,780,784,27924,27925,54796</link.rule.ids></links><search><creatorcontrib>Xu, Tong</creatorcontrib><creatorcontrib>Gao, Deyun</creatorcontrib><creatorcontrib>Dong, Ping</creatorcontrib><creatorcontrib>Foh, Chuan Heng</creatorcontrib><creatorcontrib>Zhang, Hongke</creatorcontrib><creatorcontrib>Leung, Victor C. M.</creatorcontrib><title>Improving the Security of Wireless Communications on High-Speed Trains by Efficient Authentication in SCN-R</title><title>IEEE transactions on vehicular technology</title><addtitle>TVT</addtitle><description>Recently, we have witnessed the remarkable development in high-speed railways around the world. To provide a robust and fast wireless network for the onboard passengers, we have earlier proposed smart collaborative networking for railways (SCN-R). In the realization of SCN-R, its security is challenged by potential exploitation of authentication vulnerabilities since traditional authentication mechanisms are unsuitable for scenarios with fast moving objects due to their complex and relatively timely operations. In this paper, we address this issue by proposing a new efficient authentication mechanism, which is based on a new design of chaotic random number generator (RNG). Comparing with the recent proposal relying on the precise boundaries of chaotic map state spaces, our RNG uses two logistic maps to avoid the time-consuming boundary location process. The proposed authentication mechanism uses the RNG to generate and validate the one-time password (OTP). To support different authentication applications, different lengths of OTPs can be used to differentiate and identify the applications. We have implemented our proposed authentication mechanism under real-world conditions, with results showing the feasibility and effectiveness of our authentication mechanism.</description><subject>Authentication</subject><subject>chaos</subject><subject>Chaotic communication</subject><subject>communication system security</subject><subject>cyber attack</subject><subject>Encryption</subject><subject>High speed rail</subject><subject>IP networks</subject><subject>Proposals</subject><subject>random number generator</subject><subject>Random numbers</subject><subject>Security</subject><subject>Wireless communication</subject><subject>Wireless communications</subject><subject>Wireless networks</subject><issn>0018-9545</issn><issn>1939-9359</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2019</creationdate><recordtype>article</recordtype><recordid>eNo9kM1LAzEQxYMoWKt3wUvA89Z87ibHUqotFAW76jFk02yb2s3WZFfof29Ki6dhhvfe8H4A3GM0whjJp_KzHBGE5YhIgqQQF2CAJZWZpFxeggFCWGSSM34NbmLcppUxiQfge97sQ_vr_Bp2GwuX1vTBdQfY1vDLBbuzMcJJ2zS9d0Z3rvURth7O3HqTLffWrmAZtEvH6gCnde2Ms76D4z5l-e7sgM7D5eQ1e78FV7XeRXt3nkPw8TwtJ7Ns8fYyn4wXmaGUdplhtakYRgWzFSKFrrCWOVshjHMmBeeESSt1zrjIaW2EMdIYgY1mBSoQRoIOweMpNzX76W3s1Lbtg08vFSEFzwlBnCQVOqlMaGMMtlb74BodDgojdUSqElJ1RKrOSJPl4WRx1tp_uSgoziWhf2XIccw</recordid><startdate>20190801</startdate><enddate>20190801</enddate><creator>Xu, Tong</creator><creator>Gao, Deyun</creator><creator>Dong, Ping</creator><creator>Foh, Chuan Heng</creator><creator>Zhang, Hongke</creator><creator>Leung, Victor C. M.</creator><general>IEEE</general><general>The Institute of Electrical and Electronics Engineers, Inc. (IEEE)</general><scope>97E</scope><scope>RIA</scope><scope>RIE</scope><scope>AAYXX</scope><scope>CITATION</scope><scope>7SP</scope><scope>8FD</scope><scope>FR3</scope><scope>KR7</scope><scope>L7M</scope><orcidid>https://orcid.org/0000-0002-9283-2570</orcidid><orcidid>https://orcid.org/0000-0002-5842-7264</orcidid><orcidid>https://orcid.org/0000-0003-3529-2640</orcidid><orcidid>https://orcid.org/0000-0002-8641-4057</orcidid></search><sort><creationdate>20190801</creationdate><title>Improving the Security of Wireless Communications on High-Speed Trains by Efficient Authentication in SCN-R</title><author>Xu, Tong ; Gao, Deyun ; Dong, Ping ; Foh, Chuan Heng ; Zhang, Hongke ; Leung, Victor C. M.</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c333t-c4fcb41074eb027ab1a964d011649855249e9a645863fc8cc9cc81ca470701083</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2019</creationdate><topic>Authentication</topic><topic>chaos</topic><topic>Chaotic communication</topic><topic>communication system security</topic><topic>cyber attack</topic><topic>Encryption</topic><topic>High speed rail</topic><topic>IP networks</topic><topic>Proposals</topic><topic>random number generator</topic><topic>Random numbers</topic><topic>Security</topic><topic>Wireless communication</topic><topic>Wireless communications</topic><topic>Wireless networks</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Xu, Tong</creatorcontrib><creatorcontrib>Gao, Deyun</creatorcontrib><creatorcontrib>Dong, Ping</creatorcontrib><creatorcontrib>Foh, Chuan Heng</creatorcontrib><creatorcontrib>Zhang, Hongke</creatorcontrib><creatorcontrib>Leung, Victor C. M.</creatorcontrib><collection>IEEE All-Society Periodicals Package (ASPP) 2005-present</collection><collection>IEEE All-Society Periodicals Package (ASPP) 1998-Present</collection><collection>IEEE Xplore (Online service)</collection><collection>CrossRef</collection><collection>Electronics & Communications Abstracts</collection><collection>Technology Research Database</collection><collection>Engineering Research Database</collection><collection>Civil Engineering Abstracts</collection><collection>Advanced Technologies Database with Aerospace</collection><jtitle>IEEE transactions on vehicular technology</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Xu, Tong</au><au>Gao, Deyun</au><au>Dong, Ping</au><au>Foh, Chuan Heng</au><au>Zhang, Hongke</au><au>Leung, Victor C. M.</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Improving the Security of Wireless Communications on High-Speed Trains by Efficient Authentication in SCN-R</atitle><jtitle>IEEE transactions on vehicular technology</jtitle><stitle>TVT</stitle><date>2019-08-01</date><risdate>2019</risdate><volume>68</volume><issue>8</issue><spage>7283</spage><epage>7295</epage><pages>7283-7295</pages><issn>0018-9545</issn><eissn>1939-9359</eissn><coden>ITVTAB</coden><abstract>Recently, we have witnessed the remarkable development in high-speed railways around the world. To provide a robust and fast wireless network for the onboard passengers, we have earlier proposed smart collaborative networking for railways (SCN-R). In the realization of SCN-R, its security is challenged by potential exploitation of authentication vulnerabilities since traditional authentication mechanisms are unsuitable for scenarios with fast moving objects due to their complex and relatively timely operations. In this paper, we address this issue by proposing a new efficient authentication mechanism, which is based on a new design of chaotic random number generator (RNG). Comparing with the recent proposal relying on the precise boundaries of chaotic map state spaces, our RNG uses two logistic maps to avoid the time-consuming boundary location process. The proposed authentication mechanism uses the RNG to generate and validate the one-time password (OTP). To support different authentication applications, different lengths of OTPs can be used to differentiate and identify the applications. We have implemented our proposed authentication mechanism under real-world conditions, with results showing the feasibility and effectiveness of our authentication mechanism.</abstract><cop>New York</cop><pub>IEEE</pub><doi>10.1109/TVT.2019.2920988</doi><tpages>13</tpages><orcidid>https://orcid.org/0000-0002-9283-2570</orcidid><orcidid>https://orcid.org/0000-0002-5842-7264</orcidid><orcidid>https://orcid.org/0000-0003-3529-2640</orcidid><orcidid>https://orcid.org/0000-0002-8641-4057</orcidid><oa>free_for_read</oa></addata></record> |
fulltext | fulltext |
identifier | ISSN: 0018-9545 |
ispartof | IEEE transactions on vehicular technology, 2019-08, Vol.68 (8), p.7283-7295 |
issn | 0018-9545 1939-9359 |
language | eng |
recordid | cdi_ieee_primary_8731692 |
source | IEEE Xplore (Online service) |
subjects | Authentication chaos Chaotic communication communication system security cyber attack Encryption High speed rail IP networks Proposals random number generator Random numbers Security Wireless communication Wireless communications Wireless networks |
title | Improving the Security of Wireless Communications on High-Speed Trains by Efficient Authentication in SCN-R |
url | http://sfxeu10.hosted.exlibrisgroup.com/loughborough?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2024-12-27T14%3A00%3A07IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-proquest_ieee_&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=Improving%20the%20Security%20of%20Wireless%20Communications%20on%20High-Speed%20Trains%20by%20Efficient%20Authentication%20in%20SCN-R&rft.jtitle=IEEE%20transactions%20on%20vehicular%20technology&rft.au=Xu,%20Tong&rft.date=2019-08-01&rft.volume=68&rft.issue=8&rft.spage=7283&rft.epage=7295&rft.pages=7283-7295&rft.issn=0018-9545&rft.eissn=1939-9359&rft.coden=ITVTAB&rft_id=info:doi/10.1109/TVT.2019.2920988&rft_dat=%3Cproquest_ieee_%3E2275622052%3C/proquest_ieee_%3E%3Cgrp_id%3Ecdi_FETCH-LOGICAL-c333t-c4fcb41074eb027ab1a964d011649855249e9a645863fc8cc9cc81ca470701083%3C/grp_id%3E%3Coa%3E%3C/oa%3E%3Curl%3E%3C/url%3E&rft_id=info:oai/&rft_pqid=2275622052&rft_id=info:pmid/&rft_ieee_id=8731692&rfr_iscdi=true |