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 0 < ∈
CITATION STYLE
Naor, M., Segev, G., & Smith, A. (2006). Tight bounds for unconditional authentication protocols in the manual channel and shared key models. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4117 LNCS, pp. 214–231). Springer Verlag. https://doi.org/10.1007/11818175_13
Mendeley helps you to discover research relevant for your work.