Efficient security primitives derived from a secure aggregation algorithm

  • Chan H
  • Perrig A
  • 38


    Mendeley users who have this article in their library.
  • 15


    Citations of this article.


Each of these applications uses the same basic data aggregation primitive and thus have O(log n) con- gestion performance and require only that symmetric secret keys are shared between each node and the base station. We thus ob- serve the fact that the optimizations developed in the application area of secure aggregation can feed back into creating more opti- mized versions of highly general, basic security functions.

Author-supplied keywords

  • at carnegie mel-
  • authentication
  • broadcast
  • data aggregation
  • in part by cylab
  • integrity
  • public key management
  • sensor networks
  • signatures
  • this research was supported

Get free article suggestions today

Mendeley saves you time finding and organizing research

Sign up here
Already have an account ?Sign in

Find this document


  • H Chan

  • a Perrig

Cite this document

Choose a citation style from the tabs below

Save time finding and organizing research with Mendeley

Sign up for free