Download presentation

Presentation is loading. Please wait.

Published byJason Bauer Modified over 3 years ago

1
New Developments in Quantum Money and Copy-Protected Software Scott Aaronson (MIT) Joint work with Paul Christiano A A

2
Ever since theres been money, thereve been people trying to counterfeit it Previous work on the physics of money: In his capacity as Master of the Mint, Isaac Newton worked on making English coins harder to counterfeit (He also personally oversaw hangings of counterfeiters)

3
Today: Holograms, embedded strips, microprinting, special inks… Leads to an arms race with no obvious winner Problem: From a CS perspective, uncopyable cash seems impossible for trivial reasons Any printing technology the good guys can build, bad guys can in principle build also x (x,x) is a polynomial-time operation

4
Whats done in practice: Have a trusted third party authorize every transaction OK, but sometimes you want cash, and that seems impossible to secure, at least in classical physics… (BitCoin: Trusted third party is distributed over the Internet)

5
No physical procedure can take an unknown quantum state and output two copies of it (or even a close approximation thereof) The No-Cloning Theorem

6
First Idea in the History of Quantum Info Wiesner 1969: Money thats information-theoretically impossible to counterfeit, assuming quantum mechanics Each banknote contains n qubits, secretly prepared in one of the 4 states |0,|1,|+,|- In a giant database, the bank remembers how it prepared every qubit on every banknote Want to verify a banknote? Take it to the bank. Bank uses its knowledge to measure each qubit in the right basis: OR Molina, Vidick, Watrous 2012: A counterfeiter who doesnt know the state can copy it with probability at most (3/4) n

7
1.Banknotes could decohere in your walletthe Schrödingers money problem! The reason why quantum money isnt yet practical, in contrast to (say) quantum key distribution 2.Bank needs a big database describing every banknote Solution (Bennett et al. 82): Pseudorandom functions 3.Only the bank knows how to verify the money 4.Scheme can be broken by interacting with the bank Drawbacks of Wiesners Scheme

8
Modern Goal: Public-Key Quantum Money Easy to prepare, hard to copy, verifiable by anyone KeyGenMint Ver k private k public |$ 1,|$ 2 …

9
Formally, a public-key quantum money scheme S consists of three polynomial-time quantum algorithms: S has completeness error if for all k public and valid $, S has soundness error if for all polynomial-time counterfeiters C mapping q banknotes to r>q banknotes, where Count returns the number of Cs output registers ¢ 1,…,¢ r that Ver accepts KeyGen(0 n ): Generates key pair (k private, k public ) Mint(k private ): Generates quantum banknote $ Ver(k public, ¢): Accepts or rejects claimed banknote ¢ Private-key quantum money scheme: Same except that k private =k public

10
Basic Observations Not obvious that public-key quantum money is possible! If it is, will certainly require computational assumptions, in addition to quantum mechanics Without loss of generality, quantum money is reusable. If the completeness error is, then its possible to verify banknotes in a way that damages the valid ones by at most in trace distance ( reusable 1/ times)

11
Previous Work on Public-Key Quantum Money A., CCC2009 Secure construction using a quantum oracle (but security proof never published) Explicit candidate scheme based on random stabilizer statesbroken by Lutomirski et al. 2010 Farhi et al., ITCS2012: Quantum money from knots Important, original proposal, but little known about security Not even known which states | the verifier accepts Lutomirski 2011: Abstract version of knot scheme using a classical oracle (but proving its security still wide open; seems hard)

12
Our work: A new public-key quantum money scheme, based on hidden subspaces A A Much simpler than previous schemes: verifier just projects onto valid money states, by measuring in two complementary bases For the first time, can base security on an assumption (about multivariate polynomial cryptography) that has nothing to do with quantum money Also for first time, can prove abstract version of scheme (involving a classical oracle) is unconditionally secure Same construction yields the first private-key scheme thats provably interactively secure

13
Overview of Our Construction Mini-Scheme Mint prints a single banknote (s, s ) s.t. copying s is hard Signature Scheme Secure against nonadaptive quantum chosen-message attacks Public-Key Quantum Money Scheme OWF Secure against quantum attacks From Rompel 1990

14
Standard Construction of Quantum Money from Mini-Schemes + Signatures (Introduced by Lutomirski et al.; analyzed by us) Theorem: If you can create counterfeit banknotes $, then either you can copy ss, or else you can forge signatures To verify the banknote $=(s, s,w): 1.Check that (s, s ) is valid 2.Check that w is a valid digital signature of s

15
The Hidden Subspace Mini-Scheme Quantum money state: Corresponding serial number s: Somehow describes how to check membership in A and in A (the dual subspace of A), yet doesnt reveal A or A Mint can easily choose a random A and prepare |A

16
Procedure to Verify Money State (assuming ability to decide membership in A and A ) A A 1.Project onto A elements (reject if this fails) 2.Hadamard all n qubits to map |A to |A 3.Project onto A elements (reject if this fails) 4.Hadamard all n qubits to return state to |A Theorem: The above just implements a projection onto |A A|i.e., it accepts | with probability | |A | 2

17
Security of the Black-Box Scheme Intuitively, what can the counterfeiter do? Need to show: 2 (n) quantum queries to O i and O i are needed, even just to map |A i to |A i 2 Valid Banknotes:A,A Membership Oracles: Measure |A i just yields one A i or A i element Query O i or O i to learn a basis for A i takes (2 n/4 ) queries, by the BBBV Theorem (optimality of Grover search)

