Abstract
We introduce a problem of distinguishing between two quantum states as a new underlying problem to build a computational cryptographic scheme that is ”secure” against quantum adversary. Our problem is a natural generalization of the distinguishability problem between two probability distributions, which are commonly used in computational cryptography. More precisely, our problem QSCD ff is the computational distinguishability problem between two types of random coset states with a hidden permutation over the symmetric group. We show that (i) QSCD ff has the trapdoor property; (ii) the average-case hardness of QSCD ff coincides with its worst-case hardness; and (iii) QSCD ff is at least as hard in the worst case as the graph automorphism problem. Moreover, we show that QSCD ff cannot be efficiently solved by any quantum algorithm that naturally extends Shor’s factorization algorithm. These cryptographic properties of QSCD ff enable us to construct a public-key cryptosystem, which is likely to withstand any attack of a polynomial-time quantum adversary.
Chapter PDF
Similar content being viewed by others
Keywords
- Quantum State
- Quantum Algorithm
- Discrete Logarithm Problem
- Distinguishability Problem
- Graph Automorphism
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
Adcock, M., Cleve, R.: A quantum Goldreich-Levin theorem with cryptographic applications. In: Alt, H., Ferreira, A. (eds.) STACS 2002. LNCS, vol. 2285, pp. 323–334. Springer, Heidelberg (2002)
Aharonov, D., Ta-Shma, A.: Adiabatic quantum state generation and statistical zero knowledge. In: Proc. 35th ACM Symp. Theory of Computing, pp. 20–29 (2003)
Ajtai, M.: Generating hard instances of lattice problems. In: Proc. 28th ACM Symp. Theory of Computing, pp. 99–108 (1996)
Ajtai, M., Dwork, C.: A public-key cryptosystem with worst-case/average-case equivalence. In: Proc. 29th ACM Symp. Theory of Computing, pp. 284–293 (1997)
Arvind, V., Kurur, P.P.: Graph isomorphism is in SPP. In: Proc. 43rd IEEE Symp. Foundations of Computer Science, pp. 743–750 (2002)
Bellare, M., Desai, A., Pointcheval, D., Rogaway, P.: Relations among notions of security for public-key encryption schemes. In: Krawczyk, H. (ed.) CRYPTO 1998. LNCS, vol. 1462, pp. 26–45. Springer, Heidelberg (1998)
Bennett, C.H., Brassard, G.: Quantum cryptography: public key distribution and coin tossing. In: Proc. IEEE International Conf. Computers, Systems, and Signal Processing, pp. 175–179 (1984)
Blum, M., Micali, S.: How to generate cryptographically strong sequences of pseudo-random bits. SIAM J. Comput. 13(4), 850–864 (1984)
Bogdanov, A., Trevisan, L.: On worst-case to average-case reductions for NP problems. In: Proc. 44th IEEE Symp. Foundations of Computer Science, pp. 308–317 (2004)
Boneh, D., Lipton, R.J.: Quantum cryptanalysis of hidden linear functions. In: Coppersmith, D. (ed.) CRYPTO 1995. LNCS, vol. 963, pp. 424–437. Springer, Heidelberg (1995)
Crâsmaru, M., Glaßer, C., Regan, K.W., Sengupta, S.: A protocol for serializing unique strategies. In: Fiala, J., Koubek, V., Kratochvíl, J. (eds.) MFCS 2004. LNCS, vol. 3153, pp. 660–672. Springer, Heidelberg (2004)
Crépeau, C., Dumais, P., Mayers, D., Salvail, L.: Computational collapse of quantum state with application to oblivious transfer. In: Naor, M. (ed.) TCC 2004. LNCS, vol. 2951, pp. 374–393. Springer, Heidelberg (2004)
Crépeau, C., Légaré, F., Salvail, L.: How to convert the flavor of a quantum bit commitment. In: Pfitzmann, B. (ed.) EUROCRYPT 2001. LNCS, vol. 2045, pp. 60–77. Springer, Heidelberg (2001)
Damgård, I., Fehr, S., Salvail, L.: Zero-knowledge proofs and string commitments withstanding quantum attacks. In: Franklin, M. (ed.) CRYPTO 2004. LNCS, vol. 3152, pp. 254–272. Springer, Heidelberg (2004)
Diffie, W., Hellman, M.E.: New directions in cryptography. IEEE Trans. Information Theory 22(6), 644–654 (1976)
Dumais, P., Mayers, D., Salvail, L.: Perfectly concealing quantum bit commitment from any quantum one-way permutation. In: Preneel, B. (ed.) EUROCRYPT 2000. LNCS, vol. 1807, pp. 300–315. Springer, Heidelberg (2000)
Ettinger, M., Høyer, P.: On quantum algorithms for noncommutative hidden subgroups. Advances in Applied Mathematics 25, 239–251 (2000)
Goldwasser, S., Micali, S.: Probabilistic encryption. J. Comput. System Sci. 28(2), 270–299 (1984)
Goldwasser, S., Sipser, M.: Private coins versus public coins in interactive proof system. In: Advances in Computing Research. Randomness and Computation, vol. 5, pp. 73–90. JAI Press, Greenwich (1989)
Grigni, M., Schulman, L.J., Vazirani, M., Vazirani, U.: Quantum mechanical algorithms for the nonabelian hidden subgroup problem. In: Proc. 33rd ACM Symp. Theory of Computing, pp. 68–74 (2001)
Grollmann, J., Selman, A.L.: Complexity measures for public-key cryptosystems. SIAM J. Comput. 17(2), 309–335 (1988)
Hallgren, S.: Polynomial-time quantum algorithms for Pell’s equation and the principal ideal problem. In: Proc. 34th ACM Symp. Theory of Computing, pp. 653–658 (2002)
Hallgren, S., Russell, A., Ta-Shma, A.: The hidden subgroup problem and quantum computation using group representations. SIAM J. Comput. 32(4), 916–934 (2003)
Impagliazzo, R., Naor, M.: Efficient cryptographic schemes provably as secure as subset sum. J. Cryptology 9(4), 199–216 (1996)
Kempe, J., Shalev, A.: The hidden subgroup problem and permutation group theory. In: Proc. 16th ACM-SIAM Symp. Discrete Algorithms (2005)
Kitaev, A.: Quantum measurements and the Abelian stabilizer problem. quant-ph/9511026 (1995)
Kobayashi, H.: Non-interactive quantum perfect and statistical zero-knowledge. In: Ibaraki, T., Katoh, N., Ono, H. (eds.) ISAAC 2003. LNCS, vol. 2906, pp. 178–188. Springer, Heidelberg (2003)
Köbler, J., Schöning, U., Torán, J.: The Graph Isomorphism Problem: Its Structural Complexity. Birkhäuser Boston Inc., Basel (1993)
Kuperberg, G.: A subexponential-time quantum algorithm for the dihedral hidden subgroup problem. quant-ph/0302112 (2003)
Lo, H.-K., Chau, H.F.: Is quantum bit commitment really possible? Physical Review Letters 78(17), 3410–3413 (1997)
Luks, E.M.: Permutation groups and polynomial-time computation. Groups and Computation 11, 139–175 (1993)
Mayers, D.: Unconditionally secure quantum bit commitment is impossible. Physical Review Letters 78(17), 3414–3417 (1997)
Mayers, D.: Unconditional security in quantum cryptography. J. ACM 48(3), 351–406 (2001)
Micciancio, D., Regev, O.: Worst-case to average-case reductions based on Gaussian measure. In: Proc. 45th IEEE Symp. Foundations of Computer Science, pp. 372–381 (2004)
Moore, C., Rockmore, D., Russell, A., Schulman, L.J.: The hidden subgroup problem in affine groups: basis selection in Fourier sampling. In: Proc. 15th ACM-SIAM Symp. Discrete Algorithms, pp. 1106–1115 (2004)
Okamoto, T., Tanaka, K., Uchiyama, S.: Quantum public-key cryptosystems. In: Bellare, M. (ed.) CRYPTO 2000. LNCS, vol. 1880, pp. 147–165. Springer, Heidelberg (2000)
Regev, O.: Quantum computation and lattice problems. In: Proc. 43rd IEEE Symp. Foundations of Computer Science, pp. 520–529 (2002)
Regev, O.: New lattice-based cryptographic constructions. In: Proc. 35th ACM Symp. Theory of Computing, pp. 407–416 (2003)
Schöning, U.: Graph isomorphism is in the low hierarchy. J. Comput. System Sci. 37, 312–323 (1988)
Shor, P.W.: Polynomial-time algorithms for prime factorization and discrete logarithms on a quantum computer. SIAM J. Comput. 26, 1484–1509 (1997)
Tompa, M., Woll, H.: Random self-reducibility and zero knowledge interactive proofs of possession of information. In: Proc. 28th IEEE Symp. Foundations of Computer Science, pp. 472–482 (1987)
Watrous, J.: Limits on the power of quantum statistical zero-knowledge. In: Proc. 43rd IEEE Symp. Foundations of Computer Science, pp. 459–468 (2002)
Yao, A.C.-C.: Theory and applications of trapdoor functions. In: Proc. 23rd IEEE Symp. Foundations of Computer Science, pp. 80–91 (1982)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Kawachi, A., Koshiba, T., Nishimura, H., Yamakami, T. (2005). Computational Indistinguishability Between Quantum States and Its Cryptographic Application. In: Cramer, R. (eds) Advances in Cryptology – EUROCRYPT 2005. EUROCRYPT 2005. Lecture Notes in Computer Science, vol 3494. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11426639_16
Download citation
DOI: https://doi.org/10.1007/11426639_16
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-25910-7
Online ISBN: 978-3-540-32055-5
eBook Packages: Computer ScienceComputer Science (R0)