Outsourcing association rule mining to an outside service provider brings several important benefits to the data owner. These include (i) relief from the high mining cost, (ii) minimization of demands in resources, and (iii) effective centralized mining for multiple distributed owners. On the other hand, security is an issue; the service provider should be prevented from accessing the actual data since (i) the data may be associated with private information, (ii) the frequency analysis is meant to be used solely by the owner. This paper proposes substitution cipher techniques in the encryption of transactional data for outsourcing association rule mining. After identifying the non-trivial threats to a straightforward one-to-one item mapping substitution cipher, we propose a more secure encryption scheme based on a one-to-n item mapping that transforms transactions non-deterministically, yet guarantees correct decryption. We develop an effective and efficient encryption algorithm based on this method. Our algorithm performs a single pass over the database and thus is suitable for applications in which data owners send streams of transactions to the service provider. A comprehensive cryptanalysis study is carried out. The results show that our technique is highly secure with a low data transformation cost.

Security in outsourcing of association rule mining

In this paper, a method to discover the key of a Feistel Cipher (FC) using Genetic Algorithms is described. A Jitness measure based on the differential characteristics of the FC is proposed and complete problem formulation is described. The complexity of the proposed attack is shown to be less than half of normal differential cryptanalysis of the same FC.

https://ieeexplore.ieee.org/iel5/9457/30014/01374427.pdf

Genetic algorithm cryptanalysis of a feistel type block cipher

In wireless sensor networks, the sensors transfer data through radio signals to a remote base station. Sensor nodes are used to sense environmental conditions such as temperature, strain, humidity,...

https://journals.sagepub.com/doi/pdf/10.1177/1550147720925772

An efficient cryptographic technique using modified Diffie–Hellman in wireless sensor networks:

In this paper the Cryptanalysis of polyalphabetic by applying Genetic algorithm is presented. The applicability of Genetic algorithms for searching the key space of encryption scheme is studied. In Vigenere cipher, guessing the key size is done by applying Genetic Algorithm. The frequency analysis is used as an essential factor in objective function.

Applying Genetic Algorithms for Searching Key-Space of Polyalphabetic Substitution Ciphers.

We provide a preliminary exploration of the use of Genetic Algorithms (GA) upon a Substitution Permutation Network (SPN) cipher. The purpose of the exploration is to determine how to find weak keys. The size of the selected SPN created by Stinson[1] gives a sample for showing the methodology and suitability of an attack using GA. We divide the types of keys into groups, each of which is analyzed to determine which groups are weaker. Simple genetic operators are examined to show the suitability of GA when applied to this problem. Results show the potential of GA to provide automated or computer assisted breaking of ciphers. The GA broke a subset of the keys using small input texts.

Genetic algorithm cryptanalysis of a substitution permutation network

In this paper, a method to discover the key of a substitution permutation network (SPN) using genetic algorithms is described A fitness measure based on the differential characteristics of the SPN is proposed and complete problem formulation is described The complexity of the proposed attack is shown to be less than half of normal differential cryptanalysis of the same SPN

E.M.B. Albassal

Papers

Genetic algorithm cryptanalysis of the basic substitution permutation network