Converting the flavor of a quantum bit commitment


The results presented in the thesis show how to convert a statistically binding but computationally concealing quantum bit commitment scheme into a computationally binding but statistically concealing scheme. For a security parameter n, the construction of the statistically concealing scheme requires O(n2) executions of the statistically binding scheme. As a consequence of the reduction, statistically concealing but computationally binding quantum bit commitments can be based upon any family of quantum one-way functions. Such a construction is not known to exist in the classical world

Similar works

Full text

oaioai:digitool.library.m...Last time updated on 6/16/2016

This paper was published in eScholarship@McGill.

Having an issue?

Is data on this page outdated, violates copyrights or anything else? Report the problem now and we will take corresponding actions after reviewing your request.