IET Information Security

Issue 4 • Dec. 2012

Filter Results

Displaying Results 1 - 12 of 12
  • Security analysis of Kulseng et al.'s mutual authentication protocol for RFID systems

    Publication Year: 2012, Page(s):239 - 248
    IEEE is not the copyright holder of this material | Click to expandAbstract |PDF file iconPDF (262 KB)

    The authors describe three attacks against an efficient lightweight mutual authentication protocol recently proposed by Kulseng et al. These attacks are unique as they are closely related and must be performed in order, one after another. They break the untraceability, confidentiality and mutual authentication properties of the protocol, and show, for the first time, that breaking the priva... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Critical survey of existing publicly verifiable secret sharing schemes

    Publication Year: 2012, Page(s):249 - 257
    Cited by:  Papers (2)
    IEEE is not the copyright holder of this material | Click to expandAbstract |PDF file iconPDF (170 KB)

    The existing publicly verifiable secret sharing (PVSS) schemes are surveyed in a critical way in this study. The authors show that they are not so reliable and efficient as they claim or appear. They are limited by assumptions and conditions, vulnerable in important target properties and need more cost in practice. In this study, their actual performance and cost are fairly measured and their draw... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Deniable message transmission authenticator based on weak signature schemes

    Publication Year: 2012, Page(s):258 - 263
    IEEE is not the copyright holder of this material | Click to expandAbstract |PDF file iconPDF (169 KB)

    This study shows how to use signature schemes for deniable authentication. Deniable authentication means that a message receiver R, although receiving a message m from a sender S, cannot convince a third party that the sender S has sent R the message m. If signature schemes are secure against selective forgery, the authors can construct a full deniable aut... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Analytical framework for measuring network security using exploit dependency graph

    Publication Year: 2012, Page(s):264 - 270
    Cited by:  Papers (1)
    IEEE is not the copyright holder of this material | Click to expandAbstract |PDF file iconPDF (278 KB)

    Attack graph is a popular tool for modelling multi-staged, correlated attacks on computer networks. Attack graphs have been widely used for measuring network security risks. Majority of the works on attack graph use host-based or state-based approaches. These attack graph models are either too restrictive or too resource consuming. Also, a significant portion of these works have used `probability ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Dynamic and secure key management model for hierarchical heterogeneous sensor networks

    Publication Year: 2012, Page(s):271 - 280
    Cited by:  Papers (8)
    IEEE is not the copyright holder of this material | Click to expandAbstract |PDF file iconPDF (489 KB)

    Many applications that utilise wireless sensor networks (WSNs) require essentially secure communication. However, WSNs suffer from some inherent weaknesses because of restricted communication and hardware capabilities. Key management is the crucial important building block for all security goals in WSNs. Most existing researches tried to assign keys assuming homogeneous network architecture. Recen... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Improved one-to-many authentication scheme for access control in pay-TV systems

    Publication Year: 2012, Page(s):281 - 290
    Cited by:  Papers (1)
    IEEE is not the copyright holder of this material | Click to expandAbstract |PDF file iconPDF (231 KB)

    Mutual authentication is important in a mobile pay-TV system. Traditional authentication schemes make use of one-to-one delivery, that is, one authentication message per request is delivered from a head-end system to subscriber. This delivery occupies too much bandwidth and therefore is inefficient and costly. One-to-many authentication scheme for access control in mobile pay-TV systems was propos... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Mobile encryption for laptop data protection (MELP)

    Publication Year: 2012, Page(s):291 - 298
    Cited by:  Papers (1)
    IEEE is not the copyright holder of this material | Click to expandAbstract |PDF file iconPDF (433 KB)

    Based on the advances in laptop technologies and the mobility characteristics, laptops have become a vital device used at various places. Usually, numerous sensitive files such as credit card numbers and Web cookies are stored on laptops for convenient usage. However, if a laptop is stolen, the data stored on it is easily leaked; which may cause serious consequences. Encrypting files by encryption... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Visual secret sharing for general access structures by random grids

    Publication Year: 2012, Page(s):299 - 309
    Cited by:  Papers (6)
    IEEE is not the copyright holder of this material | Click to expandAbstract |PDF file iconPDF (851 KB)

    Visual secret sharing (VSS) is a way to protect a secret image among a group of participants by using the notions of perfect ciphers and secret sharing. However, each share generated by conventional VSS is m times as big as the original secret image, where m is called pixel expansion. Random grid (RG) is an alternative approach to implement VSS without pixel expansion. However, repor... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Low-complexity Gaussian normal basis multiplier over GF(2m)

    Publication Year: 2012, Page(s):310 - 317
    Cited by:  Papers (4)
    IEEE is not the copyright holder of this material | Click to expandAbstract |PDF file iconPDF (390 KB)

    The elliptic curve cryptosystem (ECC) is very attractive for the use in portable devices because of the small key size. The finite field multiplication over GF(2m) is the most important arithmetic for performing the ECC. Portable devices usually have restricted computation power and memory resources. This work will present a simple method for designing a Gaussian normal basis (GNB) multipli... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Palindromic-like representation for Gaussian normal basis multiplier over GF(2m) with odd type t

    Publication Year: 2012, Page(s):318 - 323
    Cited by:  Papers (2)
    IEEE is not the copyright holder of this material | Click to expandAbstract |PDF file iconPDF (236 KB)

    Palindromic representation is generally used to reduce space and time complexities in Gaussian normal basis (GNB) multiplier with even type t. However, palindromic representation is inapplicable for a GNB multiplier with odd type t (t ≥ 2). This study therefore develops a palindromic-like representation for a GNB multiplier with odd type t. The proposed systolic GNB multiplier with odd type... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Low-complexity design of bit-parallel dual-basis multiplier over GF(2m)

    Publication Year: 2012, Page(s):324 - 328
    Cited by:  Papers (2)
    IEEE is not the copyright holder of this material | Click to expandAbstract |PDF file iconPDF (317 KB)

    Recently, information security is heavily dependent on cryptosystems such as Rivest-Shamir-Adleman algorithm (RSA algorithm) and elliptic curve cryptosystem (ECC). RSA can provide higher security level than ECC, but it is not suitable for the resource-constrained devices such as smart phones or embedded system. Thus, ECC is attracted on application in resource-constrained devices because it can ac... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On hardware-oriented message authentication

    Publication Year: 2012, Page(s):329 - 336
    IEEE is not the copyright holder of this material | Click to expandAbstract |PDF file iconPDF (228 KB)

    The authors consider hardware-oriented message authentication, more specifically universal hash functions. The authors propose a new type of constructions that appear promising. These constructions are based on the framework of universal hash functions, Toeplitz matrices and ε-biased sample spaces. Some new theoretical results in this area are derived. The new constructions come at the pric... View full abstract»

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

Aims & Scope

IET Information Security publishes original research papers in the following areas of information security and cryptography.

Full Aims & Scope

Meet Our Editors

Publisher
IET Research Journals
iet_ifs@theiet.org