Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

31

CRYPTO
1991
Springer

favoriteEmaildiscussreport

105views Cryptology» more CRYPTO 1991»

Universal Hashing and Authentication Codes

14 years 2 months ago

Universal Hashing and Authentication Codes

Download www1.spms.ntu.edu.sg

In this paper, we study the application of universal hashingto the construction of unconditionally secure authentication codes without secrecy. This idea is most useful when the number of authenticators is exponentially small compared to the number of possible source states (plaintext messages). We formally define some new classes of hash functions and then prove some new bounds and give some general constructions for these classes of hash functions. Then we discuss the implications to authentication codes.

Douglas R. Stinson

Real-time Traffic

Authentication Codes | CRYPTO 1991 | Cryptology | Hash Functions | Secure Authentication Codes |

claim paper

Related Content

» Bucket Hashing and its Application to Fast Message Authentication

» Fast Message Authentication Using Efficient Polynomial Evaluation

» Divide and concatenate a scalable hardware architecture for universal MAC

» New Results on NMACHMAC when Instantiated with Popular Hash Functions

» An Optimal Noninteractive Message Authentication Protocol

» On Authenticated Encryption Using Stream Ciphers Supporting an Initialisation Vector

» Cryptographic Primitives for Information Authentication State of the Art

» Almost Independent and Weakly Biased Arrays Efficient Constructions and Cryptologic Applic...

» A fast realtime memory authentication protocol

Post Info
More Details (n/a)

Added	27 Aug 2010
Updated	27 Aug 2010
Type	Conference
Year	1991
Where	CRYPTO
Authors	Douglas R. Stinson

Comments (0)