On the (im)plausibility of public-key quantum money from collision-resistant hash functions
From MaRDI portal
Publication:6562579
Cites work
- A single quantum cannot be cloned
- Being a permutation is also orthogonal to one-wayness in quantum world: impossibilities of quantum one-way permutations from one-wayness primitives
- Candidate obfuscation via oblivious LWE sampling
- Coding theorem and strong converse for quantum channels
- Computationally binding quantum commitments
- Counterexamples to new circular security assumptions underlying iO
- Cryptanalysis of three quantum money schemes
- Finding collisions in a quantum world: quantum black-box separation of collision-resistance and one-wayness
- Hidden cosets and applications to unclonable cryptography
- How to record quantum queries, and applications to quantum indifferentiability
- scientific article; zbMATH DE number 3825698 (Why is no real title available?)
- scientific article; zbMATH DE number 176554 (Why is no real title available?)
- scientific article; zbMATH DE number 1303133 (Why is no real title available?)
- scientific article; zbMATH DE number 610968 (Why is no real title available?)
- scientific article; zbMATH DE number 1842483 (Why is no real title available?)
- scientific article; zbMATH DE number 4185033 (Why is no real title available?)
- scientific article; zbMATH DE number 7651031 (Why is no real title available?)
- Identity-based encryption from the Diffie-Hellman assumption
- Indistinguishability obfuscation from circular security
- Indistinguishability obfuscation from LPN over \(\mathbb{F}_p\), DLIN, and PRGs in \(NC^0\)
- Indistinguishability obfuscation from well-founded assumptions
- Indistinguishability obfuscation without multilinear maps: new paradigms via low degree weak pseudorandomness and security amplification
- Merkle Puzzles Are Optimal — An O(n2)-Query Attack on Any Key Exchange from a Random Oracle
- On black-box reductions between predicate encryption schemes
- On obfuscation with random oracles
- On the Black-Box Complexity of Optimally-Fair Coin Tossing
- On the feasibility of unclonable encryption, and more
- On the impossibility of key agreements from quantum random oracles
- Optimal counterfeiting attacks and generalizations for Wiesner's quantum money
- Pseudorandom quantum states
- Public-key Quantum money with a classical bank
- Quantum Arthur-Merlin games
- Quantum computation and quantum information. 10th anniversary edition
- Quantum encryption with certified deletion
- Quantum lightning never strikes the same state twice. Or: quantum money from cryptographic assumptions
- Quantum money from knots
- Quantum one-time programs. (Extended abstract)
- Secure software leasing
- Security analysis of quantum lightning
- Semi-quantum money
- Semi-quantum tokenized signatures
- Structure vs. hardness through the obfuscation lens
- Succinct LWE sampling, random polynomials, and obfuscation
- The need for structure in quantum speedups
- Theory of Cryptography
Cited in
(3)
This page was built for publication: On the (im)plausibility of public-key quantum money from collision-resistant hash functions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6562579)
