Forthcoming articles


International Journal of Electronic Security and Digital Forensics


These articles have been peer-reviewed and accepted for publication in IJESDF, but are pending final changes, are not yet published and may not appear here in their final order of publication until they are assigned to issues.


Therefore, the content conforms to our standards but the presentation (e.g. typesetting and proof-reading) is not necessarily up to the Inderscience standard.


Additionally, titles, authors, abstracts and keywords may change before publication. Articles will not be published until the final proofs are validated by their authors.


Articles marked with this shopping trolley icon are available for purchase click on the icon to send an email request to purchase.


Articles marked with this Open Access icon are freely available and openly accessible to all without any restriction except use for commercial purposes.


Register for our alerting service, which notifies you by email when new issues of IJESDF are published online.


We also offer RSS feeds which provide timely updates of tables of contents, newly published articles and calls for papers.


International Journal of Electronic Security and Digital Forensics (9 papers in press)


Regular Issues


  • Efficient Scalar Product Protocol and Its Privacy-Preserving Application   Order a copy of this article
    by Youwen Zhu, Tsuyoshi Takagi 
    Abstract: Scalar product protocol aims at securely computing the dot productrnof two private vectors. As a basic tool, the protocol has been widely used inrnprivacy preserving distributed collaborative computations. In this paper, at thernexpense of disclosing partial sum of some private data, we propose a linearlyrnefficient Even-Dimension Scalar Product Protocol(EDSPP) without employingrnexpensive homomorphic crypto-system and any third party. The correctness andrnsecurity of EDSPP are confirmed by theoretical analysis. In comparison withrnsix most frequently-used schemes of scalar product protocol, the new scheme is the most efficient one, and it has good fairness.rnSimulated experiment results intuitively indicate the good performance of ourrnscheme. Consequently, in the situations where divulging very limited informationrnabout private data is acceptable, EDSPP is an extremely competitive candidaternsecure primitive to achieve practical schemes of privacy preserving distributedrncooperative computations.We also discuss the application of EDSPP, and presentrna secure distance comparison protocol based on EDSPP, which can be usedrnin many privacy-preserving computations, such as privacy-preserving k-nearestrnneighbors computation. Additionally, a hybrid scheme is put forward to securelyrncompute the scalar product of arbitrary-length private vectors.
    Keywords: privacy preserving; distributed computation; scalar product protocol;rnapplication
    by Imen Bouguerne, Yamina Tlili 
    Abstract: Steganography is the technique for hiding secret information in other data such as still, multimedia images, text, audio. The Steganalysis is the reverse technique in which detection of the secret is done in the stego image. The contourlet transform is a new two dimensional extension of the wavelet transform using multi-scale and directional filter banks. In This paper, we propose a new universal steganalysis method for JPEG images based upon hybrid transform features (cosinus discret and contourlet transform). Then the detection is usually cast as classification problem, we used kernel-based methods for the reducting of the computational cost of classification, by using linear algebra of a kernel Gram matrix of the support vectors (SVs) low computational cost. The pruning is based on the evaluation of the performance of the classifier which is formed by the reduced SVs in SVM. The feasibility of the evaluation criterion and the effectiveness of the proposed method are demonstrated.
    Keywords: Steganography; DCT; Contourlet Transform; SVM;Steganalysis.
  • Robust symmetric cryptography using plain-text variant session key   Order a copy of this article
    by Hari Narayan Khan, Ayan Chaudhuri, Souvik Kar, Parijat Roy, Atal Chaudhuri 
    Abstract: The secured data communication over internet is the most important concern nowadays. One of the common security processes is data encryption. The main goals of encryption are Data Confidentiality, Data Integrity, Authentication, and Non-Repudiation. Within the field of cryptography one can see two separate divisions: cryptographer and cryptanalysis or attacker. The cryptographer seeks methods to ensure the safety and security of conversations while the cryptanalyst tries to undo the formers work by breaking his system. So our main aim is to build an apparently attack resistant encryption model. Session key may be one solution where new encryption key is used in every session but that needs key exchange prior to every communication. Common solution is, the new key be the function of the previous key as well as the function of the previous plain-text. Here after every communication one needs to extract the next session key and to remember till the next communication. In this paper we have proposed a scheme where session key is the function of a secret key (agreed between a pair of sender and receiver once for ever at beginning) and the current plain-text. Thus in each session the encryption key is changing but there is no need to extract and remember the next session key. Moreover we have used double encryption technique and shown that our scheme is better against crypto-analysis than other existing schemes like DES or AES.
    Keywords: Symmetric cryptography; Session key; Advanced Encryption Standard (AES); Secure Hash Algorithm (SHA); Transpose Cipher.
  • Random Linear Network Coding with Probabilistic Polynomial-time Wiretap Adversary   Order a copy of this article
    by Zhiwen Hu, Li Zhu, Huaqing Mao 
    Abstract: Linear network coding can achieve the network capacity in the single source multicast case. For the single source multicast network with wiretap adversary, Cai and Yeung (Cai and Yeung, 2002) suggest an information-secure linear coding which tightly achieves the transmitting rate upper bound C-t, where C is the capacity of the network and t is the maximum number of edges with wiretap adversary. In this paper, we considers the cryptographic security for the messages in the random linear network coding setting. The indistinguishability under chosen-message-attack (or CMA-Security) from probabilistic polynomial-time (PPT) wiretap adversary is defined. With a pseudorandom generator against linear cryptanalysis, a peer-to-peer protocol is constructed for multicast network using random linear network coding. When the adversary wiretap less than C edges, the protocol is CMA-Secure and attains transmitting rate approaching the networks capacity C from below, asymptotically in the expanding ratio (i.e., length of output string/length of input string) of the pseudorandom generator. Compared with secret-key based scheme, no secret is needed by the receiver nodes, which means the key managing issues for dynamic networks would never come up.
    Keywords: network coding; confidentiality; computational bounded adversaries; pseudorandom generator; linear cryptanalysis
  • Certificate-based Encoding of Gate Level Description for Secure Transmission   Order a copy of this article
    by Debasis Mitra, Sandip Ghoshal, Subhasis Bhattacharjee 
    Abstract: Modern System-on-Chip (SoC) design cycle strongly depends on secure exchange of Intellectual Properties (IPs) between developers, integrators, foundries, etc. But, sharing of IPs between authorities involve high security risks in today
    Keywords: Intellectual property protection;secure transmission;encryption;VLSI design;gate level description
  • A Hybrid Evolutionary Algorithm for Feature & Ensemble Selection in Image Tampering Detection   Order a copy of this article
    by Jonathan Goh, Vrizlynn L. L. Thing 
    Abstract: The detection of the presence of tampered images is of significant importance in digital forensics. The problem with image tampering detection is the vast number of features that are currently available in the literature. It is very challenging to determine what are the best features to correctly characterize these images. This paper proposes a hybrid evolutionary framework to perform a quantitative study to evaluate all features in image tampering for the best feature set. Upon feature evaluation and selection, the classification mechanism must be optimized for good performance. Therefore, in addition to being able to determine an optimal set of features for a classifier, the hybrid framework is capable of determining the optimal multiple classifier ensemble while achieving the best classification performance in terms of low complexity and high accuracy for image tampering detection. Using a training data set of only 5% of the dataset, we were able to obtain accuracies of 90.18% on a CASIA 1 dataset with 1457 test images, 96.21% on a CASIA 2 dataset with 10200 and 94.64% on a combined CASIA 1 & 2 dataset with 11657 testing images. The experiment result shows that our image tampering detection can support large-scale digital image evidence authenticity verification with consistent good accuracy.
    Keywords: Image forgery; evolutionary algorithms; optimal feature selection;rnmultiple classifiers systems.
  • Hybrid Secure GSM Architecture using DNA Computing based Hyperelliptic Curve Cryptography   Order a copy of this article
    by Vijayakumar Perumal 
    Abstract: Wireless Mobile Communication has become more familiar and popular among other communication system for transmitting data to enable the user to communicate with other third parties at any place at any time. Due to third party interception, transmission of data, connection establishment, connection release, billing processes are in insecure environments. So many researchers had put their effort to develop an innovative authentication scheme for GSM network. The existing authentication scheme provides security with high communication and computational overhead using a symmetric key cryptography. The proposed scheme mainly focuses on providing security to Global System for Mobile communication system using Hyperelliptic Curve Cryptography and DNA computing technique for Mutual Authentication, Secret key generation and, data encryption and decryption algorithm. Finally a security analysis shows that authentication algorithm is more secure and efficient.
    Keywords: Deoxyribo Nucleic Acid, Hyperelliptic Curve Cryptography, Global System for Mobile communication, Mutual Authentication, Secret key generation, Encryption and Decryption, Communication and Computational Complexity

