Related papers: Quantum Cryptography in Algorithmica
Methods of quantum mechanics promise information-theoretic security for various protocols in cryptography. However, impossibility of some cryptographic applications such as standard bit commitment, oblivious transfer, multiparty secure…
Cryptographic group actions are a leading contender for post-quantum cryptography, and have also been used in the development of quantum cryptographic protocols. In this work, we explore quantum state group actions, which consist of a group…
One can fix the randomness used by a randomized algorithm, but there is no analogous notion of fixing the quantumness used by a quantum algorithm. Underscoring this fundamental difference, we show that, in the black-box setting, the…
We show that concrete hardness assumptions about learning or cloning the output state of a random quantum circuit can be used as the foundation for secure quantum cryptography. In particular, under these assumptions we construct secure…
The interest in post-quantum cryptography - classical systems that remain secure in the presence of a quantum adversary - has generated elegant proposals for new cryptosystems. Some of these systems are set in the random oracle model and…
Pseudorandom Quantum States (PRS) were introduced by Ji, Liu and Song as quantum analogous to Pseudorandom Generators. They are an ensemble of states efficiently computable but computationally indistinguishable from Haar random states.…
In classical cryptography, one-way functions (OWFs) are the minimal assumption, while it is not the case in quantum cryptography. Several new primitives have been introduced such as pseudorandom state generators (PRSGs), one-way state…
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…
We show that non-maximally entangled states can be used to build a quantum key distribution (QKD) scheme whose security and key rate transmission is nearly equivalent to those of standard QKD protocols. These aspects can be controlled by…
Pseudorandom generators (PRGs) are a foundational primitive in classical cryptography, underpinning a wide range of constructions. In the quantum setting, pseudorandom quantum states (PRSs) were proposed as a potentially weaker assumption…
It is well known that Grover's algorithm asymptotically transforms an equal superposition state into an eigenstate (of a given basis). Here, we demonstrate a verification algorithm based on weak measurement which can achieve the same…
Pseudorandom functions (PRFs) are one of the most fundamental primitives in classical cryptography. On the other hand, in quantum cryptography, it is possible that PRFs do not exist but their quantum analogues could exist, and still…
Quantum cryptography can, in principle, provide unconditional security guaranteed by the law of physics only. Here, we survey the theory and practice of the subject and highlight some recent developments.
All existing quantum cryptosystems use non-orthogonal states as the carriers of information. Non-orthogonal states cannot be cloned (duplicated) by an eavesdropper. In result, any eavesdropping attempt must introduce errors in the…
Different flavors of quantum pseudorandomness have proven useful for various cryptographic applications, with the compelling feature that these primitives are potentially weaker than post-quantum one-way functions. Ananth, Lin, and Yuen…
There are various notions of quantum pseudorandomness, such as pseudorandom unitaries (PRUs), pseudorandom state generators (PRSGs) and pseudorandom function-like state generators (PRFSGs). Unlike classical pseudorandomness, where different…
Quantum correlations between two particles show non-classical properties which can be used for providing secure transmission of information. We present a quantum cryptographic system, in which users store particles in quantum memories kept…
Quantum state discrimination plays a central role in defining the possible and impossible operations through a restricted class of quantum operations. A seminal result by Bennett et al. [Phys. Rev. A 59, 1070 (1999)] demonstrates the…
A simple proof of the unconditional security of a relativistic quantum cryptosystem based on orthogonal states is proposed. Restrictions imposed by special relativity allow to substantially simplify the proof compared with the…
The standard definition of quantum state randomization, which is the quantum analog of the classical one-time pad, consists in applying some transformation to the quantum message conditioned on a classical secret key $k$. We investigate…