Volume 12 (2020)
Volume 11 (2019)
Volume 10 (2018)
Volume 9 (2017)
Volume 8 (2016)
Volume 7 (2015)
Volume 6 (2014)
Volume 5 (2013)
Volume 4 (2012)
Volume 3 (2011)
Volume 2 (2010)
Volume 1 (2009)
51. Role and Application of RFID Technology in Internet of Things: Communication, Authentication, Risk, and Security Concerns

Saadi Hadjer; Yagoub Mustapha C.E.; Rachida TOUHAMI

Volume 11, Issue 3 , Summer and Autumn 2019, , Pages 9-17

http://dx.doi.org/10.22042/isecure.2019.11.0.2

Abstract
  The Internet of Things (IoT) is a very encouraging and fast-growing area that brings together the benefits of wireless systems, sensor networks, actuators, etc.A wide range of IoT applications have been targeted and several aspects of this field have been identified to address specific issues, ...  Read More

52. A particle swarm optimization algorithm for minimization analysis of cost-sensitive attack graphs

M. Abadi; S. Jalili

Volume 2, Issue 1 , Winter and Spring 2010, , Pages 13-32

http://dx.doi.org/10.22042/isecure.2015.2.1.3

Abstract
  To prevent an exploit, the security analyst must implement a suitable countermeasure. In this paper, we consider cost-sensitive attack graphs (CAGs) for network vulnerability analysis. In these attack graphs, a weight is assigned to each countermeasure to represent the cost of its implementation. There ...  Read More

53. On the multi _ chi-square tests and their data complexity

A. Vardasbi; M. Salmasizadeh; J. Mohajeri

Volume 4, Issue 1 , Winter and Spring 2012, , Pages 15-24

http://dx.doi.org/10.22042/isecure.2015.4.1.3

Abstract
  Chi-square tests are generally used for distinguishing purposes; however when they are combined to simultaneously test several independent variables, extra notation is required. In this study, the chi-square statistics in some previous works is revealed to be computed half of its real value. Therefore, ...  Read More

54. A novel local search method for microaggregation

R. Mortazavi; S. Jalili

Volume 7, Issue 1 , Winter and Spring 2015, , Pages 15-26

http://dx.doi.org/10.22042/isecure.2015.7.1.3

Abstract
  In this paper, we propose an effective microaggregation algorithm to produce a more useful protected data for publishing. Microaggregation is mapped to a clustering problem with known minimum and maximum group size constraints. In this scheme, the goal is to cluster n records into groups of at least ...  Read More

55. An Incentive-Aware Lightweight Secure Data Sharing Scheme for D2D Communication in 5G Cellular Networks

A. Mohseni-Ejiyeh; M. Ashouri-Talouki; M. Mahdavi

Volume 10, Issue 1 , Winter and Spring 2018, , Pages 15-27

http://dx.doi.org/10.22042/isecure.2018.111195.401

Abstract
  Due to the explosion of smart devices, data traffic over cellular networks has seen an exponential rise in recent years. This increase in mobile data traffic has caused an immediate need for offloading traffic from operators. Device-to-Device(D2D) communication is a promising solution to boost the ...  Read More

56. SESOS: A Verifiable Searchable Outsourcing Scheme for Ordered Structured Data in Cloud Computing

Javad Ghareh Chamani; Mohammad Sadeq Dousti; Rasool Jalili; Dimitrios Papadopoulos

Volume 11, Issue 1 , Winter and Spring 2019, , Pages 15-34

http://dx.doi.org/10.22042/isecure.2019.148637.430

Abstract
  While cloud computing is growing at a remarkable speed, privacy issues are far from being solved. One way to diminish privacy concerns is to store data on the cloud in encrypted form. However, encryption often hinders useful computation cloud services. A theoretical approach is to employ the so-called ...  Read More

57. Steganalysis of embedding in difference of image pixel pairs by neural network

V. Sabeti; Sh. Samavi; M. Mahdavi; Sh. Shirani

Volume 1, Issue 1 , Winter and Spring 2009, , Pages 17-26

http://dx.doi.org/10.22042/isecure.2015.1.1.3

Abstract
  In this paper a steganalysis method is proposed for pixel value differencing method. This steganographic method, which has been immune against conventional attacks, performs the embedding in the difference of the values of pixel pairs. Therefore, the histogram of the differences of an embedded image ...  Read More

58. Side channel parameter characteristics of code injection attacks

E. Aerabi; M. Kaykha; M. Fazeli; A. Patooghy; A. Akbari

Volume 9, Issue 1 , Winter and Spring 2017, , Pages 17-26

http://dx.doi.org/10.22042/isecure.2017.0.0.5

Abstract
  Embedded systems are suggestive targets for code injection attacks in the recent years. Software protection mechanisms, and in general computers, are not usually applicable in embedded systems since they have limited resources like memory and process power. In this paper we investigate side channel characteristics ...  Read More

59. Total break of Zorro using linear and differential attacks

