2000 character limit reached
On the Two-sided Permutation Inversion Problem
Published 23 Jun 2023 in quant-ph and cs.CR | (2306.13729v2)
Abstract: In the permutation inversion problem, the task is to find the preimage of some challenge value, given oracle access to the permutation. This is a fundamental problem in query complexity, and appears in many contexts, particularly cryptography. In this work, we examine the setting in which the oracle allows for quantum queries to both the forward and the inverse direction of the permutation -- except that the challenge value cannot be submitted to the latter. Within that setting, we consider two options for the inversion algorithm: whether it can get quantum advice about the permutation, and whether it must produce the entire preimage (search) or only the first bit (decision). We prove several theorems connecting the hardness of the resulting variations of the inversion problem, and establish a number of lower bounds. Our results indicate that, perhaps surprisingly, the inversion problem does not become significantly easier when the adversary is granted oracle access to the inverse, provided it cannot query the challenge itself.
- “Post-Quantum Security of the (Tweakable) FX Construction, and Applications” In Cryptology ePrint Archive, 2022 URL: https://eprint.iacr.org/2022/1097
- “Post-quantum security of the Even-Mansour cipher” In Annual International Conference on the Theory and Applications of Cryptographic Techniques, 2022, pp. 458–487 Springer DOI: https://doi.org/10.1007/978-3-031-07082-2_17
- Andris Ambainis, Mike Hamburg and Dominique Unruh “Quantum security proofs using semi-classical oracles” In Advances in Cryptology–CRYPTO 2019: 39th Annual International Cryptology Conference, Santa Barbara, CA, USA, August 18–22, 2019, Proceedings, Part II 39, 2019, pp. 269–295 Springer DOI: https://doi.org/10.1007/978-3-030-26951-7_10
- “Quantum random access codes with shared randomness” In arXiv preprint arXiv:0810.2937, 2008 DOI: https://doi.org/10.48550/arXiv.0810.2937
- Andris Ambainis “Quantum lower bounds by quantum arguments” In Journal of Computer and System Sciences 64.4 Elsevier, 2002, pp. 750–767 DOI: https://doi.org/10.1145/335305.335394
- “Dense quantum coding and a lower bound for 1-way quantum automata” In Proceedings of the thirty-first annual ACM symposium on Theory of computing, 1999, pp. 376–383 DOI: https://doi.org/10.1145/301250.301347
- “Strengths and weaknesses of quantum computing” In SIAM journal on Computing 26.5 SIAM, 1997, pp. 1510–1523 DOI: https://doi.org/10.1137/S0097539796300933
- “One-Way Ticket to Las Vegas and the Quantum Adversary” In arXiv preprint arXiv:2301.02003, 2023 DOI: https://doi.org/10.48550/arXiv.2301.02003
- “Post-quantum security of the sponge construction” In International Conference on Post-Quantum Cryptography, 2018, pp. 185–204 Springer DOI: https://doi.org/10.1007/978-3-319-79063-3_9
- “Tight quantum time-space tradeoffs for function inversion” In 2020 IEEE 61st Annual Symposium on Foundations of Computer Science (FOCS), 2020, pp. 673–684 IEEE DOI: 10.1109/FOCS46700.2020.00068
- Kai-Min Chung, Tai-Ning Liao and Luowen Qian “Lower bounds for function inversion with quantum advice” In arXiv preprint arXiv:1911.09176, 2019 DOI: https://doi.org/10.48550/arXiv.1911.09176
- “Quantum lazy sampling and game-playing proofs for quantum indifferentiability” In arXiv preprint arXiv:1904.11477, 2021 DOI: https://doi.org/10.48550/arXiv.1904.11477
- “Being a permutation is also orthogonal to one-wayness in quantum world: Impossibilities of quantum one-way permutations from one-wayness primitives” In Theoretical Computer Science 855 Elsevier, 2021, pp. 16–42 DOI: https://doi.org/10.1016/j.tcs.2020.11.013
- “Exact quantum lower bound for Grover’s problem” In arXiv preprint arXiv:0810.3647, 2008 DOI: https://doi.org/10.26421/QIC9.5-6-12
- “Quantum time/memory/data tradeoff attacks” In Designs, Codes and Cryptography Springer, 2023, pp. 1–19 DOI: https://doi.org/10.1007/s10623-023-01300-x
- Morris J Dworkin “SHA-3 standard: Permutation-based hash and extendable-output functions” In Federal Inf. Process. Stds. (NIST FIPS) Morris J. Dworkin, 2015 DOI: https://doi.org/10.6028/NIST.FIPS.202
- “Quantum vs classical proofs and subset verification” In arXiv preprint arXiv:1510.06750, 2015 DOI: https://doi.org/10.48550/arXiv.1510.06750
- “Cryptographic sponge functions” Citeseer, 2011 URL: https://keccak.team/files/CSF-0.1.pdf
- Lov K Grover “A fast quantum mechanical algorithm for database search” In Proceedings of the twenty-eighth annual ACM symposium on Theory of computing, 1996, pp. 212–219 DOI: https://doi.org/10.1145/237814.237866
- Minki Hhan, Keita Xagawa and Takashi Yamakawa “Quantum random oracle model with auxiliary input” In International Conference on the Theory and Application of Cryptology and Information Security, 2019, pp. 584–614 Springer DOI: https://doi.org/10.1007/978-3-030-34578-5_21
- “Introduction to modern cryptography” CRC press, 2020 DOI: https://doi.org/10.1201/9781420010756
- Qipeng Liu “Non-uniformity and Quantum Advice in the Quantum Random Oracle Model” In Annual International Conference on the Theory and Applications of Cryptographic Techniques, 2023, pp. 117–143 Springer DOI: https://doi.org/10.1007/978-3-031-30545-0_5
- “Quantum lower bound for inverting a permutation with advice” In arXiv preprint arXiv:1408.3193, 2014 DOI: https://doi.org/10.48550/arXiv.1408.3193
- Ashwin Nayak “Inverting a permutation is as hard as unordered search” In arXiv preprint arXiv:1007.2899, 2010 DOI: https://doi.org/10.48550/arXiv.1007.2899
- Oded Regev “On lattices, learning with errors, random linear codes, and cryptography” In Journal of the ACM (JACM) 56.6 ACM New York, NY, USA, 2009, pp. 1–40 DOI: https://doi.org/10.1145/1568318.1568324
- Ansis Rosmanis “Tight bounds for inverting permutations via compressed oracle arguments” In arXiv preprint arXiv:2103.08975, 2021 DOI: https://doi.org/10.48550/arXiv.2103.08975
- Umesh Vazirani “On the power of quantum computation” In Philosophical Transactions of the Royal Society of London A 365: 1759-1768, 1998 DOI: https://doi.org/10.1137/S0097539796298637
- Stephen Wiesner “Conjugate coding” In ACM Sigact News 15.1 ACM New York, NY, USA, 1983, pp. 78–88 DOI: https://doi.org/10.1145/1008908.1008920
- Christof Zalka “Grover’s quantum searching algorithm is optimal” In Physical Review A 60.4 APS, 1999, pp. 2746 DOI: https://doi.org/10.1103/PhysRevA.60.2746
- Mark Zhandry “A note on quantum-secure PRPs” In arXiv preprint arXiv:1611.05564, 2016 DOI: https://doi.org/10.48550/arXiv.1611.05564
- Mark Zhandry “How to record quantum queries, and applications to quantum indifferentiability” In Advances in Cryptology–CRYPTO 2019: 39th Annual International Cryptology Conference, Santa Barbara, CA, USA, August 18–22, 2019, Proceedings, Part II 39, 2019, pp. 239–268 Springer DOI: https://doi.org/10.1007/978-3-030-26951-7_9
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.