18
Common generalization of No-Cloning Theorem and BBBV Theorem |$1,000,000

19
Idea: Look at Inner Products Use Ambainiss quantum adversary method to show that the inner product between |A and |A can decrease by at most ~2 -n/4, as the result of a single query to O A or O A Problem: A query can decrease the inner product by (1) for some |A,|A pairs! But we show that it cant for most pairs A,A: neighboring n/2-dimensional subspaces in GF(2) n

20
Finishing the Security Proof Our Inner-Product Adversary Method shows that (2 n/4 ) queries are needed for almost-perfect copying of |A. But what about copying with 1/poly(n) fidelity? Key idea: Since our scheme is projective, can amplify fidelity to |A 2 using fixed-point quantum search (a recent variant of Grovers algorithm due to Tulsi, Grover, and Patel) What about counterfeiters that only copy some |A s and not others? Key idea: The counterfeiting problem is random self-reducible! Before trying to copy |A, hit it with a random invertible linear transformation on GF(2) n

21
The same construction immediately yields the first… Private-Key Quantum Money (with no oracle) Secure Against Interactive Attack Suppose |A i could be copied using poly(n) verification requests to the bank Then |A i could also be copied in our public- key scheme, using poly(n) oracle queries! Verification Requests

22
Obfuscation Challenge: Instantiate the oracles O A and O A, without revealing A such that all p i s vanish on A and all q i s vanish on A. Our Proposal: Use Multivariate Polynomials For each money state |A, mint publishes (as |A s serial number) uniformly-random degree-d polynomials Purely-classical obfuscation problem; seems interesting on its own! But if we want public-key money, we still have to face an interesting, purely-classical… The p i s and q i s can be generated in n O(d) time: generate them assuming A=span(x 1,…,x n/2 ); then apply a linear transformation

23
Verifying |A is simple! With overwhelming probability, But given only the p i s and q i s, not clear how to find any nonzero A or A elements in poly-time (even quantumly) Closely related to multivariate polynomial cryptography, and to the polynomial isomorphism problem Our scheme is breakable when d=1 (trivially) or d=2 (using theory of quadratic forms). And theres nontrivial structure when d=3 (Bouillaguet et al. 2011). So we recommend d 4

24
Security Reduction Direct Product Assumption: Given the polynomials p 1,…,p 2n and q 1,…,q 2n, no polynomial-time quantum algorithm can find a generating set for A with (2 -n/2 ) success probability Theorem: Assuming the DPA, our money scheme is secure Proof Sketch: Suppose theres a counterfeiter C that maps |A to |A 2. Then to violate the DPA: 1.Prepare a uniform superposition over all x GF(2) n 2.Project onto A elements (yields |A with probability 2 -n/2 ) 3.If step 2 works, run C repeatedly to get ~n copies of |A 4.Measure each copy of |A in the standard basis (with high probability, yields n/2 independent A elements)

25
Break our scheme! Or get stronger evidence for security Find other ways of hiding (complementary) subspaces Are there secure public-key quantum money schemes relative to a random oracle? Does private-key quantum money require either a giant database or a cryptographic assumption? Practicality Open Problems DUNCE DUNCE

26
New Direction: Quantum Copy-Protection Finally, a serious use for quantum computing Goal: Quantum state | f that lets you compute an unknown function f, but doesnt let you efficiently create more states with which f can be computed New Developments (A.-Christiano, not yet written)! - By modifying our hidden-subspace money scheme, we give a quantum copy-protection scheme with a classical oracle, which works for any fs and is proven secure - We have a candidate quantum copy-protection scheme with no oracle, but havent yet proved its security

27
Quantum Copy-Protection Relative to a Classical Oracle Quantum program: (same as for money scheme) The classical oracle O, given a Boolean function f: If x A\{0 n } and y A \{0 n }, then O(0,x,z) O(1,y,z)=f(z). Otherwise, O(b,x,z)=0. Given |A and O, one can evaluate f. But using the Inner- Product Adversary Method and random self-reducibility, we prove that given |A and O, one cant find nonzero elements of both A and A with 1/poly(n) probability

28
Explicit Quantum Copy-Protection Scheme Starting point: Yaos garbled circuit construction (1986) Assuming 1-out-of-2 oblivious-transfer, lets Alice send Bob a circuit C such that Bob can evaluate C on one input x, yet he learns nothing about Cs internal structure We use hidden subspace states |A 1,|A 2,… to implement the oblivious transfer non-interactively Given oracle access to O A and O A, any quantum algorithm needs 2 (n) queries to find nonzero elements x A, y A with (2 -n/2 ) success probability To prove security, an excellent starting point would be to prove the following direct product conjecture:

Similar presentations

OK

The Equivalence of Sampling and Searching Scott Aaronson MIT.

The Equivalence of Sampling and Searching Scott Aaronson MIT.

© 2017 SlidePlayer.com Inc.

All rights reserved.

Ads by Google

Ppt on underwater wireless communication Ppt on fashion and indian youth Ppt on political parties and electoral process in texas Ppt on thermal conductivity of insulating powder Ppt on management by objectives ppt Ppt on world book day images Ppt on south african culture today Ppt on latest technology in electronics and instrumentation Ppt on contract labour act 1970 india A ppt on robotics