Sh. Rasoolzadeh; Z. Ahmadian; M. Salmasizadeh; M. R. Aref

Volume 6, Issue 1 , Winter and Spring 2014, , Pages 23-34

http://dx.doi.org/10.22042/isecure.2014.6.1.3

Abstract
  An AES-like lightweight block cipher, namely Zorro, was proposed in CHES 2013. While it has a 16-byte state, it uses only 4 S-Boxes per round. This weak nonlinearity was widely criticized, insofar as it has been directly exploited in all the attacks on Zorro reported by now, including the weak key, reduced ...  Read More

60. New High Secure Network Steganography Method Based on Packet Length

Vajiheh Sabeti; Minoo Shoaei

Volume 12, Issue 1 , Winter and Spring 2020, , Pages 24-44

http://dx.doi.org/10.22042/isecure.2020.194573.475

Abstract
  In network steganography methods based on packet length, the length of the packets is used as a carrier for exchanging secret messages. Existing methods in this area are vulnerable against detections due to abnormal network traffic behaviors. The main goal of this paper is to propose a method which has ...  Read More

61. On the design and security of a lattice-based threshold secret sharing scheme

H. R. Amini Khorasgani; S. Asaad; H. Pilaram; T. Eghlidos; M. R. Aref

Volume 8, Issue 1 , Winter and Spring 2016, , Pages 25-38

http://dx.doi.org/10.22042/isecure.2016.8.1.2

Abstract
  In this paper, we introduce a method of threshold secret sharing scheme (TSSS) in which secret reconstruction is based on Babai's nearest plane algorithm. In order to supply secure public channels for transmitting shares to parties, we need to ensure that there are no quantum threats to these channels. ...  Read More

62. QTRU: quaternionic version of the NTRU public-key cryptosystems

E. Malekian; A. Zakerolhosseini; A. Mashatan

Volume 3, Issue 1 , Winter and Spring 2011, , Pages 29-42

http://dx.doi.org/10.22042/isecure.2015.3.1.3

Abstract
  In this paper we will construct a lattice-based public-key cryptosystem using non-commutative quaternion algebra, and since its lattice does not fully fit within Circular and Convolutional Modular Lattice (CCML), we prove it is arguably more secure than the existing lattice-based cryptosystems such as ...  Read More

63. Design and formal verification of DZMBE+

M. Soodkhah Mohammadi; A. Ghaemi Bafghi

Volume 5, Issue 1 , Winter and Spring 2013, , Pages 37-53

http://dx.doi.org/10.22042/isecure.2013.5.1.3

Abstract
  In this paper, a new broadcast encryption scheme is presented based on threshold secret sharing and secure multiparty computation. This scheme is maintained to be dynamic in that a broadcaster can broadcast a message to any of the dynamic groups of users in the system and it is also fair in the sense ...  Read More

64. Alert correlation and prediction using data mining and HMM

H. Farhadi; M. AmirHaeri; M. Khansari

Volume 3, Issue 2 , Summer and Autumn 2011, , Pages 77-101

http://dx.doi.org/10.22042/isecure.2015.3.2.3

Abstract
  Intrusion Detection Systems (IDSs) are security tools widely used in computer networks. While they seem to be promising technologies, they pose some serious drawbacks: When utilized in large and high traffic networks, IDSs generate high volumes of low-level alerts which are hardly manageable. Accordingly, ...  Read More

65. A Fast Publicly Verifiable Secret Sharing Scheme using Non-homogeneous Linear Recursions

Ali Zaghian; Bagher Bagherpour

Volume 12, Issue 2 , Summer and Autumn 2020, , Pages 79-87

http://dx.doi.org/10.22042/isecure.2020.212763.505

Abstract
  A non-interactive (t,n)-publicly veri able secret sharing scheme (non-interactive (t,n)-PVSS scheme) is a (t,n)-secret sharing scheme in which anyone, not only the participants of the scheme, can verify the correctness of the produced shares without interacting with the dealer and participants. The (t,n)-PVSS ...  Read More

66. An efficient symmetric polynomial-based key establishment protocol for wireless sensor networks

A. Fanian; M. Berenjkoub; H. Saidi; T. A. Gulliver

Volume 2, Issue 2 , Summer and Autumn 2010, , Pages 89-105

http://dx.doi.org/10.22042/isecure.2015.2.2.3

Abstract
  An essential requirement for providing secure services in wireless sensor networks is the ability to establish pairwise keys among sensors. Due to resource constraints on the sensors, the key establishment scheme should not create significant overhead. To date, several key establishment schemes have ...  Read More

67. Security testing of session initiation protocol implementations

I. G. Harris; T. Alrahem; A. Chen; N. DiGiuseppe; J. Gee; Sh. P. Hsiao; S. Mattox; T. Park; S. Selvaraj; A. Tam; M. Carlsson

Volume 1, Issue 2 , Summer and Autumn 2009, , Pages 91-103

http://dx.doi.org/10.22042/isecure.2015.1.2.3

