Your browser does not support JavaScript!
http://iet.metastore.ingenta.com
1887
banner image
image of Volume 5, Issue 2
Online ISSN 1751-8717 Print ISSN 1751-8709

IET Information Security

Volume 5, Issue 2, June 2011

Volumes & issues:

Volume 5, Issue 2

June 2011

Show / Hide details

    • Cheating resistance and reversibility-oriented secret sharing mechanism
      • Author(s): P.-Y. Lin  and  C.-C. Chang
      • Source: IET Information Security, Volume 5, Issue 2, p. 81 –92
      • DOI:  10.1049/iet-ifs.2008.0043
      • Type: Article
      • + Show details - Hide details
      • p. 81 –92 (12)
        The secret-sharing mechanism has been widely applied to the e-commerce, communications and multimedia fields. With sufficient shares, the involved participants can cooperate to reveal secret data. Fraudulent participants, however, may provide a fake shadow in order to fool others. Consequently, cheating prevention has become a critical essential for secret sharing systems. In this article, the authors propose an efficient image secret sharing scheme that can resist cheating attacks. The simulator shows that the novel scheme is sensitive to cheating detection and cheater identification. In particular, the new method allows an authorised participant to reveal a lossless secret image and to further restore the valued host image without distortion. The reversibility of the secret sharing system provides practicability and widespread potential for preserving medical images, military images and artistic images.
        Add to favourites
        Export citations
      Balanced rotation symmetric boolean functions with maximum algebraic immunity
      • Author(s): S. Fu ; L. Qu ; C. Li ; B. Sun
      • Source: IET Information Security, Volume 5, Issue 2, p. 93 –99
      • DOI:  10.1049/iet-ifs.2010.0048
      • Type: Article
      • + Show details - Hide details
      • p. 93 –99 (7)
        Rotation symmetric Boolean functions (RSBFs) that are invariant under circular translation of indices have been used as components of different cryptosystems. In this paper, even-variable-balanced RSBFs with maximum algebraic immunity (AI) are investigated. At first, we give an original construction of 2m-variable-balanced RSBFs with maximum AI. Then we improve the construction to obtain more 2m-variable-balanced RSBFs with maximum AI, and these new RSBFs have higher non-linearity than all previously obtained RSBFs. Further, we generalise our construction of 2m-variable RSBFs to a new construction that can generate any even-variable RSBFs.
        Add to favourites
        Export citations
      One for all – all for one: unifying standard differential power analysis attacks
      • Author(s): S. Mangard ; E. Oswald ; F.-X. Standaert
      • Source: IET Information Security, Volume 5, Issue 2, p. 100 –110
      • DOI:  10.1049/iet-ifs.2010.0096
      • Type: Article
      • + Show details - Hide details
      • p. 100 –110 (11)
        In this study, the authors examine the relationship between and the efficiency of different approaches to standard (univariate) differential power analysis (DPA) attacks. The authors first show that, when fed with the same assumptions about the target device (i.e. with the same leakage model), the most popular approaches such as using a distance-of-means test, correlation analysis and Bayes attacks are essentially equivalent in this setting. Differences observed in practice are not because of differences in the statistical tests but because of statistical artefacts. Then, the authors establish a link between the correlation coefficient and the conditional entropy in side-channel attacks. In a first-order attack scenario, this relationship allows linking currently used metrics to evaluate standard DPA attacks (such as the number of power traces needed to perform a key recovery) with an information theoretic metric (the mutual information). The authors results show that in the practical scenario defined formally in this study, both measures are equally suitable to compare devices with respect to their susceptibility to DPA attacks. Together with observations regarding key and algorithm independence the authors consequently extend theoretical strategies for the sound evaluation of leaking devices towards the practice of side-channel attacks.
        Add to favourites
        Export citations
      Impossible differential cryptanalysis of SPN ciphers
      • Author(s): R. Li ; B. Sun ; C. Li
      • Source: IET Information Security, Volume 5, Issue 2, p. 111 –120
      • DOI:  10.1049/iet-ifs.2010.0174
      • Type: Article
      • + Show details - Hide details
      • p. 111 –120 (10)
        Impossible differential cryptanalysis is a very popular tool for analysing the security of modern block ciphers and the core of such attack is based on the existence of impossible differentials. Currently, most methods for finding impossible differentials are based on the miss-in-the-middle technique and they are very ad hoc. In this study, the authors concentrate on substitution–permutation network (SPN) ciphers whose diffusion layer is defined by a linear transformation P. Based on the theory of linear algebra, the authors propose several criteria on P and its inversion P-1 to characterise the existence of 3/4-round impossible differentials. The authors further discuss the possibility to extend these methods to analyse 5/6-round impossible differentials. Using these criteria, impossible differentials for reduced-round Rijndael are found that are consistent with the ones found before. New 4-round impossible differentials are discovered for block cipher ARIA. Many 4-round impossible differentials are firstly detected for a kind of SPN cipher that employs a 32×32 binary matrix proposed at ICISC 2006 as its diffusion layer. It is concluded that the linear transformation should be carefully designed in order to protect the cipher against impossible differential cryptanalysis.
        Add to favourites
        Export citations
      Robust visual cryptography-based watermarking scheme for multiple cover images and multiple owners
      • Author(s): F. Liu  and  C.-K. Wu
      • Source: IET Information Security, Volume 5, Issue 2, p. 121 –128
      • DOI:  10.1049/iet-ifs.2009.0183
      • Type: Article
      • + Show details - Hide details
      • p. 121 –128 (8)
        Watermarking is a technique to protect the copyright of digital media such as image, text, music and movie. In this study, a robust watermarking scheme for multiple cover images and multiple owners is proposed. The proposed scheme makes use of the visual cryptography (VC) technique, transform domain technique, chaos technique, noise reduction technique and error correcting code technique where the VC technique provides the capability to protect the copyright of multiple cover images for multiple owners, and the rest of the techniques are applied to enhance the robustness of the scheme.
        Add to favourites
        Export citations

Most viewed content for this Journal

Article
content/journals/iet-ifs
Journal
5
Loading

Most cited content for this Journal

Print this page
This is a required field
Please enter a valid email address