Skip to content

1 paper indexed here

We haven’t gathered this author’s papers yet. Follow them and we’ll fetch their work.

Not the right person? Other researchers publish under this name.

Open access Jul 2026

Problems and prospects of building authentication methods in quantum key distribution channels

The paper addresses entity authentication in quantum key distribution (QKD) systems as a decisive condition of their practical security. It is shown that the information-theoretic security of quantum key agreement does not eliminate the need to authenticate the communicating parties: an unauthenticated classical channel leaves the system exposed to the man-in-the-middle attack, since the eavesdropper can run independent QKD instances with each party and reconcile two keys under full control. Existing authentication methods are analysed and classified by the underlying cryptographic primitive: symmetric schemes based on Wegman–Carter universal hashing, pre-shared and fixed keys, public-key infrastructure, two-way authentication, quantum entity/identity authentication, and zero-knowledge proofs. For each class the operating principle, advantages and limitations are determined, with emphasis on key management, scalability and trust distribution. It is established that symmetric and quantum-layer methods rely on pre-shared secrets with a quadratic growth of key material, public-key infrastructure introduces a single trust bottleneck and quantum-vulnerable primitives, while existing zero-knowledge authentication schemes are quantum and bound to the physical layer or solve network properties other than identity. A comparative analysis reveals an unresolved scientific gap: the absence of a scalable entity-authentication method that simultaneously provides non-disclosure of the secret, quantum resistance, sub-quadratic scalability and minimisation of trust assumptions. On this basis, a prospective research direction is substantiated – the construction of entity-authentication methods based on post-quantum zero-knowledge proofs operating over the classical control plane of scalable QKD networks. The requirements for such a method are formulated, and its compatibility with formal QKD security proofs is discussed.

Y. Kotukh, M. V. Korobchynskyi, V. Kozlovskyi et al. · 0 citations

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.