Muutke küpsiste eelistusi

On Privacy-Preserving Protocols for Smart Metering Systems: Security and Privacy in Smart Grids 1st ed. 2017 [Kõva köide]

  • Formaat: Hardback, 143 pages, kõrgus x laius: 235x155 mm, kaal: 482 g, 37 Illustrations, color; 4 Illustrations, black and white; XXVII, 143 p. 41 illus., 37 illus. in color., 1 Hardback
  • Ilmumisaeg: 22-Aug-2016
  • Kirjastus: Springer International Publishing AG
  • ISBN-10: 3319407171
  • ISBN-13: 9783319407173
Teised raamatud teemal:
  • Kõva köide
  • Hind: 48,70 €*
  • * hind on lõplik, st. muud allahindlused enam ei rakendu
  • Tavahind: 57,29 €
  • Säästad 15%
  • Raamatu kohalejõudmiseks kirjastusest kulub orienteeruvalt 2-4 nädalat
  • Kogus:
  • Lisa ostukorvi
  • Tasuta tarne
  • Tellimisaeg 2-4 nädalat
  • Lisa soovinimekirja
  • Formaat: Hardback, 143 pages, kõrgus x laius: 235x155 mm, kaal: 482 g, 37 Illustrations, color; 4 Illustrations, black and white; XXVII, 143 p. 41 illus., 37 illus. in color., 1 Hardback
  • Ilmumisaeg: 22-Aug-2016
  • Kirjastus: Springer International Publishing AG
  • ISBN-10: 3319407171
  • ISBN-13: 9783319407173
Teised raamatud teemal:
This book presents current research in privacy-preserving protocols for smart grids. It contains several approaches and compares them analytically and by means of simulation. In particular, the book introduces asymmetric DC-Nets, which offer an ideal combination of performance and features in comparison with homomorphic encryption; data anonymization via cryptographic protocols; and data obfuscation by means of noise injection or by means of the installation of storage banks. The author shows that this theory can be leveraged into several application scenarios, and how asymmetric DC-Nets are generalizations of additive homomorphic encryption schemes and abstractions of symmetric DC-Nets. The book provides the reader with an understanding about smart grid scenarios, the privacy problem, and the mathematics and algorithms used to solve it.

