330 search results - page 13 / 66 » Random Indexing Revisited |
IJNSEC
2008
15 years 8 days ago
2008
In 1949, Shannon proved the perfect secrecy of the Vernam cryptographic system (One-Time Pad or OTP). It has generally been believed that the perfectly random and uncompressible O...
97
Voted
IJISEC
2007
15 years 5 days ago
2007
Abstract. We examine the popular proof models for group key establishment of Bresson et al. [BCPQ01,BCP01] and point out missing security properties addressing malicious protocol p...
113
Voted
TCS
2008
15 years 5 days ago
2008
A large class of q-distributions is defined on the stochastic model of Bernoulli trials in which the probability of success (=advancing to the next level) depends geometrically on...
133
Voted
FSE
2009
Springer
16 years 24 days ago
2009
Springer
Enhanced Target Collision Resistance (eTCR) property for a hash function was put forth by Halevi and Krawczyk in Crypto 2006, in conjunction with the randomized hashing mode that i...
JIS
2008
14 years 11 months ago
2008
This paper deals with one aspect of the index quality of search engines: index freshness. The purpose is to analyse the update strategies of the major Web search engines Google, Y...