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

Classification of Quantum Repeater Attacks

Shigeya Suzuki, Rodney Van Meter

Published Jan 1, 2015• 6 citations
Publisher

Abstract

Author(s): Shigeya Suzuki, Rodney Van Meter Download: Paper (PDF) Date: 7 Feb 2015 Document Type: Briefing Papers Additional Documents: Slides Associated Event: NDSS Symposium 2015 Abstract: In this paper, we discuss and classify attacks on quantum repeater systems. As engineers working in both classical and quantum networking, we naturally wish to apply the lessons learned … Continued

DOI
10.14722/sent.2015.23003

Related papers

ABY - A Framework for Efficient Mixed-Protocol Secure Two-Party Computation

Daniel Demmler, Thomas H. Schneider, Michael Zohner

Author(s): Daniel Demmler, Thomas Schneider, Michael Zohner Download: Paper (PDF) Date: 7 Feb 2015 Document Type: Briefing Papers Additional Documents: Slides Associated Event: NDSS Symposium 2015 Abstract: Secure computation enables multiple mutually distrusting parties to jointly evaluate functions on their private inputs without revealing anything but the result. Generic secure computation protocols in the semi-honest … Continued

Network and Distributed System Security Symposium•Jan 1, 2015•849 citations

Security of Quantum Repeater Network Operation

Rodney Van Meter

Abstract : Much of the work on quantum networks, both entangled and unentangled, has been about the uses of quantum networks to enhance end host security. The most famous such application, of course, is quantum key distribution (QKD), detecting eavesdroppers and creating shared, secret random numbers for use as encryption keys (Bennett and Brassard, 1984). Typically the study of these applications involves information theoretic analysis of the amount of information that an attacker can glean from the use of the network. In this project, we addressed security and quantum networks from an entirely different angle: we investigated the security of the networks themselves. We wanted to know if a single mis-behaving node, or a small number of them, can disrupt operation of the network. Our work produced a first-of-its-kind taxonomy of potential attacks on quantum repeater network operations.

•Oct 3, 2016•1 citation

Quantum repeater in quantum networks (Conference Presentation)

William J. Munro, Kae Nemoto

We have seen remarkable progress made over the last decade in the realization and exploitation of small-scale quantum communication technologies. The community is now at the stage where we need to consider how quantum repeaters and their associated networks are efficiently designed and implemented. This first requires us to define what a quantum repeater actually is and what functionality it requires. Associated with this is also the issue of its performance and when it is better than non-repeater approaches. In this talk, we explore such issues by taking incites from the conventional telecommunication world and use them to establish a framework for what quantum repeaters are and how their performance can be established. As part of this we clearly show that non-repeater approaches can exceed the direct transmission bounds. We extend these concepts to quantum networks and show one must be extremely careful when establishing the optimal communication bounds within them.

Quantum Communications and Quantum Imaging•Sep 10, 2019•0 citations

Constant Round Maliciously Secure 2PC with Function-independent Preprocessing using LEGO

Jesper Buus Nielsen, Thomas H. Schneider, Roberto Trifiletti

Author(s): Jesper Buus Nielsen, Thomas Schneider, Roberto Trifiletti Download: Paper (PDF) Date: 27 Feb 2017 Document Type: Reports Additional Documents: Slides Video Associated Event: NDSS Symposium 2017 Abstract: Asymptotically more efficient than on the circuit level. Since then the LEGO approach has been improved upon in several theoretical works, but never implemented. In this paper we describe further … Continued

Network and Distributed System Security Symposium•Jan 1, 2017•50 citations

Robust implementations of quantum repeaters (14 pages)

Carolina Alves, U. Dorner, Alexander Klein

Physical Review A•Jan 1, 2006•0 citations

Pushing the Communication Barrier in Secure Computation using Lookup Tables

Ghada Dessouky, Farinaz Koushanfar, Ahmad‐Reza Sadeghi +3 more

Author(s): Ghada Dessouky, Farinaz Koushanfar, Ahmad-Reza Sadeghi, Thomas Schneider, Shaza Zeitouni, Michael Zohner Download: Paper (PDF) Date: 27 Feb 2017 Document Type: Reports Additional Documents: Slides Video Associated Event: NDSS Symposium 2017 Abstract: Secure two-party computation (S2PC) allows two parties to compute a function on their joint inputs while leaking only the output of the function. At … Continued

Network and Distributed System Security Symposium•Jan 1, 2017•63 citations
Author(s): Shigeya Suzuki, Rodney Van Meter Download: Paper (PDF) Date: 7 Feb 2015 Document Type: Briefing Papers Additional Documents: Slides Associated Event: NDSS Symposium 2015 Abstract: In this paper, we discuss and classify attacks on quantum repeater systems. As engineers working in both classical and quantum networking, we naturally wish to apply the lessons learned … Continued
Abstract : Much of the work on quantum networks, both entangled and unentangled, has been about the uses of quantum networks to enhance end host security. The most famous such application, of course, is quantum key distribution (QKD), detecting eavesdroppers and creating shared, secret random numbers for use as encryption keys (Bennett and Brassard, 1984). Typically the study of these applications involves information theoretic analysis of the amount of information that an attacker can glean from the use of the network. In this project, we addressed security and quantum networks from an entirely different angle: we investigated the security of the networks themselves. We wanted to know if a single mis-behaving node, or a small number of them, can disrupt operation of the network. Our work produced a first-of-its-kind taxonomy of potential attacks on quantum repeater network operations.
We have seen remarkable progress made over the last decade in the realization and exploitation of small-scale quantum communication technologies. The community is now at the stage where we need to consider how quantum repeaters and their associated networks are efficiently designed and implemented. This first requires us to define what a quantum repeater actually is and what functionality it requires. Associated with this is also the issue of its performance and when it is better than non-repeater approaches. In this talk, we explore such issues by taking incites from the conventional telecommunication world and use them to establish a framework for what quantum repeaters are and how their performance can be established. As part of this we clearly show that non-repeater approaches can exceed the direct transmission bounds. We extend these concepts to quantum networks and show one must be extremely careful when establishing the optimal communication bounds within them.