Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

IFIP advances in information and communication technology

On the Practical Feasibility of Secure Distributed Computing

Gregory Neven, Frank Piessens, Bart De Decker

Published Jan 1, 2000• 3 citations
Publisher
DOI
10.1007/978-0-387-35515-3_37

Related papers

The Varieties of Secure Distributed Computation

Matthew K. Franklin, Moti M. Yung

Springer eBooks•Jan 1, 1993•15 citations

Concise security bounds for practical decoy-state quantum key distribution

Charles Ci Wen Lim, Marcos Curty, Nino Walenta +2 more

Due to its ability to tolerate high channel loss, decoy-state quantum key distribution (QKD) has been one of the main focuses within the QKD community. Notably, several experimental groups have demonstrated that it is secure and feasible under real-world conditions. Crucially, however, the security and feasibility claims made by most of these experiments were obtained under the assumption that the eavesdropper is restricted to particular types of attacks or that the finite-key effects are neglected. Unfortunately, such assumptions are not possible to guarantee in practice. In this work, we provide concise and tight finite-key security bounds for practical decoy-state QKD that are valid against general attacks.

arXiv:1311.7129•Physical Review A•Feb 10, 2014•405 citations

Kerberos-Authenticated Classical Channel for Quantum Key Distribution: A Symmetric-Key Approach to Quantum-Safe Authentication

Hannes Künstner, Ashutosh Dhar Dwivedi, Jens Myrup Pedersen

Quantum Key Distribution (QKD) protocols, such as BB84, require secure authentication of their classical communication channel to ensure message integrity and authenticity, which is fundamental to successfully distribute unconditionally secure keys and prevent critical vulnerabilities. Traditionally, QKD relies on pre-shared secret keys for this authentication, posing significant scalability challenges. Employing asymmetric encryption methods is also not a viable alternative, as these methods are either vulnerable to quantum computing attacks or lack rigorous security proofs. To address these issues, we propose using the well-established Kerberos authentication protocol, which relies on symmetric cryptography inherently resistant to known quantum attacks, to securely distribute symmetric session keys that authenticate classical communication in QKD systems. We demonstrate the feasibility and practical security advantages of employing Kerberos-generated session keys, inherently resistant to quantum computing attacks, without modifying existing Kerberos workflows, providing a practical quantum-secure solution that leverages existing IT infrastructure.

IEEE Consumer Communications and Networking Conference•Jan 9, 2026•0 citations

On necessary conditions for secure distributed computation

Rafail Ostrovsky, Moti Young

DIMACS series in discrete mathematics and theoretical computer science•Apr 3, 1991•2 citations

Foundations and practical studies of secure computation

Ryo Kikuchi

IEICE Technical Report; IEICE Tech. Rep.•Dec 14, 2017•0 citations

Practical Implementation of Unconditionally Secure File Transfer Application with QKD and OTP

Alin-Bogdan Popa, Bogdan-Călin Ciobanu, Pantelimon George Popescu

With the looming threat of quantum computers capable of breaking classical encryption and the uncertainty regarding the security of post-quantum encryption algorithms, some highly sensitive applications aim for the highest level of security in information transfer: unconditional security. In this work we present an architecture and a practical implementation of a user-friendly unconditionally secure file transfer client based on quantum key distribution and one time pad cipher. We test the implementation on the live QKD research infrastructure within POLITEHNICA Bucharest, thus proving the approach is feasible for real information transfer use-cases.

Quantum Reports•Mar 14, 2025•0 citations
Due to its ability to tolerate high channel loss, decoy-state quantum key distribution (QKD) has been one of the main focuses within the QKD community. Notably, several experimental groups have demonstrated that it is secure and feasible under real-world conditions. Crucially, however, the security and feasibility claims made by most of these experiments were obtained under the assumption that the eavesdropper is restricted to particular types of attacks or that the finite-key effects are neglected. Unfortunately, such assumptions are not possible to guarantee in practice. In this work, we provide concise and tight finite-key security bounds for practical decoy-state QKD that are valid against general attacks.
Quantum Key Distribution (QKD) protocols, such as BB84, require secure authentication of their classical communication channel to ensure message integrity and authenticity, which is fundamental to successfully distribute unconditionally secure keys and prevent critical vulnerabilities. Traditionally, QKD relies on pre-shared secret keys for this authentication, posing significant scalability challenges. Employing asymmetric encryption methods is also not a viable alternative, as these methods are either vulnerable to quantum computing attacks or lack rigorous security proofs. To address these issues, we propose using the well-established Kerberos authentication protocol, which relies on symmetric cryptography inherently resistant to known quantum attacks, to securely distribute symmetric session keys that authenticate classical communication in QKD systems. We demonstrate the feasibility and practical security advantages of employing Kerberos-generated session keys, inherently resistant to quantum computing attacks, without modifying existing Kerberos workflows, providing a practical quantum-secure solution that leverages existing IT infrastructure.
With the looming threat of quantum computers capable of breaking classical encryption and the uncertainty regarding the security of post-quantum encryption algorithms, some highly sensitive applications aim for the highest level of security in information transfer: unconditional security. In this work we present an architecture and a practical implementation of a user-friendly unconditionally secure file transfer client based on quantum key distribution and one time pad cipher. We test the implementation on the live QKD research infrastructure within POLITEHNICA Bucharest, thus proving the approach is feasible for real information transfer use-cases.