<?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>8</Volume>
			<Issue>1</Issue>
			<PubDate PubStatus="epublish">
				<Year>2019</Year>
				<Month>9</Month>
				<Day>1</Day>
			</PubDate>
		</Journal>
			
		<ArticleTitle>A survey of rumor detection methods in social networks</ArticleTitle>
		<FirstPage>3</FirstPage>
		<LastPage>14</LastPage>
		<Language>FA</Language>
		

	<AuthorList>
	<Author>
	<FirstName>Fariba</FirstName>
	<MiddleName></MiddleName>
	<LastName>Sadeghi</LastName>
	<Affiliation>University of Qom</Affiliation>
	<AuthorEmails>F.Sadeghi@stu.qom.ac.ir</AuthorEmails>
	<CorrespondingAuthor>N</CorrespondingAuthor>
	<ORCID></ORCID>
	 </Author>
	<Author>
	<FirstName>Amir</FirstName>
	<MiddleName></MiddleName>
	<LastName>Jalaly Bidgoly</LastName>
	<Affiliation>University of Qom</Affiliation>
	<AuthorEmails>jalaly@qom.ac.ir</AuthorEmails>
	<CorrespondingAuthor>Y</CorrespondingAuthor>
	<ORCID></ORCID>
	 </Author>
	</AuthorList>
	<DOI></DOI>
	<Abstract>Rumors, are unverified and often erroneous news that are widely propagated at the community level, discrediting or falsely increasing the trust of nodes in a network to an entity or subject. With the rise social networks in recent years, despite their positive uses, propagating rumors have become easier and more common. Rumors are a class of security challenges on social media, since a malicious node can easily disparage or isolate its goals by spreading a rumor. Therefore, rumors detection is an important challenge in soft security mechanisms such as trust and reputation. Researchers have come up with different methods for modeling, detecting and preventing rumors. In this study, rumor detection methods in social networks will be reviewed. First, we will briefly review the features used in previous research, then we will examine the approaches used and introduce the most commonly used Dataset. Finally, the challenges that exist for the future research in exploring social media to identify and resolve rumors are presented.</Abstract>
	<Keywords>Rumor Detection, Social Media, Machine Learning, Neural Network</Keywords>

			<URLs>
				<abstract>http://monadi.isc.org.ir/article-1-139-en.html</abstract>
				<Fulltext>
					<pdf>http://monadi.isc.org.ir/article-1-139-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>8</Volume>
			<Issue>1</Issue>
			<PubDate PubStatus="epublish">
				<Year>2019</Year>
				<Month>9</Month>
				<Day>1</Day>
			</PubDate>
		</Journal>
			
		<ArticleTitle>Sponge structure; an introduction and its applications</ArticleTitle>
		<FirstPage>15</FirstPage>
		<LastPage>30</LastPage>
		<Language>FA</Language>
		

	<AuthorList>
	<Author>
	<FirstName></FirstName>
	<MiddleName></MiddleName>
	<LastName></LastName>
	<Affiliation></Affiliation>
	<AuthorEmails></AuthorEmails>
	<CorrespondingAuthor>N</CorrespondingAuthor>
	<ORCID></ORCID>
	 </Author>
	<Author>
	<FirstName></FirstName>
	<MiddleName></MiddleName>
	<LastName></LastName>
	<Affiliation></Affiliation>
	<AuthorEmails></AuthorEmails>
	<CorrespondingAuthor>N</CorrespondingAuthor>
	<ORCID></ORCID>
	 </Author>
	<Author>
	<FirstName></FirstName>
	<MiddleName></MiddleName>
	<LastName></LastName>
	<Affiliation></Affiliation>
	<AuthorEmails>orumiehchiha@rcdat.ir</AuthorEmails>
	<CorrespondingAuthor>Y</CorrespondingAuthor>
	<ORCID></ORCID>
	 </Author>
	</AuthorList>
	<DOI></DOI>
	<Abstract>Designing a wide range of encryption algorithms using the sponge structure is reduced only by designing a transform or permutation. Designer specifies a transformation or permutation and then form a hash function, stream cipher, authenticated encryption algorithm and pseudo random number generator. Also, exploiting one single transformation or permutation simplifies the implementation of derived algorithms and gives other advantages such as provable security and better understanding of security of designs. This paper provides a quick introduction to design the sponge structure and explains some cryptographic applications and security requirements.</Abstract>
	<Keywords>sponge structure, stream cipher, Hash function, authenticated encryption algorithm</Keywords>

			<URLs>
				<abstract>http://monadi.isc.org.ir/article-1-130-en.html</abstract>
				<Fulltext>
					<pdf>http://monadi.isc.org.ir/article-1-130-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>8</Volume>
			<Issue>1</Issue>
			<PubDate PubStatus="epublish">
				<Year>2019</Year>
				<Month>9</Month>
				<Day>1</Day>
			</PubDate>
		</Journal>
			
		<ArticleTitle>A Review of Consensus Algorithms in Blockchain</ArticleTitle>
		<FirstPage>31</FirstPage>
		<LastPage>42</LastPage>
		<Language>FA</Language>
		

	<AuthorList>
	<Author>
	<FirstName>jamileh</FirstName>
	<MiddleName></MiddleName>
	<LastName>bahri</LastName>
	<Affiliation>Teacher Training University of Shahid Rajaee University</Affiliation>
	<AuthorEmails>jamilebahri@yahoo.com</AuthorEmails>
	<CorrespondingAuthor>Y</CorrespondingAuthor>
	<ORCID></ORCID>
	 </Author>
	<Author>
	<FirstName>hamidreza</FirstName>
	<MiddleName></MiddleName>
	<LastName>shayeghbrojeni</LastName>
	<Affiliation>Teacher Training University of Shahid Rajaee University</Affiliation>
	<AuthorEmails>hamid.shayegh@gmail.com</AuthorEmails>
	<CorrespondingAuthor>N</CorrespondingAuthor>
	<ORCID></ORCID>
	 </Author>
	</AuthorList>
	<DOI></DOI>
	<Abstract>Blockchain technology is a decentralized data structure based on a chain to the ledger of interconnected data blocks. Blockchain stores new blocks in the ledger without having to rely on intermediaries in a competitive or voting mechanism. Due to the chain structure or graph between each block and its previous block, it is impossible to modify blockchain data. Blockchain architecture provides trust in a peer-to-peer network through nodes on the network according to different consensus algorithms. In this article, we intend to describe the mechanism of each consensus-based, voting-based, and distant-oriented graph consensus algorithm.</Abstract>
	<Keywords>Blockchain, Consensus, Decentralized Systems, Digital currency</Keywords>

			<URLs>
				<abstract>http://monadi.isc.org.ir/article-1-131-en.html</abstract>
				<Fulltext>
					<pdf>http://monadi.isc.org.ir/article-1-131-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>8</Volume>
			<Issue>1</Issue>
			<PubDate PubStatus="epublish">
				<Year>2019</Year>
				<Month>9</Month>
				<Day>1</Day>
			</PubDate>
		</Journal>
			
		<ArticleTitle>Criminology Analysis of Cybercrime</ArticleTitle>
		<FirstPage>43</FirstPage>
		<LastPage>56</LastPage>
		<Language>FA</Language>
		

	<AuthorList>
	<Author>
	<FirstName></FirstName>
	<MiddleName></MiddleName>
	<LastName></LastName>
	<Affiliation></Affiliation>
	<AuthorEmails>moshir.alireza@yahoo.com</AuthorEmails>
	<CorrespondingAuthor>Y</CorrespondingAuthor>
	<ORCID></ORCID>
	 </Author>
	</AuthorList>
	<DOI></DOI>
	<Abstract>The formation and development of the World Wide Web has played a key role in the emergence of new criminals and crimes. The increasing dependence of countries on the Internet and the rapid development of new technologies have also added to the vulnerability. However, despite many advances in the material field, human societies have not been well served by the legal and cybercrime. This has led to a controversial challenge in criminologist research over the past two decades And become a growing concern for public policy; Therefore, it is necessary to take into account all the necessary aspects in order to properly understand and prevent these crimes. &#160;In this article, we intend to explain the concept, characteristics and challenges of cybercrime, and to take preventive measures and to tackle them.</Abstract>
	<Keywords>Cybercrime, Cyber environment, Criminal prevention, Non-criminal prevention</Keywords>

			<URLs>
				<abstract>http://monadi.isc.org.ir/article-1-117-en.html</abstract>
				<Fulltext>
					<pdf>http://monadi.isc.org.ir/article-1-117-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>8</Volume>
			<Issue>1</Issue>
			<PubDate PubStatus="epublish">
				<Year>2019</Year>
				<Month>9</Month>
				<Day>1</Day>
			</PubDate>
		</Journal>
			
		<ArticleTitle>A New Hybrid Approach of K-Nearest Neighbors Algorithm with Particle Swarm Optimization for E-Mail Spam Detection</ArticleTitle>
		<FirstPage>57</FirstPage>
		<LastPage>72</LastPage>
		<Language>FA</Language>
		

	<AuthorList>
	<Author>
	<FirstName>Atefeh</FirstName>
	<MiddleName></MiddleName>
	<LastName>Mortazavi</LastName>
	<Affiliation>Department of Computer Engineering, Urmia Branch, Islamic Azad University, Urmia, IRAN</Affiliation>
	<AuthorEmails>ati.mortazavi67@gmail.com</AuthorEmails>
	<CorrespondingAuthor>N</CorrespondingAuthor>
	<ORCID></ORCID>
	 </Author>
	<Author>
	<FirstName>farhad</FirstName>
	<MiddleName></MiddleName>
	<LastName>Soleimanian Gharehchopogh</LastName>
	<Affiliation>Department of Computer Engineering, Urmia Branch, Islamic Azad University, Urmia, IRAN</Affiliation>
	<AuthorEmails>farhad@iaurmia.ac.ir</AuthorEmails>
	<CorrespondingAuthor>Y</CorrespondingAuthor>
	<ORCID></ORCID>
	 </Author>
	</AuthorList>
	<DOI></DOI>
	<Abstract>Emails are one of the fastest economic communications. Increasing email users has caused the increase of spam in recent years. As we know, spam not only damages user&#8217;s profits, time-consuming and bandwidth, but also has become as a risk to efficiency, reliability, and security of a network. Spam developers are always trying to find ways to escape the existing filters, therefore new filters to detect spams need to be developed. Most of these filters take advantage of a combination of several methods, such as black or white lists, using keywords, rule-based filters, machine learning methods and so on, to identify spams more accurately. many approaches about email spam detection exhausted up to now. In this paper, we propose a new approach for spam detection based on Particle Swarm Optimization Algorithm and K-Nearest Neighbor optimization, and we measure performance based on Accuracy, Precision, Recall, And f-measure. The results show that the proposed approach has a better performance than other models and the basic algorithms.</Abstract>
	<Keywords>K-Nearest Neighbor optimization, Particle Swarm Optimization Algorithm, E-mail Spam, Spam Detection, Optimization</Keywords>

			<URLs>
				<abstract>http://monadi.isc.org.ir/article-1-152-en.html</abstract>
				<Fulltext>
					<pdf>http://monadi.isc.org.ir/article-1-152-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>8</Volume>
			<Issue>1</Issue>
			<PubDate PubStatus="epublish">
				<Year>2019</Year>
				<Month>9</Month>
				<Day>1</Day>
			</PubDate>
		</Journal>
			
		<ArticleTitle>An Overview of the Methods for Enhancing the Communication Security in Designing Quantum-dot Cellular Automata Circuits</ArticleTitle>
		<FirstPage>73</FirstPage>
		<LastPage>83</LastPage>
		<Language>FA</Language>
		

	<AuthorList>
	<Author>
	<FirstName></FirstName>
	<MiddleName></MiddleName>
	<LastName></LastName>
	<Affiliation></Affiliation>
	<AuthorEmails>Stu.SaeidSeyedi@iaut.ac.ir</AuthorEmails>
	<CorrespondingAuthor>N</CorrespondingAuthor>
	<ORCID></ORCID>
	 </Author>
	<Author>
	<FirstName></FirstName>
	<MiddleName></MiddleName>
	<LastName></LastName>
	<Affiliation></Affiliation>
	<AuthorEmails>jafari@iaut.ac.ir</AuthorEmails>
	<CorrespondingAuthor>Y</CorrespondingAuthor>
	<ORCID></ORCID>
	 </Author>
	</AuthorList>
	<DOI></DOI>
	<Abstract>Semiconductor metal oxide technology complements a popular and pervasive approach in the design of electronic and digital circuits, but in this technology, reduction at the sub-micron level is simply not feasible; therefore, quantum-dot cellular automata nanotechnology as a new way to design digital circuits and reduce power consumption was introduced. At the nanoscale, quantum-dot cellular automata cells represent a novel way of performing calculations by transmitting information through quantum cell interactions. Small dimensions, high speed, low power consumption, and low latency are the main features of this technology. Designing high-security circuits in nano-scale quantum-dot cellular automata technology is important for designers, considering the intercellular communication, low power consumption, and optimal power consumption. Therefore, this paper first describes the quantum-dot cellular automata at the nano level and then quantum cells, then important structures in this technology, timing and important points in the quantum-dot cellular automata circuit have been discussed and reviewed. In the field of security, such as cryptographic circuits, interconnections have been made at the nanotechnology of quantum-dot cellular automata technology. Finally, their structures, circuits, and performance are analyzed. The results showed that by applying some methods such as Feynman gate reversible logic, Fredkin circuit reversible key and decoding encoding process, the safety and reliability of nano-communications based on quantum-dot cellular automata technology can be increased.</Abstract>
	<Keywords>Security, Quantum-dot cellular automata, Nano-Technology, Nano-based Communication</Keywords>

			<URLs>
				<abstract>http://monadi.isc.org.ir/article-1-96-en.html</abstract>
				<Fulltext>
					<pdf>http://monadi.isc.org.ir/article-1-96-en.pdf</pdf>
				</Fulltext>
			</URLs>
			
			
	</Article>
 </ArticleSet>
 
  
  
  
  
 