One-way functions imply secure computation in a quantum world
From MaRDI portal
Publication:2120090
DOI10.1007/978-3-030-84242-0_17zbMath1487.81036arXiv2011.13486OpenAlexW3117371777MaRDI QIDQ2120090
Fermi Ma, Andrea Coladangelo, James Bartusek, Dakshita Khurana
Publication date: 31 March 2022
Full work available at URL: https://arxiv.org/abs/2011.13486
Quantum computation (81P68) Cryptography (94A60) Quantum coding (general) (81P70) Quantum cryptography (quantum-theoretic aspects) (81P94) Computer security (68M25)
Related Items (13)
Quantum oblivious transfer based on entanglement swapping ⋮ Cryptography from pseudorandom quantum states ⋮ Quantum commitments and signatures without one-way functions ⋮ Post-quantum simulatable extraction with minimal assumptions: black-box and constant-round ⋮ General properties of quantum bit commitments (extended abstract) ⋮ Black-box separations for non-interactive classical commitments in a quantum world ⋮ Quantum computationally predicate-binding commitments with application in quantum zero-knowledge arguments for NP ⋮ A new framework for quantum oblivious transfer ⋮ On concurrent multi-party quantum computation ⋮ Cryptography with certified deletion ⋮ Secure computation with shared EPR pairs (or: how to teleport in zero-knowledge) ⋮ Secure quantum computation with classical communication ⋮ Classical binding for quantum commitments
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Quantum cryptography: public key distribution and coin tossing
- Bit commitment using pseudorandomness
- Secure multi-party quantum computation with a dishonest majority
- Post-quantum multi-party computation
- Oblivious transfer is in MiniQCrypt
- Quantum Position Verification in the Random Oracle Model
- Actively Secure Two-Party Evaluation of Any Quantum Operation
- Zero-knowledge against quantum attacks
- Merkle Puzzles Are Optimal — An O(n2)-Query Attack on Any Key Exchange from a Random Oracle
- Improving the Security of Quantum Protocols via Commit-and-Open
- Secure multi-party quantum computation
- Secure Two-Party Quantum Evaluation of Unitaries against Specious Adversaries
- Sampling in a Quantum Population, and Applications
- Oblivious Transfer Is Symmetric
- Founding Cryptography on Oblivious Transfer – Efficiently
- Random Oracles and Auxiliary Input
- A Pseudorandom Generator from any One-way Function
- Post-quantum zero knowledge in constant rounds
- Classical Cryptographic Protocols in a Quantum World
- Constant-Round Multiparty Computation Using a Black-Box Pseudorandom Generator
- On the Power of Public-Key Encryption in Secure Computation
This page was built for publication: One-way functions imply secure computation in a quantum world
