Paper · P09
Cryptanalysis of Three Quantum Money Schemes
Title from docs/planning/QMINT_MASTER_RESEARCH_PLAN.md section 16; not present in the matrix row.
Andriyan Bilyk; Javad Doliskani; Zhiyong Gong · 2022-05-21 (v1); v2 2022-10-29
- Status
- ABSTRACT READOnly the abstract (and possibly skimmed PDF) was read; theorem details are not verified.ABSTRACT_READ; PDF downloaded
- Game
- none stated
- Anchor
- —
- Source file
- research/PRIOR_ART_MATRIX.csv
Precise theorem
Polynomial-time quantum algorithm for the Aaronson-Christiano hidden-subspace hard problem; polynomial-time cloning attack on Zhandry 2017 multivariate-hash money; reduction for Kane-Sharif-Silverberg quaternion scheme (abstract).
Citations
Record
Every field of the source record, in file order.
- Canonical linkcanonical_link
https://arxiv.org/abs/2205.10488
- Authorsauthors
Andriyan Bilyk; Javad Doliskani; Zhiyong Gong
- Publication datepublication_date
2022-05-21 (v1); v2 2022-10-29
- Versionversion
arXiv v2; no journal-ref on arXiv page
- Correction statuscorrection_status
n/a
- Input modelinput_model
public-key quantum money schemes
- Verifier modelverifier_model
public
- Adversary capabilitiesadversary_capabilities
quantum polynomial time
- Tested parameterstested_parameters
none
- Proof dependenciesproof_dependencies
algebraic geometry (Zariski tangent space)
- Datasetsdatasets
none
- Codecode
none
- Licenselicense
arXiv CC BY 4.0
- Limitationslimitations
cryptanalysis of specific public-key schemes only
- What QMint addswhat_QMint_adds
Red-team reading; reminder that QMoney's hidden-subspace prototype is not secure public-key money.
- Access statusaccess_status
ABSTRACT_READ; PDF downloaded
- Qmint gameqmint_game
none