activity
20092026
most citedImproving the utility of locally differentially private protocols for longitudinal and multidimensional frequency estimates

29 citations · 139 across the 31 of their papers we have counts for

collaborators
Showing cs.CRShow all

12 papers · 1 filter

cs.CR2022

An Easy-to-use and Robust Approach for the Differentially Private De-Identification of Clinical Textual Documents

Yakini Tchouka, Jean-François Couchot, David Laiymani

Unstructured textual data is at the heart of healthcare systems. For obvious privacy reasons, these documents are not accessible to researchers as long as they contain personally i…

cs.CR2022★ 11 cited

Multi-Freq-LDPy: Multiple Frequency Estimation Under Local Differential Privacy in Python

Héber H. Arcolezi, Jean-François Couchot, Sébastien Gambs +2

This paper introduces the multi-freq-ldpy Python package for multiple frequency estimation under Local Differential Privacy (LDP) guarantees. LDP is a gold standard for achieving l…

cs.CR2021★ 29 cited

Improving the utility of locally differentially private protocols for longitudinal and multidimensional frequency estimates

Héber H. Arcolezi, Jean-François Couchot, Bechara Al Bouna +1

This paper investigates the problem of collecting multidimensional data throughout time (i.e., longitudinal studies) for the fundamental task of frequency estimation under Local Di…

cs.CR2021★ 26 cited

Random Sampling Plus Fake Data: Multidimensional Frequency Estimates With Local Differential Privacy

Héber H. Arcolezi, Jean-François Couchot, Bechara Al Bouna +1

With local differential privacy (LDP), users can privatize their data and thus guarantee privacy properties before transmitting it to the server (a.k.a. the aggregator). One primar…

cs.CR2017

One random jump and one permutation: sufficient conditions to chaotic, statistically faultless, and large throughput PRNG for FPGA

Mohammed Bakiri, Jean-François Couchot, Christophe Guyeux

Sub-categories of mathematical topology, like the mathematical theory of chaos, offer interesting applications devoted to information security. In this research work, we have intro…

cs.CR2017★ 11 cited

Random Walk in a N-cube Without Hamiltonian Cycle to Chaotic Pseudorandom Number Generation: Theoretical and Practical Considerations

Sylvain Contassot-Vivier, Jean-François Couchot, Christophe Guyeux +1

Designing a pseudorandom number generator (PRNG) is a difficult and complex task. Many recent works have considered chaotic functions as the basis of built PRNGs: the quality of th…

cs.CR2016★ 4 cited

FPGA Implementation of -Linear Pseudorandom Number Generators Based on Zynq MPSoC: a Chaotic Iterations Post Processing Case Study

Mohammed Bakiri, Jean-François Couchot, Christophe Guyeux

Pseudorandom number generation (PRNG) is a key element in hardware security platforms like field-programmable gate array FPGA circuits. In this article, 18 PRNGs belonging in 4 fam…

cs.CR2016

Quality Analysis of a Chaotic Proven Keyed Hash Function

Jacques M. Bahi, Jean-François Couchot, Christophe Guyeux

Hash functions are cryptographic tools, which are notably involved in integrity checking and password storage. They are of primary importance to improve the security of exchanges t…

cs.CR2012★ 2 cited

Application of Steganography for Anonymity through the Internet

Jacques M. Bahi, Jean-François Couchot, Nicolas Friot +1

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 application…

cs.CR2011★ 4 cited

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

Jacques M. Bahi, Jean-François Couchot, Christophe Guyeux

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…

cs.CR2011

Steganography: a class of secure and robust algorithms

Jacques M. Bahi, Jean-François Couchot, Christophe Guyeux

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 Dev…

cs.CR2011★ 7 cited

Class of Trustworthy Pseudo-Random Number Generators

Jacques M. Bahi, Jean-François Couchot, Christophe Guyeux +1

With the widespread use of communication technologies, cryptosystems are therefore critical to guarantee security over open networks as the Internet. Pseudo-random number generator…