The verification of computations performed by an untrusted server is a cornerstone for delegated computations, especially in multi-clients setting where inputs are provided by different parties. Assuming a common secret between clients, a garbled circuit offers the attractive property to ensure the correctness of a result computed by the untrusted server while keeping the input and the function private. Yet, this verification can be guaranteed only once. Based on the notion of multi-key...
This work deals with the problem of gathering n oblivious mobile entities, called robots, at a point (not known beforehand) placed on an infinite triangular grid. The robots are considered to be myopic, i.e., robots have limited visibility. Earlier works of gathering mostly considered the robots either on a plane or on a circle or on a rectangular grid under both full and limited visibility. In the triangular grid, there are two works to the best of our knowledge. The first one is by...
Les Systèmes de Transport Intelligent (ITS) est un domaine de recherche qui gagne de plus en plus d'attention dans le contexte des Routes Intelligentes. Des messages sont échangés en permanence entre les acteurs des Systèmes de Transport Intelligent-Connectés (C-ITS) et devraient être sécurisés puisqu'ils peuvent contenir des informations sensibles relatives à la vie privée des utilisateurs. Aussi, accéder aux services spécifiques des ITS nécessite l' "authentification". L'Infrastructure...
En novembre 2020, l'entreprise Semtech a développé une nouvelle modulation appelée LR-FHSS (Long Range - Frequency Hopping Spread Spectrum), inspirée de la modulation LoRa (Long Range) très utilisée dans l'Internet des Objets, pour les communications entre des équipements terrestres et des satellites en basse orbite. Cette modulation permet à des nœuds capteurs très isolés, se trouvant par exemple sur un bateau au milieu de l'océan, d'obtenir une connectivité réseau à bas débit. Dans...
We consider swarms of luminous autonomous robots. These robots are myopic (i.e., they cannot see beyond some visibility range), do not have a global compass yet they agree on a common chirality, and run in synchronous Look-Compute-Move cycles. They must rely on their lights with few colors to communicate.
In this context, we study the problem of perpetually exploring a 3D grid. We show that assuming the optimal visibility range one, three robots are necessary and sufficient to...