Universite de Cergy-Pontoise

Displaying 1-10 of 10 results

  • White Papers // Mar 2012

    Lyapunov Exponent Evaluation of a Digital Watermarking Scheme Proven to be Secure

    In the authors' 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...

    Provided By Universite de Cergy-Pontoise

  • White Papers // Dec 2011

    Differential Attacks on Generalized Feistel Schemes

    While generic attacks on classical Feistel schemes and unbalanced Feistel schemes have been studied a lot, generic attacks on several generalized Feistel schemes like type-1, type-2 and type-3 and Alternating Feistel schemes, as defined, have not been systematically investigated. This is the aim of this paper. The authors give their...

    Provided By Universite de Cergy-Pontoise

  • White Papers // Dec 2011

    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. The authors show that the proposed scheme is stego secure, which is the highest level of security in a well defined and studied category of attack...

    Provided By Universite de Cergy-Pontoise

  • White Papers // Dec 2011

    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 paper presents a new class of non-blind information hiding algorithms based on some finite domains iterations that are Devaney's topologically...

    Provided By Universite de Cergy-Pontoise

  • White Papers // Dec 2011

    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 the authors prove security against watermark-only attacks of a large...

    Provided By Universite de Cergy-Pontoise

  • White Papers // Dec 2011

    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...

    Provided By Universite de Cergy-Pontoise

  • White Papers // Apr 2011

    A Weight-Throwing Clustering Group Mutual Exclusion Algorithm for Mobile Ad Hoc Networks

    A mobile ad hoc network can be defined as a network that is spontaneously deployed and is independent of any static network. The network consists of mobiles nodes with wireless interfaces and has arbitrary dynamic topology. The network suffers from frequent link formation and disruption due to the mobility of...

    Provided By Universite de Cergy-Pontoise

  • White Papers // Jan 2011

    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 paper. 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...

    Provided By Universite de Cergy-Pontoise

  • White Papers // Jan 2011

    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...

    Provided By Universite de Cergy-Pontoise

  • White Papers // Oct 2010

    A Tighter Analysis of Work Stealing

    Classical list scheduling is a very popular and efficient technique for scheduling jobs in parallel platforms. However, with the in-creasing number of processors, the cost for managing a single centralized list becomes prohibitive. In this paper is to study the extra cost that must be paid when the list is...

    Provided By Universite de Cergy-Pontoise

  • White Papers // Apr 2011

    A Weight-Throwing Clustering Group Mutual Exclusion Algorithm for Mobile Ad Hoc Networks

    A mobile ad hoc network can be defined as a network that is spontaneously deployed and is independent of any static network. The network consists of mobiles nodes with wireless interfaces and has arbitrary dynamic topology. The network suffers from frequent link formation and disruption due to the mobility of...

    Provided By Universite de Cergy-Pontoise

  • White Papers // Dec 2011

    Differential Attacks on Generalized Feistel Schemes

    While generic attacks on classical Feistel schemes and unbalanced Feistel schemes have been studied a lot, generic attacks on several generalized Feistel schemes like type-1, type-2 and type-3 and Alternating Feistel schemes, as defined, have not been systematically investigated. This is the aim of this paper. The authors give their...

    Provided By Universite de Cergy-Pontoise

  • White Papers // Mar 2012

    Lyapunov Exponent Evaluation of a Digital Watermarking Scheme Proven to be Secure

    In the authors' 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...

    Provided By Universite de Cergy-Pontoise

  • White Papers // Jan 2011

    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...

    Provided By Universite de Cergy-Pontoise

  • White Papers // Dec 2011

    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. The authors show that the proposed scheme is stego secure, which is the highest level of security in a well defined and studied category of attack...

    Provided By Universite de Cergy-Pontoise

  • White Papers // Dec 2011

    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 paper presents a new class of non-blind information hiding algorithms based on some finite domains iterations that are Devaney's topologically...

    Provided By Universite de Cergy-Pontoise

  • White Papers // Dec 2011

    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 the authors prove security against watermark-only attacks of a large...

    Provided By Universite de Cergy-Pontoise

  • White Papers // Dec 2011

    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...

    Provided By Universite de Cergy-Pontoise

  • White Papers // Jan 2011

    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 paper. 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...

    Provided By Universite de Cergy-Pontoise

  • White Papers // Oct 2010

    A Tighter Analysis of Work Stealing

    Classical list scheduling is a very popular and efficient technique for scheduling jobs in parallel platforms. However, with the in-creasing number of processors, the cost for managing a single centralized list becomes prohibitive. In this paper is to study the extra cost that must be paid when the list is...

    Provided By Universite de Cergy-Pontoise