Name
Abstract | ||
|---|---|---|
We consider a cryptographic scenario where some center broadcasts a random binary string to Alice, Bob and Eve over binary symmetric channels with bit error probabilities e A, e B and e E respectively. Alice and Bob share no secret key initially, and their goal is to generate, after public discussion, a common information-theoretically secure key facing an active eavesdropper Eve. Under the condition e AE and e BE, code authentication (CA) can be used as part of a public discussion protocol to solve this problem. This authentication exploits parts of substrings received by Alice and Bob from the broadcasting center as authenticators to messages transmitted in a public discussion. Unfortunately, it happens to be ineffective because it produces a key of small length. We propose a hybrid authentication (HA) that combines both keyless code authentication and key authentication based on an almost strong universal class of hash functions. We prove a theorem that allows estimation of the performance evaluation of hybrid authentication. The selection algorithm for the main HA parameters, given security and reliability thresholds, is presented in detail. |
Year | DOI | Venue |
|---|---|---|
2003 | 10.1007/s10207-002-0017-x | Int. J. Inf. Sec. |
Keywords | DocType | Volume |
Key sharing,Privacy amplification,Information-theoretically secure authentication,Hash functions | Journal | 1 |
Issue | Citations | PageRank |
4 | 2 | 0.41 |
References | Authors | |
5 | 2 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Valery I. Korzhik | 1 | 35 | 15.45 |
| Guillermo Morales-luna | 2 | 99 | 28.89 |