Collective Attacks Research Articles

Postselection Technique for Optical Quantum Key Distribution with Improved de Finetti Reductions

The postselection technique is an important proof technique for proving the security of quantum key distribution protocols against coherent attacks via the uplift of any security proof against independent identically distributed collective attacks. In this work, we go through multiple steps to rigorously apply the postselection technique to optical quantum key distribution protocols. First, we place the postselection technique on a rigorous mathematical foundation by fixing a technical flaw in the original postselection paper. Second, we extend the applicability of the postselection technique to prepare-and-measure protocols by using a de Finetti reduction with a fixed marginal. Third, we show how the postselection technique can be used for decoy-state protocols by tagging the source. Finally, we extend the applicability of the postselection technique to realistic optical setups by developing a new variant of the flag-state squasher. We also improve existing de Finetti reductions, which reduce the effect of using the postselection technique on the key rate. These improvements can be more generally applied to other quantum information processing tasks. As an example to demonstrate the applicability of our work, we apply our results to the time-bin-encoded three-state protocol. We observe that the postselection technique performs better than all other known proof techniques against coherent attacks. Published by the American Physical Society 2024

Discrete modulation continuous variable quantum key distribution under fast fading channel

After decades of development, continuous variable quantum key distribution technology still cannot meet people’s needs for secure communication over long distances. Free-space quantum communication provides a new way for secure communication over long distances. However, because the communication connected in free space is inevitably affected by atmospheric turbulence, the transmission rate of the channel changes rapidly according to the probability distribution, making it difficult for the communication personnel to determine the transmission rate of the channel. At the same time, discrete modulated continuously variable quantum key Distribution protocol (DM-CVQKD) has certain advantages over Gauss modulated continuously variable quantum key Distribution protocol (GM-CVQKD) in the communication distance. Therefore, this paper analyzes the key rate of DM-CVQKD in this case (that is, in the fast attenuation channel), proves that it can resist the collective attack, and observes the relationship between the parameters and the key rate in the fast attenuation channel by numerical simulation and control variables. Finally, through the analysis of numerical simulation results, it is found that DM-CVQKD can still maintain a high key rate under certain conditions, which proves that long-distance free space quantum communication is feasible under certain conditions. At the same time, it was found that the performance of DM-CVQKD was affected by the extreme case where Eve completely controlled the instantaneous transmittance.

Designing and codifying a test to measure the speed and ability to pass and receive the ball in a collective fast attack for Iraqi handball club players

The recent amendments to the rules of the law of the game have contributed effectively to raise the pace of competition by increasing the speed of the game’s rhythm to revolutionize this field. Therefore, most international and local teams have begun to change training methods to reflect this on the style of playing and the concentration of those teams has shifted to the fast attack that is characterized by ease and scoring goals quickly to achieve victory so that the dominant character of the game becomes fast rhythm playing. All handball players should have the capabilities that qualify them to meet the requirements of the game which helps to determine the level of ball passing skills among handball players in a collective fast attack to perform shots on goal skillfully with high accuracy. Hence, it requires the availability of means or tests to measure the capabilities of the players, and here lies the importance of this study, but if these tests are found, they are rare or not sufficient for the purpose, and here lies the problem of the study. Therefore, the researchers agree to delve into this matter to develop appropriate solutions by designing a modern measurement method or a special test so that researchers, coaches and handball players alike can benefit from the test as a humble service from the researchers of this paper towards the game. The study is conducted on some club players participating in the Iraqi Handball League. The main goal of this study is to design and codify a special test to measure the ability of the players to perform a fast collective attack. Additionally, as for the areas of study, the researchers rely on some club players participating in the Iraqi Handball League. The study is performed on 10th Mar, 2021 until 20th Jul, 2022. The procedures of the test are conducted in the stadiums of the clubs participating in the Iraqi Handball League. The study employs a general qualitative approach. The researchers also employ quantitative methods to highlight the percentages, the arithmetic mean, the standard deviation, the simple correlation coefficient, the T test, the standard score, and the modified standard score. The researchers conclude from the results they achieved that this test, which is designed and codified, is characterized by high accuracy and adequacy, and can be used to measure the speed and ability to pass and receive the ball in the collective fast attack of handball players which is the reason for designing such test. The researchers support employing such tests to measure the speed and effectiveness of handball players’ performance of the fast attack process in order to properly evaluate their performance before and during the championships. The researchers also urge to devise other tests on different samples.

