Related papers: Hiding Quantum Information in the Perfect Code
We present a protocol for deterministic and highly efficient quantum cryptography with entangled photon pairs in a 4x4-dimentional Hilbert space. Two communicating parties, Alice and Bob first share a both polarization- and path-entangled…
We propose a new scheme in which perfect transmission of 1-qubit information is achieved with high success using purposefully delayed sharing of non-maximally entangled 2-qubit resource and repeated generalized Bell-state measurements…
Information about an unknown quantum state can be encoded in weak values of projectors belonging to a complete eigenbasis. We present a protocol that enables one party -- Bob -- to remotely determine the weak values corresponding to weak…
Until now the discussion on perfect security for steganographic systems has remained confined within the realm of mathematicians and information theory experts whose concise and symbolic representation of their philosophies, postulates, and…
We consider a situation in which two parties, Alice and Bob, share a 3-qubit system coupled in an initial maximally entangled, GHZ state. By manipulating locally two of the qubits, Alice can prepare any one of the eight 3-qubit GHZ states.…
We introduce a problem setting which we call ``the freedom fighters' problem''. It subtly differs from the prisoners' problem. We propose a steganographic method that allows Alice and Bob to fool Wendy the warden in this setting. Their…
One of the applications of quantum technology is to use quantum states and measurements to communicate which offers more reliable security promises. Quantum data hiding, which gives the source party the ability of sharing data among…
In recent years, neural networks have been used to implement symmetric cryptographic functions for secure communications. Extending this domain, the proposed approach explores the application of asymmetric cryptography within a neural…
A theorem by Shannon and the Holevo theorem impose that the efficiency of any protocol for quantum key distribution, $\cal E$, defined as the number of secret (i.e., allowing eavesdropping detection) bits per transmitted bit plus qubit, is…
Quantum secret-sharing protocols involving N partners (NQSS) are key distribution protocols in which Alice encodes her key into $N-1$ qubits, in such a way that all the other partners must cooperate in order to retrieve the key. On these…
We present a novel one-way quantum key distribution protocol based on 3-dimensional quantum state, a qutrit, that encodes two qubits in its 2-dimensional subspaces. The qubits hold the classical bit information that has to be shared between…
We investigate the transmission of a secret message from Alice to Bob in the presence of an eavesdropper (Eve) and many of decode-and-forward relay nodes. Each link comprises a set of parallel channels, modeling for example an orthogonal…
This paper introduces two information-theoretically secure protocols that achieve quantum secure direct communication between Alice and Bob in the first case, and among Alice, Bod and Charlie in the second case. Both protocols use the same…
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…
In this contribution we propose a novel steganographic method based on several orthogonal polynomials and their combinations. The steganographic algorithm embeds a secrete message at the first eight coefficients of high frequency image.…
We present a quantum error correction code which protects a qubit of information against general one qubit errors which maybe caused by the interaction with the environment. To accomplish this, we encode the original state by distributing…
A quantum encryption scheme (also called private quantum channel, or state randomization protocol) is a one-time pad for quantum messages. If two parties share a classical random string, one of them can transmit a quantum state to the other…
Bit commitment is a fundamental cryptographic primitive in which Bob wishes to commit a secret bit to Alice. Perfectly secure bit commitment has been proven impossible through asynchronous exchange of classical and quantum information.…
We study the problem of general entanglement purification protocols. Suppose Alice and Bob share a bipartite state $\rho$ which is ``reasonably close'' to perfect EPR pairs. The only information Alice and Bob possess is a lower bound on the…
Digital teleportation protocols make use of entanglement, local measurements and a classical communication channel to transfer quantum states between remote parties. We consider analog teleportation protocols, where classical communication…