List of Figures List of Tables List of Algorithms List of Acronyms List of Abbreviations List of Symbols Part I: Foundations 1. Introduction 2. Background and Models 3. A Selective Review Part II: Contributions 4. Reasons to Measure Frequently and Their Requirements 5. Quantifying the Aggregation Size 6. Selected Privacy-Preserving Protocols 7. Analytical Comparison 8. Simulation and Validation 9. Concluding Remarks A Algorithms B Parameters for ECC C Mean Measurement by Meter Glossary
Part I Foundations
1 Introduction
3(10)
1.1 Motivation
5(1)
1.2 Research Questions
6(1)
1.3 Contributions
7(2)
1.3.1 High Level Explanation of the Selected PPPs
8(1)
1.3.2 Summary of the Results
9(1)
1.4 Outline
9(4)
References
11(2)
2 Background and Models
13(12)
2.1 Smart Grids Around the World
13(4)
2.2 Security and Privacy Models
17(8)
2.2.1 Terminology in PPPs
17(1)
2.2.2 Security Model
18(3)
2.2.3 Privacy Model
21(2)
References
23(2)
3 A Selective Review
25(14)
3.1 Solutions with Restrictive Result
25(2)
3.1.1 Data Obfuscation by Means of Storage Banks
25(1)
3.1.2 Anonymization Via Pseudonymous
26(1)
3.1.3 Data Obfuscation by Means of Noise Injection
26(1)
3.2 Solutions Addressed in This Book: Anonymization Via Cryptographic Protocols
27(12)
3.2.1 Protocols Based on Homomorphic Encryption
28(2)
3.2.2 Protocols Based on DC-Nets
30(2)
3.2.3 Protocols Based on Commitment
32(2)
References
34(5)
Part II Contributions
4 Reasons to Measure Frequently and Their Requirements
39(10)
4.1 Reasons for Frequent Measurements
40(4)
4.1.1 Fraud and Energy Loss
40(1)
4.1.2 Virtualization of the Supplier Commodity Network
41(2)
4.1.3 Fair Distribution
43(1)
4.2 Requirements
44(5)
References
46(3)
5 Quantifying the Aggregation Size
49(12)
5.1 Algebraic Properties
50(6)
5.2 Probabilistic Properties
56(5)
References
59(2)
6 Selected Privacy-Preserving Protocols
61(40)
6.1 Monetary Value
62(1)
6.2 PPP1 The Fastest
63(3)
6.2.1 Security Analysis
65(1)
6.2.2 Privacy Analysis
65(1)
6.2.3 Performance Analysis
66(1)
6.3 PPP2 Based on Commitments and ECC
66(13)
6.3.1 Cryptographic Primitives
67(4)
6.3.2 Proposed Protocol
71(5)
6.3.3 Security Analysis
76(1)
6.3.4 Privacy Analysis
77(1)
6.3.5 Performance Analysis
78(1)
6.4 PPP3 Based on Asymmetric DC-Nets
79(13)
6.4.1 Cryptographic Primitives
80(4)
6.4.2 Attacker Model
84(1)
6.4.3 Proposed Protocol
85(1)
6.4.4 Verification Property
86(4)
6.4.5 Security Analysis
90(1)
6.4.6 Privacy Analysis
90(1)
6.4.7 Performance Analysis
91(1)
6.5 PPP4 Based on Quantum Mechanics
92(9)
6.5.1 Cryptographic Primitives
92(1)
6.5.2 Proposed Protocol
93(3)
6.5.3 Security Analysis
96(1)
6.5.4 Privacy Analysis
97(1)
References
97(4)
7 Analytical Comparison
101(10)
7.1 Security
102(1)
7.2 Privacy
103(1)
7.3 Requirements
104(1)
7.4 Verification Property
105(1)
7.5 Performance
105(2)
7.6 Summary
107(4)
References
108(3)
8 Simulation and Validation
111(16)
8.1 Dataset
111(7)
8.1.1 Anomalies
112(1)
8.1.2 Sanitized Dataset
113(1)
8.1.3 Dataset Characteristics
114(4)
8.2 Implementation of the Core Algorithms
118(1)
8.3 Simulation Parameters
118(1)
8.4 Simulation Results
119(8)
8.4.1 Encryption Algorithms
120(1)
8.4.2 Aggregation Algorithms
121(2)
8.4.3 Decryption Algorithms
123(1)
8.4.4 Overall Performance
124(2)
References
126(1)
9 Concluding Remarks
127(4)
9.1 Recapitulation
127(1)
9.2 Main Results
128(1)
9.3 Outlook
128(1)
9.4 Final Remarks
129(2)
A Algorithms 131(2)
B Parameters for ECC 133(2)
C Mean Measurement by Meter 135(2)
Glossary 137(2)
Index 139
Prof. Dr.-Ing. Fábio Borges de Oliveira concluded his doctoral research on security and privacy in smart grids. In 1994, a civil service examination selected him to the position of civil servant in the State University of Londrina - Brazil (UEL - Universidade Estadual de Londrina in Portuguese). In 2002, another civil service examination selected him to work for the Ministry of Science, Technology, and Innovation at the Brazilian National Laboratory for Scientific Computing (LNCC - Laboratório Nacional de Computação Científica in Portuguese). From 2011 to 2015, Horst Görtz Foundation supported him to work at the Technological University of Darmstadt - Germany (TU Darmstadt - Technische Universität Darmstadt in German). He holds a Ph.D. degree in Doctor of Engineering in the Department of Computer Science at TU Darmstadt, a master's degree in Computational Modeling at LNCC, and a bachelor's degree in Mathematics at UEL. Currently, he is developing research on algorithms, security, cryptography, and privacy at LNCC - Brazil.