Rial, A;
Danezis, G;
Kohlweiss, M;
(2018)
Privacy-preserving smart metering revisited.
International Journal of Information Security
, 17
pp. 1-31.
10.1007/s10207-016-0355-8.
Preview |
Text
meter-privacy-revisited.pdf - Accepted Version Download (508kB) | Preview |
Abstract
Privacy-preserving billing protocols are useful in settings where a meter measures user consumption of some service, such as smart metering of utility consumption, pay-as-you-drive insurance and electronic toll collection. In such settings, service providers apply fine-grained tariff policies that require meters to provide a detailed account of user consumption. The protocols allow the user to pay to the service provider without revealing the user’s consumption measurements. Our contribution is twofold. First, we propose a general model where a meter can output meter readings to multiple users, and where a user receives meter readings from multiple meters. Unlike previous schemes, our model accommodates a wider variety of smart metering applications. Second, we describe a protocol based on polynomial commitments that improves the efficiency of previous protocols for tariff policies that employ splines to compute the price due.
| Type: | Article |
|---|---|
| Title: | Privacy-preserving smart metering revisited |
| Open access status: | An open access version is available from UCL Discovery |
| DOI: | 10.1007/s10207-016-0355-8 |
| Publisher version: | http://dx.doi.org/10.1007/s10207-016-0355-8 |
| Language: | English |
| Additional information: | Copyright © 2016 Springer-Verlag Berlin Heidelberg. The final publication is available at Springer via http://dx.doi.org/10.1007/s10207-016-0355-8 |
| Keywords: | Universally composable security; Privacy; Billing; Smart meters; Polynomial commitments |
| UCL classification: | UCL UCL > Provost and Vice Provost Offices > UCL BEAMS UCL > Provost and Vice Provost Offices > UCL BEAMS > Faculty of Engineering Science UCL > Provost and Vice Provost Offices > UCL BEAMS > Faculty of Engineering Science > Dept of Computer Science |
| URI: | https://discovery.ucl.ac.uk/id/eprint/1532682 |
Archive Staff Only
 |
View Item |
