Abstract
A general hill-climbing attack algorithm based on Bayesian adaption is presented. The approach uses the scores provided by the matcher to adapt a global distribution computed from a development set of users, to the local specificities of the client being attacked. The proposed attack is evaluated on a competitive feature-based signature verification system over the 330 users of the MCYT database. The results show a very high efficiency of the hill-climbing algorithm, which successfully bypassed the system for over 95% of the attacks. © Springer-Verlag Berlin Heidelberg 2007.
Cite
CITATION STYLE
Galbally, J., Fierrez, J., & Ortega-Garcia, J. (2007). Bayesian hill-climbing attack and its application to signature verification. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4642 LNCS, pp. 386–395). Springer Verlag. https://doi.org/10.1007/978-3-540-74549-5_41
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
