Multiple stochastic paths scheme on partially- trusted relay quantum key distribution network
Quantum key distribution （QKD） technology provides proven unconditional point-to-point security based on fundamental quantum physics. A QKD network also holds promise for secure multi-user communications over long distances at high-speed transmission rates. Although many schemes have been proposed s...
Gespeichert in:
| Veröffentlicht in: | Science China. Information sciences 2009, Vol.52 (1), p.18-22 |
|---|---|
| Hauptverfasser: | , , , , |
| Format: | Artikel |
| Sprache: | eng |
| Schlagworte: | |
| Online-Zugang: | Volltext |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| container_end_page | 22 |
|---|---|
| container_issue | 1 |
| container_start_page | 18 |
| container_title | Science China. Information sciences |
| container_volume | 52 |
| creator | Wen, Hao Han, ZhengFu Zhao, YiBo Guo, GuangCan Hong, PeiLin |
| description | Quantum key distribution （QKD） technology provides proven unconditional point-to-point security based on fundamental quantum physics. A QKD network also holds promise for secure multi-user communications over long distances at high-speed transmission rates. Although many schemes have been proposed so far, the trusted relay QKD network is still the most practical and flexible scenario. In reality, the insecurity of certain relay sections cannot be ignored, so to solve the fatal security problems of partially-trusted relay networks we suggest a multiple stochastic paths scheme. Its features are： （i） a safe probability model that may be more practical for real applications; （ii） a multi-path scheme with an upper bound for the overall safe probability; （iii） an adaptive stochastic routing algorithm to generate sufficient different paths and hidden routes. Simulation results for a typical partially-trusted relay QKD network show that this generalized scheme is effective. |
| doi_str_mv | 10.1007/s11432-009-0001-4 |
| format | Article |
| fullrecord | <record><control><sourceid>proquest_cross</sourceid><recordid>TN_cdi_proquest_miscellaneous_35257717</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><cqvip_id>29236062</cqvip_id><sourcerecordid>35257717</sourcerecordid><originalsourceid>FETCH-LOGICAL-c374t-694a5314676c9a92cdd8911561fb924739685c9edf74e42987495bc181c7fe673</originalsourceid><addsrcrecordid>eNp9kMFqGzEQhpeSQh23D9CbaCC3TTSSVlodi0nSgEsv7bEIWTtry5Z3bUlL8NtHxoFCDj0IadD3zQx_VX0FegeUqvsEIDirKdXlUKjFh2oGrWQ1a7m8Ku_zD1ON-lRdp7SlVDDGYVb9_TmF7A8BScqj29iUvSMHmzeJJLfBPZJxKHXM3oZwqkmOU8rYkYjBnshxskOe9mSHJ9L5lKNfTdkXY8D8Msbd5-pjb0PCL2_3vPrz-PB78aNe_np6Xnxf1o4rkWuphW04CKmk01Yz13WtBmgk9CvNhOJato3T2PVKoGC6VUI3KwctONWjVHxe3V76HuJ4nDBls_fJYQh2wHFKhjesUQrO4M07cDtOcSi7GaahbRSAbgsFF8rFMaWIvTlEv7fxZICac9zmErcpoZpz3EYUh12cVNhhjfFf5_9J394GbcZhfSyeWVm3633Asg_jkkrGXwGZJ43d</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>2918571198</pqid></control><display><type>article</type><title>Multiple stochastic paths scheme on partially- trusted relay quantum key distribution network</title><source>SpringerNature Journals</source><source>ProQuest Central UK/Ireland</source><source>Alma/SFX Local Collection</source><source>ProQuest Central</source><creator>Wen, Hao ; Han, ZhengFu ; Zhao, YiBo ; Guo, GuangCan ; Hong, PeiLin</creator><creatorcontrib>Wen, Hao ; Han, ZhengFu ; Zhao, YiBo ; Guo, GuangCan ; Hong, PeiLin</creatorcontrib><description>Quantum key distribution （QKD） technology provides proven unconditional point-to-point security based on fundamental quantum physics. A QKD network also holds promise for secure multi-user communications over long distances at high-speed transmission rates. Although many schemes have been proposed so far, the trusted relay QKD network is still the most practical and flexible scenario. In reality, the insecurity of certain relay sections cannot be ignored, so to solve the fatal security problems of partially-trusted relay networks we suggest a multiple stochastic paths scheme. Its features are： （i） a safe probability model that may be more practical for real applications; （ii） a multi-path scheme with an upper bound for the overall safe probability; （iii） an adaptive stochastic routing algorithm to generate sufficient different paths and hidden routes. Simulation results for a typical partially-trusted relay QKD network show that this generalized scheme is effective.</description><identifier>ISSN: 1009-2757</identifier><identifier>ISSN: 1674-733X</identifier><identifier>EISSN: 1862-2836</identifier><identifier>EISSN: 1869-1919</identifier><identifier>DOI: 10.1007/s11432-009-0001-4</identifier><language>eng</language><publisher>Beijing: Science in China Press</publisher><subject>Adaptive algorithms ; Computer Science ; Information Systems and Communication Service ; Probability theory ; Quantum cryptography ; Quantum theory ; Relay networks ; Security ; Upper bounds ; 信息论 ; 推测性模型 ; 物理学 ; 量子密码术</subject><ispartof>Science China. Information sciences, 2009, Vol.52 (1), p.18-22</ispartof><rights>Science China Press and Springer-Verlag Berlin Heidelberg 2009</rights><rights>Science China Press and Springer-Verlag Berlin Heidelberg 2009.</rights><lds50>peer_reviewed</lds50><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c374t-694a5314676c9a92cdd8911561fb924739685c9edf74e42987495bc181c7fe673</citedby><cites>FETCH-LOGICAL-c374t-694a5314676c9a92cdd8911561fb924739685c9edf74e42987495bc181c7fe673</cites></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Uhttp://image.cqvip.com/vip1000/qk/84009X/84009X.jpg</thumbnail><linktopdf>$$Uhttps://link.springer.com/content/pdf/10.1007/s11432-009-0001-4$$EPDF$$P50$$Gspringer$$H</linktopdf><linktohtml>$$Uhttps://www.proquest.com/docview/2918571198?pq-origsite=primo$$EHTML$$P50$$Gproquest$$H</linktohtml><link.rule.ids>315,781,785,4025,21393,27928,27929,27930,33749,41493,42562,43810,51324,64390,64394,72474</link.rule.ids></links><search><creatorcontrib>Wen, Hao</creatorcontrib><creatorcontrib>Han, ZhengFu</creatorcontrib><creatorcontrib>Zhao, YiBo</creatorcontrib><creatorcontrib>Guo, GuangCan</creatorcontrib><creatorcontrib>Hong, PeiLin</creatorcontrib><title>Multiple stochastic paths scheme on partially- trusted relay quantum key distribution network</title><title>Science China. Information sciences</title><addtitle>Sci. China Ser. F-Inf. Sci</addtitle><addtitle>Science in China(Series F)</addtitle><description>Quantum key distribution （QKD） technology provides proven unconditional point-to-point security based on fundamental quantum physics. A QKD network also holds promise for secure multi-user communications over long distances at high-speed transmission rates. Although many schemes have been proposed so far, the trusted relay QKD network is still the most practical and flexible scenario. In reality, the insecurity of certain relay sections cannot be ignored, so to solve the fatal security problems of partially-trusted relay networks we suggest a multiple stochastic paths scheme. Its features are： （i） a safe probability model that may be more practical for real applications; （ii） a multi-path scheme with an upper bound for the overall safe probability; （iii） an adaptive stochastic routing algorithm to generate sufficient different paths and hidden routes. Simulation results for a typical partially-trusted relay QKD network show that this generalized scheme is effective.</description><subject>Adaptive algorithms</subject><subject>Computer Science</subject><subject>Information Systems and Communication Service</subject><subject>Probability theory</subject><subject>Quantum cryptography</subject><subject>Quantum theory</subject><subject>Relay networks</subject><subject>Security</subject><subject>Upper bounds</subject><subject>信息论</subject><subject>推测性模型</subject><subject>物理学</subject><subject>量子密码术</subject><issn>1009-2757</issn><issn>1674-733X</issn><issn>1862-2836</issn><issn>1869-1919</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2009</creationdate><recordtype>article</recordtype><sourceid>AFKRA</sourceid><sourceid>AZQEC</sourceid><sourceid>BENPR</sourceid><sourceid>CCPQU</sourceid><sourceid>DWQXO</sourceid><sourceid>GNUQQ</sourceid><recordid>eNp9kMFqGzEQhpeSQh23D9CbaCC3TTSSVlodi0nSgEsv7bEIWTtry5Z3bUlL8NtHxoFCDj0IadD3zQx_VX0FegeUqvsEIDirKdXlUKjFh2oGrWQ1a7m8Ku_zD1ON-lRdp7SlVDDGYVb9_TmF7A8BScqj29iUvSMHmzeJJLfBPZJxKHXM3oZwqkmOU8rYkYjBnshxskOe9mSHJ9L5lKNfTdkXY8D8Msbd5-pjb0PCL2_3vPrz-PB78aNe_np6Xnxf1o4rkWuphW04CKmk01Yz13WtBmgk9CvNhOJato3T2PVKoGC6VUI3KwctONWjVHxe3V76HuJ4nDBls_fJYQh2wHFKhjesUQrO4M07cDtOcSi7GaahbRSAbgsFF8rFMaWIvTlEv7fxZICac9zmErcpoZpz3EYUh12cVNhhjfFf5_9J394GbcZhfSyeWVm3633Asg_jkkrGXwGZJ43d</recordid><startdate>2009</startdate><enddate>2009</enddate><creator>Wen, Hao</creator><creator>Han, ZhengFu</creator><creator>Zhao, YiBo</creator><creator>Guo, GuangCan</creator><creator>Hong, PeiLin</creator><general>Science in China Press</general><general>Springer Nature B.V</general><scope>2RA</scope><scope>92L</scope><scope>CQIGP</scope><scope>~WA</scope><scope>AAYXX</scope><scope>CITATION</scope><scope>8FE</scope><scope>8FG</scope><scope>AFKRA</scope><scope>ARAPS</scope><scope>AZQEC</scope><scope>BENPR</scope><scope>BGLVJ</scope><scope>CCPQU</scope><scope>DWQXO</scope><scope>GNUQQ</scope><scope>HCIFZ</scope><scope>JQ2</scope><scope>K7-</scope><scope>P5Z</scope><scope>P62</scope><scope>PQEST</scope><scope>PQQKQ</scope><scope>PQUKI</scope><scope>7SC</scope><scope>8FD</scope><scope>L7M</scope><scope>L~C</scope><scope>L~D</scope></search><sort><creationdate>2009</creationdate><title>Multiple stochastic paths scheme on partially- trusted relay quantum key distribution network</title><author>Wen, Hao ; Han, ZhengFu ; Zhao, YiBo ; Guo, GuangCan ; Hong, PeiLin</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c374t-694a5314676c9a92cdd8911561fb924739685c9edf74e42987495bc181c7fe673</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2009</creationdate><topic>Adaptive algorithms</topic><topic>Computer Science</topic><topic>Information Systems and Communication Service</topic><topic>Probability theory</topic><topic>Quantum cryptography</topic><topic>Quantum theory</topic><topic>Relay networks</topic><topic>Security</topic><topic>Upper bounds</topic><topic>信息论</topic><topic>推测性模型</topic><topic>物理学</topic><topic>量子密码术</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Wen, Hao</creatorcontrib><creatorcontrib>Han, ZhengFu</creatorcontrib><creatorcontrib>Zhao, YiBo</creatorcontrib><creatorcontrib>Guo, GuangCan</creatorcontrib><creatorcontrib>Hong, PeiLin</creatorcontrib><collection>中文科技期刊数据库</collection><collection>中文科技期刊数据库-CALIS站点</collection><collection>中文科技期刊数据库-7.0平台</collection><collection>中文科技期刊数据库- 镜像站点</collection><collection>CrossRef</collection><collection>ProQuest SciTech Collection</collection><collection>ProQuest Technology Collection</collection><collection>ProQuest Central UK/Ireland</collection><collection>Advanced Technologies & Aerospace Collection</collection><collection>ProQuest Central Essentials</collection><collection>ProQuest Central</collection><collection>Technology Collection</collection><collection>ProQuest One Community College</collection><collection>ProQuest Central Korea</collection><collection>ProQuest Central Student</collection><collection>SciTech Premium Collection</collection><collection>ProQuest Computer Science Collection</collection><collection>Computer Science Database</collection><collection>Advanced Technologies & Aerospace Database</collection><collection>ProQuest Advanced Technologies & Aerospace Collection</collection><collection>ProQuest One Academic Eastern Edition (DO NOT USE)</collection><collection>ProQuest One Academic</collection><collection>ProQuest One Academic UKI Edition</collection><collection>Computer and Information Systems Abstracts</collection><collection>Technology Research Database</collection><collection>Advanced Technologies Database with Aerospace</collection><collection>Computer and Information Systems Abstracts Academic</collection><collection>Computer and Information Systems Abstracts Professional</collection><jtitle>Science China. Information sciences</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Wen, Hao</au><au>Han, ZhengFu</au><au>Zhao, YiBo</au><au>Guo, GuangCan</au><au>Hong, PeiLin</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Multiple stochastic paths scheme on partially- trusted relay quantum key distribution network</atitle><jtitle>Science China. Information sciences</jtitle><stitle>Sci. China Ser. F-Inf. Sci</stitle><addtitle>Science in China(Series F)</addtitle><date>2009</date><risdate>2009</risdate><volume>52</volume><issue>1</issue><spage>18</spage><epage>22</epage><pages>18-22</pages><issn>1009-2757</issn><issn>1674-733X</issn><eissn>1862-2836</eissn><eissn>1869-1919</eissn><abstract>Quantum key distribution （QKD） technology provides proven unconditional point-to-point security based on fundamental quantum physics. A QKD network also holds promise for secure multi-user communications over long distances at high-speed transmission rates. Although many schemes have been proposed so far, the trusted relay QKD network is still the most practical and flexible scenario. In reality, the insecurity of certain relay sections cannot be ignored, so to solve the fatal security problems of partially-trusted relay networks we suggest a multiple stochastic paths scheme. Its features are： （i） a safe probability model that may be more practical for real applications; （ii） a multi-path scheme with an upper bound for the overall safe probability; （iii） an adaptive stochastic routing algorithm to generate sufficient different paths and hidden routes. Simulation results for a typical partially-trusted relay QKD network show that this generalized scheme is effective.</abstract><cop>Beijing</cop><pub>Science in China Press</pub><doi>10.1007/s11432-009-0001-4</doi><tpages>5</tpages></addata></record> |
| fulltext | fulltext |
| identifier | ISSN: 1009-2757 |
| ispartof | Science China. Information sciences, 2009, Vol.52 (1), p.18-22 |
| issn | 1009-2757 1674-733X 1862-2836 1869-1919 |
| language | eng |
| recordid | cdi_proquest_miscellaneous_35257717 |
| source | SpringerNature Journals; ProQuest Central UK/Ireland; Alma/SFX Local Collection; ProQuest Central |
| subjects | Adaptive algorithms Computer Science Information Systems and Communication Service Probability theory Quantum cryptography Quantum theory Relay networks Security Upper bounds 信息论 推测性模型 物理学 量子密码术 |
| title | Multiple stochastic paths scheme on partially- trusted relay quantum key distribution network |
| url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2024-12-14T23%3A29%3A43IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-proquest_cross&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=Multiple%20stochastic%20paths%20scheme%20on%20partially-%20trusted%20relay%20quantum%20key%20distribution%20network&rft.jtitle=Science%20China.%20Information%20sciences&rft.au=Wen,%20Hao&rft.date=2009&rft.volume=52&rft.issue=1&rft.spage=18&rft.epage=22&rft.pages=18-22&rft.issn=1009-2757&rft.eissn=1862-2836&rft_id=info:doi/10.1007/s11432-009-0001-4&rft_dat=%3Cproquest_cross%3E35257717%3C/proquest_cross%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_pqid=2918571198&rft_id=info:pmid/&rft_cqvip_id=29236062&rfr_iscdi=true |