<?xml version="1.0" encoding="utf-8"?>
 <ArticleSet>
	
		<Article>
		<Journal>
			<PublisherName>انجمن رمز ایران</PublisherName>
			<JournalTitle>Biannual Journal Monadi for Cyberspace Security (AFTA)</JournalTitle>
			<PISSN>2476-3047</PISSN>
			<EISSN>2476-3047</EISSN>
			<Volume>5</Volume>
			<Issue>1</Issue>
			<PubDate PubStatus="epublish">
				<Year>2016</Year>
				<Month>9</Month>
				<Day>1</Day>
			</PubDate>
		</Journal>
			
		<ArticleTitle>Security challenges and solutions in software defined networks</ArticleTitle>
		<FirstPage>3</FirstPage>
		<LastPage>20</LastPage>
		<Language>FA</Language>
		

	<AuthorList>
	<Author>
	<FirstName>Mahmood</FirstName>
	<MiddleName></MiddleName>
	<LastName>Deypir</LastName>
	<Affiliation>Shahid sattari university</Affiliation>
	<AuthorEmails>mdeypir@gmail.com</AuthorEmails>
	<CorrespondingAuthor>Y</CorrespondingAuthor>
	<ORCID></ORCID>
	 </Author>
	<Author>
	<FirstName>Mozhgan</FirstName>
	<MiddleName></MiddleName>
	<LastName>Ghasabi</LastName>
	<Affiliation></Affiliation>
	<AuthorEmails>mozhgan.ghasabi@srbiau.ac.ir</AuthorEmails>
	<CorrespondingAuthor>N</CorrespondingAuthor>
	<ORCID></ORCID>
	 </Author>
	</AuthorList>
	<DOI></DOI>
	<Abstract>Recently, software defined networks have been introduced for innovation and flexibility in computer networks. They are widely used in infrastructure networks and data centers. Using these networks has advantages such as scalability, efficient bandwidth usage, reducing control traffic, better traffic engineering and etc., which are mainly due to their programmability. There are also some security challenges that often arise from the same property. Software defined networks reliability compared to traditional network reduces due to these challenges. Therefore, if software defined networks are not design based on a security architecture, they will be vulnerable against known cyber-attacks such as DDoS, spoofing, information disclosure and etc. In this paper, software defined network security challenges and corresponding solutions are reviewed. Moreover, some applications of software defined networks for security including network traffic separation, network flow access control, and secure routing are mentioned. In order to do security testing and evaluation of relevant security solutions we have explained how these networks are simulated.</Abstract>
	<Keywords>software defined networks, security, cyber-attacks, denial of service attack.</Keywords>

			<URLs>
				<abstract>http://monadi.isc.org.ir/article-1-61-en.html</abstract>
				<Fulltext>
					<pdf>http://monadi.isc.org.ir/article-1-61-en.pdf</pdf>
				</Fulltext>
			</URLs>
			
			
	</Article>
	
		<Article>
		<Journal>
			<PublisherName>انجمن رمز ایران</PublisherName>
			<JournalTitle>Biannual Journal Monadi for Cyberspace Security (AFTA)</JournalTitle>
			<PISSN>2476-3047</PISSN>
			<EISSN>2476-3047</EISSN>
			<Volume>5</Volume>
			<Issue>1</Issue>
			<PubDate PubStatus="epublish">
				<Year>2016</Year>
				<Month>9</Month>
				<Day>1</Day>
			</PubDate>
		</Journal>
			
		<ArticleTitle>Jump Index in T-functions for designing a new basic structure of stream ciphers</ArticleTitle>
		<FirstPage>21</FirstPage>
		<LastPage>32</LastPage>
		<Language>FA</Language>
		

	<AuthorList>
	<Author>
	<FirstName>Ali</FirstName>
	<MiddleName></MiddleName>
	<LastName>Hadipour</LastName>
	<Affiliation></Affiliation>
	<AuthorEmails>shakhesyar@chmail.ir</AuthorEmails>
	<CorrespondingAuthor>Y</CorrespondingAuthor>
	<ORCID></ORCID>
	 </Author>
	<Author>
	<FirstName>Seyed Mahdi</FirstName>
	<MiddleName></MiddleName>
	<LastName>Sajadieh</LastName>
	<Affiliation></Affiliation>
	<AuthorEmails>m.sajadieh@khuisf.ac.ir</AuthorEmails>
	<CorrespondingAuthor>N</CorrespondingAuthor>
	<ORCID></ORCID>
	 </Author>
	<Author>
	<FirstName>Raheleh</FirstName>
	<MiddleName></MiddleName>
	<LastName>MoradAfifi</LastName>
	<Affiliation></Affiliation>
	<AuthorEmails>rahele_4281@yahoo.com</AuthorEmails>
	<CorrespondingAuthor>N</CorrespondingAuthor>
	<ORCID></ORCID>
	 </Author>
	</AuthorList>
	<DOI></DOI>
	<Abstract>The stream ciphers are set of symmetric cipher algorithms that receive the secret message as a sequence of bits and process encrypted operation using complex function according to key, IV and XOR combination of a sequence of bits. One of the goals in the design of stream ciphers is to get minimum great period using one of the primary T-functions. Also using jump index in designing LFSRs lead to complexity of stream ciphers based on LFSR analysis. In this paper, tried with using of T-functions concepts and jump index, a novel method presented for primary functions design with great period.</Abstract>
	<Keywords>T-function, Jump index, Stream cipher, great period</Keywords>

			<URLs>
				<abstract>http://monadi.isc.org.ir/article-1-75-en.html</abstract>
				<Fulltext>
					<pdf>http://monadi.isc.org.ir/article-1-75-en.pdf</pdf>
				</Fulltext>
			</URLs>
			
			
	</Article>
	
		<Article>
		<Journal>
			<PublisherName>انجمن رمز ایران</PublisherName>
			<JournalTitle>Biannual Journal Monadi for Cyberspace Security (AFTA)</JournalTitle>
			<PISSN>2476-3047</PISSN>
			<EISSN>2476-3047</EISSN>
			<Volume>5</Volume>
			<Issue>1</Issue>
			<PubDate PubStatus="epublish">
				<Year>2016</Year>
				<Month>9</Month>
				<Day>1</Day>
			</PubDate>
		</Journal>
			
		<ArticleTitle></ArticleTitle>
		<FirstPage>33</FirstPage>
		<LastPage>44</LastPage>
		<Language>FA</Language>
		

	<AuthorList>
	<Author>
	<FirstName>Seyedeh Zeinab</FirstName>
	<MiddleName></MiddleName>
	<LastName>Mohammadi</LastName>
	<Affiliation></Affiliation>
	<AuthorEmails>s_z_mohammadi@yahoo.com</AuthorEmails>
	<CorrespondingAuthor>N</CorrespondingAuthor>
	<ORCID></ORCID>
	 </Author>
	<Author>
	<FirstName>Nima</FirstName>
	<MiddleName></MiddleName>
	<LastName>Jafari Navimipour</LastName>
	<Affiliation></Affiliation>
	<AuthorEmails>jafari@iaut.ac.ir</AuthorEmails>
	<CorrespondingAuthor>Y</CorrespondingAuthor>
	<ORCID></ORCID>
	 </Author>
	</AuthorList>
	<DOI></DOI>
	<Abstract></Abstract>
	<Keywords></Keywords>

			<URLs>
				<abstract>http://monadi.isc.org.ir/article-1-72-en.html</abstract>
				<Fulltext>
					<pdf>http://monadi.isc.org.ir/article-1-72-en.pdf</pdf>
				</Fulltext>
			</URLs>
			
			
	</Article>
	
		<Article>
		<Journal>
			<PublisherName>انجمن رمز ایران</PublisherName>
			<JournalTitle>Biannual Journal Monadi for Cyberspace Security (AFTA)</JournalTitle>
			<PISSN>2476-3047</PISSN>
			<EISSN>2476-3047</EISSN>
			<Volume>5</Volume>
			<Issue>1</Issue>
			<PubDate PubStatus="epublish">
				<Year>2016</Year>
				<Month>9</Month>
				<Day>1</Day>
			</PubDate>
		</Journal>
			
		<ArticleTitle>Performance assessment Bio- Inspired algorithms for solving backpack in the form of objective function minimization.</ArticleTitle>
		<FirstPage>45</FirstPage>
		<LastPage>52</LastPage>
		<Language>FA</Language>
		

	<AuthorList>
	<Author>
	<FirstName>mahtab</FirstName>
	<MiddleName></MiddleName>
	<LastName>roozbahani</LastName>
	<Affiliation></Affiliation>
	<AuthorEmails></AuthorEmails>
	<CorrespondingAuthor>Y</CorrespondingAuthor>
	<ORCID></ORCID>
	 </Author>
	<Author>
	<FirstName>meysam</FirstName>
	<MiddleName></MiddleName>
	<LastName>moradi</LastName>
	<Affiliation></Affiliation>
	<AuthorEmails>en.m.moradi.co@gmail.com</AuthorEmails>
	<CorrespondingAuthor>N</CorrespondingAuthor>
	<ORCID></ORCID>
	 </Author>
	<Author>
	<FirstName>parvaneh</FirstName>
	<MiddleName></MiddleName>
	<LastName>mansoori</LastName>
	<Affiliation></Affiliation>
	<AuthorEmails></AuthorEmails>
	<CorrespondingAuthor>N</CorrespondingAuthor>
	<ORCID></ORCID>
	 </Author>
	</AuthorList>
	<DOI></DOI>
	<Abstract>In mathematics and computer science an optimization problem, the problem is finding the best solution among all possible solutions. Given the importance of the knapsack in computer sciences, different algorithms are used to solve it. Knapsack problem is a combinational problem of selectivity and the purpose of solving the most benefit by taking the capacity is the tolerable knapsack. Since the knapsack is a problem of constrained maximization. In this study, a mathematical model in the form of a function unlimited minimization and designed for it, hen this model on Particle Swarm Optimization , Firefly Algorithm and Artificial Bee Colony has been implemented in MATLAB software environment, The results show that the artificial bee colony algorithm, the model is better than the other two algorithms .The advantage of this model is the objective function , because minimization and unlimited models , to implement with many&#160; Bio-Inspired algorithms.</Abstract>
	<Keywords>Knapsack Problem, Particle Swarm Optimization Algorithm, Firefly Algorithm, Artificial Bee Colony Algorithm.</Keywords>

			<URLs>
				<abstract>http://monadi.isc.org.ir/article-1-54-en.html</abstract>
				<Fulltext>
					<pdf>http://monadi.isc.org.ir/article-1-54-en.pdf</pdf>
				</Fulltext>
			</URLs>
			
			
	</Article>
	
		<Article>
		<Journal>
			<PublisherName>انجمن رمز ایران</PublisherName>
			<JournalTitle>Biannual Journal Monadi for Cyberspace Security (AFTA)</JournalTitle>
			<PISSN>2476-3047</PISSN>
			<EISSN>2476-3047</EISSN>
			<Volume>5</Volume>
			<Issue>1</Issue>
			<PubDate PubStatus="epublish">
				<Year>2016</Year>
				<Month>9</Month>
				<Day>1</Day>
			</PubDate>
		</Journal>
			
		<ArticleTitle>A review on attribute based access control in cloud environment</ArticleTitle>
		<FirstPage>53</FirstPage>
		<LastPage>72</LastPage>
		<Language>FA</Language>
		

	<AuthorList>
	<Author>
	<FirstName>Saeid</FirstName>
	<MiddleName></MiddleName>
	<LastName>Rezaei</LastName>
	<Affiliation>Shahed university</Affiliation>
	<AuthorEmails>s.rezaei@shahed.ac.ir</AuthorEmails>
	<CorrespondingAuthor>Y</CorrespondingAuthor>
	<ORCID></ORCID>
	 </Author>
	<Author>
	<FirstName>Mohammad Ali</FirstName>
	<MiddleName></MiddleName>
	<LastName>Doostari</LastName>
	<Affiliation>Shahed university</Affiliation>
	<AuthorEmails>doostari@shahed.ac.ir</AuthorEmails>
	<CorrespondingAuthor>N</CorrespondingAuthor>
	<ORCID></ORCID>
	 </Author>
	<Author>
	<FirstName>Majid</FirstName>
	<MiddleName></MiddleName>
	<LastName>Bayat</LastName>
	<Affiliation>Shahed university</Affiliation>
	<AuthorEmails>mbayat@shahed.ac.ir</AuthorEmails>
	<CorrespondingAuthor>N</CorrespondingAuthor>
	<ORCID></ORCID>
	 </Author>
	</AuthorList>
	<DOI></DOI>
	<Abstract>Cloud environment are known as a revolution in IT industry in the recent decade and many organizations have used this service for data processing and data storage. Despite of fast growing and numerous advantages, some organizations still do not use this service due to security problems and privacy issues related to storing sensitive data on the untrusted cloud servers. Access control management utilizing encryption techniques is one of the most common methods to solve these kinds of problems. Attribute based encryption is a new cryptographic model which uses descriptive attributes and access structures for managing access control. This article discusses the most recent methods of access control in cloud environment using attribute based encryption. We classify these protocols with respect of efficiently and security features. Finally, all the strengths and weaknesses points of reviewed articles are discussed and a comprehensive security and practical comparison is presented.</Abstract>
	<Keywords>Cloud computing, Attribute based encryption, Access control, Privacy, Data outsourcing </Keywords>

			<URLs>
				<abstract>http://monadi.isc.org.ir/article-1-68-en.html</abstract>
				<Fulltext>
					<pdf>http://monadi.isc.org.ir/article-1-68-en.pdf</pdf>
				</Fulltext>
			</URLs>
			
			
	</Article>
	
		<Article>
		<Journal>
			<PublisherName>انجمن رمز ایران</PublisherName>
			<JournalTitle>Biannual Journal Monadi for Cyberspace Security (AFTA)</JournalTitle>
			<PISSN>2476-3047</PISSN>
			<EISSN>2476-3047</EISSN>
			<Volume>5</Volume>
			<Issue>1</Issue>
			<PubDate PubStatus="epublish">
				<Year>2016</Year>
				<Month>9</Month>
				<Day>1</Day>
			</PubDate>
		</Journal>
			
		<ArticleTitle>A Trust Management Approach for Sybil Attack Detection in Wireless Sensor Networks</ArticleTitle>
		<FirstPage>73</FirstPage>
		<LastPage>83</LastPage>
		<Language>FA</Language>
		

	<AuthorList>
	<Author>
	<FirstName>Sayed Mohamamd</FirstName>
	<MiddleName></MiddleName>
	<LastName>Tabatabaei parsa</LastName>
	<Affiliation>Imam Reza International University</Affiliation>
	<AuthorEmails>m.tabatabaei.parsa@imamreza.ac.ir</AuthorEmails>
	<CorrespondingAuthor>Y</CorrespondingAuthor>
	<ORCID></ORCID>
	 </Author>
	<Author>
	<FirstName>Hassan</FirstName>
	<MiddleName></MiddleName>
	<LastName>Shakeri</LastName>
	<Affiliation>Mashhad Branch, Islamic Azad University</Affiliation>
	<AuthorEmails>shakeri@msdiau.ac.ir</AuthorEmails>
	<CorrespondingAuthor>N</CorrespondingAuthor>
	<ORCID></ORCID>
	 </Author>
	</AuthorList>
	<DOI></DOI>
	<Abstract>Wireless Sensor Networks (WSNs) are an ideal solution for miscellaneous applications of surveillance and control, such as traffic control, environmental monitoring, and battlefield surveillance. The wireless sensor nodes have limited memory and processing capability. The Sybil Attack is a serious threat in which a malicious node creates multiple fake identities in order to mislead the other sensor nodes. This attack can have influence on routing protocols and the operations like voting and data aggregation. In this paper, we present a dynamic and lightweight algorithm with a confidence-aware trust approach. The Algorithm uses the trust value of each sensor node to reduce the false alarm rates and detect indirect Sybil attacks in WSNs. The simulation results demonstrate that the average detection and wrong detection rates are 92% and 0.08% respectively.</Abstract>
	<Keywords>Wireless sensor networks, security, Sybil attack, trust management</Keywords>

			<URLs>
				<abstract>http://monadi.isc.org.ir/article-1-71-en.html</abstract>
				<Fulltext>
					<pdf>http://monadi.isc.org.ir/article-1-71-en.pdf</pdf>
				</Fulltext>
			</URLs>
			
			
	</Article>
 </ArticleSet>
 
  
  
  
  
 