arXiv subjects

Jacques M. Bahi

Publications and source records attributed to Jacques M. Bahi.

At least 55 records · Page 3Linked to original sources

arXiv2013

The Metadata Anonymization Toolkit

This document summarizes the experience of Julien Voisin during the 2011 edition of the well-known \emph{Google Summer of Code}. This project is a first step in the domain of metadata anonymization in Free Software. This article is articulated in three parts. First, a state of the art and a categorization of usual metadata, then the privacy policy is exposed/discussed in order to find the right balance between information lost and privacy enhancement. Finally, the specification of the Metadata Anonymization Toolkit (MAT) is presented, and future possible works are sketched.

cs.CR↗

arXiv2012

Lyapunov exponent evaluation of a digital watermarking scheme proven to be secure

In our previous researches, a new digital watermarking scheme based on chaotic iterations has been introduced. This scheme was both stego-secure and topologically secure. The stego-security is to face an attacker in the "watermark only attack" category, whereas the topological security concerns other categories of attacks. Its Lyapunov exponent is evaluated here, to quantify the chaos generated by this scheme. Keywords : Lyapunov exponent; Information hiding; Security; Chaotic iterations; Digital Watermarking.

cs.CR↗

arXiv2012

Application of Steganography for Anonymity through the Internet

In this paper, a novel steganographic scheme based on chaotic iterations is proposed. This research work takes place into the information hiding security framework. The applications for anonymity and privacy through the Internet are regarded too. To guarantee such an anonymity, it should be possible to set up a secret communication channel into a web page, being both secure and robust. To achieve this goal, we propose an information hiding scheme being stego-secure, which is the highest level of security in a well defined and studied category of attacks called "watermark-only attack". This category of attacks is the best context to study steganography-based anonymity through the Internet. The steganalysis of our steganographic process is also studied in order to show it security in a real test framework.

cs.CR↗

arXiv2011

Efficient and Cryptographically Secure Generation of Chaotic Pseudorandom Numbers on GPU

In this paper we present a new pseudorandom number generator (PRNG) on graphics processing units (GPU). This PRNG is based on the so-called chaotic iterations. It is firstly proven to be chaotic according to the Devaney's formulation. We thus propose an efficient implementation for GPU that successfully passes the BigCrush tests, deemed to be the hardest battery of tests in TestU01. Experiments show that this PRNG can generate about 20 billion of random numbers per second on Tesla C1060 and NVidia GTX280 cards. It is then established that, under reasonable assumptions, the proposed PRNG can be cryptographically secure. A chaotic version of the Blum-Goldwasser asymmetric key encryption scheme is finally proposed.

cs.CR↗

arXiv2011

A Complexity Approach for Steganalysis

In this proposal for the Journèes Codes et Stéganographie 2012, we define a new rigorous approach for steganalysis based on the complexity theory. It is similar to the definitions of security that can be found for hash functions, PRNG, and so on. We propose here a notion of \emph{secure hiding} and we give a first secure hiding scheme.

cs.CR↗

arXiv2011

Chaotic iterations for steganography: Stego-security and topological-security

In this paper is proposed a novel steganographic scheme based on chaotic iterations. This research work takes place into the information hiding security fields. We show that the proposed scheme is stego-secure, which is the highest level of security in a well defined and studied category of attack called "watermark-only attack". Additionally, we prove that this scheme presents topological properties so that it is one of the firsts able to face, at least partially, an adversary when considering the others categories of attacks defined in the literature.

cs.CR↗

arXiv2011

Chaotic iterations versus Spread-spectrum: topological-security and stego-security

A new framework for information hiding security, called topological-security, has been proposed in a previous study. It is based on the evaluation of unpredictability of the scheme, whereas existing notions of security, as stego-security, are more linked to information leaks. It has been proven that spread-spectrum techniques, a well-known stego-secure scheme, are topologically-secure too. In this paper, the links between the two notions of security is deepened and the usability of topological-security is clarified, by presenting a novel data hiding scheme that is twice stego and topological-secure. This last scheme has better scores than spread-spectrum when evaluating qualitative and quantitative topological-security properties. Incidentally, this result shows that the new framework for security tends to improve the ability to compare data hiding scheme.

cs.CR↗

arXiv2011

Steganography: a Class of Algorithms having Secure Properties

Chaos-based approaches are frequently proposed in information hiding, but without obvious justification. Indeed, the reason why chaos is useful to tackle with discretion, robustness, or security, is rarely elucidated. This research work presents a new class of non-blind information hidingalgorithms based on some finite domains iterations that are Devaney's topologically chaotic. The approach is entirely formalized and reasons to take place into the mathematical theory of chaos are explained. Finally, stego-security and chaos security are consequently proven for a large class of algorithms.

cs.DM↗

arXiv2011

Evaluating Quality of Chaotic Pseudo-Random Generators: Application to Information Hiding

Guaranteeing the security of information transmitted through the Internet, against passive or active attacks, is a major concern. The discovery of new pseudo-random number generators with a strong level of security is a field of research in full expansion, due to the fact that numerous cryptosystems and data hiding schemes are directly dependent on the quality of these generators. At the conference Internet`09, we described a generator based on chaotic iterations which behaves chaotically as defined by Devaney. In this paper which is an extension of the work presented at the conference Internet`10, the proposal is to improve the speed, the security, and the evaluation of this generator, to make its use more relevant in the Internet security context. In order to do so, a comparative study between various generators is carried out and statistical results are improved. Finally, an application in the information hiding framework is presented with details, to give an illustrative example of the use of such a generator in the Internet security field.

