Reducing complexity assumptions for statistically-hiding commitment (Q1027978)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Reducing complexity assumptions for statistically-hiding commitment |
scientific article; zbMATH DE number 5571751
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Reducing complexity assumptions for statistically-hiding commitment |
scientific article; zbMATH DE number 5571751 |
Statements
Reducing complexity assumptions for statistically-hiding commitment (English)
0 references
30 June 2009
0 references
\textit{M. Naor} et al. [J. Cryptology 11, No. 2, 87--108 (1998; Zbl 0960.94016)] have shown how to construct statistically-hiding commitment schemes based on any one-way permutation. This paper discusses the construction with one-way functions for which the value of pre-images each of the outputs can be efficiently estimated. A special case is the class of regular one-way functions where all points in the image of the function have the same number of pre-images.
0 references
bit commitment
0 references
statistical hiding
0 references
regular one way functions
0 references
0 references
0 references
0 references
0 references
0.88666546
0 references
0.8833185
0 references
0.87320536
0 references
0.86703646
0 references
0.8634267
0 references
0.8598257
0 references
0.85871834
0 references
