Paper 2008/034
Perfectly Hiding Commitment Scheme with Two-Round from Any One-Way Permutation
Chunming Tang, Dingyi Pei, Zhuojun Liu, Zheng-an Yao, and Mingsheng Wang
Abstract
Commitment schemes are arguably among the most important and useful primitives in cryptography. According to the computational power of receivers, commitments can be classified into three possible types: {\it computational hiding commitments, statistically hiding commitments} and {\it perfect computational commitments}. The fist commitment with constant rounds had been constructed from any one-way functions in last centuries, and the second with non-constant rounds were constructed from any one-way functions in FOCS2006, STOC2006 and STOC2007 respectively, furthermore, the lower bound of round complexity of statistically hiding commitments has been proven to be $\frac{n}{logn}$ rounds under the existence of one-way function. Perfectly hiding commitments implies statistically hiding, hence, it is also infeasible to construct a practically perfectly hiding commitments with constant rounds under the existence of one-way function. In order to construct a perfectly hiding commitments with constant rounds, we have to relax the assumption that one-way functions exist. In this paper, we will construct a practically perfectly hiding commitment with two-round from any one-way permutation. To the best of our knowledge, these are the best results so far.
Note: revise my paper according to some suggestions from others
Metadata
- Available format(s)
-
PDF PS
- Publication info
- Published elsewhere. Unknown where it was published
- Keywords
- Cryptographyperfectly hiding commitmentsone-way permutation$\Sigma$-protocol.
- Contact author(s)
- tangcm622 @ hotmail com
- History
- 2008-02-05: last of 4 revisions
- 2008-01-28: received
- See all versions
- Short URL
- https://ia.cr/2008/034
- License
-
CC BY
BibTeX
@misc{cryptoeprint:2008/034,
author = {Chunming Tang and Dingyi Pei and Zhuojun Liu and Zheng-an Yao and Mingsheng Wang},
title = {Perfectly Hiding Commitment Scheme with Two-Round from Any One-Way Permutation},
howpublished = {Cryptology {ePrint} Archive, Paper 2008/034},
year = {2008},
url = {https://eprint.iacr.org/2008/034}
}