Related papers: Robust Relativistic Bit Commitment
Catch 22 of cryptography - "Before two parties can communicate in secret, they must first communicate in secret". The weakness of classical cryptographic communication systems is that secret communication can only take place after a key is…
Entanglement-based attacks, which are subtle and powerful, are usually believed to render quantum bit commitment insecure. We point out that the no-go argument leading to this view implicitly assumes the evidence-of-commitment to be a…
Although it is impossible for a bit commitment protocol to be both arbitrarily concealing and arbitrarily binding, it is possible for it to be both partially concealing and partially binding. This means that Bob cannot, prior to the…
Achieving agreement among distributed parties is a fundamental task in modern systems, underpinning applications such as consensus in blockchains, coordination in cloud infrastructure, and fault tolerance in critical services. However, this…
Quantum key distribution performs the trick of growing a secret key in two distant places connected by a quantum channel. The main reason is that the legitimate users can bound the information gathered by the eavesdropper. In practical…
String commitment schemes are similar to the well studied bit commitment schemes in cryptography with the difference that the committing party, say Alice, is supposed to commit a long string instead of a single bit, to another party say…
In this paper, we study the robust consensus problem for a set of discrete-time linear agents to coordinate over an uncertain communication network, which is to achieve consensus against the transmission errors and noises resulted from the…
Quantum cryptography exploits principles of quantum physics for the secure processing of information. A prominent example is secure communication, i.e., the task of transmitting confidential messages from one location to another. The…
Traditional financial institutions face inefficiencies that can be addressed by distributed ledger technology. However, a primary barrier to adoption is the privacy concerns surrounding publicly available transaction data. Existing private…
We propose an entanglement-based quantum bit string commitment protocol whose composability is proven in the random oracle model. This protocol has the additional property of preserving the privacy of the committed message. Even though this…
Reliable broadcast (RBC) is a key primitive in fault-tolerant distributed systems, and improving its efficiency can benefit a wide range of applications. This work focuses on signature-free RBC protocols, which are particularly attractive…
We propose Byzantine-robust federated learning protocols with nearly optimal statistical rates. In contrast to prior work, our proposed protocols improve the dimension dependence and achieve a tight statistical rate in terms of all the…
Oblivious transfer protocols (R-OT and OT$_{1}^{2}$) are presented based on non-orthogonal states transmission, and the bit commitment protocols on the top of OT$_{1}^{2}$ are constructed. Although these OT protocols are all unconditional…
In a distributed coin-flipping protocol, Blum [ACM Transactions on Computer Systems '83], the parties try to output a common (close to) uniform bit, even when some adversarially chosen parties try to bias the common output. In an adaptively…
Secret sharing allows three or more parties to share secret information which can only be decrypted through collaboration. It complements quantum key distribution as a valuable resource for securely distributing information. Here we take…
Relativistic quantum field theory imposes additional fundamental restrictions on the distinguishability of quantum states. Because of the unavoidable delocalization of the quantum field states in the Minkowski space-time, the reliable (with…
In this brief paper, a new consensus protocol based on the sign of innovations is proposed. Based on this protocol each agent only requires single-bit of information about its relative state to its neighboring agents. This is significant in…
In this article we show for the first time that quantum coin flipping with security guarantees that are strictly better than any classical protocol is possible to implement with current technology. Our protocol takes into account all…
We present a general technique for hiding a classical bit in multipartite quantum states. The hidden bit, encoded in the choice of one of two possible density operators, cannot be recovered by local operations and classical communication…
Certifying quantum behavior from classically accessible data is essential for secure communication and scalable quantum technologies. While powerful certification methods such as Bell nonlocality and quantum steering exist, their…