<?xml version="1.0" encoding="utf-8"?>
<!DOCTYPE ArticleSet PUBLIC "-//NLM//DTD PubMed 2.0//EN" "http://www.ncbi.nlm.nih.gov:80/entrez/query/static/PubMed.dtd">
<ArticleSet>
<Article>
<Journal>
<PublisherName>انجمن رمز ایران</PublisherName>
<JournalTitle>Biannual Journal Monadi for Cyberspace Security (AFTA)</JournalTitle>
<Issn>2476-3047</Issn>
<Volume>5</Volume>
<Issue>2</Issue>
<PubDate PubStatus = "ppublish">
<Year>2017</Year>
<Month>3</Month>
<Day>1</Day>
</PubDate>
</Journal>


	<ArticleTitle> A Survey of Cube, Differential Fault Analysis Attacks and Linear Structures on Keccak Hash Function (SHA-3)</ArticleTitle>
	<FirstPage>3</FirstPage>
	<LastPage>14</LastPage>
	<Language>FA</Language>
<AuthorList>
	<Author>
	<FirstName>Masoumeh</FirstName>
	<LastName>Safkhani</LastName>
	<Affiliation>Shahid Rajaee Teacher Traning University</Affiliation>
	 </Author>


	<Author>
	<FirstName>Mohamadamin</FirstName>
	<LastName>Arghavani</LastName>
	<Affiliation>Shahid Rajaee Teacher Traning University</Affiliation>
	 </Author>


</AuthorList>
<Abstract>In recent years the security of SHA-3[1] is one of the most interesting topics in the field of cryptography. Cryptography uses Hash functions in different ways. Thus the security of Hash functions against different attacks is of vital importance. Several attacks and many analysis have been applied to SHA-3 till now but none of them could break it theoretically or practically. Keccak relies on a Sponge architecture.
In this paper, we focus on differential fault analysis attack and we review the latest attacks on SHA-3. Specifically, we describe cube attack, differential fault analysis and also describe zero-sum distinguisher attack and pre-image attack by using linear structures.

&#160;


[1] Secure Hash Algorithm 3(SHA-3)</Abstract>


</Article>
<Article>
<Journal>
<PublisherName>انجمن رمز ایران</PublisherName>
<JournalTitle>Biannual Journal Monadi for Cyberspace Security (AFTA)</JournalTitle>
<Issn>2476-3047</Issn>
<Volume>5</Volume>
<Issue>2</Issue>
<PubDate PubStatus = "ppublish">
<Year>2017</Year>
<Month>3</Month>
<Day>1</Day>
</PubDate>
</Journal>


	<ArticleTitle>A Study on evolutional process of privacy and security in identity managment system</ArticleTitle>
	<FirstPage>15</FirstPage>
	<LastPage>34</LastPage>
	<Language>FA</Language>
<AuthorList>
	<Author>
	<FirstName></FirstName>
	<LastName></LastName>
	<Affiliation></Affiliation>
	 </Author>


	<Author>
	<FirstName></FirstName>
	<LastName></LastName>
	<Affiliation></Affiliation>
	 </Author>


</AuthorList>
<Abstract>The Identity Management System (IDM) is a set of policies, rules, procedures, and systems that manage authentication, access control, and audit activity based on digital identity. In the Identity Management System, given the storage of user identity attributes in the identity provider, users will lose their physical and traditional control over their personal identity, and on the other hand, user attributes are subject to more attacks from The inside of the system and the external attackers. Therefore, to ensure user&#39;s privacy control is keeping awareness of the release of his / her&#160; identity information, So providing security mechanisms in the area of privacy is essential. The current mechanisms have failed to satisfy users confidence in maintaining the security and privacy associated with their identity information. The designs presented in this area will increase user intervention and involvement during system interactions , and the user must act as an interface role. The Problems of the proposed designs, the high computational burden on a part of the system. In this article, the process of improving privacy control and user awareness for solving problems has been investigated.</Abstract>


</Article>
<Article>
<Journal>
<PublisherName>انجمن رمز ایران</PublisherName>
<JournalTitle>Biannual Journal Monadi for Cyberspace Security (AFTA)</JournalTitle>
<Issn>2476-3047</Issn>
<Volume>5</Volume>
<Issue>2</Issue>
<PubDate PubStatus = "ppublish">
<Year>2017</Year>
<Month>3</Month>
<Day>1</Day>
</PubDate>
</Journal>


	<ArticleTitle>Overview of Jamming Operation in Smart Network</ArticleTitle>
	<FirstPage>35</FirstPage>
	<LastPage>48</LastPage>
	<Language>FA</Language>
<AuthorList>
	<Author>
	<FirstName>Mohammad Reza</FirstName>
	<LastName>Goharei</LastName>
	<Affiliation>RCDAT</Affiliation>
	 </Author>


</AuthorList>
<Abstract>In this paper, one of the most important challenges in energy smart grids &#8211; Denial of service for critical time messages &#8211; is addressed. In order to explain and solve this issue, we have described different communication structures for conveyed messages in energy smart grids, various proposed communication technologies, different types of jammings, and variety of conveyed messages in grid. Also, depending on communication technology and jamming in use, different situations of jamming is explored. To describe jamming problem, Gambler&#8217;s ruin problem solving theory is used. To eliminate this vulnerability, the least rate of invalid messages is calculated for the worst situation. TACT technic in he least camouflage traffic load in grids is used to match this problem to real world.</Abstract>


