18 search results - page 4 / 4 » Proofs of Security for the Unix Password Hashing Algorithm |
CCS
2008
ACM
13 years 7 months ago
2008
ACM
Hash tables are fundamental data structures that optimally answer membership queries. Suppose a client stores n elements in a hash table that is outsourced at a remote server so t...
VLDB
2007
ACM
14 years 5 months ago
2007
ACM
As computer systems are essential components of many critical commercial services, the need for secure online transactions is now becoming evident. The demand for such application...
PKC
2010
Springer
13 years 9 months ago
2010
Springer
Liskov proposed several weakened versions of the random oracle model, called weakened random oracle models (WROMs), to capture the vulnerability of ideal compression functions, wh...