|
|
|
|
| LEADER |
03196 am a22005533u 4500 |
| 001 |
67832 |
| 042 |
|
|
|a dc
|
| 100 |
1 |
0 |
|a Lutomirski, Andrew Michael
|e author
|
| 100 |
1 |
0 |
|a Massachusetts Institute of Technology. Computer Science and Artificial Intelligence Laboratory
|e contributor
|
| 100 |
1 |
0 |
|a Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science
|e contributor
|
| 100 |
1 |
0 |
|a Massachusetts Institute of Technology. Department of Mathematics
|e contributor
|
| 100 |
1 |
0 |
|a Massachusetts Institute of Technology. Department of Physics
|e contributor
|
| 100 |
1 |
0 |
|a Massachusetts Institute of Technology. Research Laboratory of Electronics
|e contributor
|
| 100 |
1 |
0 |
|a Aaronson, Scott
|e contributor
|
| 100 |
1 |
0 |
|a Lutomirski, Andrew Michael
|e contributor
|
| 100 |
1 |
0 |
|a Hassidim, Avinatan
|e contributor
|
| 100 |
1 |
0 |
|a Farhi, Edward
|e contributor
|
| 100 |
1 |
0 |
|a Gosset, David Nicholas
|e contributor
|
| 100 |
1 |
0 |
|a Shor, Peter W.
|e contributor
|
| 100 |
1 |
0 |
|a Kelner, Jonathan Adam
|e contributor
|
| 100 |
1 |
0 |
|a Aaronson, Scott
|e contributor
|
| 700 |
1 |
0 |
|a Gosset, David Nicholas
|e author
|
| 700 |
1 |
0 |
|a Hassidim, Avinatan
|e author
|
| 700 |
1 |
0 |
|a Farhi, Edward
|e author
|
| 700 |
1 |
0 |
|a Shor, Peter W.
|e author
|
| 700 |
1 |
0 |
|a Kelner, Jonathan Adam
|e author
|
| 700 |
1 |
0 |
|a Aaronson, Scott
|e author
|
| 245 |
0 |
0 |
|a Breaking and making quantum money: toward a new quantum cryptographic protocol
|
| 260 |
|
|
|b Institute for Computer Science,
|c 2011-12-20T18:01:12Z.
|
| 856 |
|
|
|z Get fulltext
|u http://hdl.handle.net/1721.1/67832
|
| 520 |
|
|
|a http://conference.itcs.tsinghua.edu.cn/ICS2010/
|
| 520 |
|
|
|a Public-key quantum money is a cryptographic protocol in which a bank can create quantum states which anyone can verify but no one except possibly the bank can clone or forge. There are no secure public-key quantum money schemes in the literature; as we show in this paper, the only previously published scheme is insecure. We introduce a category of quantum money protocols which we call collision-free. For these protocols, even the bank cannot prepare multiple identical looking pieces of quantum money. We present a blueprint for how such a protocol might work as well as a concrete example which we believe may be insecure.
|
| 520 |
|
|
|a United States. Dept. of Energy. Office of Science (cooperative research agreement DE-FG02- 94ER40818)
|
| 520 |
|
|
|a W.M. Keck Foundation
|
| 520 |
|
|
|a United States. Army Research Office (grant number W911NF-09-1-0438)
|
| 520 |
|
|
|a National Science Foundation (U.S.) (CCF-0829421)
|
| 520 |
|
|
|a National Science Foundation (U.S.) (CCF-0843915)
|
| 520 |
|
|
|a National Science Foundation (U.S.) (CCF- 0844626)
|
| 520 |
|
|
|a United States. Defense Advanced Research Projects Agency (DARPA) (YFA grant)
|
| 520 |
|
|
|a National Defense Science and Engineering Graduate Fellowship
|
| 520 |
|
|
|a Natural Sciences and Engineering Research Council of Canada (NSERC)
|
| 520 |
|
|
|a Microsoft Research
|
| 546 |
|
|
|a en_US
|
| 690 |
|
|
|a quantum money
|
| 690 |
|
|
|a cryptography
|
| 690 |
|
|
|a random matrices
|
| 690 |
|
|
|a markov chains
|
| 655 |
7 |
|
|a Article
|
| 773 |
|
|
|t First Symposium on Innovations in Computer Science, ICS 2010
|