Consensus-based virtual leader tracking swarm algorithm with GDRRT*-PSO for path-planning of multiple-UAVs

UAV technology is rapidly advancing and widely utilized, particularly in social and military domains, due to its extensive motion and maneuverability. Coordinating multiple UAVs enables more rapid and efficient task execution compared to a single UAV. The proliferation of UAVs across various sectors, including entertainment, transportation, delivery, and social domains, as well as military applications such as surveillance, tracking, and attack, has spurred research in swarm systems. In this study, a new swarm topology is presented by combining the Consensus-Based Virtual Leader Tracking Swarm Algorithm (CBVLTSA), which provides formation control in swarm systems, with the Goal Distance-based Rapidly-Exploring Random Tree with Particle Swarm Optimization (GDRRT*-PSO) route planning algorithm. Recently proposed, GDRRT* is notable for its efficient operation in expansive environments and rapid convergence to the goal. Within this framework, the path generated by GDRRT* is optimized using PSO to yield the shortest current route. CBVLTSA employs a potential push and pull function to facilitate cooperative, coordinated flight among swarm members. While applying pushing force to avoid collisions with each other and obstacles, members also exert pulling force to maintain flight formation while navigating to target points. This ensures controlled flight formation and collision-free traversal along the GDRRT*-PSO route. Consequently, unlike the others, the proposed algorithm achieves faster target reach with pre-planned routes, demonstrating a robust and flexible swarm topology with CBVLTSA. Moreover, we anticipate the significant utility of this algorithm across various swarm applications, including target detection, observation, tracking, trade and transportation logistics, and collective defense and attack strategies.

Measurement-free mediated semi-quantum key distribution protocol based on single-particle states

A novel measurement-free mediated semi-quantum key distribution (MSQKD) protocol is proposed based on single-particle states. It enables two classical users to establish a secret key with the assistance of a third party. This protocol simplifies the third party’s role to solely generating qubits in X-basis and conducting Bell measurements. A distinctive feature of this protocol is the efficient grouping and reordering of qubits by the classical users with a minimum of three delay lines. Security analyses demonstrate that the protocol can withstand various attack strategies, including collective attack, measurement attack, fake state attack, and modification attack. The noise tolerance is given by deriving a lower bound of the protocol’s key rate in the asymptotic scenario. Simulations on the IBM Quantum Experience platform are conducted to illustrate the feasibility of this protocol. Compared with existing MSQKD protocols, the proposed protocol consumes fewer quantum resources and achieves a qubit efficiency of 1/8.

A multi-agent adaptive deep learning framework for online intrusion detection

The network security analyzers use intrusion detection systems (IDSes) to distinguish malicious traffic from benign ones. The deep learning-based (DL-based) IDSes are proposed to auto-extract high-level features and eliminate the time-consuming and costly signature extraction process. However, this new generation of IDSes still needs to overcome a number of challenges to be employed in practical environments. One of the main issues of an applicable IDS is facing traffic concept drift, which manifests itself as new (i.e. , zero-day) attacks, in addition to the changing behavior of benign users/applications. Furthermore, a practical DL-based IDS needs to be conformed to a distributed (i.e. , multi-sensor) architecture in order to yield more accurate detections, create a collective attack knowledge based on the observations of different sensors, and also handle big data challenges for supporting high throughput networks. This paper proposes a novel multi-agent network intrusion detection framework to address the above shortcomings, considering a more practical scenario (i.e., online adaptable IDSes). This framework employs continual deep anomaly detectors for adapting each agent to the changing attack/benign patterns in its local traffic. In addition, a federated learning approach is proposed for sharing and exchanging local knowledge between different agents. Furthermore, the proposed framework implements sequential packet labeling for each flow, which provides an attack probability score for the flow by gradually observing each flow packet and updating its estimation. We evaluate the proposed framework by employing different deep models (including CNN-based and LSTM-based) over the CIC-IDS2017 and CSE-CIC-IDS2018 datasets. Through extensive evaluations and experiments, we show that the proposed distributed framework is well adapted to the traffic concept drift. More precisely, our results indicate that the CNN-based models are well suited for continually adapting to the traffic concept drift (i.e. , achieving an average detection rate of above 95% while needing just 128 new flows for the updating phase), and the LSTM-based models are a good candidate for sequential packet labeling in practical online IDSes (i.e. , detecting intrusions by just observing their first 15 packets).

