277 search results - page 50 / 56 » The Whirlpool Secure Hash Function |
CRYPTO
2003
Springer
14 years 20 days ago
2003
Springer
We deal with computational assumptions needed in order to design secure cryptographic schemes. We suggest a classi£cation of such assumptions based on the complexity of falsifying...
FOCS
2007
IEEE
14 years 1 months ago
2007
IEEE
We show that every construction of one-time signature schemes from a random oracle achieves black-box security at most 2(1+o(1))q , where q is the total number of oracle queries a...
ISPA
2005
Springer
14 years 29 days ago
2005
Springer
Abstract. Wireless Sensor Networks are edging closer to widespread feasibility with recent research showing promising results in developing and adapting new mechanisms to suit thei...
CCS
2001
ACM
13 years 12 months ago
2001
ACM
hfulness of Abstract Protocol Analysis: Message Authentication∗ Joshua D. Guttman F. Javier Thayer Lenore D. Zuck December 18, 2002 Dolev and Yao initiated an approach to studyi...
TC
2010
13 years 2 months ago
2010
Tweakable enciphering schemes are length preserving block cipher modes of operation that provide a strong pseudo-random permutation. It has been suggested that these schemes can b...