Modeling Robust Hash from Authentication Code Space View

摘要

In this paper, we model the robust hash authentication from the authentication code space view. In the authentication code space, the reception domain, authentication domain and near-x domain is defined, and the two error probability is derived. Based on the two error probabilities, the formalized definition of robustness and sensitivity is given and the inherent tradeoff between them is also analyzed in the paper. Finally, from the algorithm design viewpoint, we present an experimental plan used to tuning the authentication threshold.