Sciweavers

4 search results - page 1 / 1
» One-Way Permutations, Interactive Hashing and Statistically ...
Sort
View
TCC
2007
Springer
92views Cryptology» more  TCC 2007»
14 years 4 months ago
One-Way Permutations, Interactive Hashing and Statistically Hiding Commitments
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 ...
Hoeteck Wee
EUROCRYPT
2010
Springer
14 years 3 months ago
Universal One-Way Hash Functions via Inaccessible Entropy
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...
Iftach Haitner, Thomas Holenstein, Omer Reingold, ...
STOC
2005
ACM
103views Algorithms» more  STOC 2005»
14 years 11 months ago
New and improved constructions of non-malleable cryptographic protocols
We present a new constant round protocol for non-malleable zero-knowledge. Using this protocol as a subroutine, we obtain a new constant-round protocol for non-malleable commitmen...
Rafael Pass, Alon Rosen
COCO
2010
Springer
168views Algorithms» more  COCO 2010»
13 years 12 months ago
A New Sampling Protocol and Applications to Basing Cryptographic Primitives on the Hardness of NP
We investigate the question of what languages can be decided efficiently with the help of a recursive collisionfinding oracle. Such an oracle can be used to break collisionresistan...
Iftach Haitner, Mohammad Mahmoody, David Xiao