36 search results - page 1 / 8 » Statistically-hiding commitment from any one-way function |
TCC
2007
Springer
14 years 1 months ago
2007
Springer
We present a lower bound on the round complexity of a natural class of black-box constructions of statistically hiding commitments from one-way permutations. This implies a Ω( n ...
EUROCRYPT
2010
Springer
14 years 7 days ago
2010
Springer
This paper revisits the construction of Universal One-Way Hash Functions (UOWHFs) from any one-way function due to Rompel (STOC 1990). We give a simpler construction of UOWHFs, whi...
EUROCRYPT
2010
Springer
14 years 7 days ago
2010
Springer
We present a constant-round non-malleable commitment scheme based on the existence of sub-exponential one-way functions and using a blackbox proof of security. As far as we know, t...
EUROCRYPT
2000
Springer
13 years 11 months ago
2000
Springer
We show that although unconditionally secure quantum bit commitment is impossible, it can be based upon any family of quantum one-way permutations. The resulting scheme is uncondit...
FOCS
2006
IEEE
14 years 1 months ago
2006
IEEE