Sciweavers

658 search results - page 70 / 132
» The Grindahl Hash Functions
Sort
View
TCC
2007
Springer
92views Cryptology» more  TCC 2007»
15 years 3 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
ACISP
2009
Springer
15 years 4 months ago
Analysis of Property-Preservation Capabilities of the ROX and ESh Hash Domain Extenders
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...
Mohammad Reza Reyhanitabar, Willy Susilo, Yi Mu
CCS
2008
ACM
14 years 11 months ago
HMAC is a randomness extractor and applications to TLS
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...
Pierre-Alain Fouque, David Pointcheval, Séb...
PODC
2003
ACM
15 years 3 months ago
Routing networks for distributed hash tables
Routing topologies for distributed hashing in peer-to-peer networks are classified into two categories: deterministic and randomized. A general technique for constructing determi...
Gurmeet Singh Manku
CRYPTO
2000
Springer
139views Cryptology» more  CRYPTO 2000»
15 years 2 months ago
On the Exact Security of Full Domain Hash
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...
Jean-Sébastien Coron