Efficient Security Primitives Derived From a Secure Aggregation Algorithm

Download Now Free registration required

Executive Summary

By functionally decomposing a specific algorithm (the hierarchical secure aggregation algorithm of Chan et al. and Frikken et al.), the authors uncover a useful general functionality which they use to generate various efficient network security primitives, including: a signature scheme ensuring authenticity, integrity and non-repudiation for arbitrary node-to-node communications; an efficient broadcast authentication algorithm not requiring time synchronization; a scheme for managing public keys in a sensor network without requiring any asymmetric cryptographic operations to verify the validity of public keys, and without requiring nodes to maintain node revocation lists.

  • Format: PDF
  • Size: 413.7 KB