Cryptology ePrint Archive: Report 2015/361

Computationally binding quantum commitments

Dominique Unruh

Abstract: 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.

Category / Keywords: foundations / Quantum commitments, computationally binding, rewinding

Original Publication (with minor differences): IACR-EUROCRYPT-2016

Date: received 21 Apr 2015, last revised 3 Feb 2016

Contact author: unruh at ut ee

Available format(s): PDF | BibTeX Citation

Note: Minor changes taking referee comments into account.

Version: 20160203:090737 (All versions of this report)

Short URL:

Discussion forum: Show discussion | Start new discussion

[ Cryptology ePrint archive ]