paper-with-me

홈 › Papers

Alpha-wolves and Alpha-mammals: Exploring Dictionary Attacks on Iris Recognition Systems

2023-11-20 · Sudipta Banerjee, Anubhav Jain, Zehua Jiang, Nasir Memon, Julian Togelius, Arun Ross

A dictionary attack in a biometric system entails the use of a small number of strategically generated images or templates to successfully match with a large number of identities, thereby compromising security. We focus on dictionary attacks at the template level, specifically the IrisCodes used in iris recognition systems. We present an hitherto unknown vulnerability wherein we mix IrisCodes using simple bitwise operators to generate alpha-mixtures - alpha-wolves (combining a set of "wolf" samples) and alpha-mammals (combining a set of users selected via search optimization) that increase false matches. We evaluate this vulnerability using the IITD, CASIA-IrisV4-Thousand and Synthetic datasets, and observe that an alpha-wolf (from two wolves) can match upto 71 identities @FMR=0.001%, while an alpha-mammal (from two identities) can match upto 133 other identities @FMR=0.01% on the IITD dataset.

📄 PDF Abstract BibTeX arXiv:2403.12047

Code (0)

등록된 구현이 없습니다.

Tasks

Iris Recognition

Methods 이 논문이 사용한 방법론

SET Dynamic Sparse Training method where weight mask is updated randomly periodically
Focus 설명 없음

Similar Papers 제목 키워드 기반

c-trie++: A Dynamic Trie Tailored for Fast Prefix Searches

2019-04-16 · Kazuya Tsuruta, Dominik Köppl, Shunsuke Kanda, Yuto Nakashima 외

Given a dynamic set $K$ of $k$ strings of total length $n$ whose characters are drawn from an alphabet of size $\sigma$, a keyword dictionary is a data structure built on $K$ that provides locate, prefix search, and upda…

Sample Complexity of Bayesian Optimal Dictionary Learning

2013-01-26 · Ayaka Sakata, Yoshiyuki Kabashima

We consider a learning problem of identifying a dictionary matrix D (M times N dimension) from a sample set of M dimensional vectors Y = N^{-1/2} DX, where X is a sparse matrix (N times P dimension) in which the density …

Dictionary Learning

Sharp Convergence Rates for Matching Pursuit

2023-07-15 · Jason M. Klusowski, Jonathan W. Siegel

We study the fundamental limits of matching pursuit, or the pure greedy algorithm, for approximating a target function $ f $ by a linear combination $f_n$ of $n$ elements from a dictionary. When the target function is co…

Sparse Coding for Alpha Matting

2016-04-11 · Jubin Johnson, Ehsan Shahrian Varnousfaderani, Hisham Cholakkal, Deepu Rajan

Existing color sampling based alpha matting methods use the compositing equation to estimate alpha at a pixel from pairs of foreground (F) and background (B) samples. The quality of the matte depends on the selected (F,B…

Image MattingVideo Matting

Dictionary Learning Based on Sparse Distribution Tomography

2017-08-01 · ICML 2017 8 · Pedram Pad, Farnood Salehi, Elisa Celis, Patrick Thiran 외

We propose a new statistical dictionary learning algorithm for sparse signals that is based on an $\alpha$-stable innovation model. The parameters of the underlying model—that is, the atoms of the dictionary, the sp…

DenoisingDictionary LearningImage Denoising