<?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>6</Volume>
			<Issue>2</Issue>
			<PubDate PubStatus="epublish">
				<Year>2018</Year>
				<Month>3</Month>
				<Day>1</Day>
			</PubDate>
		</Journal>
			
		<ArticleTitle>A Survey on Lightweight Hardware Implementation of AES</ArticleTitle>
		<FirstPage>3</FirstPage>
		<LastPage>20</LastPage>
		<Language>FA</Language>
		

	<AuthorList>
	<Author>
	<FirstName>Mohsen</FirstName>
	<MiddleName></MiddleName>
	<LastName>Jahanbani</LastName>
	<Affiliation>Imam Hosain University</Affiliation>
	<AuthorEmails>mjahanbani@ihu.ac.ir</AuthorEmails>
	<CorrespondingAuthor>Y</CorrespondingAuthor>
	<ORCID></ORCID>
	 </Author>
	<Author>
	<FirstName>Nasour</FirstName>
	<MiddleName></MiddleName>
	<LastName>Bagheri</LastName>
	<Affiliation>Shahid Rajaei Teacher Training University</Affiliation>
	<AuthorEmails>nbagheri@srttu.edu</AuthorEmails>
	<CorrespondingAuthor>N</CorrespondingAuthor>
	<ORCID></ORCID>
	 </Author>
	<Author>
	<FirstName>Zeinolabedin</FirstName>
	<MiddleName></MiddleName>
	<LastName>Norozi</LastName>
	<Affiliation>Imam Hussein University</Affiliation>
	<AuthorEmails>znorozi@ihu.ac.ir</AuthorEmails>
	<CorrespondingAuthor>N</CorrespondingAuthor>
	<ORCID></ORCID>
	 </Author>
	</AuthorList>
	<DOI></DOI>
	<Abstract>Devices such as wireless sensor networks and RFIDs have limited memory, power and energy. They have security requirements so that the usual implementation of cryptographic algorithms is not appropriate for them and leads to high consumption of resources. One solution is designing new lightweight algorithms that have a lower security level than standard algorithms. The second solution is implementing standard algorithms such as AES block cipher as a lightweight algorithm. In this type of implementation, some techniques such as resource sharing, S-box implementation with combinational circuits, mapping computations finite fields from one base to another base and on the fly computation are used. In this paper, the most important lightweight implementations of AES are evaluated. The criteria considered for this evaluation include gate count, the number of clocks required for an encryption/decryption operation, throughput, power, energy and the combination of themes. Studies show that we can use standard encryption algorithms in applications with limited area between 2000-3000 GE and a small amount of energy, for example a few PJ. Some of these successes are achieved due to advancements in CMOS circuit technology and some others are the result of designing suitable hardware architecture, exact scheduling of cryptographic operations and efficient use of resources.
&#160;</Abstract>
	<Keywords>Lightweight Implementation, AES, Power, Energy, Gate Count, Clock </Keywords>

			<URLs>
				<abstract>http://monadi.isc.org.ir/article-1-94-en.html</abstract>
				<Fulltext>
					<pdf>http://monadi.isc.org.ir/article-1-94-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>6</Volume>
			<Issue>2</Issue>
			<PubDate PubStatus="epublish">
				<Year>2018</Year>
				<Month>3</Month>
				<Day>1</Day>
			</PubDate>
		</Journal>
			
		<ArticleTitle>Survey of Electronic Election Based on HomomorphicEncryption</ArticleTitle>
		<FirstPage>23</FirstPage>
		<LastPage>36</LastPage>
		<Language>FA</Language>
		

	<AuthorList>
	<Author>
	<FirstName>Sajad</FirstName>
	<MiddleName></MiddleName>
	<LastName>Rezaee Adaryani</LastName>
	<Affiliation></Affiliation>
	<AuthorEmails>sajjad21367@yahoo.com</AuthorEmails>
	<CorrespondingAuthor>Y</CorrespondingAuthor>
	<ORCID></ORCID>
	 </Author>
	<Author>
	<FirstName>Seyed Mahdi</FirstName>
	<MiddleName></MiddleName>
	<LastName>Sajjadieh</LastName>
	<Affiliation></Affiliation>
	<AuthorEmails>mahdisajadieh@yahoo.com</AuthorEmails>
	<CorrespondingAuthor>N</CorrespondingAuthor>
	<ORCID></ORCID>
	 </Author>
	<Author>
	<FirstName>Ali</FirstName>
	<MiddleName></MiddleName>
	<LastName>Zaghyan</LastName>
	<Affiliation></Affiliation>
	<AuthorEmails>ali_zaghian1338@yahoo.com</AuthorEmails>
	<CorrespondingAuthor>N</CorrespondingAuthor>
	<ORCID></ORCID>
	 </Author>
	</AuthorList>
	<DOI></DOI>
	<Abstract>Not only election is one of the significant issues in democratic societies, but also it can be used in commercial association such as stock market and it has a noteworthy feature to determine the board of the directors. According to progresses in cryptographic topics and asymmetric encryption systems, tremendous attempts have been made in the design of protocols for electronic elections. However, all of the designed protocols have either high complexity or weaknesses in security features. Since the majority of electronic election schemes are dependent on a number of honest persons, they are practically difficult. In addition, in most of them, voters will play a key role in producing ballot. If someone imposes compulsory, privacy will be lost or the voter will be able to provide a receipt to show the content of his vote, and this in turn, vote-buying and immoral issues will be appeared.&#160; 
