Quantum commitments from complexity assumptions

Please use this identifier to cite or link to this item: https://doi.org/10.1007/978-3-642-22006-7_7

Title:	Quantum commitments from complexity assumptions
Authors:	Chailloux, A. Kerenidis, I. Rosgen, B.
Issue Date:	2011
Citation:	Chailloux, A.,Kerenidis, I.,Rosgen, B. (2011). Quantum commitments from complexity assumptions. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) 6755 LNCS (PART 1) : 73-85. ScholarBank@NUS Repository. https://doi.org/10.1007/978-3-642-22006-7_7
Abstract:	We study worst-case complexity assumptions that imply quantum bit-commitment schemes. First we show that QSZK QMA implies a computationally hiding and statistically binding auxiliary-input quantum commitment scheme. We then extend our result to show that the much weaker assumption QIP QMA (which is weaker than PSPACE PP) implies the existence of auxiliary-input commitment schemes with quantum advice. Finally, to strengthen the plausibility of the separation QSZK QMA we find a quantum oracle relative to which honest-verifier QSZK is not contained in QCMA. © 2011 Springer-Verlag.
Source Title:	Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
URI:	http://scholarbank.nus.edu.sg/handle/10635/117266
ISBN:	9783642220050
ISSN:	03029743
DOI:	10.1007/978-3-642-22006-7_7
Appears in Collections:	Staff Publications

There are no files associated with this item.

Check