Paper 2006/175
Tight Bounds for Unconditional Authentication Protocols in the Manual Channel and Shared Key Models
Moni Naor, Gil Segev, and Adam Smith
Abstract
We address the message authentication problem in two seemingly
different communication models. In the first model, the sender and
receiver are connected by an insecure channel and by a
low-bandwidth auxiliary channel, that enables the sender to
``manually'' authenticate one short message to the receiver (for
example, by typing a short string or comparing two short strings).
We consider this model in a setting where no computational
assumptions are made, and prove that for any
Metadata
- Available format(s)
-
PDF PS
- Category
- Cryptographic protocols
- Publication info
- Published elsewhere. Preliminary version in CRYPTO '06. Full version in IEEE Transactions on Information Theory (special issue on Information-Theoretic Security).
- Keywords
- authenticationlower boundsone-way functionsunconditional security
- Contact author(s)
- gil segev @ weizmann ac il
- History
- 2008-07-03: last of 10 revisions
- 2006-05-22: received
- See all versions
- Short URL
- https://ia.cr/2006/175
- License
-
CC BY
BibTeX
@misc{cryptoeprint:2006/175, author = {Moni Naor and Gil Segev and Adam Smith}, title = {Tight Bounds for Unconditional Authentication Protocols in the Manual Channel and Shared Key Models}, howpublished = {Cryptology {ePrint} Archive, Paper 2006/175}, year = {2006}, url = {https://eprint.iacr.org/2006/175} }