Paper 2005/134
Broadcast Authentication With Hashed Random Preloaded Subsets
Mahalingam Ramkumar
Abstract
We introduce a novel cryptographic paradigm of broadcast authentication with ``preferred'' verifiers (BAP). With BAP, the message source explicitly targets a set of one or more verifiers. For an attacker, forging authentication data of a source, for purposes of fooling preferred verifiers may be substantially more difficult than fooling other (non-preferred) verifiers. We investigate broadcast authentication (BA) with \textit{hashed random preloaded subsets} (HARPS), which caters for such a distinction. HARPS, provides for efficient broadcast authentication, with and without preferred verifiers.
Metadata
- Available format(s)
-
PDF
- Category
- Secret-key cryptography
- Publication info
- Published elsewhere. Unknown where it was published
- Keywords
- Key predistributionHARPS
- Contact author(s)
- ramkumar @ cse msstate edu
- History
- 2005-05-10: received
- Short URL
- https://ia.cr/2005/134
- License
-
CC BY
BibTeX
@misc{cryptoeprint:2005/134,
author = {Mahalingam Ramkumar},
title = {Broadcast Authentication With Hashed Random Preloaded Subsets},
howpublished = {Cryptology {ePrint} Archive, Paper 2005/134},
year = {2005},
url = {https://eprint.iacr.org/2005/134}
}