Continuous-Variable Measurement-Device-Independent Quantum Key Distribution in the Terahertz Band

We have introduced, for the first time, a protocol for Continuous-Variable Measurement-Device-Independent Quantum Key Distribution (CV-MDI-QKD) in the terahertz (THz) frequency band. We have conducted a secret key rate analysis against collective attacks. The proposed THz CV-MDI-QKD is immune to all detector attacks, significantly enhancing the security assurance of practical THz CVQKD implementations. Furthermore, we investigated the impact of finite key length (the finite-size effect) and finite reconciliation efficiency on the performance of practical THz CV-MDI-QKD systems. Our findings reveal that by employing a large number of keys or signals and optimizing the modulation variance, the detrimental effects arising from the finite-size effect and suboptimal reconciliation efficiency can be notably mitigated. These insights play a crucial role in advancing the feasibility of THz CVQKD technology towards practical applications.

Improvement and security analysis of multi-ring discrete modulation continuous variable quantum secret sharing scheme

Abstract In order to avoid the complexity of Gaussian modulation and the problem that the traditional point-to-point communication DM-CVQKD protocol cannot meet the demand for multi-user key sharing at the same time, we propose a multi-ring discrete modulation continuous variable quantum key sharing scheme (MR-DM-CVQSS). In this paper, we primarily compare single-ring and multi-ring M-symbol amplitude and phase-shift keying modulations. We analyze their asymptotic key rates against collective attacks and consider the security key rates under finite-size effects. Leveraging the characteristics of discrete modulation, we improve the quantum secret sharing scheme. Non-dealer participants only require simple phase shifters to complete quantum secret sharing. We also provide the general design of the MR-DM-CVQSS protocol. We conduct a comprehensive analysis of the improved protocol’s performance, confirming that the enhancement through multi-ring M-PSK allows for longer-distance quantum key distribution. Additionally, it reduces the deployment complexity of the system, thereby increasing the practical value.

Attack semantics and collective attacks revisited

In the current paper we re-examine the concepts of attack semantics and collective attacks in abstract argumentation, and examine how these concepts interact with each other. For this, we systematically map the space of possibilities. Starting with standard argumentation frameworks (which consist of a directed graph with nodes and arrows) we briefly state both node semantics and arrow semantics (the latter a.k.a. attack semantics) in both their extensions-based form and labellings-based form. We then proceed with SETAFs (which consist of a directed hypergraph of nodes and arrows, to take into account the notion of collective attacks) and state both node semantics and arrow semantics, in both their extensions-based and labellings-based form. We then show equivalence between the extensions-based and labellings-based form, for node semantics and arrow semantics of AFs, as well as for node semantics and arrow semantics of SETAFs. Moreover, we show equivalence between node semantics and arrow semantics for AFs, and equivalence between node semantics and arrow semantics for SETAFs (with the notable exception of semi-stable). We also provide a novel way of converting a SETAF to an AF such that semantics are preserved, without the use of any “meta arguments”. Although the main part of our work is on the level of abstract argumentation, we do provide an application of our theory on the instantiated level. More specifically, we show that the classical characterisation of Assumption-Based Argumentation (ABA) can be seen as an instantiation based on a SETAF, whereas the contemporary characterisation of ABA can be seen as an instantiation based on a standard AF. Our theory of how to convert a SETAF to an AF can then be used to account for both the similarities and the differences between the classical and contemporary characterisations of ABA. Most prominently, our theory is able to explain the semantic mismatch for semi-stable semantics that arises in the ABA instantiation process.

