Related papers: Safe Register Token Transfer in a Ring
Secure computation often benefits from the use of correlated randomness to achieve fast, non-cryptographic online protocols. A recent paradigm put forth by Boyle $\textit{et al.}$ (CCS 2018, Crypto 2019) showed how pseudorandom correlation…
Self-stabilization is a general paradigm to provide forward recovery capabilities to distributed systems and networks. Intuitively, a protocol is self-stabilizing if it is able to recover without external intervention from any catastrophic…
Superdense coding is a paradigmatic protocol in quantum information science, employing a quantum communication channel to send classical information more efficiently. As we show here, it can be understood as a particular case of a prepare…
Coin flipping is a cryptographic primitive in which two spatially separated players, who in principle do not trust each other, wish to establish a common random bit. If we limit ourselves to classical communication, this task requires…
Nuclear spins in quantum dots are promising candidates for fast and scalable quantum memory. By utilizing the hyperfine interaction between the central electron and its surrounding nuclei, quantum information can be transferred to the…
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…
We consider the cryptographic task of bit-string generation. This is a generalisation of coin tossing in which two mistrustful parties wish to generate a string of random bits such that an honest party can be sure that the other cannot have…
Recent results have shown the usefulness of tamper-proof hardware tokens as a setup assumption for building UC-secure two-party computation protocols, thus providing broad security guarantees and allowing the use of such protocols as…
Quantum energy teleportation (QET) is a process that leverages quantum entanglement and local operations to transfer energy between two spatially separated locations without physically transporting particles or energy carriers. We construct…
Emulating atomic read/write shared objects in a message-passing system is a fundamental problem in distributed computing. Considering that network communication is the most expensive resource, efficiency is measured first of all in terms of…
Pseudo-random operators consist of sets of operators that exhibit many of the important statistical features of uniformly distributed random operators. Such pseudo-random sets of operators are most useful whey they may be parameterized and…
Weak coin flipping is a cryptographic primitive in which two mutually distrustful parties generate a shared random bit to agree on a winner via remote communication. While a stand-alone secure weak coin flipping protocol can be constructed…
We discuss a novel approach to quantum information processing with molecules based on molecular degrees of freedom which are isolated from the environment as well as from the rest of the molecule. Such a degree of freedom can provide…
We present a new technique for proving the security of quantum key distribution (QKD) protocols. It is based on direct information-theoretic arguments and thus also applies if no equivalent entanglement purification scheme can be found.…
We investigate the approximate quantum state sharing protocol based on random unitary channels, which is secure against any exterior or interior attackers in principle. Although the protocol leaks small information for a security parameter…
A quantum computer based on an asymmetric coupled dot system has been proposed and shown to operate as the controlled-NOT-gate. The basic idea is (1) the electron is localized in one of the asymmetric coupled dots. (2)The electron transfer…
We prove the security of a high-capacity quantum key distribution protocol over noisy channels. By using entanglement purification protocol, we construct a modified version of the protocol in which we separate it into two consecutive…
This work is intended as an introduction to cryptographic security and a motivation for the widely used Quantum Key Distribution (QKD) security definition. We review the notion of security necessary for a protocol to be usable in a larger…
Quantum random numbers are essential for security against quantum algorithms. Randomness as a beacon is a service being provided for companies and governments to upgrade their security standards from RSA to PQC-QKD or PQC-RSA protocols.…
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…