Fetching the paper…
Reading the bibliography…
We show how to construct pseudorandom permutations (PRPs) that remain secure even if the adversary can query the permutation, both in the forward and reverse directions, on a quantum superposition of inputs.
How to construct random functions
Oded Goldreich, Shafi Goldwasser, and Silvio Micali · 1986
Earlier work this paper cites.
How to construct pseudorandom permutations from pseudorandom functions
Michael Luby and Charles Rackoff · 1988
Earlier work this paper cites.
A pseudorandom generator from any one-way function
Johan Håstad, Russell Impagliazzo, Leonid A. Levin, and Michael Luby · 1999
Earlier work this paper cites.
The mixing time of the Thorp shuffle
Ben Morris · 2005
Earlier work this paper cites.
Perfect block ciphers with small blocks
Louis Granboulan and Thomas Pornin · 2007
Earlier work this paper cites.
Quantum Copy-Protection and Quantum Money
Scott Aaronson · 2009
Earlier work this paper cites.
Format-preserving encryption
Mihir Bellare, Thomas Ristenpart, Phillip Rogaway, and Till Stegers · 2009
Earlier work this paper cites.
Quantum distinguisher between the 3-round feistel cipher and the random permutation
Hidenori Kuwakado and Masakatu Morii · 2010
Earlier work this paper cites.
Quantum money from hidden subspaces
Scott Aaronson and Paul Christiano · 2012
Earlier work this paper cites.
An enciphering scheme based on a card shuffle
Viet Tung Hoang, Ben Morris, and Phillip Rogaway · 2012
Earlier work this paper cites.
FastPRP: Fast pseudo-random permutations for small domains
Emil Stefanov and Elaine Shi · 2012
Earlier work this paper cites.
How to construct quantum random functions
Mark Zhandry · 2012
Earlier work this paper cites.
Quantum-secure message authentication codes
Dan Boneh and Mark Zhandry · 2013
Earlier work this paper cites.
Secure signatures and chosen ciphertext security in a quantum computing world
Dan Boneh and Mark Zhandry · 2013
Cited alongside, same era.
The mix-and-cut shuffle: Small-domain encryption secure against N queries
Thomas Ristenpart and Scott Yilek · 2013
Cited alongside, same era.
Superposition attacks on cryptographic protocols
Ivan Damgård, Jakob Funder, Jesper Buus Nielsen, and Louis Salvail · 2014
Cited alongside, same era.
Sometimes-recurse shuffle - almost-random permutations in logarithmic expected time
Ben Morris and Phillip Rogaway · 2014
Cited alongside, same era.
Quantum homomorphic encryption for circuits of low T-gate complexity
Anne Broadbent and Stacey Jeffery · 2015
Cited alongside, same era.
Semantic security and indistinguishability in the quantum world
Tommaso Gagliardoni, Andreas Hülsing, and Christian Schaffner · 2016
Quantum immune one-time memories
Qipeng Liu, Amit Sahai, and Mark Zhandry · 2020
Closest in time.
Rapidly verifiable XMSS signatures
Joppe W. Bos, Andreas Hülsing, Joost Renes, and Christine van Vredendaal · 2021
Closest in time.
Redeeming reset indifferentiability and applications to post-quantum security
Mark Zhandry · 2021
Closest in time.
Classical verification of quantum depth, 2022
Nai-Hui Chia and Shih-Han Hung · 2022
Closest in time.
Computational entanglement theory, 2023
Rotem Arnon-Friedman, Zvika Brakerski, and Thomas Vidick · 2023
Closest in time.
Pseudorandomness with proof of destruction and applications
Amit Behera, Zvika Brakerski, Or Sattath, and Omri Shmueli · 2023
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Cited alongside, same era.
Breaking symmetric cryptosystems using quantum period finding
Marc Kaplan, Gaëtan Leurent, Anthony Leverrier, and María Naya-Plasencia · 2016
Cited alongside, same era.
Complexity-theoretic foundations of quantum supremacy experiments
Scott Aaronson and Lijie Chen · 2017
Cited alongside, same era.
New security notions and feasibility results for authentication of quantum data
Sumegha Garg, Henry Yuen, and Mark Zhandry · 2017
Cited alongside, same era.
Quantum-secure pseudorandom permutations, 2017
Fang Song · 2017
Cited alongside, same era.
4-round Luby-Rackoff construction is a qPRP
Akinori Hosoyamada and Tetsu Iwata · 2019
Cited alongside, same era.
Quantum-access-secure message authentication via blind-unforgeability
Gorjan Alagic, Christian Majenz, Alexander Russell, and Fang Song · 2020
Cited alongside, same era.
Closest in time.
Pseudorandomness from subset states, 2023
Tudor Giurgica-Tiron and Adam Bouland · 2023
Closest in time.
Quantum pseudoentanglement
Scott Aaronson, Adam Bouland, Bill Fefferman, Soumik Ghosh, Umesh V. Vazirani, Chenyi Zhang, and Zixin Zhou · 2024
Closest in time.
Pseudorandom isometries
Prabhanjan Ananth, Aditya Gulati, Fatih Kaleoglu, and Yao-Ting Lin · 2024
Closest in time.
Mind the bad norms: Revisiting compressed oracle-based quantum indistinguishability proofs
Ritam Bhaumik, Benoît Cogliati, Jordan Ethan, and Ashwin Jha · 2024
Closest in time.
Quantum pseudorandom scramblers
Chuhan Lu, Minglong Qin, Fang Song, Penghui Yao, and Mingnan Zhao · 2025
Closest in time.
How to construct random unitaries
Fermi Ma and Hsin-Yuan Huang · 2025
Closest in time.