War: Mentalization and Totalitarian State of Mind.

For most residents of Europe, war is a new experience in which they find themselves both as witnesses and participants. In this paper the war in Ukraine serves as an illustration and case example. Like any unfamiliar experience, war elicits profound emotional responses which can be so overwhelming that an individual may be unable to fully process them and to create mental representations of the reality of war. When the psyche becomes entrapped in an unprocessed state, without the capacity to derive meaning from it, this results in the "fossilization" of the psyche akin to what McGinley and Segal describes as a totalitarian state of mind. Subjectivity and individual differences come under collective or personal attack, or both. This state of being prioritizes the needs of the collective psyche over the individual psyche. The image of Gorgon Medusa, who transformed living people into "fossilized" ones, is presented as a metaphor of total identification with the collective dimension. In contrast, the psyche can reveal a creative approach to resolving war-induced trauma. This is depicted in the concept of the Alchemical Stone and its creation, which symbolizes a harmonious connection between the external and internal realms, the subjective and objective experiences, and the real and the imaginal dimension.

Neural network method: withstanding noise for continuous-variable quantum key distribution with discrete modulation

Excess noise in continuous-variable quantum key distribution systems usually results in a loss of key rate, leading to fatal security breaches. This paper proposes a long short-term memory time-sequence neural network to predict the key rate of the system while counteracting the effects of excess noise. The proposed network model, which can be updated with historical data, predicts the key rate of the future moment for the input time-sequence data. To increase the key rate, we perform a postselection operation to combat excess noise. We demonstrate the asymptotic security of the protocol against collective attacks with the numerical simulations using the quadrature phase-shift keying protocol, where some parameters have been optimized to resist excess noise. It provides a potential solution for improving the security of quantum communication in practical applications.

Principles and their Computational Consequences for Argumentation Frameworks with Collective Attacks

Argumentation frameworks (AFs) are a key formalism in AI research. Their semantics have been investigated in terms of principles, which define characteristic properties in order to deliver guidance for analyzing established and developing new semantics. Because of the simple structure of AFs, many desired properties hold almost trivially, at the same time hiding interesting concepts behind syntactic notions. We extend the principle-based approach to argumentation frameworks with collective attacks (SETAFs) and provide a comprehensive overview of common principles for their semantics. Our analysis shows that investigating principles based on decomposing the given SETAF (e.g. directionality or SCC-recursiveness) poses additional challenges in comparison to usual AFs. We introduce the notion of the reduct as well as the modularization principle for SETAFs which will prove beneficial for this kind of investigation. We then demonstrate how our findings can be utilized for incremental computation of extensions and show how we can use graph properties of the frameworks to speed up these algorithms.

Long-distance continuous-variable quantum key distribution over 100-km fiber with local local oscillator.

Quantum key distribution (QKD) enables two remote parties to share encryption keys with security based on the laws of physics. Continuous-variable (CV) QKD with coherent states and coherent detection integrates well with existing telecommunication networks. Thus far, long-distance CV-QKD has only been demonstrated using a highly complex scheme where the local oscillator is transmitted, opening security loopholes for eavesdroppers and limiting potential applications. Here, we report a long-distance CV-QKD experiment with a locally generated local oscillator over a 100-kilometer fiber channel with a total loss of 15.4 decibels. This record-breaking distance is achieved by controlling the phase noise-induced excess noise through a machine learning framework for carrier recovery and optimizing the modulation variance. We implement the full CV-QKD protocol and demonstrate the generation of keys secure against collective attacks in the finite-size regime. Our results mark a substantial milestone for realizing CV quantum access networks with a high loss budget and pave the way for large-scale deployment of secure QKD.

Unidimensional Continuous Variable Quantum Key Distribution under Fast Fading Channel

