Paper 2010/212
Quantum Proofs of Knowledge
Dominique Unruh
Abstract
We motivate, define and construct quantum proofs of knowledge, proofs of knowledge secure against quantum adversaries. Our constructions are based on a new quantum rewinding technique that allows us to extract witnesses in many classical proofs of knowledge. We give criteria under which a classical proof of knowledge is a quantum proof of knowledge. Combining our results with Watrous' results on quantum zero-knowledge, we show that there are zero-knowledge quantum proofs of knowledge for all languages in NP (assuming quantum one-way permutations).
Note: The proofs in the previous revision contained an error. (Page 14, line 6 from bottom: "(1-|Phi><Phi|/nu_i^2) is positive" is incorrect.) The proofs have been rewritten (and simplified).
Metadata
- Available format(s)
- Category
- Foundations
- Publication info
- Published elsewhere. Unknown where it was published
- Keywords
- Quantum cryptographyproofs of knowledge
- Contact author(s)
- unruh @ mmci uni-saarland de
- History
- 2015-02-11: last of 4 revisions
- 2010-04-19: received
- See all versions
- Short URL
- https://ia.cr/2010/212
- License
-
CC BY