By Topic

Information Forensics and Security, IEEE Transactions on

Issue 1  Part 2 • Date Feb. 2012

 This issue contains several parts.Go to:  Part 1 

Filter Results

Displaying Results 1 - 25 of 26
  • Table of contents

    Publication Year: 2012 , Page(s): C1 - C4
    Request Permissions | PDF file iconPDF (139 KB)  
    Freely Available from IEEE
  • IEEE Transactions on Information Forensics and Security publication information

    Publication Year: 2012 , Page(s): C2
    Request Permissions | PDF file iconPDF (37 KB)  
    Freely Available from IEEE
  • Secure Communication in Stochastic Wireless Networks—Part I: Connectivity

    Publication Year: 2012 , Page(s): 125 - 138
    Cited by:  Papers (36)
    Request Permissions | Click to expandAbstract | PDF file iconPDF (3062 KB) |  | HTML iconHTML  

    The ability to exchange secret information is critical to many commercial, governmental, and military networks. Information-theoretic security-widely accepted as the strictest notion of security-relies on channel coding techniques that exploit the inherent randomness of the propagation channels to strengthen the security of digital communications systems. Motivated by recent developments in the fi... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Secure Communication in Stochastic Wireless Networks—Part II: Maximum Rate and Collusion

    Publication Year: 2012 , Page(s): 139 - 147
    Cited by:  Papers (26)
    Request Permissions | Click to expandAbstract | PDF file iconPDF (2207 KB) |  | HTML iconHTML  

    In Part I of this paper, we introduced the intrinsically secure communications graph (iS-graph)-a random graph which describes the connections that can be established with strong secrecy over a large-scale network, in the presence of eavesdroppers. We focused on the local connectivity of the iS-graph, and proposed techniques to improve it. In this second part, we characterize the maximum secrecy r... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Security Embedding Codes

    Publication Year: 2012 , Page(s): 148 - 159
    Cited by:  Papers (4)
    Request Permissions | Click to expandAbstract | PDF file iconPDF (3099 KB) |  | HTML iconHTML  

    This paper considers the problem of simultaneously communicating two messages, a high-security message and a low-security message, to a legitimate receiver, referred to as the security embedding problem. An information-theoretic formulation of the problem is presented. A coding scheme that combines rate splitting, superposition coding, nested binning, and channel prefixing is considered and is sho... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On the Saddle-Point Solution and the Large-Coalition Asymptotics of Fingerprinting Games

    Publication Year: 2012 , Page(s): 160 - 175
    Cited by:  Papers (11)
    Request Permissions | Click to expandAbstract | PDF file iconPDF (4296 KB) |  | HTML iconHTML  

    We study a fingerprinting game in which the number of colluders and the collusion channel are unknown. The encoder embeds fingerprints into a host sequence and provides the decoder with the capability to trace back pirated copies to the colluders. Fingerprinting capacity has recently been derived as the limit value of a sequence of maximin games with mutual information as their payoff functions. H... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A Novel Data Embedding Method Using Adaptive Pixel Pair Matching

    Publication Year: 2012 , Page(s): 176 - 184
    Cited by:  Papers (9)
    Request Permissions | Click to expandAbstract | PDF file iconPDF (2654 KB) |  | HTML iconHTML  

    This paper proposes a new data-hiding method based on pixel pair matching (PPM). The basic idea of PPM is to use the values of pixel pair as a reference coordinate, and search a coordinate in the neighborhood set of this pixel pair according to a given message digit. The pixel pair is then replaced by the searched coordinate to conceal the digit. Exploiting modification direction (EMD) and diamond... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Performance Analysis of a Block-Neighborhood-Based Self-Recovery Fragile Watermarking Scheme

    Publication Year: 2012 , Page(s): 185 - 196
    Cited by:  Papers (5)
    Request Permissions | Click to expandAbstract | PDF file iconPDF (4152 KB) |  | HTML iconHTML  

    In this paper, we present the performance analysis of a self-recovery fragile watermarking scheme using block-neighbor- hood tamper characterization. This method uses a pseudorandom sequence to generate the nonlinear block-mapping and employs an optimized neighborhood characterization method to detect the tampering. Performance of the proposed method and its resistance to malicious attacks are ana... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A Probabilistic Model of (t,n) Visual Cryptography Scheme With Dynamic Group

    Publication Year: 2012 , Page(s): 197 - 207
    Cited by:  Papers (2)
    Request Permissions | Click to expandAbstract | PDF file iconPDF (4091 KB) |  | HTML iconHTML  

    The (t, n) visual cryptography (VC) is a secret sharing scheme where a secret image is encoded into n transparencies, and the stacking of any t out of n transparencies reveals the secret image. The stacking of t - 1 or fewer transparencies is unable to extract any information about the secret. We discuss the additions and deletions of users in a dynamic user group. To reduce the overhead of genera... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Reconstructing a Linear Scrambler With Improved Detection Capability and in the Presence of Noise

    Publication Year: 2012 , Page(s): 208 - 218
    Cited by:  Papers (3)
    Click to expandAbstract | PDF file iconPDF (2725 KB) |  | HTML iconHTML  

    In this paper, the problem of reconstruction of the feedback polynomial in a linear scrambler is studied. Our work contains two parts. In the first part, schemes to improve the performance of an existing reconstruction algorithm are proposed. Simulation results show that both the detection capability and speed of the existing algorithm are significantly improved by using our proposed schemes. In t... View full abstract»

    Open Access
  • An Extended Visual Cryptography Algorithm for General Access Structures

    Publication Year: 2012 , Page(s): 219 - 229
    Cited by:  Papers (10)
    Request Permissions | Click to expandAbstract | PDF file iconPDF (2966 KB) |  | HTML iconHTML  

    Conventional visual secret sharing schemes generate noise-like random pixels on shares to hide secret images. It suffers a management problem, because of which dealers cannot visually identify each share. This problem is solved by the extended visual cryptography scheme (EVCS), which adds a meaningful cover image in each share. However, the previous approaches involving the EVCS for general access... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Half-Iris Feature Extraction and Recognition Using a New Class of Biorthogonal Triplet Half-Band Filter Bank and Flexible k-out-of-n:A Postclassifier

    Publication Year: 2012 , Page(s): 230 - 240
    Cited by:  Papers (5)  |  Patents (1)
    Request Permissions | Click to expandAbstract | PDF file iconPDF (2836 KB) |  | HTML iconHTML  

    Abstract-This paper presents a shift, scale, and rotation-in- variant technique for iris feature-representation and fused postclassification at the decision-level to improve the accuracy and speed of the iris-recognition system. Most of the iris-recognition systems are still incapable for providing low false rejections due to a wide variety of artifacts and are computationally inefficient. In orde... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A Fast Parts-Based Approach to Speaker Verification Using Boosted Slice Classifiers

    Publication Year: 2012 , Page(s): 241 - 254
    Cited by:  Papers (3)
    Request Permissions | Click to expandAbstract | PDF file iconPDF (2455 KB) |  | HTML iconHTML  

    Speaker verification (SV) on portable devices like smartphones is gradually becoming popular. In this context, two issues need to be considered: 1) such devices have relatively limited computation resources, and 2) they are liable to be used everywhere, possibly in very noisy, uncontrolled environments. This work aims to address both these issues by proposing a computationally efficient yet robust... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Multibiometric Cryptosystems Based on Feature-Level Fusion

    Publication Year: 2012 , Page(s): 255 - 268
    Cited by:  Papers (17)
    Request Permissions | Click to expandAbstract | PDF file iconPDF (1952 KB) |  | HTML iconHTML  

    Multibiometric systems are being increasingly de- ployed in many large-scale biometric applications (e.g., FBI-IAFIS, UIDAI system in India) because they have several advantages such as lower error rates and larger population coverage compared to unibiometric systems. However, multibiometric systems require storage of multiple biometric templates (e.g., fingerprint, iris, and face) for each user, ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Biometric Template Protection Using Universal Background Models: An Application to Online Signature

    Publication Year: 2012 , Page(s): 269 - 282
    Cited by:  Papers (8)
    Request Permissions | Click to expandAbstract | PDF file iconPDF (2212 KB) |  | HTML iconHTML  

    Data security and privacy are crucial issues to be addressed for assuring a successful deployment of biometrics-based recognition systems in real life applications. In this paper, a template protection scheme exploiting the properties of universal background models, eigen-user spaces, and the fuzzy commitment cryptographic protocol is presented. A detailed discussion on the security and informatio... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Exposing Digital Forgeries in Ballistic Motion

    Publication Year: 2012 , Page(s): 283 - 296
    Cited by:  Papers (4)
    Request Permissions | Click to expandAbstract | PDF file iconPDF (3527 KB) |  | HTML iconHTML  

    We describe a geometric technique to detect physically implausible trajectories of objects in video sequences. This technique explicitly models the three-dimensional ballistic motion of objects in free-flight and the two-dimensional projection of the trajectory into the image plane of a static or moving camera. Deviations from this model provide evidence of manipulation. The technique assumes that... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Jamming-Resistant Collaborative Broadcast Using Uncoordinated Frequency Hopping

    Publication Year: 2012 , Page(s): 297 - 309
    Cited by:  Papers (9)
    Request Permissions | Click to expandAbstract | PDF file iconPDF (2494 KB) |  | HTML iconHTML  

    We propose a jamming-resistant collaborative broadcast scheme for wireless networks, which utilizes the Un coordinated Frequency Hopping (UFH) technique to counteract jamming without preshared keys, and exploits node cooperation to achieve higher communication efficiency and stronger jamming resistance. In this scheme, nodes that already obtain the broadcast message serve as relays to help forward... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Joint Relay and Jammer Selection for Secure Two-Way Relay Networks

    Publication Year: 2012 , Page(s): 310 - 320
    Cited by:  Papers (44)
    Request Permissions | Click to expandAbstract | PDF file iconPDF (2377 KB) |  | HTML iconHTML  

    In this paper, we investigate joint relay and jammer selection in two-way cooperative networks, consisting of two sources, a number of intermediate nodes, and one eavesdropper, with the constraints of physical-layer security. Specifically, the proposed algorithms select two or three intermediate nodes to enhance security against the malicious eavesdropper. The first selected node operates in the c... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Architecture Support for Dynamic Integrity Checking

    Publication Year: 2012 , Page(s): 321 - 332
    Request Permissions | Click to expandAbstract | PDF file iconPDF (1291 KB) |  | HTML iconHTML  

    A trusted platform module (TPM) enhances the security of general purpose computer systems by authenticating the platform at boot time. Security can often be compromised due to the presence of vulnerabilities in the trusted software that is executed on the system. Existing TPM architectures do not support runtime integrity checking and this allows attackers to exploit these vulnerabilities to modif... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A Robust Physical Unclonable Function With Enhanced Challenge-Response Set

    Publication Year: 2012 , Page(s): 333 - 345
    Cited by:  Papers (7)
    Request Permissions | Click to expandAbstract | PDF file iconPDF (4153 KB) |  | HTML iconHTML  

    A Physical Unclonable Function (PUF) is a promising solution to many security issues due its ability to generate a die unique identifier that can resist cloning attempts as well as physical tampering. However, the efficiency of a PUF depends on its implementation cost, its reliability, its resiliency to attacks, and the amount of entropy in it. PUF entropy is used to construct crypto graphic keys,... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Fast Matrix Embedding by Matrix Extending

    Publication Year: 2012 , Page(s): 346 - 350
    Request Permissions | Click to expandAbstract | PDF file iconPDF (625 KB) |  | HTML iconHTML  

    When designing steganographic schemes, matrix embedding is an efficient method for increasing the embedding efficiency that is de- fined as an average number of bits embedded via per change on the cover. Random linear code-based matrix embedding can achieve high embedding efficiency but cost much in computation. In this paper, we propose a method to increase the embedding speed of matrix embedding... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • IEEE Transactions on Information Forensics and Security Edics

    Publication Year: 2012 , Page(s): 351
    Request Permissions | PDF file iconPDF (21 KB)  
    Freely Available from IEEE
  • IEEE Transactions on Information Forensics and Security information for authors

    Publication Year: 2012 , Page(s): 352 - 353
    Request Permissions | PDF file iconPDF (518 KB)  
    Freely Available from IEEE
  • Leading the field since 1884 [advertisement]

    Publication Year: 2012 , Page(s): 354
    Request Permissions | PDF file iconPDF (223 KB)  
    Freely Available from IEEE
  • 2012 IEEE membership form

    Publication Year: 2012 , Page(s): 355 - 356
    Request Permissions | PDF file iconPDF (1368 KB)  
    Freely Available from IEEE

Aims & Scope

The IEEE Transactions on Information Forensics and Security covers the sciences, technologies, and applications relating to information forensics, information security, biometrics, surveillance and systems applications that incorporate these features.

Full Aims & Scope

Meet Our Editors

Editor-in-Chief
Mauro Barni
University of Siena, Italy