Hiding Quantum States in a Superposition (original) (raw)
Related papers
2007
We study the teleportation scheme performed by means of a partially entangled pure state. We found that the information belonging to the quantum channel can be distributed into both the system of the transmitter and the system of the receiver. Thus, in order to complete the teleportation process it is required to perform an "unambiguous non-orthogonal quantum states discrimination" and an "extraction of the quantum information" processes. This general scheme allows one to design a strategy for concealing the unknown information of the teleported state. Besides, we showed that the teleportation and the "concealing the quantum information" process, can be probabilistically performed even though the bipartite quantum channel is maximally entangled.
IEEE Transactions on Information Theory, 2002
We expand on our work on Quantum Data Hiding [1] -hiding classical data among parties who are restricted to performing only local quantum operations and classical communication (LOCC). We review our scheme that hides one bit between two parties using Bell states, and we derive upper and lower bounds on the secrecy of the hiding scheme. We provide an explicit bound showing that multiple bits can be hidden bitwise with our scheme. We give a preparation of the hiding states as an efficient quantum computation that uses at most one ebit of entanglement. A candidate data hiding scheme that does not use entanglement is presented. We show how our scheme for quantum data hiding can be used in a conditionally secure quantum bit commitment scheme.
2009
Though security is nothing new, the way that security has become a part of our daily lives today is unprecedented. Today, steganography is most often associated with the high-tech variety, where data is hidden within other data in an electronic file. Steganography is hidden writing, whether it consists of invisible ink on paper or copyright information hidden in an audio or video file. This work has as purpose to expand the field of applicability of the steganography from the classical informatics to the quantum one.
Multiparty data hiding of quantum information
Physical Review A, 2005
In a variety of situations, it is desirable to distribute data among many parties in such a way that the parties can reconstruct the data only if they cooperate in a well-defined way. This problem has been studied in several settings, including the purely classical case 1, encoding classical data in quantum systems 2–5, and encoding quantum data in quantum systems 6–9. For the last two settings, at least two inequivalent security criteria can be applied. In quantum secret sharing 6, 8, certain authorized sets of parties are able to ...
Hide Secrets Using the Power of Quantum Computers
2009
Secret communication is everywhere around us today. Cryptography is being used to encrypt messages so that they can be read only by someone who has the key. Combining the art of steganography with the powers of computers has brought a method of hiding information to a whole new level. Steganography hides messages so that their very existence is undetectable. The idea of embedding some information within a digital media, in such a way that the inserted data are intrinsically part of the media itself, has aroused a considerable interest in different fields. This work has as a purpose to expand the field of applicability of the embedded information within a digital media from the classical informatics to the quantum one.
Foundations of Physics, 2003
Recent work has shown how to use the laws of quantum mechanics to keep classical and quantum bits secret in a number of different circumstances. Among the examples are private quantum channels, quantum secret sharing and quantum data hiding. In this paper we show that a method for keeping two classical bits hidden in any such scenario can be used to construct a method for keeping one quantum bit hidden, and vice-versa. In the realm of quantum data hiding, this allows us to construct bipartite and multipartite hiding schemes for qubits from the previously known constructions for hiding bits. Our method also gives a simple proof that two bits of shared randomness are required to construct a private quantum channel hiding one qubit.
Proceedings 41st Annual Symposium on Foundations of Computer Science, 2000
We investigate how a classical private key can be used by two players, connected by an insecure one-way quantum channel, to perform private communication of quantum information. In particular we show that in order to transmit n qubits privately, 2n bits of shared private key are necessary and sufficient. This result may be viewed as the quantum analogue of the classical one-time pad encryption scheme.
Masking of Quantum Information is Possible
2019
Masking of data is a method to protect information by shielding it from a third party, however keeping it usable for further usages like application development, building program extensions to name a few. Whereas it is possible for classical information encoded in composite quantum states to be completely masked from reduced sub-systems, it has to be checked if quantum information can also be masked when the future possibilities of a quantum computer are increasing day by day. Newly proposed no-masking theorem [Phys. Rev. Lett. 120, 230501 (2018)], one of the no-go theorems, demands that except for some restricted sets of non-orthogonal states, it's impossible to mask arbitrary quantum states. Here, we explore the possibility of masking in the IBM quantum experience platform by designing the quantum circuits and running them on the 5-qubit quantum computer. We choose two particular states considering both the orthogonal and non-orthogonal basis states and illustrate their maskin...
Security of the private quantum channel
Journal of Modern Optics, 2003
We extensively discuss the problem of encryption of quantum information. We present an attack on the private quantum channel which applies when partial classical description of the cipher text is known (the known-ciphertext attack) and show how to avoid this situation. The quantum analogue of the known-plaintext attack is also discussed.
Hiding Quantum Information In the Perfect Code
Arxiv preprint arXiv:1007.0793, 2010
We present and analyze a protocol for quantum steganography where the sender (Alice) encodes her steganographic information into the error syndromes of the perfect (five-qubit) quantum errorcorrecting code, and sends it to the receiver (Bob) over a depolarizing channel. Alice and Bob share a classical secret key, and hide quantum information in such a way that to an eavesdropper (Eve) without access to the secret key, the quantum message looks like an innocent codeword with a typical sequence of quantum errors. We calculate the average rate of key consumption, and show how the protocol improves in performance as information is spread over multiple codeword blocks. Alice and Bob utilize different encodings to optimize the average number of steganographic bits that they can send to each other while matching the error statistics of the depolarizing channel.