524 search results - page 8 / 105 » On the Security of the DeKaRT Primitive |
CRYPTO
1999
Springer
14 years 2 months ago
1999
Springer
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...
CRYPTO
2000
Springer
14 years 2 months ago
2000
Springer
We put forward a new model for understanding the security of symmetric-key primitives, such as block ciphers. The model captures the fact that many such primitives often consist of...
ACISP
2009
Springer
14 years 2 months ago
2009
Springer
Abstract. We establish a framework for bounding the efficiency of cryptographic reductions in terms of their security transfer. While efficiency bounds for the reductions have been...
SP
2007
IEEE
14 years 4 months ago
2007
IEEE
CORR
2008
Springer
13 years 10 months ago
2008
Springer
We present a new technique for verifying correspondences in security protocols. In particular, correspondences can be used to formalize authentication. Our technique is fully auto...