465 search results - page 25 / 93 » Programmable Hash Functions and Their Applications |
ESOP
2000
Springer
15 years 1 months ago
2000
Springer
Abstract. Type classes in Haskell allow programmers to define functions that can be used on a set of different types, with a potentially different implementation in each case. For ...
CARDIS
2008
Springer
14 years 12 months ago
2008
Springer
Digital signatures are one of the most important applications of microprocessor smart cards. The most widely used algorithms for digital signatures, RSA and ECDSA, depend on finite...
ICC
2007
IEEE
15 years 4 months ago
2007
IEEE
— The recent advances of distributed hash tables (DHTs) facilitate the development of highly scalable and robust network applications and services. However, with applications and...
CTRSA
2007
Springer
15 years 4 months ago
2007
Springer
Standard signature schemes are usually designed only to achieve weak unforgeability – i.e. preventing forgery of signatures on new messages not previously signed. However, most s...
IPL
2006
14 years 10 months ago
2006
The strongest well-known measure for the quality of a universal hash-function family H is its being -strongly universal, which measures, for randomly chosen h H, one's inabi...