AbstractIn this paper, the performance of a unidimensional continuous variable quantum key distribution protocol is analyzed using Gaussian modulated coherent state under fast fading channel. In the fast fading channel, both parties are connected in free space, resulting in a harsh propagation environment and pollution caused by atmospheric turbulence. This pollution makes it difficult for the communicators to determine the channel transmittance, which can only be estimated based on a probability distribution. To address this, only one modulator is used to code, which demonstrates performance equivalent to that of the symmetric modulated Gaussian coherent state protocol. The security of the protocol in the face of collective attacks is analyzed and it is proved that it can accept a certain amount of excessive channel noise while simplifying operations. Simultaneously, the impact of finite‐key length effects on the protocol is analyzed. It is also demonstrated that this protocol can reduce costs within an acceptable range of performance losses, making it more practical.

Improving the performance of twin-field quantum key distribution with advantage distillation technology

In this work, we apply the advantage distillation method to improve the performance of a practical twin-field quantum key distribution system under collective attack. Compared with the previous analysis result given by Maeda, Sasaki and Koashi [Nature Communication 10, 3140 (2019)], the maximal transmission distance obtained by our analysis method will be increased from 420 km to 470 km. By increasing the loss-independent misalignment error to 12%, the previous analysis method can not overcome the rate-distance bound. However, our analysis method can still overcome the rate-distance bound when the misalignment error is 16%. More surprisingly, we prove that twin-field quantum key distribution can generate positive secure key even if the misalignment error is close to 50%, thus our analysis method can significantly improve the performance of a practical twin-field quantum key distribution system.

Large-alphabet time-bin quantum key distribution and Einstein–Podolsky–Rosen steering via dispersive optics

Quantum key distribution (QKD) has established itself as a groundbreaking technology, showcasing inherent security features that are fundamentally proven. Qubit-based QKD protocols that rely on binary encoding encounter an inherent constraint related to the secret key capacity. This limitation restricts the maximum secret key capacity to one bit per photon. On the other hand, qudit-based QKD protocols have their advantages in scenarios where photons are scarce and noise is present, as they enable the transmission of more than one secret bit per photon. While proof-of-principle entangled-based qudit QKD systems have been successfully demonstrated over the years, the current limitation lies in the maximum distribution distance, which remains at 20 km fiber distance. Moreover, in these entangled high-dimensional QKD systems, the witness and distribution of quantum steering have not been shown before. Here we present a high-dimensional time-bin QKD protocol based on energy-time entanglement that generates a secure finite-length key capacity of 2.39 bit/coincidences and secure cryptographic finite-length keys at 0.24 Mbits s−1 in a 50 km optical fiber link. Our system is built entirely using readily available commercial off-the-shelf components, and secured by nonlocal dispersion cancellation technique against collective Gaussian attacks. Furthermore, we set new records for witnessing both energy-time entanglement and quantum steering over different fiber distances. When operating with a quantum channel loss of 39 dB, our system retains its inherent characteristic of utilizing large-alphabet. This enables us to achieve a secure key rate of 0.30 kbits s−1 and a secure key capacity of 1.10 bit/coincidences, considering finite-key effects. Our experimental results closely match the theoretical upper bound limit of secure cryptographic keys in high-dimensional time-bin QKD protocols (Mower et al 2013 Phys. Rev. A 87 062322; Zhang et al 2014 Phys. Rev. Lett. 112 120506), and outperform recent state-of-the-art qubit-based QKD protocols in terms of secure key throughput using commercial single-photon detectors (Wengerowsky et al 2019 Proc. Natl Acad. Sci. 116 6684; Wengerowsky et al 2020 npj Quantum Inf. 6 5; Zhang et al 2014 Phys. Rev. Lett. 112 120506; Zhang et al 2019 Nat. Photon. 13 839; Liu et al 2019 Phys. Rev. Lett. 122 160501; Zhang et al 2020 Phys. Rev. Lett. 125 010502; Wei et al 2020 Phys. Rev. X 10 031030). The simple and robust entanglement-based high-dimensional time-bin protocol presented here provides potential for practical long-distance quantum steering and QKD with multiple secure bits-per-coincidence, and higher secure cryptographic keys compared to mature qubit-based QKD protocols.

