IET Information Security
Volume 9, Issue 5, September 2015
Volumes & issues:
Volume 9, Issue 5
September 2015
-
- Author(s): Fuzhi Zhang ; Shuangxia Sun ; Huawei Yi
- Source: IET Information Security, Volume 9, Issue 5, p. 257 –265
- DOI: 10.1049/iet-ifs.2014.0488
- Type: Article
- + Show details - Hide details
-
p.
257
–265
(9)
The existing collaborative recommendation algorithms based on matrix factorisation (MF) have poor robustness against shilling attacks. To address this problem, in this study the authors propose a robust collaborative recommendation algorithm based on kernel function and Welsch reweighted M-estimator. They first propose a median-based method to calculate user and item biases, which can reduce the influence of shilling attacks on user and item biases because median is insensitive to outliers. Then, they present a method of similarity computation based on kernel function, which can obtain the information of similar users by non-linear inner product operation. Finally, they combine the user and item biases based on median and the similarity based on kernel function with MF model, and introduce the Welsch reweighted M-estimator to realise the robust estimation of user feature matrix and item feature matrix. The experimental results on the MovieLens dataset show that the proposed algorithm outperforms the existing algorithms in terms of both recommendation accuracy and robustness, and the improvement of its robustness is not at the expense of recommendation accuracy.
- Author(s): Qingju Wang ; Zhiqiang Liu ; Deniz Toz ; Kerem Varici ; Dawu Gu
- Source: IET Information Security, Volume 9, Issue 5, p. 266 –276
- DOI: 10.1049/iet-ifs.2014.0380
- Type: Article
- + Show details - Hide details
-
p.
266
–276
(11)
In this study, the authors present the first related-key rectangle cryptanalysis of Rijndael-160/160 and Rijndael-192/192. The author's attack on Rijndael-160/160 covers eight rounds. The attack complexities are 2126.5 chosen plaintexts, 2129.28 8-round Rijndael-160/160 encryptions and 2132.82 bytes. Their attack on Rijndael-192/192 covers ten rounds. It requires 2179 chosen plaintexts, 2181.09 10-round Rijndael-192/192 encryptions and 2185.59 bytes memory. These are the currently best cryptanalytic results on Rijndael-160/160 and Rijndael-192/192 in terms of the number of attacked rounds. Furthermore, their results show that the slow diffusion in the key schedule of Rijndael makes it a target for this type of analysis.
- Author(s): Le Dong ; Yanling Wang ; Wenling Wu ; Jian Zou
- Source: IET Information Security, Volume 9, Issue 5, p. 277 –283
- DOI: 10.1049/iet-ifs.2014.0402
- Type: Article
- + Show details - Hide details
-
p.
277
–283
(7)
Generalised Feistel network (GFN) is a popular design for block ciphers and hash functions. The round function of the network often chooses a substitution–permutation (SP) transformation (consists of a subkey XOR, an S-boxes layer and a linear layer). In 2011, Bogdanov and Shibutani provided another choice to build round functions, namely the double SP-functions, which has two SP-layers in series. They showed that a 4-branch type-2 GFN with double SP-functions was stronger than the one with single SP-function in terms of the number of active S-boxes in a differential or linear cryptanalysis, but some subsequent results showed that the double SP-function is the weaker one in some known-key scenarios and hashing modes. In this study, the authors present a new result of the 4-branch type-2 GFN, whose round function is a single SP-function. They show some 15-round truncated differential distinguishers for this network with four usual parameters by utilising some rebound attack techniques. Based on these distinguishers, they construct some 15-round near-collision attacks on the Matyas–Meyer–Oseas and Miyaguchi–Preneel compression function modes in which the 4-branch type-2 GFN with the single SP-function is used.
- Author(s): Myong-Son Sin and Ryul Kim
- Source: IET Information Security, Volume 9, Issue 5, p. 284 –287
- DOI: 10.1049/iet-ifs.2014.0551
- Type: Article
- + Show details - Hide details
-
p.
284
–287
(4)
Silverberg (IEEE Trans. Inform. Theory, 2003, 49, (5), pp. 1312–1318) proposed a question on the equivalence of identifiable parent property and traceability property for Reed-Solomon code family. Earlier studies on Silverberg's problem motivate us to think of the stronger version of the question of equivalence of separation and traceability properties. Both, however, still remain open. In this study, the authors integrate all the previous works on this problem with an algebraic way, and present some new results. It is notable that the concept of subspace subcode of Reed-Solomon code, which was introduced in error-correcting code theory, provides an interesting prospect for the author's topic.
- Author(s): Zhuohua Liu and Chuankun Wu
- Source: IET Information Security, Volume 9, Issue 5, p. 288 –293
- DOI: 10.1049/iet-ifs.2014.0287
- Type: Article
- + Show details - Hide details
-
p.
288
–293
(6)
Privacy and efficiency are two important but seemingly contradictory objectives in radio-frequency identification (RFID) systems. On one hand, RFID aims to identify objects easily and quickly, on the other hand, users want to maintain the necessary privacy without being tracked down for where they are and what they are doing. Common RFID privacy-preserving authentication protocols can be classified into tree-based schemes and group-based schemes, and all these schemes do not meet the dual goals of efficiency and security at the same time. In 2013, Sakai et al. proposed a randomised skip lists-based authentication protocol (RSLA), and claimed that the RSLA can resist compromise attacks. In this study, the authors analyse the compromise attacks on RSLA and show that there is no obvious advantage with respect to the privacy of the RSLA compared with balanced tree-based schemes. Moreover, it is reasonable to claim that protocols based on skip lists are also vulnerable to compromise attacks.
- Author(s): Zahra Ahmadian ; Mahmoud Salmasizadeh ; Mohammad Reza Aref
- Source: IET Information Security, Volume 9, Issue 5, p. 294 –301
- DOI: 10.1049/iet-ifs.2014.0160
- Type: Article
- + Show details - Hide details
-
p.
294
–301
(8)
In this study, the authors evaluate the security of the lightweight block cipher KLEIN-64 using biclique cryptanalysis. They first point out some new weaknesses of the diffusion layer and key schedule of this algorithm. Then they exploit them to cryptanalyst the full round version of KLEIN-64 using an asymmetric biclique. The (worst case) computations and data complexity of this cryptanalysis are 262.84 and 239, respectively. A modified version of this cryptanalysis is also presented which is slightly faster at the expense of the data required.
Robust collaborative recommendation algorithm based on kernel function and Welsch reweighted M-estimator
Related-key rectangle cryptanalysis of Rijndael-160 and Rijndael-192
Known-key distinguishers on 15-round 4-branch type-2 generalised Feistel networks with single substitution–permutation functions and near-collision attacks on its hashing modes
Some new results on equivalency of collusion-secure properties for Reed-Solomon codes
Privacy of a randomised skip lists-based protocol
Biclique cryptanalysis of the full-round KLEIN block cipher
-
- Source: IET Information Security, Volume 9, Issue 5, p. 302 –303
- DOI: 10.1049/iet-ifs.2015.0151
- Type: Article
- + Show details - Hide details
-
p.
302
–303
(2)
Errata: ‘Related-key rectangle cryptanalysis of Rijndael-160 and Rijndael-192’
Most viewed content
Most cited content for this Journal
-
High accuracy android malware detection using ensemble learning
- Author(s): Suleiman Y. Yerima ; Sakir Sezer ; Igor Muttik
- Type: Article
-
Crypto-based algorithms for secured medical image transmission
- Author(s): Ali Al-Haj ; Gheith Abandah ; Noor Hussein
- Type: Article
-
Pseudorandom bit generator based on non-stationary logistic maps
- Author(s): Lingfeng Liu ; Suoxia Miao ; Hanping Hu ; Yashuang Deng
- Type: Article
-
Constructing important features from massive network traffic for lightweight intrusion detection
- Author(s): Wei Wang ; Yongzhong He ; Jiqiang Liu ; Sylvain Gombault
- Type: Article
-
Empirical analysis of Tor Hidden Services
- Author(s): Gareth Owen and Nick Savage
- Type: Article