</Article>
<Article>
<Journal>
<PublisherName>انجمن رمز ایران</PublisherName>
<JournalTitle>Biannual Journal Monadi for Cyberspace Security (AFTA)</JournalTitle>
<Issn>2476-3047</Issn>
<Volume>5</Volume>
<Issue>2</Issue>
<PubDate PubStatus = "ppublish">
<Year>2017</Year>
<Month>3</Month>
<Day>1</Day>
</PubDate>
</Journal>


	<ArticleTitle>An overview of privacy preserving Data Publishing Techniques</ArticleTitle>
	<FirstPage>49</FirstPage>
	<LastPage>62</LastPage>
	<Language>FA</Language>
<AuthorList>
	<Author>
	<FirstName>Mehdi</FirstName>
	<LastName>Sadeghpour</LastName>
	<Affiliation>University of Guilan</Affiliation>
	 </Author>


	<Author>
	<FirstName>Reza</FirstName>
	<LastName>Ebrahimi Atani</LastName>
	<Affiliation>University of Guilan</Affiliation>
	 </Author>


</AuthorList>
<Abstract>Data collection and storage has facilitated by the growth in electronic services, and has led to recording vast amounts of personal information in public and private organizations&#39; databases. These records often include sensitive personal information (such as income and diseases) and must be covered from others access. But in some cases, mining the data and extraction of knowledge from these valuable sources, creates the need for sharing them with other organizations. This would bring security challenges in users&#39; privacy. &#8220;Privacy preserving data publishing&#8221; is a solution to ensure secrecy of sensitive information in a data set, after publishing it in a hostile environment. This process aimed to hide sensitive information and keep published data suitable for knowledge discovery techniques. Grouping data set records is a broad approach to data anonymization. This technique prevents access to sensitive attributes of a specific record by eliminating the distinction between a number of data set &#8204;records. In this paper an overview of privacy preserving Data Publishing Techniques will be presented.</Abstract>


</Article>
<Article>
<Journal>
<PublisherName>انجمن رمز ایران</PublisherName>
<JournalTitle>Biannual Journal Monadi for Cyberspace Security (AFTA)</JournalTitle>
<Issn>2476-3047</Issn>
<Volume>5</Volume>
<Issue>2</Issue>
<PubDate PubStatus = "ppublish">
<Year>2017</Year>
<Month>3</Month>
<Day>1</Day>
</PubDate>
</Journal>


	<ArticleTitle> Review of Image Steganography Based on LSB and Pixel Classification and Providing a New Method in This Area</ArticleTitle>
	<FirstPage>63</FirstPage>
	<LastPage>71</LastPage>
	<Language>FA</Language>
<AuthorList>
	<Author>
	<FirstName>mansoor</FirstName>
	<LastName>fateh</LastName>
	<Affiliation>Shahrood University of Technology</Affiliation>
	 </Author>


	<Author>
	<FirstName>samira</FirstName>
	<LastName>rajabloo</LastName>
	<Affiliation>Shahrood University of Technology</Affiliation>
	 </Author>


	<Author>
	<FirstName>elahe</FirstName>
	<LastName>alipour</LastName>
	<Affiliation>Shahrood University of Technology</Affiliation>
	 </Author>


</AuthorList>
<Abstract>In this paper, the image steganography based on LSB and pixel classification is reviewed. Then, the method for steganography information in image is presented. This method based on LSB. Our purpose of this paper is to minimize the changes in cover image. At the first, the pixels of the image are selected to hiding the message; second complemented message will be hidden in LSB of selected pixels. In this paper, to solve some problems LSB method and minimize the changes, pixels categorized based on values of bits of second, third, fourth. In each category, ratio of changed pixels to unchanged pixels is calculated. If the ratio is greater than one, the LSB of that category are reversed and those changes reach at least. Mean Square Error and Peak Signal to Noise Ratio are two criterions to evaluate stego-image quality. PSNR and MSE of proposed method in comparison with simple LSB method, are respectively growth rate 0.13 percent and reduction rate 0.19 percent.</Abstract>


</Article>
<Article>
<Journal>
<PublisherName>انجمن رمز ایران</PublisherName>
<JournalTitle>Biannual Journal Monadi for Cyberspace Security (AFTA)</JournalTitle>
<Issn>2476-3047</Issn>
<Volume>5</Volume>
<Issue>2</Issue>
<PubDate PubStatus = "ppublish">
<Year>2017</Year>
<Month>3</Month>
<Day>1</Day>
</PubDate>
</Journal>


	<ArticleTitle>Survey of group location privacy approaches in location-based services and its challenges</ArticleTitle>
	<FirstPage>73</FirstPage>
	<LastPage>85</LastPage>
	<Language>FA</Language>
<AuthorList>
	<Author>
	<FirstName>shadi</FirstName>
	<LastName>azizi</LastName>
	<Affiliation>University of Isfahan</Affiliation>
	 </Author>


	<Author>
	<FirstName>maede</FirstName>
	<LastName>Ashouri-Talouki</LastName>
	<Affiliation>University of Isfahan</Affiliation>
	 </Author>


	<Author>
	<FirstName>hamid</FirstName>
	<LastName>mala</LastName>
	<Affiliation>University of Isfahan</Affiliation>
	 </Author>


</AuthorList>
<Abstract>Location-based services (LBSs) provide appropriate information based on users&#8217; locations. These services can be invoked by an individual user or a group of users. Using these services requires users to reveal their locations; thus, providing uses&#8217; location privacy during the use of these services is an important issue. There are many works to protect users&#8217; location privacy. In this paper, we have reviewed the related works to provide the location privacy for a group of users during the use of LBSs. We have classified them into two categories: the first category consists of the solutions that protect an individual user location privacy through group formation, while the second category contains the specific solutions to provide group location privacy. We have then analyzed and compared the performance and security properties of the related works, and have identified the open issues and future works in this field.</Abstract>


</Article>
</ArticleSet>
