Look-Up Table based FHE System for Privacy Preserving Anomaly Detection in Smart Grids

被引:5
|
作者
Li, Ruixiao [1 ]
Bhattacharjee, Shameek [2 ]
Das, Sajal K. [3 ]
Yamana, Hayato [1 ]
机构
[1] Waseda Univ, Dept Comp Sci & Commun Engn, Tokyo, Japan
[2] Western Michigan Univ, Dept Comp Sci, Kalamazoo, MI 49008 USA
[3] Missouri Univ Sci & Technol, Dept Comp Sci, Rolla, MO USA
关键词
anomaly (attack) detection; smart grid; privacy-preserving; FHE; look-up table;
D O I
10.1109/SMARTCOMP55677.2022.00030
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
In advanced metering infrastructure (AMI), the customers' power consumption data is considered private but needs to be revealed to data-driven attack detection frameworks. In this paper, we present a system for privacy-preserving anomaly-based data falsification attack detection over fully homomorphic encrypted (FHE) data, which enables computations required for the attack detection over encrypted individual customer smart meter's data. Specifically, we propose a homomorphic lookup table (LUT) based FHE approach that supports privacy preserving anomaly detection between the utility, customer, and multiple partied providing security services. In the LUTs, the data pairs of input and output values for each function required by the anomaly detection framework are stored to enable arbitrary arithmetic calculations over FHE. Furthermore, we adopt a private information retrieval (PIR) approach with FHE to enable approximate search with LUTs, which reduces the execution time of the attack detection service while protecting private information. Besides, we show that by adjusting the significant digits of inputs and outputs in our LUT, we can control the detection accuracy and execution time of the attack detection, even while using FHE. Our experiments confirmed that our proposed method is able to detect the injection of false power consumption in the range of 11-17 secs of execution time, depending on detection accuracy.
引用
收藏
页码:108 / 115
页数:8
相关论文
共 50 条
  • [1] Face detection using look-up table based Gentle AdaBoost
    Demirkir, C
    Sankur, B
    AUDIO AND VIDEO BASED BIOMETRIC PERSON AUTHENTICATION, PROCEEDINGS, 2005, 3546 : 339 - 345
  • [2] Privacy Preservation for Trajectory Data Publishing by Look-Up Table Generalization
    Harnsamut, Nattapon
    Natwichai, Juggapong
    Riyana, Surapon
    DATABASES THEORY AND APPLICATIONS, ADC 2018, 2018, 10837 : 15 - 27
  • [3] A Novel Polynomial Predistorter Based on Look-Up Table
    Chen, Bin
    Ren, Guo-chun
    Chen, Jin
    Gong, Yu-ping
    ASIA-PACIFIC YOUTH CONFERENCE ON COMMUNICATION TECHNOLOGY 2010 (APYCCT 2010), 2010, : 632 - 635
  • [4] A shifter look-up table technique based on HXDSP
    Ye H.
    Gu N.
    Lin C.
    Zhang X.
    Chen R.
    Beijing Hangkong Hangtian Daxue Xuebao/Journal of Beijing University of Aeronautics and Astronautics, 2019, 45 (10): : 2044 - 2050
  • [5] A Test Approach for Look-Up Table Based FPGAs
    Ehsan Atoofian
    Zainalabedin Navabi
    Journal of Computer Science and Technology, 2006, 21 : 141 - 146
  • [6] A test approach for look-up table based FPGAs
    Atoofian, E
    Navabi, Z
    JOURNAL OF COMPUTER SCIENCE AND TECHNOLOGY, 2006, 21 (01) : 141 - 146
  • [7] A Privacy Preserving Approach to Energy Theft Detection in Smart Grids
    Richardson, Christopher
    Race, Nicholas
    Smith, Paul
    IEEE SECOND INTERNATIONAL SMART CITIES CONFERENCE (ISC2 2016), 2016, : 833 - 836
  • [8] High-accuracy scheme based on a look-up table for motion detection in an optical camera communication system
    He, Jing
    Huang, Zheng
    Yu, Ke
    OPTICS EXPRESS, 2020, 28 (07): : 10270 - 10279
  • [9] A privacy-preserving cancelable iris template generation scheme using decimal encoding and look-up table mapping.
    Dwivedi, Rudresh
    Dey, Somnath
    Singh, Ramveer
    Prasad, Aditya
    COMPUTERS & SECURITY, 2017, 65 : 373 - 386
  • [10] Demonstration of a VCSEL-based optoelectronic look-up table
    Irakliotis, LJ
    Stanko, PJ
    Wilmsen, CW
    Mitkas, PA
    IEEE PHOTONICS TECHNOLOGY LETTERS, 1997, 9 (04) : 502 - 504