Subscribe to the gold package and get unlimited access to Shamra Academy
Register a new userExperimental implementation of secure anonymous protocols on an eight-user quantum network
77
0
0.0
(
0
)
Ask ChatGPT about the research
No Arabic abstract
Anonymity in networked communication is vital for many privacy-preserving tasks. Secure key distribution alone is insufficient for high-security communications, often knowing who transmits a message to whom and when must also be kept hidden from an adversary. Here we experimentally demonstrate 5 information-theoretically secure anonymity protocols on an 8 user city-wide quantum network using polarisation-entangled photon pairs. At the heart of these protocols is anonymous broadcasting, which is a cryptographic primitive that allows one user to reveal one bit of information while keeping her identity anonymous. For a network of $n$ users, the protocols retain anonymity for the sender, given less than $n-2$ users are dishonest. This is one of the earliest implementations of genuine multi-user cryptographic protocols beyond standard QKD. Our anonymous protocols enhance the functionality of any fully-connected Quantum Key Distribution network without trusted nodes.
rate research
Read More
Quantum secure direct communication (QSDC) based on entanglement can directly transmit confidential information. However, the inability to simultaneously distinguish the four sets of encoded entangled states limits its practical application. Here, we explore a deterministic QSDC network based on time-energy entanglement and sum-frequency generation. 15 users are in a fully connected QSDC network, and the fidelity of the entangled state shared by any two users is greater than 97%. The results show that when any two users are performing QSDC over 40 kilometers of optical fiber, the fidelity of the entangled state shared by them is still greater than 95%, and the rate of information transmission can be maintained above 1Kbp/s. Our Letter demonstrates the feasibility of a proposed QSDC network, and hence lays the foundation for the realization of satellite-based long-distance and global QSDC in the future.
Due to the intrinsic point-to-point characteristic of quantum key distribution (QKD) systems, it is necessary to study and develop QKD network technology to provide a secure communication service for a large-scale of nodes over a large area. Considering the quality assurance required for such a network and the cost limitations, building an effective mathematical model of a QKD network becomes a critical task. In this paper, a flow-based mathematical model is proposed to describe a QKD network using mathematical concepts and language. In addition, an investigation on QKD network topology evaluation was conducted using a unique and novel QKD network performance indicator, the Information-Theoretic Secure communication bound, and the corresponding linear programming-based calculation algorithm. A large number of simulation results based on the topologies of SECOQC network and NSFNET network validate the effectiveness of the proposed model and indicator.
We report the realization of a nuclear magnetic resonance computer with three quantum bits that simulates an adiabatic quantum optimization algorithm. Adiabatic quantum algorithms offer new insight into how quantum resources can be used to solve hard problems. This experiment uses a particularly well suited three quantum bit molecule and was made possible by introducing a technique that encodes general instances of the given optimization problem into an easily applicable Hamiltonian. Our results indicate an optimal run time of the adiabatic algorithm that agrees well with the prediction of a simple decoherence model.
Cryptography promises confidentiality, integrity, authenticity and non-repudiation to support trillions of transactions every year in digital economy. Recently, some cryptosystems, such as one-way hash functions and public-key cryptosystems, have been broken by exploiting classical computing resources. One-time pad encryption combined with quantum key distribution can perfectly guarantee the confidentiality of communication, which has been demonstrated in various quantum communication networks. However, digital signature technique, traditionally constituted by hash algorithm and public-key encryption, is more extensively used as it ensures integrity, authenticity and non-repudiation of data. The efficient implementation of signing arbitrarily long messages with unconditional security is an intractable open problem. Here we propose unconditionally secure quantum digital signatures consisting of secret sharing, one-time universial$_{2}$ hash functions and one-time pad encryption. The new protocol promises to sign a document of arbitrary length with security bound of $3times10^{-39}$ if using 256-bit key. Furthermore, we build an all-in-one quantum secure network integrating provably secure communication, digital signatures, secret sharing and conference key agreement. Our work paves the way for securing digital enconomy by taking advantage of quantum networks.
In this paper, an efficient arbitrated quantum signature scheme is proposed by combining quantum cryptographic techniques and some ideas in classical cryptography. In the presented scheme, the signatory and the receiver can share a long-term secret key with the arbitrator by utilizing the key together with a random number. While in previous quantum signature schemes, the key shared between the signatory and the arbitrator or between the receiver and the arbitrator could be used only once, and thus each time when a signatory needs to sign, the signatory and the receiver have to obtain a new key shared with the arbitrator through a quantum key distribution protocol. Detailed theoretical analysis shows that the proposed scheme is efficient and provably secure.
Log in to be able to interact and post comments
comments
Fetching comments
Sign in to be able to follow your search criteria
