Related papers: Uncloneable Encryption from Decoupling
In this paper we consider generalized eigenvalue problems for a family of operators with a quadratic dependence on a complex parameter. Our model is $L(\lambda)=-\triangle +(P(x)-\lambda)^2$ in $L^2(\R^d)$ where $P$ is a positive elliptic…
Fully homomorphic encryption is a kind of encryption scheme, which enables arbitrary computation on encrypted data without accessing the data. We present the quantum version of fully homomorphic encryption scheme, which is constructed based…
We show a deterministic secure direct communication protocol using single qubit in mixed state. The security of this protocol is based on the security proof of BB84 protocol. It can be realized with current technologies.
Basic techniques to prove the unconditional security of quantum cryptography are described. They are applied to a quantum key distribution protocol proposed by Bennett and Brassard in 1984. The proof considers a practical variation on the…
In this paper, we present a comprehensive architecture for confidential computing, which we show to be general purpose and quite efficient. It executes the application as is, without any added burden or discipline requirements from the…
It has been widely claimed and believed that many protocols in quantum key distribution, especially the single-photon BB84 protocol, have been proved unconditionally secure at least in principle, for both asymptotic and finite protocols…
We prove the unconditional security of an entanglement-based quantum-key-distribution protocol using detectors that respond to multiple modes of light and cannot distinguish between one from two or more photons. Even with such practical…
Universal Composability (UC) is the gold standard for cryptographic security, but mechanizing proofs of UC is notoriously difficult. A recently-discovered connection between UC and Robust Compilation (RC)$\unicode{x2014}$a novel theory of…
We show that stand-alone statistically secure random oblivious transfer protocols based on two-party stateless primitives are statistically universally composable. I.e. they are simulatable secure with an unlimited adversary, an unlimited…
Here we show that, in principle it is possible to clone (measure) a single arbitrary unknown quantum state of a spin-$\frac{1}{2}$ particle (an electron) with arbitrary precision and with success probability tending to one, using protective…
Quantum key distribution is the most well-known application of quantum cryptography. Previous proposed proofs of security of quantum key distribution contain various technical subtleties. Here, a conceptually simpler proof of security of…
Recently the explicit applicability of bound entanglement in quantum cryptography has been shown. In this paper some of recent results respecting this topic are reviewed. In particular relevant notions and definitions are reminded. The new…
Unitary $t$-designs are the bread and butter of quantum information theory and beyond. An important issue in practice is that of efficiently constructing good approximations of such unitary $t$-designs. Building on results by Aubrun (Comm.…
We study the problem of encrypting and authenticating quantum data in the presence of adversaries making adaptive chosen plaintext and chosen ciphertext queries. Classically, security games use string copying and comparison to detect…
In the distrustful quantum cryptography model the different parties have conflicting interests and do not trust one another. Nevertheless, they trust the quantum devices in their labs. The aim of the device-independent approach to…
We investigate the definition of security for encryption scheme in quantum context. We systematically define the indistinguishability and semantic security for quantum public-key and private-key encryption schemes, and for computational…
We present a perfectly secure cipher system based on the concept of fake bits which has never been used in either classical or quantum cryptography.
Special relativity forbids superluminal influences. Using only the no-signaling principle and an assumption about the form of the Schmidt decomposition, we show that for "any" allowed fidelity there is a "unique" approximate qubit cloner…
Relativistic cryptography is a proposal for achieving unconditional security that exploits the fact that no information carrier can travel faster than the speed of light. It is based on space-time constraints but doesn't require quantum…
We present a new, but simple, randomised order-preserving encryption (OPE) scheme based on the general approximate common divisor problem (GACDP). This appears to be the first OPE scheme to be based on a computational hardness primitive,…