Quantum key distribution protocols are known to be vulnerable against a side channel attack that exploits the time difference in detector responses used to obtain key bits. The recommended solution against this timing side channel attack is to use a large time bin width instead of high resolution timing information. Common notion is that using a large bin width reduces the resolution of detector responses, hence supposedly minimizes the information leakage to an eavesdropper. We challenge this conventional wisdom, and demonstrate that increasing the bin width does not monotonically reduce the mutual information between the key bits and the eavesdropper's observation of detector responses. Instead of randomly increasing the bin width, it should be carefully chosen because the mutual information fluctuates with respect to the bin width. We also examined the effect of full width half maximums (FWHMs) of the detectors responses on the mutual information and showed that decreasing the FWHM increases the mutual information. Lastly, the start time of binning is also shown to be important in binning process and the mutual information fluctuates periodically with respect to it.
We look into multipartite quantum states on which quantum cryptographic protocols including quantum key distribution and quantum secret sharing can be perfectly performed, and define the quantum cryptographic resource distillable rate as the asymptotic rate at which such multipartite state can be distilled from a given multipartite state. Investigating several relations between entanglement and the rate, we show that there exists a multipartite bound entangled state whose quantum cryptographic resource distillable rate is strictly positive, that is, there exists a multipartite entangled state …
Secret sharing is a multiparty cryptographic task in which some secret information is splitted into several pieces which are distributed among the participants such that only an authorized set of participants can reconstruct the original secret. Similar to quantum key distribution, in quantum secret sharing, the secrecy of the shared information relies not on computational assumptions, but on laws of quantum physics. Here, we present an experimental demonstration of four-party quantum secret sharing via the resource of four-photon entanglement.
We introduce a new multiparty cryptographic protocol, which we call `entanglement sharing schemes', wherein a dealer retains half of a maximally-entangled bipartite state and encodes the other half into a multipartite state that is distributed among multiple players. In a close analogue to quantum secret sharing, some subsets of players can recover maximal entanglement with the dealer whereas other subsets can recover no entanglement (though they may retain classical correlations with the dealer). We find a lower bound on the share size for such schemes and construct two non-trivial examples b…
We propose a wide class of distillation schemes for multi-partite entangled states that are CSS-states. Our proposal provides not only superior efficiency, but also new insights on the connection between CSS-states and bipartite graph states. We then apply our distillation schemes to the tri-partite case for three cryptographic tasks--namely, (a) conference key agreement, (b) quantum sharing of classical secrets and (c) third-man cryptography. Moreover, we construct ``prepare-and-measure'' protocols for the above three cryptographic tasks which can be implemented with the generation of only a …
This paper presents a hybrid cryptographic protocol, using quantum and classical resources, for authentication and authorization in a network. One or more trusted servers distribute streams of entangled photons to individual resources that seek to communicate. It is assumed that each resource shares a previously distributed secret key with the trusted server, and that resources can communicate with the server using both classical and quantum channels. Resources do not share secret keys with each other, so that the key distribution problem for the network is reduced from O(n^2) to O(n). Some ad…
A secret sharing scheme is a cryptographic protocol to distribute a secret state in an encoded form among a group of players such that only authorized subsets of the players can reconstruct the secret. Classically, efficient secret sharing schemes have been shown to be induced by matroids. Furthermore, access structures of such schemes can be characterized by an excluded minor relation. No such relations are known for quantum secret sharing schemes. In this paper we take the first steps toward a matroidal characterization of quantum secret sharing schemes. In addition to providing a new perspe…
Quantum cryptography is information-theoretically secure owing to its solid basis in quantum mechanics. However, generally, initial implementations with practical imperfections might open loopholes, allowing an eavesdropper to compromise the security of a quantum cryptographic system. This has been shown to happen for quantum key distribution (QKD). Here we apply experience from implementation security of QKD to several other quantum cryptographic primitives. We survey quantum digital signatures, quantum secret sharing, source-independent quantum random number generation, quantum secure direct…
We give an example of a wide class of problems for which quantum information protocols based on multi-system entanglement can be mapped into much simpler ones involving one system. Secret sharing is a cryptographic primitive which plays a central role in various secure multiparty computation tasks and management of keys in cryptography. In secret sharing protocols, a classical message is divided into shares given to recipient parties in such a way that some number of parties need to collaborate in order to reconstruct the message. Quantum protocols for the task commonly rely on multi-partite G…
Agile cryptography allows for a resource-efficient swap of a cryptographic core in case the security of an underlying classical cryptographic algorithm becomes compromised. Conversely, versatile cryptography allows the user to switch the cryptographic task without requiring any knowledge of its inner workings. In this paper, we suggest how these related principles can be applied to the field of quantum cryptography by explicitly demonstrating two quantum cryptographic protocols, quantum digital signatures (QDS) and quantum secret sharing (QSS), on the same hardware sender and receiver platform…
Attacks on classical cryptographic protocols are usually modeled by allowing an adversary to ask queries from an oracle. Security is then defined by requiring that as long as the queries satisfy some constraint, there is some problem the adversary cannot solve, such as compute a certain piece of information. In this paper, we introduce a fundamentally new model of quantum attacks on classical cryptographic protocols, where the adversary is allowed to ask several classical queries in quantum superposition. This is a strictly stronger attack than the standard one, and we consider the security of…
Experimental Efficient Source-Independent Quantum Secret Sharing against Coherent Attacks
National Laboratory of Solid State Microstructures and School of Physics, Collaborative Innovation Center of Advanced Microstructures, Nanjing University（南京大学固体微结构物理国家重点实验室和物理学院，先进微结构协同创新中心）；School of Physics and Key Laboratory of Quantum State Construction and Manipulation (Ministry of Education), Renmin University of China（中国人民大学物理学院，量子态构建与操控教育部重点实验室）；Beijing Academy of Quantum Information Sciences（北京量子信息科学研究院）
We present three quantum key distribution protocols using entangled state. In the first two protocols, all Einstein-Podolsky-Rosen pairs are used to distribute a secret key except those chosen for eavesdropping check, because the communication parties measure each of their particles in an invariable measuring basis. The first protocol is based on the ideal of qubit transmission in blocks. Although it need quantum memory, its theoretic efficiency approximates to 100%. The second protocol does not need quantum memory and its efficiency for qubits can achieve 100%. In the third protocol, we prese…
Secret sharing is a multi-party cryptographic primitive that can be applied to a network of partially distrustful parties for encrypting data that is both sensitive (it must remain secure) and important (it must not be lost or destroyed). When sharing classical secrets (as opposed to quantum states), one can distinguish between protocols that leverage bi-partite quantum key distribution (QKD) and those that exploit multi-partite entanglement. The latter class are known to be vulnerable to so-called participant attacks and, while progress has been made recently, there is currently no analysis t…
Multiparty quantum communication provides delightful applications including quantum cryptographic communication and quantum secret sharing. Measurement-Device-Independent (MDI) quantum communication based on the Greenberg-Horne-Zeilinger (GHZ) state measurement provides a practical way to implement multiparty quantum communication. With the standard spatially localized GHZ state measurement, however, information can be imbalanced among the communication parties that can cause significant problems in multiparty cryptographic communication. Here, we propose an equitable multiparty quantum commun…
High-rate multipartite quantum secret sharing with composable security
Institute of Photonics and Quantum Sciences, School of Engineering and Physical Sciences, Heriot-Watt University（赫瑞瓦特大学工程与物理科学学院光子与量子科学研究所）；Electrical Engineering and Computer Science Department, Technische Universität Berlin（柏林工业大学电气与计算机科学系）；Dahlem Center for Complex Quantum Systems, Freie Universität Berlin（柏林自由大学达勒姆复杂量子系统中心）
When can quantum information be localized to each of a collection of spacetime regions, while also excluded from another collection of regions? We answer this question by defining and analyzing the localize-exclude task, in which a quantum system must be localized to a collection of authorized regions while also being excluded from a set of unauthorized regions. This task is a spacetime analogue of quantum secret sharing, with authorized and unauthorized regions replacing authorized and unauthorized sets of parties. Our analysis yields the first quantum secret sharing scheme for arbitrary acce…
We make an explicit connection between fundamental notions in quantum cryptography and quantum error correction. Error-correcting subsystems (and subspaces) for quantum channels are the key vehicles for contending with noise in physical implementations of quantum information-processing. Private subsystems (and subspaces) for quantum channels play a central role in cryptographic schemes such as quantum secret sharing and private quantum communication. We show that a subsystem is private for a channel precisely when it is correctable for a complementary channel. This result is shown to hold even…
The commodity-based cryptography is an alternative approach to realize conventionally impossible cryptographic primitives such as unconditionally secure bit-commitment by consuming pre-established correlation between distrustful participants. A unit of such classical correlation is known as the one-time table (OTT). In this paper, we introduce a new example besides quantum key distribution in which quantum correlation is useful for cryptography. We propose a scheme for unconditionally secure qubit-commitment, a quantum cryptographic primitive forbidden by the recently proven no-masking theorem…
We propose a new thought experiment, based on present-day Quantum Information Technologies, to measure quantum gravitational effects through the Bose-Marletto-Vedral (BMV) effect by revealing the gravitational $t^3$ phase term, its expected relationships with low-energy quantum gravity phenomena and test the equivalence principle of general relativity. The technique here proposed promise to reveal gravitational field fluctuations from the analysis of the stochastic noise associated to an ideal output of a measurement process of a quantum system. To improve the sensitivity we propose to cumulat…
Single-photon detectors are a pivotal component in photonic quantum technologies. A precise and comprehensive calibration of the intrinsic detection efficiency is of utmost importance to ensure the proper evaluation of the performance in view of the specific technological application of interest, such as the protection against security breaches in quantum cryptographic solutions. Here we report on a systematic study on and comprehensive analysis of the estimation of the intrinsic detection efficiency of two commercial single-photon detectors based on single-photon avalanche diodes (SPADs) for …
We propose a decision procedure for analysing security of quantum cryptographic protocols, combining a classical algebraic rewrite system for knowledge with an operational semantics for quantum distributed computing. As a test case, we use our procedure to reason about security properties of a recently developed quantum secret sharing protocol that uses graph states. We analyze three different scenarios based on the safety assumptions of the classical and quantum channels and discover the path of an attack in the presence of an adversary. The epistemic analysis that leads to this and similar t…
