Fabien Galand

Learn More
The goal of encryption is to ensure confidentiality of data in communication and storage processes. Recently, its use in constrained devices led to consider additional features, such as the ability to delegate computations to untrusted computers. For this purpose, we would like to give the untrusted computer only an encrypted version of the data to process.(More)
We propose a formal model for embedding information in black-white images and prove the equivalence between existence of embedding schemes and covering codes. An asymptoticly tight bound on the performance of embedding schemes is given. We construct efficient embedding schemes via known coverings. In particular, one of those schemes allows to embed up to(More)
The use of syndrome coding in steganographic schemes tends to reduce distortion during embedding. The more complete model comes from the wet papers (J. Fridrich et al., 2005) and allow to lock positions which cannot be modified. Recently, binary BCH codes have been investigated and seem to be good candidates in this context (D. Schönfeld and A. Winkler,(More)
The use of syndrome coding in steganographic schemes tends to reduce distortion during embedding. The more complete model comes from the wet papers [FGLS05] which allow to lock positions that cannot be modified. Recently, BCH codes have been investigated, and seem to be good candidates in this context [SW06]. Here, we show that ReedSolomon codes are twice(More)
  • Fabien Galand
  • 2006 IEEE International Symposium on Information…
  • 2006
We consider fingerprinting under collusion attacks in the Hamming space. To model the attacks we use the framework of Somekh-Baruch and Merhav, IEEE Trans, on Inf. Th.9 vol. 51(3), 2005. We construct a family of fingerprinting codes efficient against coalition of arbitrary size. Using this family, tracing dishonest users can be done without error and in(More)
A manual voting system can be time consuming and cumbersome and takes a lot of time. With the rapid development of Information Technology an E voting system tends to overcome all these limitations. E voting is fast and helps us to cast our vote from any location. One of the main concern of then E-Voting System is security. In this paper we propose an(More)
With the help of a computer, we obtain the minimum distance of some codes belonging to two families of Z2k -linear codes: the first is the generalized Kerdock codes which aren’t as good as the best linear codes and the second is the Hensel lift of quadratic residue codes. In the latter, we found new codes with same minimum distances as the best linear codes(More)
After a brief historical reminder, the authors emphasize the difficulties of such investigations; difficulties of realization, analysis and synthesis since the results depend on ethnic and socio-cultural origins, socio-professional factors, primary or secondary forms or the length of evolution of the disease. From their experience, the authors draw a(More)
  • 1