Paper 2011/223 Original: eprint.iacr.org/2011/223 ↗
A Perfectly Binding Commitment Scheme Against Quantum Attacks
Abstract
It's known that perfectly binding quantum computationally hiding commitment schemes can be constructed from any quantum one-way permutation. Since no quantum one-way permutations are known, it has been unknown by far whether we can get such a concrete commitment scheme. In this paper, we give a positive answer. Specifically, we present such a lattice-based commitment scheme, which is built from the results gained by Gentry et al.
Metadata
- Available format(s)
PDF- Category
- Secret-key cryptography
- Publication info
- Preprint.
- History
- 2011-05-22: last updated
- 2011-05-10: published
- Short URL
- https://ia.cr/2011/223
- License
- https://creativecommons.org/licenses/by/4.0/
BibTeX
@misc{cryptoeprint:2011/223,
author = {Zeng Bing and Chen Liang and Tang Xueming},
title = {A Perfectly Binding Commitment Scheme Against Quantum Attacks},
howpublished = {Cryptology {ePrint} Archive, Paper 2011/223},
year = {2011},
url = {https://eprint.iacr.org/2011/223}
}