IEEE Transactions on Pattern Analysis and Machine Intelligence

Usually, a proof of a theorem contains more knowledge than the mere fact that the theorem is true. For instance, to prove that a graph is Hamiltonian it suffices to exhibit a Hamiltonian tour in it; however, this seems to contain more knowledge than the single bit Hamiltonian/non-Hamiltonian.In this paper a computational complexity theory of the “knowledge” contained in a proof is developed. Zero-knowledge proofs are defined as those proofs that convey no additional knowledge other than the correctness of the proposition in question. Examples of zero-knowledge proof systems are given for the languages of quadratic residuosity and 'quadratic nonresiduosity. These are the first examples of zero-knowledge proofs for languages not known to be efficiently recognizable.

/pdf/the-knowledge-complexity-of-interactive-proof-systems-31apre0ecf.pdf

The knowledge complexity of interactive proof-systems

In this paper, we define and explore proofs of retrievability (PORs). A POR scheme enables an archive or back-up service (prover) to produce a concise proof that a user (verifier) can retrieve a target file F, that is, that the archive retains and reliably transmits file data sufficient for the user to recover F in its entirety.A POR may be viewed as a kind of cryptographic proof of knowledge (POK), but one specially designed to handle a large file (or bitstring) F. We explore POR protocols here in which the communication costs, number of memory accesses for the prover, and storage requirements of the user (verifier) are small parameters essentially independent of the length of F. In addition to proposing new, practical POR constructions, we explore implementation considerations and optimizations that bear on previously explored, related schemes.In a POR, unlike a POK, neither the prover nor the verifier need actually have knowledge of F. PORs give rise to a new and unusual security definition whose formulation is another contribution of our work.We view PORs as an important tool for semi-trusted online archives. Existing cryptographic techniques help users ensure the privacy and integrity of files they retrieve. It is also natural, however, for users to want to verify that archives do not delete or modify files prior to retrieval. The goal of a POR is to accomplish these checks without users having to download the files themselves. A POR can also provide quality-of-service guarantees, i.e., show that a file is retrievable within a certain time bound.

PORs: Proofs of Retrievability for Large Files

Quantum information science involves the storage, manipulation and communication of information encoded in quantum systems, where the phenomena of superposition and entanglement can provide enhancements over what is possible classically. Large-scale quantum information processors require stable and addressable quantum memories, usually in the form of fixed quantum bits (qubits), and a means of transferring and entangling the quantum information between memories that may be separated by macroscopic or even geographic distances. Atomic systems are excellent quantum memories, because appropriate internal electronic states can coherently store qubits over very long timescales. Photons, on the other hand, are the natural platform for the distribution of quantum information between remote qubits, given their ability to traverse large distances with little perturbation. Recently, there has been considerable progress in coupling small samples of atomic gases through photonic channels, including the entanglement between light and atoms and the observation of entanglement signatures between remotely located atomic ensembles. In contrast to atomic ensembles, single-atom quantum memories allow the implementation of conditional quantum gates through photonic channels, a key requirement for quantum computing. Along these lines, individual atoms have been coupled to photons in cavities, and trapped atoms have been linked to emitted photons in free space. Here we demonstrate the entanglement of two fixed single-atom quantum memories separated by one metre. Two remotely located trapped atomic ions each emit a single photon, and the interference and detection of these photons signals the entanglement of the atomic qubits. We characterize the entangled pair by directly measuring qubit correlations with near-perfect detection efficiency. Although this entanglement method is probabilistic, it is still in principle useful for subsequent quantum operations and scalable quantum information applications.

/pdf/entanglement-of-single-atom-quantum-bits-at-a-distance-2xc4y1duqf.pdf

Entanglement of single-atom quantum bits at a distance.

