Privacy-preserving smart metering revisited

Rial, Alfredo; Danezis, George; Kohlweiss, Markulf

doi:10.1007/s10207-016-0355-8

Cited by 11 publications

(4 citation statements)

References 42 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Application to PPB. In the PPB protocols in [39,40], a meter reading comprises the consumption c and the time interval i of consumption. The tariff policy associates a different function p = f i (c) to each time interval (and possibly to each consumption interval).…”

Section: Modular Design With F Ud and Applicationsmentioning

confidence: 99%

“…In POT [9,41] (resp. PPB [39,40]) protocols, the user frequently uses a zeroknowledge (ZK) proof to prove that p i (resp. r i ) is correctly associated with i.…”

Section: Introductionmentioning

confidence: 99%

“…To allow the user to prove knowledge of an entry [i, vr i ] from DB, DB needs to be stored into some data structure that allows for efficient ZK proofs. POT [9,41] and PPB [39,40] protocols typically use a signature scheme with efficient ZK proofs of signature possession. The provider computes signatures s i on tuples [i, vr i ] (∀i ∈ [1, N]) and sends them to the user.…”

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

UC Updatable Databases and Applications

Damodaran

Rial

2020

Progress in Cryptology - AFRICACRYPT 2020

Self Cite

View full text Add to dashboard Cite

We define an ideal functionality FUD and a construction ΠUD for an updatable database (UD). UD is a two-party protocol between an updater and a reader. The updater sets the database and updates it at any time throughout the protocol execution. The reader computes zeroknowledge (ZK) proofs of knowledge of database entries. These proofs prove that a value is stored at a certain position in the database, without revealing the position or the value.(Non-)updatable databases are implicitly used as building block in priced oblivious transfer, privacy-preserving billing and other privacypreserving protocols. Typically, in those protocols the updater signs each database entry, and the reader proves knowledge of a signature on a database entry. Updating the database requires a revocation mechanism to revoke signatures on outdated database entries.Our construction ΠUD uses a non-hiding vector commitment (NHVC) scheme. The updater maps the database to a vector and commits to the database. This commitment can be updated efficiently at any time without needing a revocation mechanism. ZK proofs for reading a database entry have communication and amortized computation cost independent of the database size. Therefore, ΠUD is suitable for large databases. We implement ΠUD and our timings show that it is practical.In existing privacy-preserving protocols, a ZK proof of a database entry is intertwined with other tasks, e.g., proving further statements about the value read from the database or the position where it is stored. FUD allows us to improve modularity in protocol design by separating those tasks. We show how to use FUD as building block of a hybrid protocol along with other functionalities.

show abstract

Section: Modular Design With F Ud and Applicationsmentioning

confidence: 99%

“…In POT [9,41] (resp. PPB [39,40]) protocols, the user frequently uses a zeroknowledge (ZK) proof to prove that p i (resp. r i ) is correctly associated with i.…”

Section: Introductionmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

UC Updatable Databases and Applications

Damodaran

Rial

2020

Progress in Cryptology - AFRICACRYPT 2020

Self Cite

View full text Add to dashboard Cite

show abstract

“…Authors of [24] explain how for privacy preserving an individual meter of a consumer can share its readings to multiple consumers, and how a consumer can receive meter readings from multiple meters. They propose a polynomial-based protocol for pricing.…”

Section: Related Workmentioning

confidence: 99%

Statistical-Based Privacy-Preserving Scheme with Malicious Consumers Identification for Smart Grid

Ahadipour,

Mohammadi,

Keshavarz-Haddad

2019

Preprint

View full text Add to dashboard Cite

As smart grids are getting popular and being widely implemented, preserving the privacy of consumers is becoming more substantial. Power generation and pricing in smart grids depends on the continuously gathered information from the consumers. However, having access to the data relevant to the electricity consumption of each individual consumer is in conflict with its privacy. One common approach for preserving privacy is to aggregate data of different consumers and to use their smartmeters for calculating the bills. But in this approach, malicious consumers who send erroneous data to take advantage or disrupt smart grid cannot be identified. In this paper, we propose a new statistical-based scheme for data gathering and billing in which the privacy of consumers is preserved, and at the same time, if any consumer with erroneous data can be detected. Our simulation results verify these matters.

show abstract

Practical Single-Pass Oblivious Aggregation and Billing Computation Protocols for Smart Meters

Mandal

2022

Cryptology and Network Security

View full text Add to dashboard Cite

Privacy-preserving smart metering revisited

Cited by 11 publications

References 42 publications

UC Updatable Databases and Applications

UC Updatable Databases and Applications

Statistical-Based Privacy-Preserving Scheme with Malicious Consumers Identification for Smart Grid

Practical Single-Pass Oblivious Aggregation and Billing Computation Protocols for Smart Meters

Contact Info

Product

Resources

About