Results 1 - 10 of 104

On the Individuality of Fingerprints

by Sharath Pankanti, Salil Prabhakar, Anil K. Jain - IEEE Transactions on Pattern Analysis and Machine Intelligence , 2001
"... Fingerprint identification is based on two basic premises: (i) persistence: the basic characteristics of fingerprints do not change with time; and (ii) individuality: the fingerprint is unique to an individual. The validity of the first premise has been established by the anatomy and morphogenesis o ..."
Abstract - Cited by 157 (15 self) - Add to MetaCart
the problem of fingerprint individuality by quantifying the amount of information available in minutiae points to establish a correspondence between two fingerprint images. We derive an expression which estimates the probability of falsely associating minutiae-based representations from two arbitrary

A Virtual Honeypot Framework

by Niels Provos - In Proceedings of the 13th USENIX Security Symposium , 2004
"... A honeypot is a closely monitored network decoy serving several purposes: it can distract adversaries from more valuable machines on a network, can provide early warning about new attack and exploitation trends, or allow in-depth examination of adversaries during and after exploitation of a honeypot ..."
Abstract - Cited by 252 (5 self) - Add to MetaCart
level. The simulated computer systems appear to run on unallocated network addresses. To deceive network fingerprinting tools, Honeyd simulates the networking stack of different operating systems and can provide arbitrary routing topologies and services for an arbitrary number of virtual systems

PERFORMANCE OF RANDOM FINGERPRINTING CODES UNDER ARBITRARY NONLINEAR ATTACKS

by unknown authors
"... This paper analyzes the performance of arbitrary nonlinear collusion attacks on random fingerprinting codes. We derive the error exponent of the fingerprinting system, which determines the exponential decay of the error probability. A Gaussian ensemble and an expurgated Gaussian ensemble of codes ar ..."
Abstract - Add to MetaCart
This paper analyzes the performance of arbitrary nonlinear collusion attacks on random fingerprinting codes. We derive the error exponent of the fingerprinting system, which determines the exponential decay of the error probability. A Gaussian ensemble and an expurgated Gaussian ensemble of codes

Hiding Fingerprint Minutiae in Images

by Anil Jain, Umut Uludag - Proceedings of Third Workshop on Automatic Identification Advanced Technologies (AutoID), 2002 , 2002
"... We introduce an application of steganography and watermarking to enable secure biometric data (e.g., fingerprints) exchange. We hide fingerprint minutiae data in a host image, which can be a synthetic fingerprint image, a face image or an arbitrary image. It is this carrier image that is transferred ..."
Abstract - Cited by 8 (0 self) - Add to MetaCart
We introduce an application of steganography and watermarking to enable secure biometric data (e.g., fingerprints) exchange. We hide fingerprint minutiae data in a host image, which can be a synthetic fingerprint image, a face image or an arbitrary image. It is this carrier image

THE ECHO NEST MUSICAL FINGERPRINT

by Daniel P. W. Ellis, Brian Whitman, Tristan Jehan, Paul Lamere
"... We will discuss the methodology and accuracy of the Echo Nest Musical Fingerprint (ENMFP), an open-source fingerprint code generator and query server that works on music files. We define fingerprinting as matching an arbitrary audio signal to its underlying song in a 10 million song database. 1. MUS ..."
Abstract - Cited by 1 (1 self) - Add to MetaCart
We will discuss the methodology and accuracy of the Echo Nest Musical Fingerprint (ENMFP), an open-source fingerprint code generator and query server that works on music files. We define fingerprinting as matching an arbitrary audio signal to its underlying song in a 10 million song database. 1

Fingerprint Matching on Splash 2

by Nalini K. Ratha, Anil K. Jain, Diane T. Rover - Splash 2: FPGAs in a Custom Computing Machine, To be published. IEEE Computer , 1995
"... this memory. The PEs are connected through a crossbar that is programmed by X 0 . There is a 36-bit linear data path (SIMD Bus) running through all the PEs. The PEs can read data either from their respective memory or from any other PE. A broadcast path also exists by suitably programming X 0 . The ..."
Abstract - Cited by 5 (1 self) - Add to MetaCart
), the crossbar, and the host interface. The crossbar sets the communication paths for any arbitrary pattern of communication between PEs. In case the crossbar is used, X 0 needs to be programmed. The host interface handles data transfers in and out of the Splash 2 board. 4 Fingerprint Matching Algorithm

Fingerprinting capacity under the marking assumption

by N. Prasanth Anthapadmanabhan, Alexander Barg, Ilya Dumer - IEEE TRANS. ON INFORM. THEORY , 2008
"... We address the maximum attainable rate of fingerprinting codes under the marking assumption, studying lower and upper bounds on the value of the rate for various sizes of the attacker coalition. Lower bounds are obtained by considering typical coalitions, which represents a new idea in the area of ..."
Abstract - Cited by 22 (3 self) - Add to MetaCart
:199, respectively. For coalitions of an arbitrary fixed size t, we derive an upper bound (t ln 2) 01 on fingerprinting capacity in the binary case. Finally, for general alphabets, we establish upper bounds on the fingerprinting capacity involving only single-letter mutual information quantities.

Fingerprinting with Minimum Distance Decoding

by Shih-chun Lin, Mohammad Shahmohammadi, Hesham El Gamal , 710
"... This work adopts an information theoretic framework for the design of collusion-resistant coding/decoding schemes for digital fingerprinting. More specifically, the minimum distance decision rule is used to identify 1 out of t pirates. Achievable rates, under this detection rule, are characterized i ..."
Abstract - Cited by 1 (0 self) - Add to MetaCart
This work adopts an information theoretic framework for the design of collusion-resistant coding/decoding schemes for digital fingerprinting. More specifically, the minimum distance decision rule is used to identify 1 out of t pirates. Achievable rates, under this detection rule, are characterized

A Detection Theoretic Approach to Digital Fingerprinting with Focused Receivers Under Uniform Linear Averaging Gaussian Attacks

by Ozgur Dalkilic, Ersen Ekrem, S. Eray Varlik, M. Kivanc Mihcak
"... Abstract — We consider the digital fingerprinting problem where colluders apply uniform linear averaging followed by AWGN. For each user, the receiver computes the correlation between the attacked signal and that user’s fingerprint, and performs thresholding (focused detection). We model the fingerp ..."
Abstract - Cited by 1 (0 self) - Add to MetaCart
the fingerprinting problem as a multi-user communications problem and develop a detection theoretic framework. Assuming independent colluders, we derive generic exact bit error probability expressions, together with tight bounds, for arbitrary fingerprinting systems. Then, we specialize our results to orthogonal

Collusion of Fingerprints via the Gradient Attack

by unknown authors
"... Abstract — The difficulty of building an effective digital rights management system stems from the fact that traditional cryptographic primitives such as encryption or scrambling do not protect audio or video signals once they are played in plain-text. This fact, commonly referred to as “the analog ..."
Abstract - Add to MetaCart
resistance of spread-spectrum fingerprints with an arbitrary probability distribution of their source using a recently introduced collusion procedure, the gradient attack. I.
Results 1 - 10 of 104