Abstract
AbstractWe 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.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
