Quantum lightning never strikes the same state twice. Or: quantum money from cryptographic assumptions

DOI10.1007/s00145-020-09372-xzbMath1478.94114OpenAlexW3118434288WikidataQ114692954 ScholiaQ114692954MaRDI QIDQ2661695

Mark Zhandry

Publication date: 7 April 2021

Published in: Journal of Cryptology (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00145-020-09372-x

zbMATH Keywords

hash functionsquantum moneyobfuscationcommitments

Mathematics Subject Classification ID

Cryptography (94A60) Macroeconomic theory (monetary models, models of taxation) (91B64) Authentication, digital signatures and secret sharing (94A62)

Related Items (4)

On the feasibility of unclonable encryption, and more ⋮ Quantum money with mintage supervision ⋮ Secure software leasing from standard assumptions ⋮ New constructions for quantum money and its application

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Return of GGH15: provable security against zeroizing attacks
• New security notions and feasibility results for authentication of quantum data
• Quantum-access-secure message authentication via blind-unforgeability
• Revisiting post-quantum Fiat-Shamir
• Obfuscating Conjunctions under Entropic Ring LWE
• Candidate Indistinguishability Obfuscation and Functional Encryption for All Circuits
• Quantum money from knots
• A Subfield Lattice Attack on Overstretched NTRU Assumptions
• Practical Multilinear Maps over the Integers
• Secure Signatures and Chosen Ciphertext Security in a Quantum Computing World
• Algebraic Cryptanalysis of a Quantum Money Scheme The Noise-Free Case
• Superposition Attacks on Cryptographic Protocols
• An algorithm for NTRU problems and cryptanalysis of the GGH multilinear map without a low-level encoding of zero
• Quantum money from hidden subspaces
• Multivariates Polynomials for Hashing
• Strengths and Weaknesses of Quantum Computing
• Coding theorem and strong converse for quantum channels
• Candidate Multilinear Maps from Ideal Lattices
• Quantum-Secure Message Authentication Codes
• One-shot signatures and applications to hybrid quantum/classical authentication
• Graph-Induced Multilinear Maps from Lattices
• Cryptanalyses of Candidate Branching Program Obfuscators
• Revocable Quantum Timed-Release Encryption
• Worst‐Case to Average‐Case Reductions Based on Gaussian Measures
• Computationally Binding Quantum Commitments
• Recovering Short Generators of Principal Ideals in Cyclotomic Rings
• On Extractability Obfuscation
• On lattices, learning with errors, random linear codes, and cryptography

This page was built for publication: Quantum lightning never strikes the same state twice. Or: quantum money from cryptographic assumptions