Open AccessPerformance of the verification for binary memoryless channels
Author(s) -
Balakirsky Vladimir B.,
Vinck A. J. Han
Publication year - 2011
Publication title -
security and communication networks
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.446
H-Index - 43
eISSN - 1939-0122
pISSN - 1939-0114
DOI - 10.1002/sec.263
Subject(s) - computer science , channel (broadcasting) , binary number , bernoulli's principle , scheme (mathematics) , metric (unit) , algorithm , transmission (telecommunications) , binary search algorithm , binary decision diagram , binary symmetric channel , theoretical computer science , mathematics , telecommunications , channel capacity , arithmetic , search algorithm , mathematical analysis , operations management , engineering , economics , aerospace engineering
We consider the verification problem when the verifier receives a pair of binary vectors ( a , b ) and makes the acceptance or the rejection decision. The acceptance decision has to be made if the vector b is the result of transmission of the vector a over a known memoryless channel. An attacker substitutes a vector b generated by a stationary Bernoulli source. We design the verification algorithm with the metric depending on the weight of the vector a . The attacker knows the weight of the vector a and the verification algorithm, but we can restrict his possibilities in such a way that the best strategy becomes the flipping of a fair coin. The performance of the algorithm is essentially better than the performance of the scheme, which is based on the maximum likelihood decision for the known channel. We also show that the algorithm is a special case of a general verification scheme for an arbitrary memoryless channel. Copyright © 2010 John Wiley & Sons, Ltd.