Quantum-mechanical effects at the macroscopic level were first explored in Josephson-junction-based superconducting circuits in the 1980s. In recent decades, the emergence of quantum information science has intensified research toward using these circuits as qubits in quantum information processors. The realization that superconducting qubits can be made to strongly and controllably interact with microwave photons, the quantized electromagnetic fields stored in superconducting circuits, led to the creation of the field of circuit quantum electrodynamics (QED), the topic of this review. While atomic cavity QED inspired many of the early developments of circuit QED, the latter has now become an independent and thriving field of research in its own right. Circuit QED allows the study and control of light-matter interaction at the quantum level in unprecedented detail. It also plays an essential role in all current approaches to gate-based digital quantum information processing with superconducting circuits. In addition, circuit QED provides a framework for the study of hybrid quantum systems, such as quantum dots, magnons, Rydberg atoms, surface acoustic waves, and mechanical systems interacting with microwave photons. Here the coherent coupling of superconducting qubits to microwave photons in high-quality oscillators focusing on the physics of the Jaynes-Cummings model, its dispersive limit, and the different regimes of light-matter interaction in this system are reviewed. Also discussed is coupling of superconducting circuits to their environment, which is necessary for coherent control and measurements in circuit QED, but which also invariably leads to decoherence. Dispersive qubit readout, a central ingredient in almost all circuit QED experiments, is also described. Following an introduction to these fundamental concepts that are at the heart of circuit QED, important use cases of these ideas in quantum information processing and in quantum optics are discussed. Circuit QED realizes a broad set of concepts that open up new possibilities for the study of quantum physics at the macro scale with superconducting circuits and applications to quantum information science in the widest sense.

/pdf/circuit-quantum-electrodynamics-bcs9sxffu0.pdf

Circuit quantum electrodynamics

The participant attack is the most serious threat for quantum secret-sharing protocols. We present a method to analyze the security of quantum secret-sharing protocols against this kind of attack taking the scheme of Hillery, Buzek, and Berthiaume (HBB) [Phys. Rev. A 59 1829 (1999)] as an example. By distinguishing between two mixed states, we derive the necessary and sufficient conditions under which a dishonest participant can attain all the information without introducing any error, which shows that the HBB protocol is insecure against dishonest participants. It is easy to verify that the attack scheme of Karlsson, Koashi, and Imoto [Phys. Rev. A 59, 162 (1999)] is a special example of our results. To demonstrate our results further, we construct an explicit attack scheme according to the necessary and sufficient conditions. Our work completes the security analysis of the HBB protocol, and the method presented may be useful for the analysis of other similar protocols.

Cryptanalysis of the Hillery-Bužek-Berthiaume quantum secret-sharing protocol

The ring-arrangement quantum secret sharing protocol in the paper [K. Bradler and M. Dusek (2004) J. Opt. B: Quantum Semiclass. Opt. 6 63] is analyzed and it is shown that this protocol is secure for any eavesdropper except for a dishonest participant. For example, by a special strategy, Bob can steal Charlie's portion of information without being detected and then recover Alice's secret by himself. We give a description of this strategy and point out a possible way to improve the protocol to stand against this attack.

A simple participant attack on the brádler-dušek protocol

Cryptanalysis of multiparty controlled quantum secure direct communication using Greenberger-Horne-Zeilinger state

As a new model for signing quantum messages, arbitrated quantum signature (AQS) has recently received a lot of attention. In this paper we study the cryptanalysis of previous AQS protocols from the aspects of forgery and disavowal. We show that in these protocols the receiver, Bob, can realize existential forgery of the sender's signature under known message attack. Bob can even achieve universal forgery when the protocols are used to sign a classical message. Furthermore, the sender, Alice, can successfully disavow any of her signatures by simple attack. The attack strategies are described in detail and some discussions about the potential improvements of the protocols are given. Finally we also present several interesting topics on AQS protocols that can be studied in future.

Cryptanalysis of the arbitrated quantum signature protocols

In many circumstances, a shared key is needed to realize secure communication. Based on quantum mechanics principles, quantum key agreement (QKA) is a good method to establish a shared key by every party's fair participation. In this paper, we propose a novel three-party QKA protocol, which is designed by using Greenberger---Horne---Zeilinger (GHZ) states. To realize the protocol, the distributor of the GHZ states needs only one quantum communication with the other two parties, respectively, and everyone performs single-particle measurements simply. Then, we extend the three-party QKA protocol to arbitrary multiparty situation. At last, we discuss the security and fairness of the multiparty protocol. It shows that the new scheme is secure and fair to every participant.

Su-Juan Qin

Papers

Cryptanalysis of the Hillery-Bužek-Berthiaume quantum secret-sharing protocol

A simple participant attack on the brádler-dušek protocol

Cryptanalysis of multiparty controlled quantum secure direct communication using Greenberger-Horne-Zeilinger state

Cryptanalysis of the arbitrated quantum signature protocols

Novel multiparty quantum key agreement protocol with GHZ states