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.
Cite
CITATION STYLE
Chailloux, A., Kerenidis, I., & Rosgen, B. (2011). Quantum commitments from complexity assumptions. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 6755 LNCS, pp. 73–85). Springer Verlag. https://doi.org/10.1007/978-3-642-22006-7_7
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
