@article {
author = {Eskandari, Zahra and Ghaemi Bafghi, Abbas},
title = {Extension of Cube Attack with Probabilistic Equations and its Application on Cryptanalysis of KATAN Cipher},
journal = {The ISC International Journal of Information Security},
volume = {12},
number = {1},
pages = {1-12},
year = {2020},
publisher = {Iranian Society of Cryptology},
issn = {2008-2045},
eissn = {2008-3076},
doi = {10.22042/isecure.2020.199304.481},
abstract = {Cube Attack is a successful case of Algebraic Attack. Cube Attack consists of two phases, linear equation extraction and solving the extracted equation system. Due to the high complexity of equation extraction phase in finding linear equations, we can extract nonlinear ones that could be approximated to linear equations with high probability. The probabilistic equations could be considered as linear ones under some noises. Existing approaches to solve noisy equation systems work well provided that the equation system has low error rate; however, as the error rate increases, the success rate of finding the exact solution diminishes, making them rather inefficient in high error rate. In this paper, we extend Cube Attack to probabilistic equations. First, an approximation approach based on linear combinations of nonlinear equations is presented to find probabilistic linear equations with high probability. Then, we present an approach to improve the efficiency of current solving approaches and make them practical to solve high error rate linear equation system. Finally, utilizing proposed approaches, we find the right key under extended noisy equation system with lower complexity in comparison to the original Cube Attack.},
keywords = {Cube Attack,Probabilistic equation,approximation,Solving noisy equation system},
url = {http://www.isecure-journal.com/article_102461.html},
eprint = {http://www.isecure-journal.com/article_102461_63043339d70cc19cf82405c666e85243.pdf}
}
@article {
author = {Mahmoudzadeh Niknam, Majid and Sadeghi, Sadegh and Aref, Mohammad Reza and Bagheri, Nasour},
title = {Investigation of Some Attacks on GAGE (v1), InGAGE (v1), (v1.03), and CiliPadi (v1) Variants},
journal = {The ISC International Journal of Information Security},
volume = {12},
number = {1},
pages = {13-23},
year = {2020},
publisher = {Iranian Society of Cryptology},
issn = {2008-2045},
eissn = {2008-3076},
doi = {10.22042/isecure.2020.199099.480},
abstract = {In this paper, we present some attacks on GAGE, InGAGE, and CiliPadi which are candidates of the first round of the NIST-LWC competition. GAGE and InGAGE are lightweight sponge based hash function and Authenticated Encryption with Associated Data (AEAD), respectively and support different sets of parameters. The length of hash, key, and tag are always 256, 128, and 128 bits, respectively. We show that the security bounds for some variants of its hash and AEAD are less than the designers' claims. For example, the designers' security claim of preimage attack for a hash function when the rate is 128 bits and the capacity is $256$ bits, is 2^{256}, however, we show that the security of preimage for this parameter set is 2^{128}. Also, the designer claimed security of confidentiality for an AEAD, when the rate is 8 bits and the capacity is 224 bits, is 2^{116}, however, we show the security of confidentiality for it is 2^{112$. We also investigate the structure of the permutation used in InGAGE and present an attack to recover the key for reduced rounds of a variant of InGAGE. In an instance of AEAD of InGAGE, when the rate is 8 bits and the capacity is 224 bits, we recover the key when the number of the composition of the main permutation with itself, i.e., r_{1}, is less than 8. We also show that CiliPadi is vulnerable to the length extension attack by presenting concrete examples of forged messages.},
keywords = {NIST lightweight cryptography competition,GAGE,InGAGE,Preimage attack,confidentialityو Integrityو MILP,CiliPadi},
url = {http://www.isecure-journal.com/article_100988.html},
eprint = {http://www.isecure-journal.com/article_100988_9d69088b877cbe848d16d2788c40efee.pdf}
}
@article {
author = {Sabeti, Vajiheh and Shoaei, Minoo},
title = {New High Secure Network Steganography Method Based on Packet Length},
journal = {The ISC International Journal of Information Security},
volume = {12},
number = {1},
pages = {24-44},
year = {2020},
publisher = {Iranian Society of Cryptology},
issn = {2008-2045},
eissn = {2008-3076},
doi = {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 great resistance to network traffic detections. In the first proposed method, the sender embeds a bit of data in each pair that includes two non-identical packet lengths. In the current situation, if the first packet length of the pair is larger than the second one, it shows a ‘1’ bit and otherwise, it shows a ‘0’ bit. If the intended bit of the sender is in conflict with the current status, he/she will create the desired status by swapping the packet lengths. In this method, the paired packets can be selected freely, but in the second proposed method, the packets are divided into buckets and only packets within a single bucket can be paired together. In this case, the embedding method is similar to the previous one. The results show that the second method, despite having low embedding capacity, will be more secure in real traffic compared to the other methods. Since the packet lengths of UDP protocol are more random in comparison to TCP, the proposed methods have higher embedding capacity and they are more secure for UDP-based packets. However, these methods are only applicable to the protocols in which the packet length has not a constant value.},
keywords = {covert channel,data security,network steganography,packet length,Steganalysis},
url = {http://www.isecure-journal.com/article_102479.html},
eprint = {http://www.isecure-journal.com/article_102479_e899feafcfcb2a4cb568bd82015135e8.pdf}
}
@article {
author = {Mortazavi, Reza},
title = {Improved Univariate Microaggregation for Integer Values},
journal = {The ISC International Journal of Information Security},
volume = {12},
number = {1},
pages = {35-43},
year = {2020},
publisher = {Iranian Society of Cryptology},
issn = {2008-2045},
eissn = {2008-3076},
doi = {10.22042/isecure.2019.185397.465},
abstract = {Privacy issues during data publishing is an increasing concern of involved entities. The problem is addressed in the field of statistical disclosure control with the aim of producing protected datasets that are also useful for interested end users such as government agencies and research communities. The problem of producing useful protected datasets is addressed in multiple computational privacy models such as $k$-anonymity in which data is clustered into groups of at least $k$ members. Microaggregation is a mechanism to realize $k$-anonymity. The objective is to assign records of a dataset to clusters and replace the original values with their associated cluster centers which are the average of assigned values to minimize information loss in terms of the sum of within group squared errors ($SSE$). While the problem is shown to be NP-hard in general, there is an optimal polynomial-time algorithm for univariate datasets. This paper shows that the assignment of the univariate microaggregation algorithm cannot produce optimal partitions for integer observations where the computed centroids have to be integer values. In other words, the integrality constraint on published quantities has to be addressed within the algorithm steps and the optimal partition cannot be attained using only the results of the general solution. Then, an effective method that considers the constraint is proposed and analyzed which can handle very large numerical volumes. Experimental evaluations confirm that the developed algorithm not only produces more useful datasets but also is more efficient in comparison with the general optimal univariate algorithm.},
keywords = {data privacy,statistical databases,microdata protection,Microaggregation,integer optimization},
url = {http://www.isecure-journal.com/article_99437.html},
eprint = {http://www.isecure-journal.com/article_99437_4404dd17313ba18a5716d7bc7fe981af.pdf}
}
@article {
author = {Mohammadi, Shahriar and Namadchian, Amin},
title = {Anomaly-based Web Attack Detection: The Application of Deep Neural Network Seq2Seq With Attention Mechanism},
journal = {The ISC International Journal of Information Security},
volume = {12},
number = {1},
pages = {44-54},
year = {2020},
publisher = {Iranian Society of Cryptology},
issn = {2008-2045},
eissn = {2008-3076},
doi = {10.22042/isecure.2020.199009.479},
abstract = {Today, the use of the Internet and Internet sites has been an integrated part of the people’s lives, and most activities and important data are in the Internet websites. Thus, attempts to intrude into these websites have grown exponentially. Intrusion detection systems (IDS) of web attacks are an approach to protect users. But, these systems are suffering from such drawbacks as low accuracy in detecting new attacks. To tackle this problem, various methods of machine learning have been presented in recent years. Since malicious web requests have more delicate distinction than normal requests, these methods have failed to exhibit a good accuracy in new attack detection. This paper presents a new method for web attack detection using seq2seq networks using attention. The results show that this method could predict the possible responses and use the difference from the real responses of the server to model the normal traffic. Thereby, it could use the similarity measure to discriminate between normal and anomalous traffic. The highest accuracy of this method versus similar methods shows that the use of attention mechanism can cope with the challenge of studying long web requests to a great extent.},
keywords = {Deep seq2seq network,web intrusion detection system,attention mechanism,Embedding},
url = {http://www.isecure-journal.com/article_101909.html},
eprint = {http://www.isecure-journal.com/article_101909_58350b81defece7a3189bd5f437cffeb.pdf}
}
@article {
author = {Naderi, Bashir and Kheiri, Hossein and Vafaei, Vajiheh},
title = {Modified Sliding-Mode Control Method for Synchronization a Class of Chaotic Fractional-Order Systems with Application in Encryption},
journal = {The ISC International Journal of Information Security},
volume = {12},
number = {1},
pages = {55-66},
year = {2020},
publisher = {Iranian Society of Cryptology},
issn = {2008-2045},
eissn = {2008-3076},
doi = {10.22042/isecure.2019.156417.439},
abstract = {In this study, we propose a secure communication scheme based on the synchronization of two identical fractional-order chaotic systems. The fractional-order derivative is in Caputo sense, and for synchronization, we use a robust sliding-mode control scheme. The designed sliding surface is taken simply due to using special technic for fractional-order systems. Also, unlike most manuscripts, the fractional-order derivatives of state variables can be chosen differently. The stability of the error system is proved using the Lyapunov stability of fractional-order systems. Numerical simulations illustrate the ability and effectiveness of the proposed method. Moreover, synchronization results are applied to secure communication using the masking method. The security analysis demonstrates that the introduced algorithm has a large keyspace, high sensitivity to encryption keys, higher security, and the acceptable performance speed.},
keywords = {Fractional-order systems,chaos,Sliding mode control,Synchronization,Secure communication},
url = {http://www.isecure-journal.com/article_99428.html},
eprint = {http://www.isecure-journal.com/article_99428_f58286ded7f54e4c4abb4d12ef733022.pdf}
}