ii Acknowledgements The authors would like to thank Michael Garris and Elham Tabassi for their many valuable suggestions that went into this report. Abstract Automated searches of fingerprints against a repository/database are important tools of the forensic community. Systems performing these searches are referred to as Automated Fingerprint Identification Systems (AFISs). The output of an AFI...

During recent years,RFID technology has a wide applications in many fields.Since singnal transmit by the radio frequency, it raises many security and privacy concerns. Ownership transfer of RFID tags is another requriement for RFID systems. During the life of tag, it may pass from manufacutrer to commercial agent, the ownership of tag need change correspondingly.Taking into account the natural ...

Fingerprint biometric security system identifies the unique property in human being and matching with template stored in database. Fingerprint details are generally defined in three levels i.e. Level 1 (Pattern), Level 2(Minutiae points) and Level 3 (pores and contour ridges). Level 3 features are barely used by automated fingerprint verification system. This research paper presents a Level 3 f...

The recent emergence of RFID tags capable of performing public key operations enables a number of new applications in commerce (e.g., RFID-enabled credit cards) and security (e.g., ePassports and access-control badges). While the use of public key cryptography in RFID tags mitigates many difficult security issues, certain important usability-related issues remain, particularly when RFID tags ar...

In this paper we propose a new family of very efficient hardware oriented block ciphers. The family contains six block ciphers divided into two flavors. All block ciphers share the 80-bit key size and security level. The first flavor, KATAN, is composed of three block ciphers, with 32, 48, or 64-bit block size. The second flavor, KTANTAN, contains the other three ciphers with the same block siz...

The application of sparse polynomials in cryptography has been studied recently. A public key encryption scheme EnRoot [4] and an identification scheme SPIFI [1] based on sparse polynomials were proposed. In this paper, we show that both of them are insecure. The designers of SPIFI proposed the modified SPIFI [2] after Schnorr pointed out some weakness in its initial version. Unfortunately, the...

We present two zero-knowledge protocols for the code-based McEliece public key encryption scheme in the standard model. Consider a prover who encrypted a plaintext m into a ciphertext c under the public key pk. The first protocol is a proof of plaintext knowledge (PPK), where the prover convinces a polynomially bounded verifier on a joint input (c, pk) that he knows m without actually revealing...

This paper presents techniques for multimedia annotation and their application to video summarization and translation. Our tool for annotation allows users to easily create annotation including voice transcripts, video scene descriptions, and visual/auditory object descriptions. The module for voice transcription is capable of multilingual spoken language identification and recognition. A video...