In this paper after, evaluating the security features of an electronic election scheme, an election protocol based on homomorphic encryption, will be expressed, and &#160;the difference between the receipt&#160; protocol and receipt-free protocol will be&#160; examined.
&#160;</Abstract>
	<Keywords>Homomorphic encryption, Re-encryption, zero-knowledge proof, Elgamal encryption system, electronic elections, Receipt-Free </Keywords>

			<URLs>
				<abstract>http://monadi.isc.org.ir/article-1-102-en.html</abstract>
				<Fulltext>
					<pdf>http://monadi.isc.org.ir/article-1-102-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>6</Volume>
			<Issue>2</Issue>
			<PubDate PubStatus="epublish">
				<Year>2018</Year>
				<Month>3</Month>
				<Day>1</Day>
			</PubDate>
		</Journal>
			
		<ArticleTitle>A Confidence-Aware Trust Approach for Detecting Indirect Sybil Attacks in Wireless Sensor Networks Considering Time Factor</ArticleTitle>
		<FirstPage>37</FirstPage>
		<LastPage>50</LastPage>
		<Language>FA</Language>
		

	<AuthorList>
	<Author>
	<FirstName>Sayed Mohammad</FirstName>
	<MiddleName></MiddleName>
	<LastName>Tabatabaei Parsa</LastName>
	<Affiliation>Imam Reza International University</Affiliation>
	<AuthorEmails>m.tabatabaei.parsa@gmail.com</AuthorEmails>
	<CorrespondingAuthor>Y</CorrespondingAuthor>
	<ORCID></ORCID>
	 </Author>
	<Author>
	<FirstName>Hassan</FirstName>
	<MiddleName></MiddleName>
	<LastName>Shakeri</LastName>
	<Affiliation>Islamic Azad University</Affiliation>
	<AuthorEmails>shakeri@msdiau.ac.ir</AuthorEmails>
	<CorrespondingAuthor>N</CorrespondingAuthor>
	<ORCID></ORCID>
	 </Author>
	</AuthorList>
	<DOI></DOI>
	<Abstract>Wireless Sensor Networks (WSNs) gather the environmental information via some sensor nodes and send them after some simple processing functions if necessary. These nodes are constrained devices in terms of memory, processing capability, radio range, and energy. Due to the unattended deployment of sensor nodes and the nature of wireless communications, these networks are vulnerable to several attacks. Among these, the Sybil Attack is a serious threat in which a malicious node creates multiple fake identities in order to mislead the other sensor nodes. In this case, the malicious node can attract lots of traffic and disrupt routing protocols. In this paper, we present a confidence-aware trust model considering Time Factor to detect such attacks. In this model, we use the indirect trust, gained from the neighbors&#39; recommendations, in order to detect the indirect Sybil attacks, in which a legal node is not directly associated with the Sybil node. The Algorithm has been implemented using MATLAB. The simulation results demonstrate significant preference of the proposed method in terms of detection accuracy and false alarm rates. The average rate of detection and false detection of the proposed model are 93% and 0.26%.</Abstract>
	<Keywords>wireless sensor networks, security, sybil attack, trust management, confidence-Aware Trust</Keywords>

			<URLs>
				<abstract>http://monadi.isc.org.ir/article-1-111-en.html</abstract>
				<Fulltext>
					<pdf>http://monadi.isc.org.ir/article-1-111-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>6</Volume>
			<Issue>2</Issue>
			<PubDate PubStatus="epublish">
				<Year>2018</Year>
				<Month>3</Month>
				<Day>1</Day>
			</PubDate>
		</Journal>
			
		<ArticleTitle>A Review on Website Fingerprinting Attacks</ArticleTitle>
		<FirstPage>51</FirstPage>
		<LastPage>64</LastPage>
		<Language>FA</Language>
		

	<AuthorList>
	<Author>
	<FirstName>Maryam</FirstName>
	<MiddleName></MiddleName>
	<LastName>Taebi</LastName>
	<Affiliation>University of Isfahan</Affiliation>
	<AuthorEmails>m.taebi@eng.ui.ac.ir</AuthorEmails>
	<CorrespondingAuthor>N</CorrespondingAuthor>
	<ORCID></ORCID>
	 </Author>
	<Author>
	<FirstName>Ali</FirstName>
	<MiddleName></MiddleName>
	<LastName>Bohlooli</LastName>
	<Affiliation>University of Isfahan</Affiliation>
	<AuthorEmails>bohlooli@eng.ui.ac.ir</AuthorEmails>
	<CorrespondingAuthor>Y</CorrespondingAuthor>
	<ORCID></ORCID>
	 </Author>
	<Author>
	<FirstName>Marjan</FirstName>
	<MiddleName></MiddleName>
	<LastName>Kaedi</LastName>
	<Affiliation>University of Isfahan</Affiliation>
	<AuthorEmails>kaedi@eng.ui.ac.ir</AuthorEmails>
	<CorrespondingAuthor>N</CorrespondingAuthor>
	<ORCID></ORCID>
	 </Author>
	</AuthorList>
	<DOI></DOI>
	<Abstract>In Website Fingerprinting (WFP) Attacks, clients&#8217; destination webpages are identified using traffic analysis techniques, without any need to decrypt traffic contents. Typically, clients make use of the privacy enhancing technologies (e.g., VPNs, proxies, and anonymity networks) to browse webpages. These technologies allow clients to hide traffic contents and their real destinations. To perform an attack, features are extracted from the input packet sequence. Next, the data is pre-processed and finally, client&#8217;s real destination is revealed by means of a machine learning algorithm. Various studies have utilized statistical methods or classification approaches to infer the client&#8217;s visited webpages. In this paper, a comprehensive overview of WFP techniques is performed, in which previous studies are categorized based on the features they use for webpages identification. This is a new approach for categorizing previous works on WFP attacks and to the best of our knowledge, this viewpoint has not been applied so far.
