A vendor has several secrets which he regards as of equal worth and importance. He is willing to sell any of these secrets to a buyer. The bargain is said to be secure when the following two conditions are satisfied: 1) the buyer can only obtain one secret if he pays for only one secret, and 2) the vendor will not be able to find out which secret the buyer picked. This cryptographic problem is customarily called all-or-nothing disclosure of secrets (ANDOS). Previous ANDOS schemes have a few defects: neither the number of the secrets is restricted within narrow limits, nor the security is desirable. In this paper, we propose two new and novel ANDOS protocols in quantum computing environment. The first protocol is shown to be as secure as a classical one. The second protocol is based on unambiguous state discrimination, which is proven to be secure in quantum world. Moreover, all our schemes have no limitation on the number of the secrets to be sold.
A vendor has several secrets which he regards as of equal worth and importance. He is willing to sell any of these secrets to a buyer. The bargain is said to be secure when the following two conditions are satisfied: 1) the buyer can only obtain one secret if he pays for only one secret, and 2) the vendor will not be able to find out which secret the buyer picked. This cryptographic problem is customarily called all-or-nothing disclosure of secrets (ANDOS). Previous ANDOS schemes have a few defects: neither the number of the secrets is restricted within narrow limits, nor the security is desirable. In this paper, we propose two new and novel ANDOS protocols in quantum computing environment. The first protocol is shown to be as secure as a classical one. The second protocol is based on unambiguous state discrimination, which is proven to be secure in quantum world. Moreover, all our schemes have no limitation on the number of the secrets to be sold.
Secure two-party protocols are of significant research and application value. All-or-Nothing Disclosure of Secrets (ANDOS) is such a kind of cryptographic task. It involves two parties, a vendor and a buyer. The vendor, say Alice, who disposes of several secrets and is willing to sell any of them to the buyer, say Bob, with the guarantee that no information about the other secrets will be obtained. Furthermore, Bob can freely choose his secret and wants to ensure that Alice can obtain on information about which of her secrets he has picked. In this paper, we present a new quantum ANDOS scheme which achieves the same functionality, but which is of unconditional security.
In modern cryptography, distributing a private and unique index number to each participant is an important cryptographic task, which can be adopted to efficiently solve many complicated secure multiparty computations. In this paper, we define this cryptographic primitive, called Secret Permutating, in which every one ofnparticipants can get a random but unique secretki∈{1,2,…,n}. Furthermore, we focus on the unconditional security of Secret Permutating based on laws of quantum mechanics. Accordingly, by local Pauli operators and entanglement swapping of Bell states, we design novel quantum Secret Permutating protocols. What's more, to reduce the communicational complexity, we exploit the uniform, random and independent properties of quantum measurements to evenly divide all participants into many secret groups with the small approximate sizes. Finally, the analysis results and simulated experiments show that the proposed protocols have the unconditional security and the good feasibility.
Based on quantum uncertainty and quantum entanglement, an quantum allor-nothing oblivious transfer protocol is proposed. It is illustrated in detail that the protocol is unconditionally secure. The distinct merit of the present protocol lies in that it is not based on quantum bit commitment. The full utilization of the entanglement makes the protocol different from previous insecure ones, thus its security is not restricted by the no-go theorem of twoparty secure computations. Typeset using REVTEX 1 The research on the oblivious transfer (OT) problem may be traced back to more than twenty years ago [1,2]. Kilian [3] pointed out later that OT is very important in two-party and multi-party protocols. This is because in most symmetrical protocols, the participants always know each others ’ data. If some participants are dishonest or try to get extra information, the protocols become insecure. OT can create some secret between the participants and break this symmetry. Thus it can be used to implement multi-party protocols such as
We call quantum security the area of IT security dealing with scenarios where one or more parties have access to quantum hardware. This encompasses both the fields of post-quantum cryptography (that is, traditional cryptography engineered to be resistant against quantum adversaries), and quantum cryptography (that is, security protocols designed to be natively run on a quantum infrastructure, such as quantum key distribution). Moreover, there exist also hybrid models, where traditional cryptographic schemes are somehow `mixed' with quantum operations in certain scenarios. Even if a fully-fledged, scalable quantum computer has yet to be built, recent results and the pace of research in its realization call for attention, lest we suddenly find ourselves one day with an obsolete security infrastructure. For this reason, in the last two decades research in quantum security has experienced an exponential growth in interest and investments. In this work, we propose the first systematic classification of quantum security scenarios, and for each of them we recall the main tools and results, as well as presenting new ones. We achieve this goal by identifying four distinct quantum security classes, or domains, each of them encompassing the security notions and constructions related to a particular scenario. We start with the class QS0, which is `classical cryptography' (meaning that no quantum scenario is considered), where we present some classical constructions and results as a preliminary step. Regarding post-quantum cryptography, we introduce the class QS1, where we discuss in detail the problems arising when designing a classical cryptographic object meant to be resistant against adversaries with local quantum computing power, and we provide a classification of the possible quantum security reductions in this scenario when considering provable security. Moreover, we present results about the quantum security and insecurity of the Fiat-Shamir transformation (a useful tool used to turn interactive identification schemes into digital signatures), and ORAMs (protocols used to outsource a database in a private way). In respect to hybrid classical-quantum models, in the security class QS2 we discuss in detail the possible scenarios where these scenarios arise, and what a correct formalization should be in terms of quantum oracle access. We also provide a novel framework for the quantum security (both in terms of indistinguishability and semantic security) of secret-key encryption schemes, and we give explicit secure constructions, as well as impossibility results. Finally, in the class QS3 we consider all those cryptographic constructions designed to run natively on quantum hardware. We give constructions for quantum encryption schemes (both in the secret- and public-key scenario), and we introduce transformations for obtaining such schemes by conceptually simpler schemes from the class QS2. Moreover, we introduce a quantum version of ORAM, called quantum ORAM (QORAM), aimed at outsourcing in a private way a database composed of quantum data. In proposing a suitable security model and an explicit construction for QORAMs, we also introduce a technique of independent interest which models a quantum adversary able to extract information from a quantum system without disturbing it `too much'. We believe that the framework we introduce in this work will be a valuable tool for the scientific community in addressing the challenges arising when formalizing sound constructions and notions of security in the quantum world.
Currently, theoretical and experimental work in the field of quantum cryptography is being carried out in many research centers around the world. Over the past two decades since the start of active research, many quantum cryptographic protocols have been proposed, a significant number of laboratory experiments have been performed on their practical implementation, important work has been done to prove the resistance of the proposed protocols to certain types of attacks, and the first commercial quantum key distribution systems have been developed. However, there are still many tasks and problems in the field of quantum cryptography, the solution of which is of great scientific and technical importance. So, in particular, such a promising direction as quantum protocols for direct secure communication requires further development, allowing, under certain conditions, to transfer secret information without encryption, both between two and between a large number of users. Currently, such protocols have been developed using two-and three-particle entangled states, but there are almost no similar protocols with entangled states of a larger number of qubits that do not require large quantum memory for their implementation and, at the same time, have a large information capacity. Therefore, the development of new quantum direct secure communication protocols with increased information capacity, the analysis of their resistance to attacks, as well as the determination of the best protocols according to the criteria of resistance and information capacity.
Oblivious transfer is an important primitive in modern cryptography and is widely utilized in designing more complex protocols. In a one-out-of-two oblivious transfer, a party Alice has two messages x0, x1send to another party Bob in such a way that he can decide to obtain one of them at his choice but not both. In the literature (A. Kawachi et al., EUROCRYPT 2005, 268-284), the quantum states ppi+and ppi-are used as public keys to construct an encryption algorithm. In the paper, we further demonstrate that, for pi ne thetas, the quantum states ppiplusmnand pthetasplusmncan't been distinguished by quantum computers. Using this result, we devise a one-out-of-two oblivious transfer scheme, in which any cheating of the entities are detected at the end of the protocol. Correctness and privacy of this protocol are analyzed and results show that the proposed scheme is computationally secured