Identificador persistente para citar o vincular este elemento: http://hdl.handle.net/10553/130556
Campo DC Valoridioma
dc.contributor.authorGuerra Yánez,Carlosen_US
dc.contributor.authorMederos Barrera,Antonioen_US
dc.contributor.authorDe Marco, Innocenzoen_US
dc.contributor.authorOrsucci, Davideen_US
dc.contributor.authorMoll, Florianen_US
dc.contributor.authorGhassemlooy, Zabihen_US
dc.contributor.authorZvanovec, Stanislaven_US
dc.date.accessioned2024-05-20T13:45:34Z-
dc.date.available2024-05-20T13:45:34Z-
dc.date.issued2024en_US
dc.identifier.issn0090-6778en_US
dc.identifier.otherScopus-
dc.identifier.urihttp://hdl.handle.net/10553/130556-
dc.description.abstractThe use of quantum key distribution (QKD) to improve security may impact the quality of service (Qos) of high rate classical data links. The key generation process with an empty buffer can be modeled as a queuing system, and data throughput limits can be determined using queueing theory to assess the impact on the QoS. The proposed key generation model is based on an on-demand paradigm. Based on the results of this study, a discrete variable (DV)-QKD-secured link could be designed using the data rate bounds to guarantee a given QoS. Furthermore, we validate the derived bounds by comparing the theoretical derivations with simulations. We show that in a one-time-pad system, the achievable throughput approaches 0.59 times the secret key rate as the key length increases. In the case of a key scheme with key reuse, the throughput is asymptotically linear with the number of key reuses, and the slope of the curve corresponds to the secret key rate multiplied by a function of the protocol and channel characteristics. The analysis is carried out on optical fiber and free-space links.en_US
dc.languageengen_US
dc.relation.ispartofIEEE Transactions on Communicationsen_US
dc.sourceIEEE Transactions on Communications[ISSN 0090-6778], (Enero 2024)en_US
dc.subject3325 Tecnología de las telecomunicacionesen_US
dc.subject.otherCiphersen_US
dc.subject.otherEncryptionen_US
dc.subject.otherModelingen_US
dc.subject.otherOptical Communicationen_US
dc.subject.otherProtocolsen_US
dc.subject.otherQuality Of Serviceen_US
dc.subject.otherQuantum Computingen_US
dc.subject.otherQuantum Theoryen_US
dc.subject.otherQueueing Analysisen_US
dc.subject.otherQueueing Analysisen_US
dc.subject.otherStochastic Processesen_US
dc.subject.otherThroughputen_US
dc.titleThe Throughput Bottleneck of Quantum-secure Communication Links: Analysis and Mitigationen_US
dc.typeinfo:eu-repo/semantics/Articleen_US
dc.typeArticleen_US
dc.identifier.doi10.1109/TCOMM.2024.3394746en_US
dc.identifier.scopus85192148892-
dc.contributor.orcidNO DATA-
dc.contributor.orcidNO DATA-
dc.contributor.orcidNO DATA-
dc.contributor.orcidNO DATA-
dc.contributor.orcidNO DATA-
dc.contributor.orcidNO DATA-
dc.contributor.orcidNO DATA-
dc.contributor.authorscopusid57315214300-
dc.contributor.authorscopusid57220806560-
dc.contributor.authorscopusid57204613742-
dc.contributor.authorscopusid56603980400-
dc.contributor.authorscopusid22734930200-
dc.contributor.authorscopusid7004547192-
dc.contributor.authorscopusid8346275300-
dc.identifier.eissn1558-0857-
dc.investigacionIngeniería y Arquitecturaen_US
dc.type2Artículoen_US
dc.utils.revisionen_US
dc.date.coverdateEnero 2024en_US
dc.identifier.ulpgcen_US
dc.contributor.buulpgcBU-TELen_US
dc.description.sjr3,889
dc.description.jcr8,3
dc.description.sjrqQ1
dc.description.jcrqQ1
dc.description.scieSCIE
dc.description.miaricds11,0
item.grantfulltextnone-
item.fulltextSin texto completo-
crisitem.author.deptGIR IOCAG: Procesado de Imágenes y Teledetección-
crisitem.author.deptIU de Oceanografía y Cambio Global-
crisitem.author.orcidhttps://orcid.org/0000-0003-1680-0726-
crisitem.author.parentorgIU de Oceanografía y Cambio Global-
crisitem.author.fullNameGuerra Yánez,Carlos-
crisitem.author.fullNameMederos Barrera, Antonio Ramón-
Colección:Artículos
Vista resumida

Visitas

40
actualizado el 10-ago-2024

Google ScholarTM

Verifica

Altmetric


Comparte



Exporta metadatos



Los elementos en ULPGC accedaCRIS están protegidos por derechos de autor con todos los derechos reservados, a menos que se indique lo contrario.