[Resource Topic] 2015/361: Computationally binding quantum commitments

Welcome to the resource topic for 2015/361

Computationally binding quantum commitments

Authors: Dominique Unruh


We present a new definition of computationally binding commitment schemes in the quantum setting, which we call “collapse-binding”. The definition applies to string commitments, composes in parallel, and works well with rewinding-based proofs. We give simple constructions of collapse-binding commitments in the random oracle model, giving evidence that they can be realized from hash functions like SHA-3. We evidence the usefulness of our definition by constructing three-round statistical zero-knowledge quantum arguments of knowledge for all NP languages.

ePrint: https://eprint.iacr.org/2015/361

Talk: https://www.youtube.com/watch?v=JtN3BIMUQFc

See all topics related to this paper.

Feel free to post resources that are related to this paper below.

Example resources include: implementations, explanation materials, talks, slides, links to previous discussions on other websites.

For more information, see the rules for Resource Topics .