cs.CR↗

arXiv2011

Steganography: a class of secure and robust algorithms

This research work presents a new class of non-blind information hiding algorithms that are stego-secure and robust. They are based on some finite domains iterations having the Devaney's topological chaos property. Thanks to a complete formalization of the approach we prove security against watermark-only attacks of a large class of steganographic algorithms. Finally a complete study of robustness is given in frequency DWT and DCT domains.

cs.CR↗

arXiv2011

Performance Analysis of a Keyed Hash Function based on Discrete and Chaotic Proven Iterations

Security of information transmitted through the Internet is an international concern. This security is guaranteed by tools like hash functions. However, as security flaws have been recently identified in the current standard in this domain, new ways to hash digital media must be investigated. In this document an original keyed hash function is evaluated. It is based on chaotic iterations and thus possesses various topological properties as uniform repartition and sensibility to its initial condition. These properties make our hash function satisfy the requirements in this field. This claim is verified qualitatively and experimentally in this research work, among other things by realizing simulations of diffusion and confusion.

cs.CR↗

arXiv2011

Class of Trustworthy Pseudo-Random Number Generators

With the widespread use of communication technologies, cryptosystems are therefore critical to guarantee security over open networks as the Internet. Pseudo-random number generators (PRNGs) are fundamental in cryptosystems and information hiding schemes. One of the existing chaos-based PRNGs is using chaotic iterations schemes. In prior literature, the iterate function is just the vectorial boolean negation. In this paper, we propose a method using Graph with strongly connected components as a selection criterion for chaotic iterate function. In order to face the challenge of using the proposed chaotic iterate functions in PRNG, these PRNGs are subjected to a statistical battery of tests, which is the well-known NIST in the area of cryptography.

cs.CR↗

arXiv2011

Randomness Quality of CI Chaotic Generators: Applications to Internet Security

Due to the rapid development of the Internet in recent years, the need to find new tools to reinforce trust and security through the Internet has became a major concern. The discovery of new pseudo-random number generators with a strong level of security is thus becoming a hot topic, because numerous cryptosystems and data hiding schemes are directly dependent on the quality of these generators. At the conference Internet`09, we have described a generator based on chaotic iterations, which behaves chaotically as defined by Devaney. In this paper, the proposal is to improve the speed and the security of this generator, to make its use more relevant in the Internet security context. To do so, a comparative study between various generators is carried out and statistical results are given. Finally, an application in the information hiding framework is presented, to give an illustrative example of the use of such a generator in the Internet security field.

cs.CR↗

arXiv2011

On the design of a family of CI pseudo-random number generators

Chaos and its applications in the field of secure communications have attracted a lot of attention. Chaos-based pseudo-random number generators are critical to guarantee security over open networks as the Internet. We have previously demonstrated that it is possible to define such generators with good statistical properties by using a tool called "chaotic iterations", which depends on an iteration function. An approach to find update functions such that the associated generator presents a random-like and chaotic behavior is proposed in this research work. To do so, we use the vectorial Boolean negation as a prototype and explain how to modify this iteration function without deflating the good properties of the associated generator. Simulation results and basic security analysis are then presented to evaluate the randomness of this new family of generators.

cs.CR↗

arXiv2011

Chaos in DNA inversions (Draft paper)

This is a draft paper, proving that the inversion process that occurs in DNA mutations, is indeed chaotic as it is defined by the Devaney's theory.

nlin.CD↗

arXiv2011

Chaotic iterations versus Spread-spectrum: chaos and stego security

A new framework for information hiding security, called chaos-security, has been proposed in a previous study. It is based on the evaluation of unpredictability of the scheme, whereas existing notions of security, as stego-security, are more linked to information leaks. It has been proven that spread-spectrum techniques, a well-known stego-secure scheme, are chaos-secure too. In this paper, the links between the two notions of security is deepened and the usability of chaos-security is clarified, by presenting a novel data hiding scheme that is twice stego and chaos-secure. This last scheme has better scores than spread-spectrum when evaluating qualitative and quantitative chaos-security properties. Incidentally, this result shows that the new framework for security tends to improve the ability to compare data hiding scheme.

cs.CR↗

arXiv2011

Building a Chaotic Proved Neural Network

Chaotic neural networks have received a great deal of attention these last years. In this paper we establish a precise correspondence between the so-called chaotic iterations and a particular class of artificial neural networks: global recurrent multi-layer perceptrons. We show formally that it is possible to make these iterations behave chaotically, as defined by Devaney, and thus we obtain the first neural networks proven chaotic. Several neural networks with different architectures are trained to exhibit a chaotical behavior.

cs.AI↗

arXiv2010

Improving random number generators by chaotic iterations. Application in data hiding

In this paper, a new pseudo-random number generator (PRNG) based on chaotic iterations is proposed. This method also combines the digits of two XORshifts PRNGs. The statistical properties of this new generator are improved: the generated sequences can pass all the DieHARD statistical test suite. In addition, this generator behaves chaotically, as defined by Devaney. This makes our generator suitable for cryptographic applications. An illustration in the field of data hiding is presented and the robustness of the obtained data hiding algorithm against attacks is evaluated.

cs.CR↗