Sciweavers

90 search results - page 2 / 18
» The Poly1305-AES Message-Authentication Code
Sort
View
SCN
2010
Springer
143views Communications» more  SCN 2010»
13 years 5 months ago
History-Free Aggregate Message Authentication Codes
Aggregate message authentication codes, as introduced by Katz and Lindell (CT-RSA 2008), combine several MACs into a single value, which has roughly the same size as an ordinary MA...
Oliver Eikemeier, Marc Fischlin, Jens-Fabian G&oum...
CTRSA
2006
Springer
88views Cryptology» more  CTRSA 2006»
13 years 11 months ago
On the (Im)possibility of Blind Message Authentication Codes
Michel Abdalla, Chanathip Namprempre, Gregory Neve...
JCSS
2000
54views more  JCSS 2000»
13 years 7 months ago
The Security of the Cipher Block Chaining Message Authentication Code
Mihir Bellare, Joe Kilian, Phillip Rogaway
FSE
1997
Springer
246views Cryptology» more  FSE 1997»
13 years 11 months ago
Fast Message Authentication Using Efficient Polynomial Evaluation
Abstract. Message authentication codes (MACs) using polynomial evaluation have the advantage of requiring a very short key even for very large messages. We describe a low complexit...
Valentine Afanassiev, Christian Gehrmann, Ben J. M...
CRYPTO
1995
Springer
140views Cryptology» more  CRYPTO 1995»
13 years 11 months ago
Bucket Hashing and its Application to Fast Message Authentication
We introduce a new technique for constructing a family of universal hash functions. At its center is a simple metaphor: to hash a string x, cast each of its words into a small numb...
Phillip Rogaway