658 search results - page 70 / 132 » The Grindahl Hash Functions |
168
click to vote
TCC
2007
Springer
16 years 11 days 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 ...
152
click to vote
ACISP
2009
Springer
16 years 27 days ago
2009
Springer
Abstract. Two of the most recent and powerful multi-property-preserving (MPP) hash domain extension transforms are the Ramdom-Oracle-XOR (ROX) transform and the Enveloped Shoup (ES...
155
click to vote
CCS
2008
ACM
15 years 8 months ago
2008
ACM
In this paper, we study the security of a practical randomness extractor and its application in the tls standard. Randomness extraction is the first stage of key derivation functi...
149
click to vote
PODC
2003
ACM
15 years 11 months ago
2003
ACM
Routing topologies for distributed hashing in peer-to-peer networks are classified into two categories: deterministic and randomized. A general technique for constructing determi...
132
click to vote
CRYPTO
2000
Springer
15 years 10 months ago
2000
Springer
Abstract. The Full Domain Hash (FDH) scheme is a RSA-based signature scheme in which the message is hashed onto the full domain of the RSA function. The FDH scheme is provably secu...