Special Issue on: "Issues and Development of Network Security Algorithms,"

  • Adaptation Of Frames For GOP Using NSEW Affine Translation For Effective Privacy Protection Mechanism   Order a copy of this article
    by D. Raveena Judie Dolly, Josemin Bala, J.Dinesh Peter 
    Abstract: The Group of Pictures (GOP) plays a very vital role in the privacy protection mechanism when data hiding is preferred through video transmission. GOP varies for every conventional video compression standards. The frame identification plays a key role in framing GOP. If frames are chosen adaptively using a matching criteria instead of precoded GOP the further processing for video compression could be effectively done. The quality of the reconstructed video after compression can be improved subjectively if GOP is selected properly and thus the embedded data can be retrieved without degradation. It is observed that B-frames in a GOP takes more computation time since it depends on the previous and next frame to be processed. So, NSEW affine translation technique is proposed to convert B-frames to either P-frames or I-frames depending on the matching criteria between frames. The result shows that the performance objective evaluation coincides with the subjective evaluation.
    Keywords: B-Frame; Frame identification; Group of Pictures; I-Frame; P-Frame; Video Compression; Data hiding
  • A Localized Clustering Scheme to Detect Attacks in Wireless Sensor Network   Order a copy of this article
    by P. P. Joby, P Sengottuvelan 
    Abstract: Wireless Sensor networks (WSN) is an embryonic communication technique in the universe to be engaged for precarious circumstances resembling battle arenas and viable applications such as construction, transportation surveillance, territory monitoring, clever homes etc. Currently wireless sensor network facing a foremost problem is result from security issues. There are many security methodologies were available for wireless sensor network. Generally classified as two levels; one is low level, further categorized into privacy, key establishment, trusted network, secrecy, authentication, secure routing and etc. Another one is High level, further categorized into secure group management, Intrusion detection, data integrity and etc. This research Focusing on the network availability, prior revisions offered to protect the network beside denial of service attacks with the use of traffic monitoring proxies on some nodes. But if the governor nodes are miserable, then its vulnerable to network. To overcome this, the research put front a mechanism called election method to elect the control nodes in a clusters. To simulate this methodology, Packet tracer tool is used.
    Keywords: Wireless Sensor Network, Election Method, Security Methodologies, Control proxies.