Publication | Open Access
How to make unforgeable money in generalised probabilistic theories
16
Citations
30
References
2018
Year
EngineeringGame TheoryMoney SchemeQuantum MoneyMeasurement ProblemCone ProgrammingUnforgeable MoneyQuantum ComputingPost-quantum CryptographyQuantum Mechanical PropertyProbabilistic ReasoningQuantum EntanglementDecision TheoryQuantum CryptographyEconomicsQuantum SecurityQuantum ScienceProbability TheoryComputer ScienceFinanceImprecise ProbabilityBusinessGame-theoretic Probability
We discuss the possibility of creating money that is physically impossible to counterfeit. Of course, "physically impossible" is dependent on the theory that is a faithful description of nature. Currently there are several proposals for quantum money which have their security based on the validity of quantum mechanics. In this work, we examine Wiesner's money scheme in the framework of generalised probabilistic theories. This framework is broad enough to allow for essentially any potential theory of nature, provided that it admits an operational description. We prove that under a quantifiable version of the no-cloning theorem, one can create physical money which has an exponentially small chance of being counterfeited. Our proof relies on cone programming, a natural generalisation of semidefinite programming. Moreover, we discuss some of the difficulties that arise when considering non-quantum theories.
| Year | Citations | |
|---|---|---|
Page 1
Page 1