Related papers: New Protocols and Lower Bound for Quantum Secret S…
We study the connection between quantum secret sharing (QSS) schemes and $k$-uniform states of qubits beyond the equivalence between threshold QSS schemes and AME states. Specifically, we focus on homogeneous access structures and show that…
Based on a quantum secure direct communication (QSDC) protocol [Phys. Rev. A69(04)052319], we propose a $(n,n)$-threshold scheme of multiparty quantum secret sharing of classical messages (QSSCM) using only single photons. We take advantage…
Any Quantum Key Distribution (QKD) protocol consists first of sequences of measurements that produce some correlation between classical data. We show that these correlation data must violate some Bell inequality in order to contain…
In recent years Quantum Key Distribution (QKD) has emerged as the most paradigmatic example of Quantum technology allowing the realization of intrinsically secure communication links over hundreds of kilometers. Beyond its commercial…
A crucial goal for quantum key distribution (QKD) is to transmit unconditionally secure keys over long distances. Previous studies show that the key rate of point-to-point QKD is limited by a secret key rate capacity bound, and higher key…
Quantum secret sharing (QSS) is a multi-party quantum communication protocol that can be realized with bipartite entanglement and relative phase encoding. Previous implementations typically encoded the phase in the pump, applying it across…
Quantum computing had a profound impact on cryptography. Shor's discovery of an efficient quantum algorithm for factoring large integers implies that many existing classical systems based on computational assumptions can be broken, once a…
In this paper we consider to use the quantum stabilizer codes as secret sharing schemes for classical secrets. We give necessary and sufficient conditions for qualified and forbidden sets in terms of quantum stabilizers. Then we give a…
Digital signatures are a powerful cryptographic tool widely employed across various industries for securely authenticating the identity of a signer during communication between signers and verifiers. While quantum digital signatures have…
Semi-quantum secret sharing (SQSS) protocols serve as fundamental frameworks in quantum secure multi-party computations, offering the advantage of not requiring all users to possess intricate quantum devices. However, the current landscape…
In some quantum secret sharing schemes, it is known that some shares can be distributed to participants before a secret is given to the dealer. However, it is unclear whether some shares can be distributed before a secret is given in the…
In this article I present a protocol for quantum cryptography which is secure against attacks on individual signals. It is based on the Bennett-Brassard protocol of 1984 (BB84). The security proof is complete as far as the use of single…
In this paper we propose a technique for distributing entanglement in architectures in which interactions between pairs of qubits are constrained to a fixed network $G$. This allows for two-qubit operations to be performed between qubits…
Quantum Key Distribution (QKD) enables two distant users to exchange a secret key with information-theoretic security, based on the fundamental laws of quantum physics. While it is arguably the most mature application of quantum…
We propose an efficient quantum protocol performing quantum bit commitment, which is a simple cryptographic primitive involved with two parties, called a committer and a verifier. Our protocol is non-interactive, uses no supplemental shared…
Quantum communication is an important application that derives from the burgeoning field of quantum information and quantum computation. Focusing on secure communication, quantum cryptography has two major directions of development, namely…
Transformers are increasingly employed for graph data, demonstrating competitive performance in diverse tasks. To incorporate graph information into these models, it is essential to enhance node and edge features with positional encodings.…
The bandwidth theorem [Mathematische Annalen, 343(1):175--205, 2009] states that any $n$-vertex graph $G$ with minimum degree $\big(\tfrac{k-1}{k}+o(1)\big)n$ contains all $n$-vertex $k$-colourable graphs $H$ with bounded maximum degree and…
In this paper, a novel multi-party quantum private comparison (MQPC) protocol for equality comparison with n-level single-particle states is constructed, where the encoded particles are transmitted in a circular way. Here, n parties employ…
This paper considers quantum network coding, which is a recent technique that enables quantum information to be sent on complex networks at higher rates than by using straightforward routing strategies. Kobayashi et al. have recently showed…