
...we introduce a computational problem of distinguishing between two specific quantum states as a new cryptographic problem to design a quantum cryptographic scheme that is "secure" against any polynomialtime quantum adversary. our problem qscd is to distinguish between two types of random coset states with a hidden permutation over...

...we introduce a computational problem of distinguishing between two specific quantum states as a new cryptographic problem
to design a quantum cryptographic scheme that is “secure” against any polynomialtime quantum adversary. our problem, qscdff, is to distinguish between two types of random coset states with a hidden permutation over...

...point of view of the cryptographer with a particular eye on applications in quantum cryptography. each of the measures...a single no tion of cryptographic exponential indistinguishability for two families of quantum states. this is a tool that...

...however, in traditional cryptography, proving computational indistinguishability is usually informal and becomes errorprone when cryptographic constructions are complex. this paper...rules that justify directly the computational indistinguishability between programs and prove that these rules are...

...following informationtheoretic property about quantum states. substate theorem: let and be quantum states in the same hilbert space...ktr := tr p ( 0 )2 , and 0=2o(c= 2 ) . it states that if the relative entropy of and is small, then there is a state 0 close to , i.e...

...function. we show that the quantum version of the reduction—between quantum oneway functions and quantum hardpredicates—is quantitatively more...that, using this reduction, a quantum bit commitment scheme that is per fectly binding and computationally concealing can be obtained from any quantum oneway permutation. this complements...

...2005)]. more detailed
proofs, discussion and examples are provided of the main results. namely, we
demonstrate that all quantum cryptographic protocols can be recast in...pairs, the parties distill private states. the form of these
general private states are given, and we show that there are...

...computational indistinguishability amplication is the problem of...

...foundation of the network
security, computational approaches even to quantum cryptography are promising, since quantum computational cryptography could
offer richer applications than the quantum key distribution. our project focused especially on the quantum onewayness and
quantum publickey cryptosystems. the one...

...composed of nodes for storing and processing quantum states, and of channels for transmitting states between them. the scalability of such...basic principle for enabling scalable quantum networks, with applications also to linear optics quantum computation....