Computational indistinguishability between quantum states and its cryptographic application
From MaRDI portal
Publication:434349
DOI10.1007/s00145-011-9103-4zbMath1275.81021arXivquant-ph/0403069WikidataQ57310999 ScholiaQ57310999MaRDI QIDQ434349
Akinori Kawachi, Tomoyuki Yamakami, Takeshi Koshiba, Harumichi Nishimura
Publication date: 10 July 2012
Published in: Journal of Cryptology (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/quant-ph/0403069
quantum cryptography; computational indistinguishably; graph automorphism problem; quantum public-key cryptosystem; trapdoor; worst-case/average-case equivalence
94A60: Cryptography
81P50: Quantum state estimation, approximate cloning
81P94: Quantum cryptography (quantum-theoretic aspects)
Related Items
Quantum commitments and signatures without one-way functions, Bit-oriented quantum public-key encryption based on quantum perfect encryption, The independence of reduced subgroup-state, Bit-oriented quantum public-key cryptosystem based on Bell states, Quantum public-key designated verifier signature, Quantum public-key signature scheme based on asymmetric quantum encryption with trapdoor information, Quantum public-key encryption schemes based on conjugate coding, On the Power of Quantum Encryption Keys
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Quantum mechanical algorithms for the nonabelian hidden subgroup problem
- Probabilistic encryption
- Graph isomorphism is in the low hierarchy
- Graph Isomorphism is in SPP
- Efficient cryptographic schemes provably as secure as subset sum
- Unconditional security in quantum cryptography
- How to Generate Cryptographically Strong Sequences of Pseudorandom Bits
- SECURITY OF QUANTUM KEY DISTRIBUTION
- On the Power of Quantum Encryption Keys
- The Symmetric Group Defies Strong Fourier Sampling
- Complexity Measures for Public-Key Cryptosystems
- New directions in cryptography
- Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
- Quantum Computation and Lattice Problems
- The Hidden Subgroup Problem and Quantum Computation Using Group Representations
- Applications of single-qubit rotations in quantum public-key cryptography
- Algorithms and Computation
- Mathematical Foundations of Computer Science 2004
- Advances in Cryptology – CRYPTO 2004
- Probability Inequalities for Sums of Bounded Random Variables
- Computational Indistinguishability Between Quantum States and Its Cryptographic Application
- New lattice-based cryptographic constructions
- Adiabatic Quantum State Generation
- Worst‐Case to Average‐Case Reductions Based on Gaussian Measures
- A Subexponential-Time Quantum Algorithm for the Dihedral Hidden Subgroup Problem
- On Worst‐Case to Average‐Case Reductions for NP Problems
- Limitations of quantum coset states for graph isomorphism
- On lattices, learning with errors, random linear codes, and cryptography
- Polynomial-time quantum algorithms for Pell's equation and the principal ideal problem
- Theory of Cryptography
- On quantum algorithms for noncommutative hidden subgroups
