Abstract | This review provides an introduction to Sup-

Abstract not found

I am grateful to Luc Segoufin who kindly accepted me to be his PhD student. He introduced me to the problem of query enumeration and encouraged me to look for the answers to all the questions that emerged during our collaboration. He was a truly great advisor, always supportive and available for discussions and advice. I would like to thank Arnaud Durand and Patrice Ossona de Mendez for accepting to review this thesis and for their constructive comments on the earlier versions of this manuscript. Many thanks to Nicole Bidoit and Victor Vianu for accepting to be in my jury. Special thanks go to my Parents, who directed me to follow the scientific path and where fully supportive at all times. Thanks to all the members of LSV – it was a pleasure working with You. I would like to thank the awesome people whom I have been working with in the same office on the 4th floor. Without all the nice riddles and the magnificent French lessons my time there wouldn’t be as chouette as it was. Big thanks go to my son Boris, who was kind enough to sleep through the whole nights, allowing his dad to actually write the thesis down.

Abstract. The concept of threshold ring signature in code-based cryptography was introduced by Aguilar et al. in [1]. Their proposal uses Stern’s identification scheme as basis. In this paper we construct a novel threshold ring signature scheme built on the q-SD identification scheme recently proposed by Cayrel et al. in [14]. Our proposed scheme benefits of a performance gain as a result of the reduction in the soundness error from 2/3 for Stern’s scheme to 1/2 per round for the q-SD scheme. Our threshold ring signature scheme uses random linear codes over the field Fq, secure in the random oracle model and its security relies on the hardness of an error-correcting codes problem (namely the q-ary syndrome decoding problem). In this paper we also provide implementation results of the Aguilar et al. scheme and our proposal, this is the first efficient implementation of this type of code-based schemes.

of different factors: the expressive power of basic queries, the embedding of computation into data (as in Active XML), and the use of deterministic vs. nondeterministic control. All languages are Turing complete, but not necessarily query complete in the sense of Chandra and Harel. Indeed, we show that some

nite-context sources from fractal

for automatic semigroups ✩

HAL is a multi-disciplinary open access archive for the deposit and dissemination of sci-entific research documents, whether they are pub-lished or not. The documents may come from teaching and research institutions in France or abroad, or from public or private research centers. L’archive ouverte pluridisciplinaire HAL, est destinée au dépôt et a ̀ la diffusion de documents scientifiques de niveau recherche, publiés ou non, émanant des établissements d’enseignement et de recherche français ou étrangers, des laboratoires publics ou privés.

Vast majority of wireless appliances used in household, industry and medical field share the ISM frequency band. These devices need to coexist and thus are challenged to tolerate their mutual interference. One way of dealing with this is by using frequency hopping; where the device changes its radio channel periodically. Consequently, communications will not suffer from the same interference each time; instead, it should be fairer and more stable. This thesis investigates the aforementioned problem in the field of low power wireless sensor networks and Internet of Things where Contiki OS is used. We introduce a low-power pseudo-random frequency-hopping MAC protocol which is specifically characterized as a duty cycled asynchronous sender-initiated LPL style protocol. We illustrate two flavors of the protocol; one that does not use any dedicated channel and another which allows dedicated broadcast channels that can implement frequency-hopping as well. We implement

I herewith certify that all material in this dissertation which is not my own work has been properly acknowledged.