Efficient security primitives derived from a secure aggregation algorithm Export

@inproceedings{citeulike:3887187, abstract = {By functionally decomposing a specific algorithm (the hierarchical secure aggregation algorithm of Chan et al. [3] and Frikken et al. [7]), we uncover a useful general functionality which we 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. Each of these applications uses the same basic data aggregation primitive and thus have O(log n) congestion performance and require only that symmetric secret keys are shared between each node and the base station. We thus observe the fact that the optimizations developed in the application area of secure aggregation can feed back into creating more optimized versions of highly general, basic security functions.}, address = {New York, NY, USA}, author = {Chan, Haowen and Perrig, Adrian}, booktitle = {CCS '08: Proceedings of the 15th ACM conference on Computer and communications security}, citeulike-article-id = {3887187}, citeulike-linkout-0 = {http://portal.acm.org/citation.cfm?id=1455770.1455836}, citeulike-linkout-1 = {http://dx.doi.org/10.1145/1455770.1455836}, doi = {10.1145/1455770.1455836}, isbn = {978-1-59593-810-7}, keywords = {aggregation, authentication, broadcast, networks, secure, sensor}, location = {Alexandria, Virginia, USA}, pages = {521--534}, posted-at = {2009-10-20 18:36:33}, priority = {0}, publisher = {ACM}, title = {Efficient security primitives derived from a secure aggregation algorithm}, url = {http://dx.doi.org/10.1145/1455770.1455836}, year = {2008} }

TY - CONF ID - citeulike:3887187 L3 - citeulike-article-id:3887187 N2 - By functionally decomposing a specific algorithm (the hierarchical secure aggregation algorithm of Chan et al. [3] and Frikken et al. [7]), we uncover a useful general functionality which we 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. Each of these applications uses the same basic data aggregation primitive and thus have O(log n) congestion performance and require only that symmetric secret keys are shared between each node and the base station. We thus observe the fact that the optimizations developed in the application area of secure aggregation can feed back into creating more optimized versions of highly general, basic security functions. CY - Alexandria, Virginia, USA SN - 978-1-59593-810-7 AD - New York, NY, USA EP - 534 TI - Efficient security primitives derived from a secure aggregation algorithm PB - ACM T2 - CCS '08: Proceedings of the 15th ACM conference on Computer and communications security SP - 521 KW - aggregation KW - authentication KW - broadcast KW - networks KW - secure KW - sensor AU - Chan, Haowen AU - Perrig, Adrian PY - 2008/// UR - http://dx.doi.org/10.1145/1455770.1455836 ER -