Sciweavers

20 search results - page 4 / 4
» The Breaking of the AR Hash Function
Sort
View
APN
2007
Springer
14 years 1 months ago
Improving Static Variable Orders Via Invariants
Abstract. Choosing a good variable order is crucial for making symbolic state-space generation algorithms truly efficient. One such algorithm is the MDD-based Saturation algorithm ...
Gianfranco Ciardo, Gerald Lüttgen, Andy Jinqi...
CRYPTO
2005
Springer
144views Cryptology» more  CRYPTO 2005»
14 years 1 months ago
Analysis of Random Oracle Instantiation Scenarios for OAEP and Other Practical Schemes
We investigate several previously suggested scenarios of instantiating random oracles (ROs) with “realizable” primitives in cryptographic schemes. As candidates for such “in...
Alexandra Boldyreva, Marc Fischlin
COCO
2010
Springer
168views Algorithms» more  COCO 2010»
13 years 8 months ago
A New Sampling Protocol and Applications to Basing Cryptographic Primitives on the Hardness of NP
We investigate the question of what languages can be decided efficiently with the help of a recursive collisionfinding oracle. Such an oracle can be used to break collisionresistan...
Iftach Haitner, Mohammad Mahmoody, David Xiao
CRYPTO
1999
Springer
159views Cryptology» more  CRYPTO 1999»
13 years 12 months ago
UMAC: Fast and Secure Message Authentication
We describe a message authentication algorithm, UMAC, which can authenticate messages (in software, on contemporary machines) roughly an order of magnitude faster than current prac...
John Black, Shai Halevi, Hugo Krawczyk, Ted Krovet...
CN
2007
144views more  CN 2007»
13 years 7 months ago
SPP: An anti-phishing single password protocol
Most users have multiple accounts on the Internet where each account is protected by a password. To avoid the headache in remembering and managing a long list of different and un...
Mohamed G. Gouda, Alex X. Liu, Lok M. Leung, Moham...