Black-box separations for non-interactive classical commitments in a quantum world
From MaRDI portal
(Redirected from Publication:6138082)
Recommendations
- The curious case of non-interactive commitments -- on the power of black-box vs. non-black-box use of primitives
- Quantum commitments and signatures without one-way functions
- Classical binding for quantum commitments
- Non-malleable commitments against quantum attacks
- Quantum commitments from complexity assumptions
Cites work
- A Pseudorandom Generator from any One-way Function
- Advances in Cryptology - CRYPTO 2003
- Being a permutation is also orthogonal to one-wayness in quantum world: impossibilities of quantum one-way permutations from one-wayness primitives
- Classical binding for quantum commitments
- Classical verification of quantum computations with efficient verifier
- Collapse-binding quantum commitments without random oracles
- Computationally binding quantum commitments
- Cryptography from pseudorandom quantum states
- Finding collisions in a quantum world: quantum black-box separation of collision-resistance and one-wayness
- General properties of quantum bit commitments (extended abstract)
- Hardness vs randomness
- How to record quantum queries, and applications to quantum indifferentiability
- scientific article; zbMATH DE number 1722671 (Why is no real title available?)
- scientific article; zbMATH DE number 4185033 (Why is no real title available?)
- scientific article; zbMATH DE number 4187086 (Why is no real title available?)
- scientific article; zbMATH DE number 7651035 (Why is no real title available?)
- scientific article; zbMATH DE number 7701522 (Why is no real title available?)
- Merkle Puzzles Are Optimal — An O(n2)-Query Attack on Any Key Exchange from a Random Oracle
- Non-interactive classical verification of quantum computation
- Notions of black-box reductions, revisited
- Oblivious transfer is in MiniQCrypt
- On black-box separations among injective one-way functions
- On the impossibility of key agreements from quantum random oracles
- One-way functions imply secure computation in a quantum world
- Perfectly concealing quantum bit commitment from any quantum one-way permutation
- Pseudorandom quantum states
- Quantum bit commitment with application in quantum zero-knowledge proof (extended abstract)
- Quantum commitments and signatures without one-way functions
- Quantum computation and quantum information. 10th anniversary edition
- Quantum proofs of knowledge
- Quantum random oracle model with auxiliary input
- Random oracles in a quantum world
- Scalable pseudorandom quantum states
- Secure quantum computation with classical communication
- Statistically-hiding quantum bit commitment from approximable-preimage-size quantum one-way function
- Strengths and Weaknesses of Quantum Computing
- Succinct blind Quantum computation using a random oracle
- The curious case of non-interactive commitments -- on the power of black-box vs. non-black-box use of primitives
- The need for structure in quantum speedups
- The uncertainty principle: Variations on a theme
- Theory of Cryptography
- Theory of Cryptography
- Uncertainty Principles and Signal Recovery
Cited in
(7)- On central primitives for quantum cryptography with classical communication
- On quantum money and evasive obfuscation
- Quantum public-key encryption of quantum states, and more
- Cryptography in the common Haar state model: feasibility results and separations
- On the limitations of pseudorandom unitaries. Or: cryptographic applications of LOCC indistinguishability of identical versus independent Haar unitaries
- On the efficiency of generic, quantum cryptographic constructions
- Towards the impossibility of quantum public key encryption with classical keys from one-way functions
This page was built for publication: Black-box separations for non-interactive classical commitments in a quantum world
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6138082)
