Reducing complexity assumptions for statistically-hiding commitment

DMCA

Reducing complexity assumptions for statistically-hiding commitment (2005)

Cached

Download Links

Other Repositories/Bibliography

DBLP

by Iftach Haitner , Omer Horvitz , Jonathan Katz , Chiu-yuen Koo , Ruggero Morselli , Ronen Shaltiel

Venue:	In EUROCRYPT
Citations:	31 - 6 self

BibTeX

@INPROCEEDINGS{Haitner05reducingcomplexity,
    author = {Iftach Haitner and Omer Horvitz and Jonathan Katz and Chiu-yuen Koo and Ruggero Morselli and Ronen Shaltiel},
    title = {Reducing complexity assumptions for statistically-hiding commitment},
    booktitle = {In EUROCRYPT},
    year = {2005},
    pages = {58--77},
    publisher = {Springer}
}

OpenURL

Abstract

We revisit the following question: what are the minimal assumptions needed to construct statistically-hiding commitment schemes? Naor et al. show how to construct such schemes based on any one-way permutation. We improve upon this by showing a construction based on any approximable preimage-size one-way function. These are one-way functions for which it is possible to efficiently approximate the number of pre-images of a given output. 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. We also prove two additional results related to statistically-hiding commitment. First, we prove a (folklore) parallel composition theorem showing, roughly speaking, that the statistical hiding property of any such commitment scheme is amplified exponentially when multiple independent parallel executions of the scheme are carried out. Second, we show a compiler which transforms any commitment scheme which is statistically hiding against an honest-but-curious receiver into one which is statistically hiding even against a malicious receiver. 1

Keyphrases

statistically-hiding commitment complexity assumption commitment scheme additional result one-way permutation honest-but-curious receiver minimal assumption statistically-hiding commitment scheme approximable preimage-size one-way function multiple independent parallel execution parallel composition statistical hiding property malicious receiver following question special case regular one-way function one-way function

DMCA