Sciweavers

4438 search results - page 50 / 888
» On the Distribution of Keys by Hashing
Sort
View
EUROPAR
2003
Springer
15 years 11 months ago
c-Perfect Hashing Schemes for Binary Trees, with Applications to Parallel Memories
Gennaro Cordasco, Alberto Negro, Vittorio Scarano,...
ACSAC
1999
IEEE
15 years 10 months ago
Fast Checking of Individual Certificate Revocation on Small Systems
High security network transactions require the checking of the revocation status of public key certificates. On mobile systems this may lead to excessive delays and unacceptable p...
Selwyn Russell
FSE
1997
Springer
246views Cryptology» more  FSE 1997»
15 years 9 months ago
Fast Message Authentication Using Efficient Polynomial Evaluation
Abstract. Message authentication codes (MACs) using polynomial evaluation have the advantage of requiring a very short key even for very large messages. We describe a low complexit...
Valentine Afanassiev, Christian Gehrmann, Ben J. M...
157
Voted
CSREASAM
2006
15 years 7 months ago
A New Approach For Source Authentication Of Multicast Data
Multicast Security is one of the important problems to solve for the successful deployment of group communication applications, and source authentication of multicast data is a key...
Jinxin He, Gaochao Xu, Zhiguo Zhou, Guannan Gong
143
Voted
FSE
2009
Springer
106views Cryptology» more  FSE 2009»
16 years 6 months ago
Practical Collisions for EnRUPT
The EnRUPT hash functions were proposed by O'Neil, Nohl and Henzen [5] as candidates for the SHA-3 competition, organised by NIST [4]. The proposal contains seven concrete has...
Sebastiaan Indesteege, Bart Preneel