Universal test for quantum one-way permutations

@article{Kawachi2004UniversalTF,
  title={Universal test for quantum one-way permutations},
  author={Akinori Kawachi and Hirotada Kobayashi and Takeshi Koshiba and Raymond H. Putra},
  journal={Theor. Comput. Sci.},
  year={2004},
  volume={345},
  pages={370-385}
}

Figures from this paper

Statistical Zero Knowledge and quantum one-way functions

Quantum computational cryptography

This project focused especially on the quantum one-wayness and quantum public-key cryptosystems, and introduces a problem of distinguishing between two quantum states as a new underlying problem that is harder to solve than the graph automorphism problem.

Quantum Public-Key Cryptosystem

This paper's purpose is to establish a theoretical framework for a candidate of the quantum one-way functions and quantum trapdoor functions based on one-parameter unitary groups.

Security Aspect OF Quantum Key Distribution

This paper presents the proof of the unconditional security of the BB84 protocol, as devised by Peter Shor and John Preskill, and stresses the fact that it does not rely on the presumed, yet unproven hardness of somemathematical problem.

Progress in Quantum Computational Cryptography

This paper surveys what has been studied in quantum computational cryptography and considers whether the power of quantum computation could be exploited to withstand even quantum adversaries.

Security of entanglement based version of BB84 protocol for Quantum Cryptography

  • Anand SharmaV. OjhaS. Lenka
  • Computer Science, Mathematics
    2010 3rd International Conference on Computer Science and Information Technology
  • 2010
The BB84 protocol which is used in Quantum Cryptography and the security aspect of entanglement based version of BB84, the ultimate way for key distribution are described.

Quantum cryptography: A survey

The quantum-mechanical background needed to present some fundamental protocols from quantum cryptography is provided, and quantum key distribution via the BB84 protocol and its security proof are reviewed.

Quantum Signature Scheme with Weak Arbitrator

A quantum signature scheme with a weak arbitrator to sign classical messages can preserve the merits in the original arbitrated scheme with some entanglement resources, and provide a higher efficiency in transmission and reduction the complexity of implementation.

Quantum Signature Scheme Using a Single Qubit Rotation Operator

In this protocol, the trusted center confirms the quantum signature and thus conforms with other quantum signature schemes, and the protocol facilitates the ease of implementation and enhances convenience for users.

45 Quantum Cryptography

References

SHOWING 1-10 OF 17 REFERENCES

A Quantum Goldreich-Levin Theorem with Cryptographic Applications

It is shown that, using the Goldreich-Levin Theorem, a quantum bit (or qubit) commitment scheme that is perfectly binding and computationally concealing can be obtained from any quantum one-way permutation.

One-way permutations and self-witnessing languages

On quantum one-way permutations

The equivalence between inverting a permutation and that of constructing polynomial size quantum networks for reflection operators about a class of quantum states is proved.

Security preserving amplification of hardness

The task of transforming a weak one-way function (which may be easily inverted on all but a polynomial fraction of the range) into a strong one-way function (which can be easily inverted only on a

How to generate cryptographically strong sequences of pseudo random bits

  • M. BlumS. Micali
  • Computer Science, Mathematics
    23rd Annual Symposium on Foundations of Computer Science (sfcs 1982)
  • 1982
A more operative definition of Randomness should be pursued in the light of modern Complexity Theory.

A hard-core predicate for all one-way functions

This paper proves a conjecture of [Levin 87, sec. 5.6.2] that the scalar product of Boolean vectors p, g, x is a hard-core of every one-way function ƒ, and extends to multiple (up to the logarithm of security) such bits and to any distribution on the <italic>x</italic>.

Perfectly Concealing Quantum Bit Commitment from any Quantum One-Way Permutation

We show that although unconditionally secure quantum bit commitment is impossible, it can be based upon any family of quantum one-way permutations. The resulting scheme is unconditionally concealing

Universal tests for nonuniform distributions

The aim of this paper is to provide a rigorous methodology for testing sources whose output distributions are not necessarily uniform, and to develop new universal tests for arbitrary models of (potentially imperfect) sources of randomness.

Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer

  • P. Shor
  • Computer Science
    SIAM Rev.
  • 1999
Efficient randomized algorithms are given for factoring integers and finding discrete logarithms, two problems that are generally thought to be hard on classical computers and that have been used as the basis of several proposed cryptosystems.

A fast quantum mechanical algorithm for database search

In early 1994, it was demonstrated that a quantum mechanical computer could efficiently solve a well-known problem for which there was no known efficient algorithm using classical computers, i.e. testing whether or not a given integer, N, is prime, in a time which is a finite power of o (logN) .