相关论文: An Extension of Cook's Elastic Cipher
This paper studies physical-layer secure transmissions from a transmitter to a legitimate receiver against an eavesdropper over slow fading channels, taking into account the impact of finite blocklength secrecy coding. A comprehensive…
This paper studies how post-quantum cryptographic (PQC) security assumptions can be represented and communicated through a structured, layered framework that is useful for technical interpretation but does not replace formal cryptographic…
In this Paper, we investigate the security of Zhang, Li and Guo quantum key distribution via quantum encryption protocol [$\text{Phys. Rev. A} \textbf{64}, 24302 (2001)$] and show that it is not secure against some of Eve's attacks and with…
Quantum data locking is a protocol that allows for a small secret key to (un)lock an exponentially larger amount of information, hence yielding the strongest violation of the classical one-time pad encryption in the quantum setting. This…
It was claimed that all quantum string seals are insecure [H. F. Chau, quant-ph/0602099]. However, here it will be shown that for imperfect quantum string seals, the information obtained by the measurement proposed in that reference is…
We provide a security analysis for continuous variable quantum key distribution protocols based on the transmission of squeezed vacuum states measured via homodyne detection. We employ a version of the entropic uncertainty relation for…
We consider a system where an agent (Alice) aims at transmitting a message to a second agent (Bob) over a set of parallel channels, while keeping it secret from a third agent (Eve) by using physical layer security techniques. We assume that…
Quantum Key Distribution allows two parties to establish a secret key that is secure against computationally unbounded adversaries. To extend the distance between parties, quantum networks, and in particular repeater chains, are vital.…
Quantum key distribution (QKD) allows two spatially separated parties to securely generate a cryptographic key. The first QKD protocol, published by C. H. Bennett and G. Brassard in 1984 (BB84), describes how this is achieved by…
Claude Shannon proved in 1949 that information-theoretic-secure encryption is possible if the encryption key is used only once, is random, and is at least as long as the message itself. Notwithstanding, when information is encoded in a…
The performance of quantum key distribution (QKD) is severely limited by multi-photon pulses emitted by laser sources due to the photon-number splitting attack. Coherent-one-way (COW) QKD has been introduced as a promising solution to…
Quantum cryptography makes it possible to expand a short shared key (of e.g. 256 bits[1]) into an arbitrary long shared key. The novelty of quantum cryptography is that whenever a spy tries to eavesdrop the communication he causes…
Quantum key distribution (QKD) systems can send signals over more than 100 km standard optical fiber and are widely believed to be secure. Here, we show experimentally for the first time a technologically feasible attack, namely the…
Covert and secret quantum key distribution aims at generating information-theoretically secret bits between distant legitimate parties in a manner that remains provably undetectable by an adversary. We propose a framework in which to…
The Advanced Encryption Standard (AES) is widely recognized as the most important block cipher in common use nowadays. This high assurance in AES is given by its resistance to ten years of extensive cryptanalysis, that has shown no…
We study the secure decentralized Pliable Index CODing (PICOD) problem with circular side information sets at the users. The security constraint forbids every user to decode more than one message while a decentralized setting means there is…
Extending the functionality and overcoming the performance limitation under which QKD can operate requires either quantum repeaters or new security models. Investigating the latter option, we introduce the \textit{Quantum Computational…
It has been shown that in the asymptotic case of infinite-key length the 2-decoy state QKD protocol outperforms the 1-decoy state protocol. Here, we present a finite-key analysis of the 1-decoy method. Interestingly, we find that for…
In quantum weak oblivious transfer, Alice sends Bob two bits and Bob can learn one of the bits at his choice. It was found that the security of such a protocol is bounded by $2P_{Alice}^{\ast }+P_{Bob}^{\ast }\geq 2$, where $P_{Alice}^{\ast…
Reliable distribution of quantum entanglement over long distances is a central challenge in quantum information science, fundamentally limited by decoherence in noisy communication channels. In this work, we investigate the asymptotic…