Title: Efficient Security Primitives Derived from a Secure Aggregation

AlgorithmSpeaker: Adrian Perrig, Professor, Carnegie Mellon UniversityDate: Mon.,

Dec. 28, 2009, 10:30am~12:00pmPlace: Science library #611 (과학도서관

611호)Abstract:By functionally decomposing a specific algorithm (the

hierarchicalsecure aggregation algorithm of Chan et al. and Frikken et al.),

weuncover a useful general functionality which we use to generatevarious efficient

network security primitives, including: a signaturescheme ensuring authenticity,

integrity and non-repudiation forarbitrary node-to-node communications an efficient

broadcastauthentication algorithm not requiring time synchronization a schemefor

managing public keys in a sensor network without requiring anyasymmetric

cryptographic operations to verify the validity of publickeys, and without requiring

nodes to maintain node revocationlists. Each of these applications uses the same

basic data aggregationprimitive and thus have O(log n) congestion performance and

requireonly that symmetric secret keys are shared between each node and thebase

station. We thus observe the fact that the optimizationsdeveloped in the application

area of secure aggregation can feed backinto creating more optimized versions of

highly general, basicsecurity

functions.http://sparrow.ece.cmu.edu/group/pub/chan_perrig_secure_agg_apps.pdfBio:Adr

ian Perrig is a Professor in Electrical and ComputerEngineering, Engineering and

Public Policy, and Computer Science atCarnegie Mellon University. Adrian also serves

as the technicaldirector for Carnegie Mellon''s Cybersecurity Laboratory (CyLab)

andfor the iCast project. He earned his Ph.D. degree in ComputerScience from Carnegie

Mellon University, and spent three years duringhis Ph.D. degree at University of

California at Berkeley. He receivedhis B.Sc. degree in Computer Engineering from the

Swiss FederalInstitute of Technology in Lausanne (EPFL). Adrian''s researchinterests

revolve around building secure systems and include Internetsecurity, security for

sensor networks and mobile applications, andtrusted computing. More information about

his research is available onAdrian''s web page. http://www.ece.cmu.edu/~adrian/Adrian

is a recipient of the NSF CAREER award in 2004, the IBM facultyfellowship in 2004 and

2005, and the Sloan research fellowship in 2006.