A 15-user quantum secure direct communication network.
Ontology highlight
ABSTRACT:
SUBMITTER: Qi Z
PROVIDER: S-EPMC8440625 | biostudies-literature |
REPOSITORIES: biostudies-literature
Similar Datasets
Project description:Quantum secure direct communication is an important mode of quantum communication in which secret messages are securely communicated directly over a quantum channel. Quantum secure direct communication is also a basic cryptographic primitive for constructing other quantum communication tasks, such as quantum authentication and quantum dialog. Here, we report the first experimental demonstration of quantum secure direct communication based on the DL04 protocol and equipped with single-photon frequency coding that explicitly demonstrated block transmission. In our experiment, we provided 16 different frequency channels, equivalent to a nibble of four-bit binary numbers for direct information transmission. The experiment firmly demonstrated the feasibility of quantum secure direct communication in the presence of noise and loss.
| S-EPMC6059926 | biostudies-literature
Project description:We propose a novel protocol for controlled bidirectional quantum secure communication based on a nonlocal swap gate scheme. Our proposed protocol would be applied to a system in which a controller (supervisor/Charlie) controls the bidirectional communication with quantum information or secret messages between legitimate users (Alice and Bob). In this system, the legitimate users must obtain permission from the controller in order to exchange their respective quantum information or secret messages simultaneously; the controller is unable to obtain any quantum information or secret messages from the decoding process. Moreover, the presence of the controller also avoids the problem of one legitimate user receiving the quantum information or secret message before the other, and then refusing to help the other user decode the quantum information or secret message. Our proposed protocol is aimed at protecting against external and participant attacks on such a system, and the cost of transmitting quantum bits using our protocol is less than that achieved in other studies. Based on the nonlocal swap gate scheme, the legitimate users exchange their quantum information or secret messages without transmission in a public channel, thus protecting against eavesdroppers stealing the secret messages.
| S-EPMC4076848 | biostudies-other
Project description:Rapid development of supercomputers and the prospect of quantum computers are posing increasingly serious threats to the security of communication. Using the principles of quantum mechanics, quantum communication offers provable security of communication and is a promising solution to counter such threats. Quantum secure direct communication (QSDC) is one important branch of quantum communication. In contrast to other branches of quantum communication, it transmits secret information directly. Recently, remarkable progress has been made in proof-of-principle experimental demonstrations of QSDC. However, it remains a technical feat to bring QSDC into a practical application. Here, we report the implementation of a practical quantum secure communication system. The security is analyzed in the Wyner wiretap channel theory. The system uses a coding scheme of concatenation of low-density parity-check (LDPC) codes and works in a regime with a realistic environment of high noise and high loss. The present system operates with a repetition rate of 1?MHz at a distance of 1.5 kilometers. The secure communication rate is 50?bps, sufficient to effectively send text messages and reasonably sized files of images and sounds.
| S-EPMC6363753 | biostudies-literature
Project description:We propose a quantum secure group communication protocol for the purpose of sharing the same message among multiple authorized users. Our protocol can remove the need for key management that is needed for the quantum network built on quantum key distribution. Comparing with the secure quantum network based on BB84, we show our protocol is more efficient and securer. Particularly, in the security analysis, we introduce a new way of attack, i.e., the counterfactual quantum attack, which can steal information by "invisible" photons. This invisible photon can reveal a single-photon detector in the photon path without triggering the detector. Moreover, the photon can identify phase operations applied to itself, thereby stealing information. To defeat this counterfactual quantum attack, we propose a quantum multi-user authorization system. It allows us to precisely control the communication time so that the attack can not be completed in time.
| S-EPMC5832868 | biostudies-other
Project description:Quantum communication is rapidly gaining popularity due to its high security and technological maturity. However, most implementations are limited to just two communicating parties (users). Quantum communication networks aim to connect a multitude of users. Here, we present a fully connected quantum communication network on a city-wide scale without active switching or trusted nodes. We demonstrate simultaneous and secure connections between all 28 pairings of eight users. Our novel network topology is easily scalable to many users, allows traffic management features, and minimizes the infrastructure as well as the user hardware needed.
| S-EPMC7467697 | biostudies-literature
Project description:In this paper, we generalize a secured direct communication process between N users with partial and full cooperation of quantum server. So, N - 1 disjointed users u1, u2, …, uN-1 can transmit a secret message of classical bits to a remote user uN by utilizing the property of dense coding and Pauli unitary transformations. The authentication process between the quantum server and the users are validated by EPR entangled pair and CNOT gate. Afterwards, the remained EPR will generate shared GHZ states which are used for directly transmitting the secret message. The partial cooperation process indicates that N - 1 users can transmit a secret message directly to a remote user uN through a quantum channel. Furthermore, N - 1 users and a remote user uN can communicate without an established quantum channel among them by a full cooperation process. The security analysis of authentication and communication processes against many types of attacks proved that the attacker cannot gain any information during intercepting either authentication or communication processes. Hence, the security of transmitted message among N users is ensured as the attacker introduces an error probability irrespective of the sequence of measurement.
| S-EPMC4649760 | biostudies-literature
Project description:Optical fibre networks are advancing rapidly to meet growing traffic demands. Security issues, including attack management, have become increasingly important for optical communication networks because of the vulnerabilities associated with tapping light from optical fibre links. Physical layer security often requires restricting access to channels and periodic inspections of link performance. In this paper, we report how quantum communication techniques can be utilized to detect a physical layer attack. We present an efficient method for monitoring the physical layer security of a high-data-rate classical optical communication network using a modulated continuous-variable quantum signal. We describe the theoretical and experimental underpinnings of this monitoring system and the monitoring accuracy for different monitored parameters. We analyse its performance for both unamplified and amplified optical links. The technique represents a novel approach for applying quantum signal processing to practical optical communication networks and compares well with classical monitoring methods. We conclude by discussing the challenges facing its practical application, its differences with respect to existing quantum key distribution methods, and its usage in future secure optical transport network planning.
| S-EPMC7532184 | biostudies-literature
Project description:Computational encryption, information-theoretic secrecy and quantum cryptography offer progressively stronger security against unauthorized decoding of messages contained in communication transmissions. However, these approaches do not ensure stealth--that the mere presence of message-bearing transmissions be undetectable. We characterize the ultimate limit of how much data can be reliably and covertly communicated over the lossy thermal-noise bosonic channel (which models various practical communication channels). We show that whenever there is some channel noise that cannot in principle be controlled by an otherwise arbitrarily powerful adversary--for example, thermal noise from blackbody radiation--the number of reliably transmissible covert bits is at most proportional to the square root of the number of orthogonal modes (the time-bandwidth product) available in the transmission interval. We demonstrate this in a proof-of-principle experiment. Our result paves the way to realizing communications that are kept covert from an all-powerful quantum adversary.
| S-EPMC4667704 | biostudies-other
Project description:Biomolecular cryptography exploiting specific biomolecular interactions for data encryption represents a unique approach for information security. However, constructing protocols based on biomolecular reactions to guarantee confidentiality, integrity and availability (CIA) of information remains a challenge. Here we develop DNA origami cryptography (DOC) that exploits folding of a M13 viral scaffold into nanometer-scale self-assembled braille-like patterns for secure communication, which can create a key with a size of over 700 bits. The intrinsic nanoscale addressability of DNA origami additionally allows for protein binding-based steganography, which further protects message confidentiality in DOC. The integrity of a transmitted message can be ensured by establishing specific linkages between several DNA origamis carrying parts of the message. The versatility of DOC is further demonstrated by transmitting various data formats including text, musical notes and images, supporting its great potential for meeting the rapidly increasing CIA demands of next-generation cryptography.
| S-EPMC6884444 | biostudies-literature
Project description:BACKGROUND:Increasing the reach of messages disseminated through Twitter promotes the success of Twitter-based health education campaigns. OBJECTIVE:This study aimed to identify factors associated with reach in a dental Twitter network (1) initially and (2) sustainably at individual and network levels. METHODS:We used instructors' and students' Twitter usernames from a Saudi dental school in 2016-2017 and applied Gephi (a social network analysis tool) and social media analytics to calculate user and network metrics. Content analysis was performed to identify users disseminating oral health information. The study outcomes were reach at baseline and sustainably over 1.5 years. The explanatory variables were indicators of popularity (number of followers, likes, tweets retweeted by others), communication pattern (number of tweets, retweets, replies, tweeting/ retweeting oral health information or not). Multiple logistic regression models were used to investigate associations. RESULTS:Among dental users, 31.8% had reach at baseline and 62.9% at the end of the study, reaching a total of 749,923 and dropping to 37,169 users at the end. At an individual level, reach was associated with the number of followers (baseline: odds ratio, OR=1.003, 95% CI=1.001-1.005 and sustainability: OR=1.002, 95% CI=1.0001-1.003), likes (baseline: OR=1.001, 95% CI=1.0001-1.002 and sustainability: OR=1.0031, 95% CI=1.0003-1.002), and replies (baseline: OR=1.02, 95% CI=1.005-1.04 and sustainability: OR=1.02, 95% CI=1.004-1.03). At the network level, users with the least followers, tweets, retweets, and replies had the greatest reach. CONCLUSIONS:Reach was reduced by time. Factors increasing reach at the user level had different impact at the network level. More than one strategy is needed to maximize reach.
| S-EPMC6231799 | biostudies-other