Cover Image

Quantum Lifting for Invertible Permutations and Ideal Ciphers

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Cojocaru, Alexandru, Hhan, Minki, Liu, Qipeng, Yamakawa, Takashi, Yun, Aaram
Format:	Preprint
Published:	2025
Subjects:	Quantum Physics Computational Complexity Cryptography and Security
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Quantum Complexity for Discrete Logarithms and Related Problems
by: Hhan, Minki, et al.
Published: (2023)

A Note on Output Length of One-Way State Generators and EFIs
by: Hhan, Minki, et al.
Published: (2023)

Improved Quantum Lifting by Coherent Measure-and-Reprogram
by: Cojocaru, Alexandru, et al.
Published: (2025)

Proofs of quantum memory
by: Hhan, Minki, et al.
Published: (2025)

NISQ Security and Complexity via Simple Classical Reasoning
by: Cojocaru, Alexandru, et al.
Published: (2025)

Classical vs Quantum Advice and Proofs under Classically-Accessible Oracle
by: Li, Xingjian, et al.
Published: (2023)

Verifiable Quantum Advantage without Structure
by: Yamakawa, Takashi, et al.
Published: (2022)

Quantum Advantage from One-Way Functions
by: Morimae, Tomoyuki, et al.
Published: (2023)

From Worst-Case Hardness of $\mathsf{NP}$ to Quantum Cryptography via Quantum Indistinguishability Obfuscation
by: Morimae, Tomoyuki, et al.
Published: (2025)

Quantum Cryptography and Hardness of Non-Collapsing Measurements
by: Morimae, Tomoyuki, et al.
Published: (2025)

A New Approach to Generic Lower Bounds: Classical/Quantum MDL, Quantum Factoring, and More
by: Hhan, Minki
Published: (2024)

Quantum Public-Key Encryption with Tamper-Resilient Public Keys from One-Way Functions
by: Kitagawa, Fuyuki, et al.
Published: (2023)

The NISQ Complexity of Collision Finding
by: Hamoudi, Yassine, et al.
Published: (2022)

On the Computational Hardness of Quantum One-Wayness
by: Cavalar, Bruno, et al.
Published: (2023)

Hardness of Quantum Distribution Learning and Quantum Cryptography
by: Hiroka, Taiga, et al.
Published: (2025)

On Limits on the Provable Consequences of Quantum Pseudorandomness
by: Bouaziz--Ermann, Samuel, et al.
Published: (2025)

Quantum Cryptography in Algorithmica
by: Kretschmer, William, et al.
Published: (2022)

Quantum Pseudorandom Scramblers
by: Lu, Chuhan, et al.
Published: (2023)

Quantum Statistical Witness Indistinguishability
by: Nassar, Shafik, et al.
Published: (2025)

Quantum Pseudorandomness and Classical Complexity
by: Kretschmer, William
Published: (2021)

Quantum delegation with an off-the-shelf device
by: Broadbent, Anne, et al.
Published: (2023)

A Note on Quantum-Secure PRPs
by: Zhandry, Mark
Published: (2016)

A Meta-Complexity Characterization of Quantum Cryptography
by: Cavalar, Bruno P., et al.
Published: (2024)

Cryptographic Conditions for Efficient Testing of Distributions and Quantum States
by: Cavalar, Bruno, et al.
Published: (2025)

A Computational Separation Between Quantum No-cloning and No-telegraphing
by: Nehoran, Barak, et al.
Published: (2023)

The Round Complexity of Proofs in the Bounded Quantum Storage Model
by: Grilo, Alex B., et al.
Published: (2024)

Quantum Automating $\mathbf{TC}^0$-Frege Is LWE-Hard
by: Arteche, Noel, et al.
Published: (2024)

Quantum-proof multi-source randomness extractors in the Markov model
by: Arnon, Rotem, et al.
Published: (2015)

Quantum Fast Implementation of Functional Bootstrapping and Private Information Retrieval
by: Ma, Guangsheng, et al.
Published: (2024)

Quantum-Computable One-Way Functions without One-Way Functions
by: Kretschmer, William, et al.
Published: (2024)

Quantum Multiplier Based on Exponent Adder
by: Zhan, Junpeng
Published: (2023)

Does quantum lattice sieving require quantum RAM?
by: Cho, Beomgeun, et al.
Published: (2024)

Experimental relativistic zero-knowledge proofs with unconditional security
by: Weng, Chen-Xun, et al.
Published: (2025)

Parallel Kac's Walk Generates PRU
by: Lu, Chuhan, et al.
Published: (2025)

An efficient construction of Raz's two-source randomness extractor with improved parameters
by: Foreman, Cameron, et al.
Published: (2025)

Pseudorandom quantum authentication
by: Haug, Tobias, et al.
Published: (2025)

Pseudorandom density matrices
by: Bansal, Nikhil, et al.
Published: (2024)

Clifford Strategies in Interactive Protocols are Classically Simulatable
by: Shalit, Itay
Published: (2024)

Finding dense sub-lattices as low-energy states of a Hamiltonian
by: Barberà-Rodríguez, Júlia, et al.
Published: (2023)

Pseudorandomness in the (Inverseless) Haar Random Oracle Model
by: Ananth, Prabhanjan, et al.
Published: (2024)