Online ISSN
1751-8717
Print ISSN
1751-8709
IET Information Security
Volume 5, Issue 1, March 2011
Volumes & issues:
Volume 5, Issue 1
March 2011
-
- Author(s): S.M. Saad
- Source: IET Information Security, Volume 5, Issue 1, p. 1 –9
- DOI: 10.1049/iet-ifs.2010.0100
- Type: Article
- + Show details - Hide details
-
p.
1
–9
(9)
The identification of a person on the basis of scanned images of handwriting is a useful biometric technique with application in forensic document analysis. This study describes the design and implementation of a system that identifies the writer using offline Arabic handwritten text. The key point is using multiple features to capture different aspects of handwriting individuality and to operate at different level of analysis with the aim of improving identification performance. Fuzzy logic (FL) and genetic algorithm (GA) have been used in a complementary fashion to fuse (combine) extracted features as well as to deal with the ambiguity of human judgment of handwritings similarity. GA is used to help construct and tune fuzzy membership functions that are necessary to categorise the strength of existence of handwritings features similarity through FL, with the purpose of yielding high correct identification rates. The final results indicate and clarify that the proposed system achieves an excellent test accuracy of identification rated up to 96% for Arabic text. - Author(s): F. Huang ; W. Luo ; J. Huang
- Source: IET Information Security, Volume 5, Issue 1, p. 10 –18
- DOI: 10.1049/iet-ifs.2009.0080
- Type: Article
- + Show details - Hide details
-
p.
10
–18
(9)
Recently, a new high-performance JPEG steganography with a complementary embedding strategy (JPEG-CES) was presented. It can disable many specific steganalysers such as the Chi-square family and S family detectors, which have been used to attack J-Steg, JPHide, F5 and OutGuess successfully. In this work, a study on the security performance of JPEG-CES is reported. Our theoretical analysis demonstrates that in this algorithm, the number of the different quantised discrete cosine transform (qDCT) coefficients and the symmetry of the qDCT coefficient histogram both will be disturbed when the secret message is embedded. Moreover, the intrinsic sign and magnitude dependencies that existed in intra-block and inter-block qDCT coefficients will be disturbed too. Thus it may be detected by some modern universal steganalysers which can catch these disturbances. In this work, the authors have proposed two new steganalytic approaches. Through exploring the distortions that have been introduced into the qDCT coefficient histogram and the dependencies existed in the intra-block and inter-block sense, respectively, these two alternative steganalysers can detect JPEG-CES effectively. In addition, via merging the features of these two steganalysers, a more reliable classifier can be obtained. - Author(s): N. Chen ; H.-D. Xiao ; W. Wan
- Source: IET Information Security, Volume 5, Issue 1, p. 19 –25
- DOI: 10.1049/iet-ifs.2010.0097
- Type: Article
- + Show details - Hide details
-
p.
19
–25
(7)
Robust audio hash function defines a feature vector that characterises the audio signal, independent of content preserving manipulations, such as MP3 compression, amplitude boosting/cutting, low-pass filtering etc. In this study, the authors propose a new audio hash function based on the non-negative matrix factorisation (NMF) of mel-frequency cepstral coefficients (MFCCs). Their work is motivated by the fact that the orthogonality constraints in the singular value decomposition (SVD) make the low-rank singular vectors of audio with distinct local difference be the same. Thus, the available hash function based on SVD of MFCCs cannot achieve satisfactory discrimination. Although the non-negative constraints of NMF result in the basis that captures the local feature of the audio, thereby significantly reducing misclassification. Experimental results over large audio databases demonstrate that the proposed scheme achieves better performances, in terms of perceptual robustness and discrimination, than the available SVD-MFCCs-based hash function. - Author(s): Y. Huang ; S. Tang ; C. Bao ; Y.J. Yip
- Source: IET Information Security, Volume 5, Issue 1, p. 26 –32
- DOI: 10.1049/iet-ifs.2010.0032
- Type: Article
- + Show details - Hide details
-
p.
26
–32
(7)
A network covert channel is a passage along which information leaks across the network in violation of security policy in a completely undetectable manner. This study reveals our findings in analysing the principle of G.723.1 codec that there are ‘unused’ bits in G.723.1 encoded audio frames, which can be used to embed secret messages. A novel steganalysis method that employs the second detection and regression analysis is suggested in this study. The proposed method can not only detect the hidden message embedded in a compressed voice over Internet protocol (VoIP) speech, but also accurately estimate the embedded message length. The method is based on the second statistics, that is, doing a second steganography (embedding information in a sampled speech at an embedding rate followed by embedding another information at a different level of data embedding) in order to estimate the hidden message length. Experimental results have proven the effectiveness of the steganalysis method for detecting the covert channel in the compressed VoIP speech. - Author(s): T.-P. Chuang ; C.W. Chiou ; S.-S. Lin
- Source: IET Information Security, Volume 5, Issue 1, p. 33 –42
- DOI: 10.1049/iet-ifs.2010.0254
- Type: Article
- + Show details - Hide details
-
p.
33
–42
(10)
This work develops a novel self-checking alternating logic (SCAL) bit-parallel Gaussian normal basis (GNB) multiplier with type-t over GF(2m). The proposed GNB multiplier is with both concurrent error-detection and off-line testing capabilities. The concurrent error-detection capability can give countermeasure to fault-based cryptanalysis. The off-line testing capability supports the design-for-test property. The proposed SCAL GNB multiplier can detect both permanent and transient faults. The proposed SCAL GNB is the first normal basis multiplier to have both on-line error-detection and off-line testing capabilities. - Author(s): T.-C. Hsu ; W.-S. Hsieh ; J.Y. Chiang ; T.-S. Su
- Source: IET Information Security, Volume 5, Issue 1, p. 43 –50
- DOI: 10.1049/iet-ifs.2008.0055
- Type: Article
- + Show details - Hide details
-
p.
43
–50
(8)
Most watermark-removal methods treat watermarks as noise and apply denoising approaches to remove them. However, denoising methods remove not only this watermark energy, but also some of the energy of the original image. A trade-off therefore exists: if not enough of the watermark is removed, then it will still be detected by probabilistic methods, but if too much is removed, the image quality will be noticeably poor. To solve this problem, the relationships among the energies of the original image, the watermark and the watermarked image are initially determined using stochastic models. Then the energy of the watermark is estimated using just-noticeable-distortion (JND). Finally, the watermark energy is removed from the watermarked image using the energy distribution of its Eigen-images. The experimental results show that the proposed approach yields a mean peak signal-to-noise ratio (PSNR) of the predicted images that is 2.2 dB higher than that obtained using the adaptive Wiener filter, and a mean normalised correlation (NC) value of the extracted watermarks that is 0.27 lower than that obtained using the adaptive Wiener filter. In removing watermark energy from 100 randomly selected watermarked images in which watermarks were embedded using the ‘broken arrows (BA)’ algorithm proposed for the second breaking our watermarking system (BOWS-2) contest, the mean PSNR of 100 predicted images is 24.1 dB and the proposed approach successfully removed watermarks from 90 of these images. This result exceeds the minimum requirement of PSNR 20 dB for the BOWS-2 contest. Clearly, the proposed approach is a very effective watermark-removal approach for removing watermarks. - Author(s): F. Liu ; C. Wu ; X. Lin
- Source: IET Information Security, Volume 5, Issue 1, p. 51 –59
- DOI: 10.1049/iet-ifs.2008.0064
- Type: Article
- + Show details - Hide details
-
p.
51
–59
(9)
Most cheating immune visual cryptography schemes (CIVCS) are based on a traditional visual cryptography scheme (VCS) and are designed to avoid cheating when the secret image of the original VCS is to be recovered. However, all the known CIVCS have some drawbacks. Most usual drawbacks include the following: the scheme needs an online trusted authority, or it requires additional shares for the purpose of verification, or it has to sacrifice the properties by means of pixel expansion and contrast reduction of the original VCS or it can only be based on such VCS with specific access structures. In this study, the authors propose a new CIVCS that can be based on any VCS, including those with a general access structure, and show that their CIVCS can avoid all the above drawbacks. Moreover, their CIVCS does not care about whether the underlying operation is OR or XOR. - Author(s): M. López ; J. Daugman ; E. Cantó
- Source: IET Information Security, Volume 5, Issue 1, p. 60 –68
- DOI: 10.1049/iet-ifs.2009.0267
- Type: Article
- + Show details - Hide details
-
p.
60
–68
(9)
This study describes the implementation of an iris recognition algorithm based on hardware–software co-design. The system architecture consists of a general-purpose 32-bit microprocessor and several slave coprocessors that accelerate the most intensive calculations. The whole iris recognition algorithm has been implemented on a low-cost Spartan 3 FPGA, achieving significant reduction in execution time when compared with a conventional software-based application. Experimental results show that with a clock speed of 40 MHz, an IrisCode is obtained in <523 ms from an image of 640×480 pixels, which is just 20% of the total time needed by a software solution running on the same microprocessor embedded in the architecture. - Author(s): Y.-H. Chou ; C.-Y. Chen ; H.-C. Chao ; J.H. Park ; R.-K. Fan
- Source: IET Information Security, Volume 5, Issue 1, p. 69 –79
- DOI: 10.1049/iet-ifs.2009.0143
- Type: Article
- + Show details - Hide details
-
p.
69
–79
(11)
Traditionally, the authors could establish secure computation protocols using variants of public key cryptology whose security is based on hard mathematics problems. However, classical protocols will become insecure owing to the emergence of quantum algorithms like Shors. In this paper, the authors demonstrate that nanoscale phenomenon can be applied not only in device level but also in high layer applications, such as secure computation. The authors study the possibility of performing secure computation by building non-local machines based on quantum entanglement and non-locality, which are phenomena available only at the nanometre scale. Comparing with classical secure computation algorithms, the security of this protocol is based on physical laws, instead of any unproven mathematic conjecture.
Application of fuzzy logic and genetic algorithm in biometric text-independent writer identification
Steganalysis of JPEG steganography with complementary embedding strategy
Audio hash function based on non-negative matrix factorisation of mel-frequency cepstral coefficients
Steganalysis of compressed speech to detect covert voice over Internet protocol channels
Self-checking alternating logic bit-parallel Gaussian normal basis multiplier with type-t
New watermark-removal method based on Eigen-image energy
Cheating immune visual cryptography scheme
Hardware–software co-design of an iris recognition algorithm
Quantum entanglement and non-locality based secure computation for future communication
Most viewed content for this Journal
Article
content/journals/iet-ifs
Journal
5
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
