Subscribe to the gold package and get unlimited access to Shamra Academy
Register a new userPhase-Matching Quantum Cryptographic Conferencing
55
0
0.0
(
0
)
Ask ChatGPT about the research
No Arabic abstract
Quantum cryptographic conferencing (QCC) holds promise for distributing information-theoretic secure keys among multiple users over long distance. Limited by the fragility of Greenberger-Horne-Zeilinger (GHZ) state, QCC networks based on directly distributing GHZ states at long distance still face big challenge. Another two potential approaches are measurement device independent QCC and conference key agreement with single-photon interference, which was proposed based on the post-selection of GHZ states and the post-selection of W state, respectively. However, implementations of the former protocol are still heavily constrained by the transmission rate $eta$ of optical channels and the complexity of the setups for post-selecting GHZ states. Meanwhile, the latter protocol cannot be cast to a measurement device independent prepare-and-measure scheme. Combining the idea of post-selecting GHZ state and recently proposed twin-field quantum key distribution protocols, we report a QCC protocol based on weak coherent state interferences named phase-matching quantum cryptographic conferencing, which is immune to all detector side-channel attacks. The proposed protocol can improve the key generation rate from $mathrm{O}(eta^N)$ to $mathrm{O}(eta^{N-1})$ compared with the measurement device independent QCC protocols. Meanwhile, it can be easily scaled up to multiple parties due to its simple setup.
rate research
Read More
We investigate cryptographic quantum parameter estimation with a high-dimensional system that allows only Bob (Receiver) to access the result and achieve optimal parameter precision from Alice (Sender). Eavesdropper (Eve) only can disturb the parameter estimation of Bob, but she can not obtain the information of parameter. We analyze the security and show that the high-dimensional system can help to utilize the resource to obtain better precision than the two-dimensional system. Finally, we generalize it to the case of multi-parameter.
We propose a multiple pulses phase-matching quantum key distribution protocol (MPPM-QKD) to exceed the linear key rate bound and to achieve higher error tolerance. In our protocol, Alice and Bob generate at first their own train pulses (each train should contain L pulses) as well as random bit sequences, and also encode each pulse of their trains with a randomized phase and a modulation phase. As the next step, both encoded trains are simultaneously sent to Charlie, who performs an interference detection and may be also an eavesdropper. After a successful detection is announced by Charlie, Alice and Bob open the randomized phase of each pulse and keep only communications when the summation of the difference randomized phases at two success detections time-stamps for Alice and Bob are equal to 0 or pi. Thereafter, Alice and Bob compute the sifted key with the time-stamps. The above procedure is repeated until both Alice and Bob achieve sufficiently long sifted keys. We can also show that the secret key rate of the proposed QKD protocol can beat the rate-loss limit of so far known QKD protocols when the transmission distance is greater than 250 km. Moreover, the proposed protocol has a higher error tolerance, approximately 24%, when the transmission distance is 50 km and L = 128. The secret key rate and the transmission distance of our protocol are superior to that of the round-robin differential-phase-shift quantum key distribution protocol [6], and also of the measurement-device-independent quantum key distribution protocol [4], and the secret key rate performance is better in both cases than that of phase-matching quantum key distribution when bit train length is greater than 32.
Cryptographic protocols, such as protocols for secure function evaluation (SFE), have played a crucial role in the development of modern cryptography. The extensive theory of these protocols, however, deals almost exclusively with classical attackers. If we accept that quantum information processing is the most realistic model of physically feasible computation, then we must ask: what classical protocols remain secure against quantum attackers? Our main contribution is showing the existence of classical two-party protocols for the secure evaluation of any polynomial-time function under reasonable computational assumptions (for example, it suffices that the learning with errors problem be hard for quantum polynomial time). Our result shows that the basic two-party feasibility picture from classical cryptography remains unchanged in a quantum world.
Secure quantum conferencing refers to a protocol where a number of trusted users generate exactly the same secret key to confidentially broadcast private messages. By a modification of the techniques first introduced in [Pirandola, arXiv:1601.00966], we derive a single-letter upper bound for the maximal rates of secure conferencing in a quantum network with arbitrary topology, where the users are allowed to perform the most powerful local operations assisted by two-way classical communications, and the quantum systems are routed according to the most efficient multipath flooding strategies. More precisely, our analysis allows us to bound the ultimate rates that are achievable by single-message multiple-multicast protocols, where N senders distribute N independent secret keys, and each key is to be shared with an ensemble of M receivers.
Two time-reversal quantum key distribution (QKD) schemes are the quantum entanglement based device-independent (DI)-QKD and measurement-device-independent (MDI)-QKD. The recently proposed twin field (TF)-QKD, also known as phase-matching (PM)-QKD, has improved the key rate bound from $Oleft( eta right )$ to $Oleft( sqrt {eta} right )$ with $eta$ the channel transmittance. In fact, TF-QKD is a kind of MDI-QKD but based on single-photon detection. In this paper, we propose a different PM-QKD based on single-photon entanglement, referred to as single-photon entanglement-based phase-matching (SEPM)-QKD, which can be viewed as a time-reversed version of the TF-QKD. Detection loopholes of the standard Bell test, which often occur in DI-QKD over long transmission distances, are not present in this protocol because the measurement settings and key information are the same quantity which is encoded in the local weak coherent state. We give a security proof of SEPM-QKD and demonstrate in theory that it is secure against all collective attacks and beam-splitting attacks. The simulation results show that the key rate enjoys a bound of $Oleft( sqrt {eta} right )$ with respect to the transmittance. SEPM-QKD not only helps us understand TF-QKD more deeply, but also hints at a feasible approach to eliminate detection loopholes in DI-QKD for long-distance communications.
Log in to be able to interact and post comments
comments
Fetching comments
Sign in to be able to follow your search criteria