&#160;</Abstract>
	<Keywords>Website Fingerprinting Attack, Traffic Analysis, Machine Learning, Classification, Feature Extraction</Keywords>

			<URLs>
				<abstract>http://monadi.isc.org.ir/article-1-112-en.html</abstract>
				<Fulltext>
					<pdf>http://monadi.isc.org.ir/article-1-112-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>6</Volume>
			<Issue>2</Issue>
			<PubDate PubStatus="epublish">
				<Year>2018</Year>
				<Month>3</Month>
				<Day>1</Day>
			</PubDate>
		</Journal>
			
		<ArticleTitle>Risk Management in Local Search Engine Systems</ArticleTitle>
		<FirstPage>65</FirstPage>
		<LastPage>84</LastPage>
		<Language>FA</Language>
		

	<AuthorList>
	<Author>
	<FirstName>Mahsa</FirstName>
	<MiddleName></MiddleName>
	<LastName>Omidvar Sarkandi</LastName>
	<Affiliation>Iran Telecommunication Research Center</Affiliation>
	<AuthorEmails>mahsa.omidvarsarkandi@gmail.com</AuthorEmails>
	<CorrespondingAuthor>Y</CorrespondingAuthor>
	<ORCID></ORCID>
	 </Author>
	<Author>
	<FirstName>Nasrin</FirstName>
	<MiddleName></MiddleName>
	<LastName>Taj Neyshabouri</LastName>
	<Affiliation>Iran Telecommunication Research Center</Affiliation>
	<AuthorEmails></AuthorEmails>
	<CorrespondingAuthor>N</CorrespondingAuthor>
	<ORCID></ORCID>
	 </Author>
	<Author>
	<FirstName>Hassan</FirstName>
	<MiddleName></MiddleName>
	<LastName>Koushkaki</LastName>
	<Affiliation>Iran Telecommunication Research Center</Affiliation>
	<AuthorEmails></AuthorEmails>
	<CorrespondingAuthor>N</CorrespondingAuthor>
	<ORCID></ORCID>
	 </Author>
	<Author>
	<FirstName>Shaghayegh</FirstName>
	<MiddleName></MiddleName>
	<LastName>Naderi</LastName>
	<Affiliation>Iran Telecommunication Research Center</Affiliation>
	<AuthorEmails></AuthorEmails>
	<CorrespondingAuthor>N</CorrespondingAuthor>
	<ORCID></ORCID>
	 </Author>
	</AuthorList>
	<DOI></DOI>
	<Abstract>Abstarct- The local search engine systems is one of the indicators of IT industry development in all countries. The safety of these systems arises according to its specific position, with providing users to access to right information in the least possible time. The most effective measures to secure this type of application are assessment and risk management in the early stage of software security. It consists of a set of steps that will help a software team in the applications management during the development process. In order to reduce the risk of this type of systems responce to risk approach is selected. The main objective of this article is assessment and risk management based on information collected from designed questionnaire. As well as to identify important risks, security controls and NIST methodology are used and the results of calculations of the risk level are provided on the basis of known fields.</Abstract>
	<Keywords>Local Search Engines, NIST Risk Management Methodology, Risk, Threat.</Keywords>

			<URLs>
				<abstract>http://monadi.isc.org.ir/article-1-87-en.html</abstract>
				<Fulltext>
					<pdf>http://monadi.isc.org.ir/article-1-87-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>6</Volume>
			<Issue>2</Issue>
			<PubDate PubStatus="epublish">
				<Year>2018</Year>
				<Month>3</Month>
				<Day>1</Day>
			</PubDate>
		</Journal>
			
		<ArticleTitle>A review of privacy in online social networks</ArticleTitle>
		<FirstPage>85</FirstPage>
		<LastPage>102</LastPage>
		<Language>FA</Language>
		

	<AuthorList>
	<Author>
	<FirstName>Kamaleddin</FirstName>
	<MiddleName></MiddleName>
	<LastName>Ghezavati</LastName>
	<Affiliation>Malek-e-Ashtar University of Technology</Affiliation>
	<AuthorEmails>kghazavati@yahoo.com</AuthorEmails>
	<CorrespondingAuthor>Y</CorrespondingAuthor>
	<ORCID></ORCID>
	 </Author>
	<Author>
	<FirstName>Alireza</FirstName>
	<MiddleName></MiddleName>
	<LastName>Nowroozi</LastName>
	<Affiliation>Sharif University of Technology</Affiliation>
	<AuthorEmails>nowroozi@ce.sharif.edu</AuthorEmails>
	<CorrespondingAuthor>N</CorrespondingAuthor>
	<ORCID></ORCID>
	 </Author>
	</AuthorList>
	<DOI></DOI>
	<Abstract>Online social networks (OSNs) is one of the most popular medium for communicating, sharing, and publishing a considerable amount of information. OSN popularity often faces the challenge of dealing with unwanted messages and hidden malicious purposes in it. Based on recent studies, social network users can easily expose their confidential details with others. Misuse of this information can cause damage in virtual and real world. In this paper, main categories attacks are given on social network online security and privacy in four categories classic, modern, hybrid and children special attacks and ways that can be used to protect against different types of attacks used OSN users is the social network operators, security companies, and researchers are provided. Finally, eight ways to prevent these threats is presented.
&#160;</Abstract>
	<Keywords>Online social networks, social network threats, privacy, security</Keywords>

			<URLs>
				<abstract>http://monadi.isc.org.ir/article-1-73-en.html</abstract>
				<Fulltext>
					<pdf>http://monadi.isc.org.ir/article-1-73-en.pdf</pdf>
				</Fulltext>
			</URLs>
			
			
	</Article>
 </ArticleSet>
 
  
  
  
  
 