 |
|
|
|
| HAL : hal-00436559, version 1 |
| Fiche détaillée |  Récupérer au format |
|
|
| International ICST Conference on Security and Privacy in Communication Networks - SecureComm 2009, Athens : Grèce (2009) |
|
|
|
|
| Aggregated Authentication (AMAC) using Universal Hash Functions |
|
|
| Wassim Znaidi 1, 2Cédric Lauradoux 2, 3 |
|
|
| (15/09/2009) |
|
|
|
| Aggregation is a very important issue to reduce the energy consumption in Wireless Sensors Networks (WSNs). There is currently a lack of cryptographic primitives for authentication of aggregated data. The theoretical background for Aggregated Message Authentication Codes (AMACs) has been proposed by Chan and Castelluccia at ISIT 08. In this paper, we propose a MAC design based on universal hash functions and more precisely on the Krawczyk's constructions. We show how those designs can be used for aggregation and how it can be easily adapted for WSNs. Our two AMAC constructions offer a small memory footprint and a signification speed to fit into a sensor. Moreover, when compared with scenarios without aggregation, the method proposed here induces a simulated energy gain between 3 and 9. |
|
|
|
|
|
|
|
|
|
|
|
| 1 : | Centre d'Innovation en Télécommunications et Intégration de services (EA 3720) |
|
|
|
INRIA – Institut National des Sciences Appliquées (INSA) - Lyon |
|
|
| 2 : | SWING (CITI Insa Lyon / INRIA Grenoble Rhône-Alpes) |
|
|
|
INRIA – Institut National des Sciences Appliquées (INSA) - Lyon |
|
|
| 3 : | Département d'Ingénierie Informatique - UCL (INGI) |
|
|
|
Université Catholique de Louvain (UCL) - Belgique |
|
|
|
|
|
|
|
|
|
| Domaine | : | Informatique/Cryptographie et sécurité Informatique/Réseaux et télécommunications Informatique/Théorie de l'information et codage Mathématiques/Théorie de l'information et codage |
| hal-00436559, version 1 | |
| http://hal.archives-ouvertes.fr/hal-00436559 | |
| oai:hal.archives-ouvertes.fr:hal-00436559 | |
| Contributeur : Cédric Lauradoux | |
| Soumis le : Vendredi 27 Novembre 2009, 08:44:25 | |
| Dernière modification le : Mercredi 30 Décembre 2009, 15:26:09 | |