Generating local oscillator locally in continuous variable quantum key distribution using optical injection phase locked loop: a theoretical approach.

In this study, we investigate the feasibility of utilizing optical injection locking with phase-locked loop feedback to generate a true local oscillator for continuous-variable quantum key distribution (CV-QKD). We evaluate the noise and imperfections associated with this novel approach and compare our findings with existing CV-QKD schemes. Notably, our calculations demonstrate significantly lower noise levels compared to other locally generated local oscillator-based CV-QKD schemes. Furthermore, we assess the secure key rate and achievable distance under collective attack for our proposed scheme and compare it to other variants of CV-QKD protocols employing a true local oscillator. Our results align well with experimental data, highlighting the promise of our approach.

Efficient Mediated Quantum Secret Sharing Protocol in a Restricted Quantum Environment

AbstractThe multiparty‐mediated quantum secret sharing (MQSS) protocol proposed by Tsai et al. [Quantum Inf. Process., 2022, 21, 63] allows n restricted users with limited quantum capabilities to share secret information using a dishonest third party with full quantum capabilities. Although the MQSS protocol allows restricted users to achieve secret sharing with lightweight quantum capabilities, the qubit efficiency of this protocol can be further improved. Therefore, this study proposes a measurement property of the graph state to design an efficient mediated quantum secret‐sharing protocol in the same quantum environment as that of Tsai et al.’s protocol. The proposed MQSS protocol not only inherits the lightweight property of Tsai et al.’s protocol but also improves the qubit efficiency of Tsai et al.’s protocol by times. Security analysis is performed to show that the proposed MQSS protocol can avoid collective, collusion, and Trojan horse attacks. Furthermore, this study uses quantum network simulation software to implement Tsai et al.’s protocol and the proposed protocol to prove the feasibility of the proposed MQSS protocol and show that it is more efficient than Tsai et al.’s protocol.

Expressiveness of SETAFs and support-free ADFs under 3-valued semantics

Generalising the attack structure in argumentation frameworks (AFs) has been studied in different ways. Most prominently, the binary attack relation of Dung frameworks has been extended to the notion of collective attacks. The resulting formalism is often termed SETAFs. Among the generalisations of AFs, abstract dialectical frameworks (ADFs) allow for a systematic and flexible generalisation of AFs in which different kinds of logical relations, e.g. attack and support, among arguments can be represented. Restricting the logical relations among arguments leads to different subclasses of ADFs of interest. In this work, we consider so-called support-free ADFs that allow for all kinds of attacks but no support or other relations and SETADFs that embed SETAFs in the ADF setting. The aim of this paper is to shed light on the relation between these two different approaches. To this end, we investigate and compare the expressiveness of SETAFs and support-free ADFs under the lens of 3-valued semantics. Our results show that it is only the presence of unsatisfiable acceptance conditions in support-free ADFs that discriminates the two approaches.

De Finetti Theorems for Quantum Conditional Probability Distributions with Symmetry

The aim of device-independent quantum key distribution (DIQKD) is to study protocols that allow the generation of a secret shared key between two parties under minimal assumptions on the devices that produce the key. These devices are merely modeled as black boxes and mathematically described as conditional probability distributions. A major obstacle in the analysis of DIQKD protocols is the huge space of possible black box behaviors. De Finetti theorems can help to overcome this problem by reducing the analysis to black boxes that have an iid structure. Here we show two new de Finetti theorems that relate conditional probability distributions in the quantum set to de Finetti distributions (convex combinations of iid distributions) that are themselves in the quantum set. We also show how one of these de Finetti theorems can be used to enforce some restrictions onto the attacker of a DIQKD protocol. Finally we observe that some desirable strengthenings of this restriction, for instance to collective attacks only, are not straightforwardly possible.