The power of primes: security of authentication based on a universal hash-function family

DOI10.1515/JMC.2010.005zbMath1246.94018OpenAlexW1979133558MaRDI QIDQ3056339

No author found.

Publication date: 12 November 2010

Published in: Journal of Mathematical Cryptology (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1515/jmc.2010.005

zbMATH Keywords

cryptographyauthenticationfinite integer ringsuniversal hash-function families

Mathematics Subject Classification ID

Cryptography (94A60) Authentication, digital signatures and secret sharing (94A62)

Related Items (3)

Idempotents and Congruence $$\boldsymbol{ax}\boldsymbol{ \equiv b\pmod n}$$ ⋮ Restricted linear congruences ⋮ On an Almost-Universal Hash Function Family with Applications to Authentication and Secrecy Codes

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A construction for authentication/secrecy codes from certain combinatorial designs
• New bounds and constructions for authentication/secrecy codes with splitting
• Bounds and characterizations of authentication/secrecy schemes
• On the construction of authentication and secrecy codes
• Information-theoretic bounds for authentication codes and block designs
• Tight Bounds for Unconditional Authentication Protocols in the Manual Channel and Shared Key Models
• Lower bounds on the probability of deception in authentication with arbitration
• On the security of iterated message authentication codes
• Progress in Cryptology - INDOCRYPT 2004
• The security of the cipher block chaining message authentication code
• Combinatorial bounds on authentication codes with arbitration.

This page was built for publication: The power of primes: security of authentication based on a universal hash-function family