Abstract
  The mechanisms which enable the vast majority of computer attacks are based on design and programming errors in networked applications. The growing use of voice over IP (VOIP) phone technology makes these phone applications potential targets. We present a tool to perform security testing of VOIP applications ...  Read More

68. Impossible Differential Cryptanalysis on Deoxys-BC-256

F. Moazami; A.R. Mehrdad; H. Soleimany

Volume 10, Issue 2 , Summer and Autumn 2018, , Pages 93-105

http://dx.doi.org/10.22042/isecure.2018.114245.405

Abstract
  Deoxys is a final-round candidate of the CAESAR competition. Deoxys is built upon an internal tweakable block cipher Deoxys-BC, where in addition to the plaintext and key, it takes an extra non-secret input called a tweak. This paper presents the first impossible differential cryptanalysis of Deoxys-BC-256 ...  Read More

69. Efficient implementation of low time complexity and pipelined bit-parallel polynomial basis multiplier over binary finite fields

B. Rashidi; R. Rezaeian Farashahi; S. M. Sayedi

Volume 7, Issue 2 , Summer and Autumn 2015, , Pages 101-114

http://dx.doi.org/10.22042/isecure.2016.7.2.3

Abstract
  This paper presents two efficient implementations of fast and pipelined bit-parallel polynomial basis multipliers over GF (2m) by irreducible pentanomials and trinomials. The architecture of the first multiplier is based on a parallel and independent computation of powers of the polynomial variable. ...  Read More

70. Traceability improvements of a new RFID protocol based on EPC C1 G2

S. Sajjadi Ghaemmaghami; A. Haghbin; M. Mirmohseni

Volume 8, Issue 2 , Summer and Autumn 2016, , Pages 105-114

http://dx.doi.org/10.22042/isecure.2016.8.2.2

Abstract
  Radio Frequency Identification (RFID) applications have spread all over the world. In order to provide their security and privacy, researchers proposed different kinds of protocols. In this paper, we analyze the privacy of a new protocol, proposed by Yu-Jehn in 2015 which is based on Electronic Product ...  Read More

71. Cryptanalysis of GSM encryption algorithm A5/1

V. Amin Ghafari; A. Vardasbi; J. Mohajeri

Volume 4, Issue 2 , Summer and Autumn 2012, , Pages 107-114

http://dx.doi.org/10.22042/isecure.2013.4.2.2

Abstract
  The A5/1 algorithm is one of the most famous stream cipher algorithms used for over-the-air communication privacy in GSM. The purpose of this paper is to analyze several weaknesses of A5/1, including an improvement to an attack and investigation of the A5/1 state transition. Biham and Dunkelman proposed ...  Read More

72. An efficient secure channel coding scheme based on polar codes

B. Mafakheri; T. Eghlidos; H. Pilaram

Volume 9, Issue 2 , Summer and Autumn 2017, , Pages 111-118

http://dx.doi.org/10.22042/isecure.2017.84609.380

Abstract
  In this paper, we propose a new framework for joint encryption encoding scheme based on polar codes, namely efficient and secure joint secret key encryption channel coding scheme. The issue of using new coding structure, i.e. polar codes in Rao-Nam (RN) like schemes is addressed. Cryptanalysis methods ...  Read More

73. A Lightweight Privacy-preserving Authenticated Key Exchange Scheme for Smart Grid Communications

Majid Bayat; Zahra Zare Jousheghani; Ashok Kumar Das; Pitam Singh; Saru Kumari; Mohammad Reza Aref

Volume 11, Issue 2 , Summer and Autumn 2019, , Pages 113-128

http://dx.doi.org/10.22042/isecure.2019.161366.445

Abstract
  Smart grid concept is introduced to modify the power grid by utilizing new information and communication technology. Smart grid needs live power consumption monitoring to provide required services and for this issue, bi-directional communication is essential. Security and privacy are the most important ...  Read More

74. Artemia: a family of provably secure authenticated encryption schemes

J. Alizadeh; M. R. Aref; N. Bagheri

Volume 6, Issue 2 , Summer and Autumn 2014, , Pages 125-139

http://dx.doi.org/10.22042/isecure.2015.6.2.3

Abstract
  Authenticated encryption schemes establish both privacy and authenticity. This paper specifies a family of the dedicated authenticated encryption schemes, Artemia. It is an online nonce-based authenticated encryption scheme which supports the associated data. Artemia uses the permutation based mode, ...  Read More

75. A computational model and convergence theorem for rumor dissemination in social networks

M. Amoozgar; R. Ramezanian

Volume 5, Issue 2 , Summer and Autumn 2013, , Pages 141-154

http://dx.doi.org/10.22042/isecure.2014.5.2.3

Abstract
  The spread of rumors, which are known as unverified statements of uncertain origin, may threaten the society and it's controlling, is important for national security councils of countries. If it would be possible to identify factors affecting spreading a rumor (such as agents’ desires, trust network, ...  Read More