<?xml version="1.0" encoding="UTF-8"?>
<rdf:RDF xmlns:rdf="http://www.w3.org/1999/02/22-rdf-syntax-ns#" xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/" xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:content="http://purl.org/rss/1.0/modules/content/" xmlns="http://purl.org/rss/1.0/">
<channel rdf:about="http://www.inderscience.com/current_issue_rss/index.php?journal=ijesdf">
<title>Most recent issue published online for the International Journal of Electronic Security and Digital Forensics.</title>
<description>International Journal of Electronic Security and Digital Forensics</description>
<link>http://www.inderscience.com/browse/index.php?journalID=217&amp;year=2012&amp;vol=4&amp;issue=1</link>
<dc:publisher>Inderscience Publishers Ltd</dc:publisher>
<dc:language>en-uk</dc:language>
<prism:publicationName>International Journal of Electronic Security and Digital Forensics</prism:publicationName>
<prism:issn>1751-911X</prism:issn>
<prism:eIssn>1751-9128</prism:eIssn>
<prism:copyright>&#169; 2012 Inderscience Publishers Ltd</prism:copyright>
<prism:rightsAgent>editor@inderscience.com</prism:rightsAgent>
<image rdf:resource="https://www.inderscience.com/images/files/coverImgs/ijesdf_scoverijesdf.jpg" />
<items>
<rdf:Seq>
<rdf:li rdf:resource="http://dx.doi.org/10.1504/IJESDF.2012.045387" />
<rdf:li rdf:resource="http://dx.doi.org/10.1504/IJESDF.2012.045388" />
<rdf:li rdf:resource="http://dx.doi.org/10.1504/IJESDF.2012.045389" />
<rdf:li rdf:resource="http://dx.doi.org/10.1504/IJESDF.2012.045390" />
<rdf:li rdf:resource="http://dx.doi.org/10.1504/IJESDF.2012.045391" />
<rdf:li rdf:resource="http://dx.doi.org/10.1504/IJESDF.2012.045392" />
</rdf:Seq>
</items>
</channel>
<image rdf:about="https://www.inderscience.com/images/files/coverImgs/ijesdf_scoverijesdf.jpg">
<title>International Journal of Electronic Security and Digital Forensics</title>
<url>https://www.inderscience.com/images/files/coverImgs/ijesdf_scoverijesdf.jpg</url>
<link>http://www.inderscience.com/browse/index.php?journalID=217&amp;year=2012&amp;vol=4&amp;issue=1</link>
</image>
<item rdf:about="http://dx.doi.org/10.1504/IJESDF.2012.045387">
<title>High capacity and secured methodologies for steganography</title>
<link>http://www.inderscience.com/link.php?id=45387</link>
<description>In current digital era, people are using e&#45;devices such as ipods, iphones and cell phones for capturing the static and dynamic images. However, these images have a compromised size and quality due to fixed memory dimension. But, in the multi&#45;media messaging service &#40;MMS&#41; of cell phones and iphones, they may participate as a cover medium, strengthening the steganography communication. The different methods of steganography are mostly applied on image files to embed the data. In all these cases, the principle of replacing the entire or some parts of the chosen pixel may not be able to utilise all the available memory area of an image for the purpose of the secret data. This paper presents a new high capacity steganographic technique to hide information. Three different techniques out of which two are to embed the plain text and one is for all type of data to embed in image. Based on these methods, we have constructed secured MMS creator and short message service creator viewer in Microsoft platform for providing data embedding in new e&#45;devices.</description>
<content:encoded><![CDATA[<p><a href="http://www.inderscience.com/link.php?id=45387"><b>High capacity and secured methodologies for steganography</b></A><br />Rajesh Kumar Tiwari<br /><i>International Journal of Electronic Security and Digital Forensics, Vol. 4, No. 1 (2012) pp. 1 - 18</i><br />In current digital era, people are using e&#45;devices such as ipods, iphones and cell phones for capturing the static and dynamic images. However, these images have a compromised size and quality due to fixed memory dimension. But, in the multi&#45;media messaging service &#40;MMS&#41; of cell phones and iphones, they may participate as a cover medium, strengthening the steganography communication. The different methods of steganography are mostly applied on image files to embed the data. In all these cases, the principle of replacing the entire or some parts of the chosen pixel may not be able to utilise all the available memory area of an image for the purpose of the secret data. This paper presents a new high capacity steganographic technique to hide information. Three different techniques out of which two are to embed the plain text and one is for all type of data to embed in image. Based on these methods, we have constructed secured MMS creator and short message service creator viewer in Microsoft platform for providing data embedding in new e&#45;devices.</p>]]></content:encoded>
<dc:identifier>10.1504/IJESDF.2012.045387</dc:identifier>
<dc:source>International Journal of Electronic Security and Digital Forensics, Vol. 4, No. 1 (2012) pp. 1 - 18</dc:source>
<dc:creator>Rajesh Kumar Tiwari</dc:creator>
<dc:contributor>Department of Computer Science and Engineering, R.V.S. College of Engineering and Technology, Jamshedpur, Jharkhand, India</dc:contributor>
<dc:subject>stego keys</dc:subject>
<dc:subject>user classified multi&#45;valued code</dc:subject>
<dc:subject>reduced ASCII code</dc:subject>
<dc:subject>direct replacement</dc:subject>
<dc:subject>steganography</dc:subject>
<dc:subject>information hiding</dc:subject>
<dc:subject>MMS</dc:subject>
<dc:subject>multimedia messaging service</dc:subject>
<dc:subject>cell phones</dc:subject>
<dc:subject>mobile phones</dc:subject>
<dc:subject>iphones</dc:subject>
<dc:subject>image files</dc:subject>
<dc:subject>plain text</dc:subject>
<dc:subject>SMS</dc:subject>
<dc:subject>short message service</dc:subject>
<dc:subject>secret data.</dc:subject>
<dc:date>2012-02-09T23:20:50-05:00</dc:date>
<prism:volume>4</prism:volume>
<prism:number>1</prism:number>
<prism:startingPage>1</prism:startingPage>
<prism:endingPage>18</prism:endingPage>
<prism:publicationDate>2012-02-09T23:20:50-05:00</prism:publicationDate>
</item>
<item rdf:about="http://dx.doi.org/10.1504/IJESDF.2012.045388">
<title>Image encryption using HC&#45;128 and HC&#45;256 stream ciphers</title>
<link>http://www.inderscience.com/link.php?id=45388</link>
<description>In this paper, we surveyed HC&#45;128 and HC&#45;256 as methods for protecting the distribution of digital images in an efficient and secure way. We proposed the Hongjun Cipher &#40;HC&#41; image encryption algorithm based on column&#45;wise raster scanning of the plain image. Then, we performed a series of tests and some comparisons to justify the efficiency of surveyed algorithms for image encryption. These tests included key space analysis, visual test and histogram analysis, randomness analysis, information entropy, encryption quality, correlation analysis, differential analysis, sensitivity analysis and performance analysis. Based on all analysis and experimental results, it can be concluded that the two variants of HC scheme are efficient, feasible and trustworthy to be adopted for image encryption.</description>
<content:encoded><![CDATA[<p><a href="http://www.inderscience.com/link.php?id=45388"><b>Image encryption using HC&#45;128 and HC&#45;256 stream ciphers</b></A><br />Alireza Jolfaei; Ahmadreza Vizandan; Abdolrasoul Mirghadri<br /><i>International Journal of Electronic Security and Digital Forensics, Vol. 4, No. 1 (2012) pp. 19 - 42</i><br />In this paper, we surveyed HC&#45;128 and HC&#45;256 as methods for protecting the distribution of digital images in an efficient and secure way. We proposed the Hongjun Cipher &#40;HC&#41; image encryption algorithm based on column&#45;wise raster scanning of the plain image. Then, we performed a series of tests and some comparisons to justify the efficiency of surveyed algorithms for image encryption. These tests included key space analysis, visual test and histogram analysis, randomness analysis, information entropy, encryption quality, correlation analysis, differential analysis, sensitivity analysis and performance analysis. Based on all analysis and experimental results, it can be concluded that the two variants of HC scheme are efficient, feasible and trustworthy to be adopted for image encryption.</p>]]></content:encoded>
<dc:identifier>10.1504/IJESDF.2012.045388</dc:identifier>
<dc:source>International Journal of Electronic Security and Digital Forensics, Vol. 4, No. 1 (2012) pp. 19 - 42</dc:source>
<dc:creator>Alireza Jolfaei; Ahmadreza Vizandan; Abdolrasoul Mirghadri</dc:creator>
<dc:contributor>Faculty and Research Center of Communication and Information Technology, IHU, Tehran, Iran &#39; Faculty and Research Center of Communication and Information Technology, IHU, Tehran, Iran &#39; Faculty and Research Center of Communication and Information Technology, IHU, Tehran, Iran</dc:contributor>
<dc:subject>image encryption</dc:subject>
<dc:subject>HC&#45;128</dc:subject>
<dc:subject>HC&#45;256</dc:subject>
<dc:subject>stream ciphers</dc:subject>
<dc:subject>efficiency</dc:subject>
<dc:subject>digital images</dc:subject>
<dc:subject>electronic security</dc:subject>
<dc:subject>cryptography</dc:subject>
<dc:subject>image protection</dc:subject>
<dc:subject>trustworthiness</dc:subject>
<dc:subject>raster scanning.</dc:subject>
<dc:date>2012-02-09T23:20:50-05:00</dc:date>
<prism:volume>4</prism:volume>
<prism:number>1</prism:number>
<prism:startingPage>19</prism:startingPage>
<prism:endingPage>42</prism:endingPage>
<prism:publicationDate>2012-02-09T23:20:50-05:00</prism:publicationDate>
</item>
<item rdf:about="http://dx.doi.org/10.1504/IJESDF.2012.045389">
<title>Weaknesses in a dynamic ID&#45;based remote user authentication scheme for multi&#45;server environment</title>
<link>http://www.inderscience.com/link.php?id=45389</link>
<description>Due to the widespread applications of internet services, the study of accessing the resources of multi&#45;server environment has received considerable attention, and many schemes are proposed successively. Very recently, Hsiang et al. proposed a dynamic ID&#45;based remote user authentication scheme for multi&#45;server environment. They claimed their scheme can resist various attacks. However, in this paper, we will show that Hsiang et al.&#39;s scheme is vulnerable to the impersonation attack, the password guessing attack, the masquerading user attack and the masquerading server attack. The analysis shows that Hsiang et al.&#39;s scheme is insecure for practical application.</description>
<content:encoded><![CDATA[<p><a href="http://www.inderscience.com/link.php?id=45389"><b>Weaknesses in a dynamic ID&#45;based remote user authentication scheme for multi&#45;server environment</b></A><br />Debiao He; Yin Huang<br /><i>International Journal of Electronic Security and Digital Forensics, Vol. 4, No. 1 (2012) pp. 43 - 53</i><br />Due to the widespread applications of internet services, the study of accessing the resources of multi&#45;server environment has received considerable attention, and many schemes are proposed successively. Very recently, Hsiang et al. proposed a dynamic ID&#45;based remote user authentication scheme for multi&#45;server environment. They claimed their scheme can resist various attacks. However, in this paper, we will show that Hsiang et al.&#39;s scheme is vulnerable to the impersonation attack, the password guessing attack, the masquerading user attack and the masquerading server attack. The analysis shows that Hsiang et al.&#39;s scheme is insecure for practical application.</p>]]></content:encoded>
<dc:identifier>10.1504/IJESDF.2012.045389</dc:identifier>
<dc:source>International Journal of Electronic Security and Digital Forensics, Vol. 4, No. 1 (2012) pp. 43 - 53</dc:source>
<dc:creator>Debiao He; Yin Huang</dc:creator>
<dc:contributor>School of Mathematics and Statistics, Wuhan University, Wuhan 430072, China &#39; Sumavision Technology Co. Ltd., Beijing 100085, China</dc:contributor>
<dc:subject>remote users</dc:subject>
<dc:subject>authentication</dc:subject>
<dc:subject>electronic security</dc:subject>
<dc:subject>cryptanalysis</dc:subject>
<dc:subject>smart cards</dc:subject>
<dc:subject>attacks</dc:subject>
<dc:subject>multi&#45;server environments</dc:subject>
<dc:subject>user identification</dc:subject>
<dc:subject>impersonation attack</dc:subject>
<dc:subject>password guessing attack</dc:subject>
<dc:subject>masquerading user attack</dc:subject>
<dc:subject>masquerading server attack.</dc:subject>
<dc:date>2012-02-09T23:20:50-05:00</dc:date>
<prism:volume>4</prism:volume>
<prism:number>1</prism:number>
<prism:startingPage>43</prism:startingPage>
<prism:endingPage>53</prism:endingPage>
<prism:publicationDate>2012-02-09T23:20:50-05:00</prism:publicationDate>
</item>
<item rdf:about="http://dx.doi.org/10.1504/IJESDF.2012.045390">
<title>Children and geotagged images&#58; quantitative analysis for security risk assessment</title>
<link>http://www.inderscience.com/link.php?id=45390</link>
<description>This paper investigates the levels of geocoding images with children pictures and discusses privacy and safety issues that may affect children. This study analysed the number of geocoded images of children&#39;s pictures on Flickr, a popular image&#45;sharing site. For 50 of the top most expensive residential zip codes in the USA, the number of images that had geolocation tags was counted. Results showed significant number of images with children&#39;s faces that had geotagged information. The location information could possibly be used to locate a child&#39;s home or other location based on information publicly available on Flickr. Publishing geolocation data raises concerns about privacy and security of children when such personalised information is available to internet users who may have dubious reasons for accessing this data. People should understand the implications of this technology and post only appropriate data to protect themselves and their children.</description>
<content:encoded><![CDATA[<p><a href="http://www.inderscience.com/link.php?id=45390"><b>Children and geotagged images&#58; quantitative analysis for security risk assessment</b></A><br />Joanne M. Kuzma<br /><i>International Journal of Electronic Security and Digital Forensics, Vol. 4, No. 1 (2012) pp. 54 - 64</i><br />This paper investigates the levels of geocoding images with children pictures and discusses privacy and safety issues that may affect children. This study analysed the number of geocoded images of children&#39;s pictures on Flickr, a popular image&#45;sharing site. For 50 of the top most expensive residential zip codes in the USA, the number of images that had geolocation tags was counted. Results showed significant number of images with children&#39;s faces that had geotagged information. The location information could possibly be used to locate a child&#39;s home or other location based on information publicly available on Flickr. Publishing geolocation data raises concerns about privacy and security of children when such personalised information is available to internet users who may have dubious reasons for accessing this data. People should understand the implications of this technology and post only appropriate data to protect themselves and their children.</p>]]></content:encoded>
<dc:identifier>10.1504/IJESDF.2012.045390</dc:identifier>
<dc:source>International Journal of Electronic Security and Digital Forensics, Vol. 4, No. 1 (2012) pp. 54 - 64</dc:source>
<dc:creator>Joanne M. Kuzma</dc:creator>
<dc:contributor>Faculty of Computing, University of Worcester, Henwick Grove, Worcester WR2 6AJ, UK</dc:contributor>
<dc:subject>Flickr</dc:subject>
<dc:subject>geocoding</dc:subject>
<dc:subject>geolocation tags</dc:subject>
<dc:subject>geotags</dc:subject>
<dc:subject>privacy</dc:subject>
<dc:subject>security</dc:subject>
<dc:subject>children</dc:subject>
<dc:subject>geotagged images</dc:subject>
<dc:subject>risk assessment</dc:subject>
<dc:subject>child safety</dc:subject>
<dc:subject>child protection</dc:subject>
<dc:subject>child images</dc:subject>
<dc:subject>image sharing</dc:subject>
<dc:subject>location information</dc:subject>
<dc:subject>personalised information.</dc:subject>
<dc:date>2012-02-09T23:20:50-05:00</dc:date>
<prism:volume>4</prism:volume>
<prism:number>1</prism:number>
<prism:startingPage>54</prism:startingPage>
<prism:endingPage>64</prism:endingPage>
<prism:publicationDate>2012-02-09T23:20:50-05:00</prism:publicationDate>
</item>
<item rdf:about="http://dx.doi.org/10.1504/IJESDF.2012.045391">
<title>Key generation based on elliptic curve over finite prime field</title>
<link>http://www.inderscience.com/link.php?id=45391</link>
<description>With the explosion of networks and the huge amount of data transmitted along, securing data content is becoming more and more important. Data encryption is widely used to ensure security in open networks, like the internet. This paper presents the implementation of stream cipher, where the key stream is generated based on the properties of linear feedback shift register &#40;LFSR&#41; and cyclic elliptic curve &#40;EC&#41; over a finite prime field. Here, the process of encryption&#47;decryption of an image in spatial domain is illustrated and also key file parameters needed for generating the key stream to other parties are encrypted using elliptic curve cryptography &#40;ECC&#41;. Only, the encrypted key file parameters are transmitted, not the entire full length key. Since ECC is replacing RSA for key exchange, EC&#45;based stream cipher offers a good choice for encryption in real&#45;time application. The strength of the proposed cipher lies in the generation of random sequence using LFSR over finite prime field and also the use of EC discrete logarithmic problem makes it more difficult to determine the key file parameters. This paper also discusses the security aspects of the proposed cipher which is secure against all kinds of attacks.</description>
<content:encoded><![CDATA[<p><a href="http://www.inderscience.com/link.php?id=45391"><b>Key generation based on elliptic curve over finite prime field</b></A><br />S. Maria Celestin Vigila; K. Muneeswaran<br /><i>International Journal of Electronic Security and Digital Forensics, Vol. 4, No. 1 (2012) pp. 65 - 81</i><br />With the explosion of networks and the huge amount of data transmitted along, securing data content is becoming more and more important. Data encryption is widely used to ensure security in open networks, like the internet. This paper presents the implementation of stream cipher, where the key stream is generated based on the properties of linear feedback shift register &#40;LFSR&#41; and cyclic elliptic curve &#40;EC&#41; over a finite prime field. Here, the process of encryption&#47;decryption of an image in spatial domain is illustrated and also key file parameters needed for generating the key stream to other parties are encrypted using elliptic curve cryptography &#40;ECC&#41;. Only, the encrypted key file parameters are transmitted, not the entire full length key. Since ECC is replacing RSA for key exchange, EC&#45;based stream cipher offers a good choice for encryption in real&#45;time application. The strength of the proposed cipher lies in the generation of random sequence using LFSR over finite prime field and also the use of EC discrete logarithmic problem makes it more difficult to determine the key file parameters. This paper also discusses the security aspects of the proposed cipher which is secure against all kinds of attacks.</p>]]></content:encoded>
<dc:identifier>10.1504/IJESDF.2012.045391</dc:identifier>
<dc:source>International Journal of Electronic Security and Digital Forensics, Vol. 4, No. 1 (2012) pp. 65 - 81</dc:source>
<dc:creator>S. Maria Celestin Vigila; K. Muneeswaran</dc:creator>
<dc:contributor>Department of Information Technology, Noorul Islam College of Engineering, Kumaracoil 629180, Tamilnadu, India &#39; Department of Computer Science and Engineering, Mepco Schlenk Engineering College, Sivakasi 626005, Tamilnadu, India</dc:contributor>
<dc:subject>elliptic curve cryptography</dc:subject>
<dc:subject>discrete logarithms</dc:subject>
<dc:subject>finite fields</dc:subject>
<dc:subject>stream ciphers</dc:subject>
<dc:subject>OTP</dc:subject>
<dc:subject>one time pad</dc:subject>
<dc:subject>key generation</dc:subject>
<dc:subject>data encryption</dc:subject>
<dc:subject>linear feedback shift register</dc:subject>
<dc:subject>LFSR</dc:subject>
<dc:subject>key exchange</dc:subject>
<dc:subject>electronic security.</dc:subject>
<dc:date>2012-02-09T23:20:50-05:00</dc:date>
<prism:volume>4</prism:volume>
<prism:number>1</prism:number>
<prism:startingPage>65</prism:startingPage>
<prism:endingPage>81</prism:endingPage>
<prism:publicationDate>2012-02-09T23:20:50-05:00</prism:publicationDate>
</item>
<item rdf:about="http://dx.doi.org/10.1504/IJESDF.2012.045392">
<title>RF authenticated protection scheme for SRAM&#45;based FPGA IP cores</title>
<link>http://www.inderscience.com/link.php?id=45392</link>
<description>Field programmable gate arrays &#40;FPGAs&#41; have become increasingly popular due to their rapid development times and low costs. Many FPGA&#45;based systems utilise third&#45;party intellectual property &#40;IP&#41; in their development. With their increased use, the need to protect the IP against unauthorised use has become important. In this paper, we have proposed a novel wireless intellectual property protection &#40;IPP&#41; technique that overcomes the secure secret decryption key storage problem associated with traditional encryption&#45;based IPP techniques that are widely used for IPP of static random access memory&#45;based FPGA IP cores. The proposed scheme also provides an extra authentication protection for IP cores to make it more security efficient. The results derived from the testing of hardware prototype used for the evaluation of the proposed scheme are quite encouraging.

</description>
<content:encoded><![CDATA[<p><a href="http://www.inderscience.com/link.php?id=45392"><b>RF authenticated protection scheme for SRAM&#45;based FPGA IP cores</b></A><br />Sridhar Laavanya; V. Lakshmi Prabha<br /><i>International Journal of Electronic Security and Digital Forensics, Vol. 4, No. 1 (2012) pp. 82 - 100</i><br />Field programmable gate arrays &#40;FPGAs&#41; have become increasingly popular due to their rapid development times and low costs. Many FPGA&#45;based systems utilise third&#45;party intellectual property &#40;IP&#41; in their development. With their increased use, the need to protect the IP against unauthorised use has become important. In this paper, we have proposed a novel wireless intellectual property protection &#40;IPP&#41; technique that overcomes the secure secret decryption key storage problem associated with traditional encryption&#45;based IPP techniques that are widely used for IPP of static random access memory&#45;based FPGA IP cores. The proposed scheme also provides an extra authentication protection for IP cores to make it more security efficient. The results derived from the testing of hardware prototype used for the evaluation of the proposed scheme are quite encouraging.

</p>]]></content:encoded>
<dc:identifier>10.1504/IJESDF.2012.045392</dc:identifier>
<dc:source>International Journal of Electronic Security and Digital Forensics, Vol. 4, No. 1 (2012) pp. 82 - 100</dc:source>
<dc:creator>Sridhar Laavanya; V. Lakshmi Prabha</dc:creator>
<dc:contributor>Pyramid Design Private Limited, 25 &#40;Old no. 33&#41; K.S. Ramaswamy Street, K.K. Pudur, Coimbatore 641038, Tamil Nadu, India &#39; Government College of Engineering, Rettiyaarpatti, Tirunelveli 627007, Tamil Nadu, India</dc:contributor>
<dc:subject>SRAM</dc:subject>
<dc:subject>static random access memory</dc:subject>
<dc:subject>FPGAs</dc:subject>
<dc:subject>field programmable gate arrays</dc:subject>
<dc:subject>IPP</dc:subject>
<dc:subject>intellectual property protection</dc:subject>
<dc:subject>bitstream encryption</dc:subject>
<dc:subject>RFID</dc:subject>
<dc:subject>radio frequency identification</dc:subject>
<dc:subject>authentication protection</dc:subject>
<dc:subject>decryption key transmission</dc:subject>
<dc:subject>electronic security.</dc:subject>
<dc:date>2012-02-09T23:20:50-05:00</dc:date>
<prism:volume>4</prism:volume>
<prism:number>1</prism:number>
<prism:startingPage>82</prism:startingPage>
<prism:endingPage>100</prism:endingPage>
<prism:publicationDate>2012-02-09T23:20:50-05:00</prism:publicationDate>
</item>
</rdf:RDF>

