PET PhD Course 2012 SWITS The Smart Grid and Anonymous - - PowerPoint PPT Presentation
PET PhD Course 2012 SWITS The Smart Grid and Anonymous Communication Mechanisms Leonardo Martucci Security and Networks Group, ADIT Department of Computer and Information Science About me EE Degree (95-00) + Master in EE (00-02)
University of São Paulo
Karlstad University
Center for Advanced Security Research
Technische Universität Darmstadt
Linköping University
2/32
3/32
4/32
to appear SmartGridComm 2012 with some bits from:
under submission
5/32
* we that work on privacy
6/32
* National Institute of Standards and Technology
7/32
information
* we that work on privacy
produces information collects information Personal Identifiable Information SP & O
8/32
information
* we that work on privacy
produces information collects information Personal Identifiable Information customer SP & O
9/32
real-time control data billing data SP & O customer
10/32
11/32
12/32
13/32
SP & O real-time control data billing data customer
14/32
customer control data SP & O billing data differentiate sources, but not identify them
15/32
customer f (control data) SP & O
16/32
Real-time control data
Billing data customer 2 Partial identities pseudonym customer ID
17/32
A.
Symmetric Data Aggregation
B.
Asymmetric Data Aggregation
C.
Anonymous Communication Networks
D.
Schemes based on Trusted Third Parties
E.
Batteries and Local Generation Schemes
F.
(Hybrid Schemes)
* from “A Survey in Privacy-Enhancing Technologies for the Smart Grid” 18/32
information SP & O customer
19/32
A.
Symmetric Data Aggregation
B.
Asymmetric Data Aggregation
C.
Anonymous Communication Networks
D.
Schemes based on Trusted Third Parties
E.
Batteries and Local Generation Schemes
F.
(Hybrid Schemes)
* from “A Survey in Privacy-Enhancing Technologies for the Smart Grid” 20/32
The objective: sender anonymity towards the SP&O Secure Session
21/32
Group ID is used for geographical reasons group ID customer ID SP & O begin secure session end secure session
22/32
group ID customer ID secure sessions
23/32
1 pseudonym for all messages
1 pseudonym per message
n messages = n key agreements
maximum computational cost (!)
24/32
25/32
a general solution based on homorphic encryption (HF) customer: 2.i.E + i.M sp&o: (i-1).M
a solution based on a Diffie-Hellman (DH) key agreement (IK) for customer: 4.j.E sp&o: 4.j.E i = number of measurements j = number of secure sessions E = exponential cost M = multiplication cost
26/32
Homorphic functions perform better for i = j (maximum privacy)
27/32
28/32
exponention cost is not constant for the chosen bit-lenghts
10-bit message, 1024-bit for all other HF parameters 1024-bit for DH parameters (modulo 2048 bits)
29/32
30/32
to appear SmartGridComm 2012 with some bits from:
under submission
31/32
32/32
33/32