Secure Dictionary Learning for Sparse Representation

In this paper, we propose secure dictionary learning for sparse representation based on a random unitary transform. Edge cloud computing is now spreading to many application fields including services that use sparse coding. This situation raises many new privacy concerns. The proposed scheme provides practical MOD and K-SVD schemes that allow computation on encrypted signals. We prove, theoretically, that the proposal has exactly the same dictionary and sparse coefficient estimation performance as sparse dictionary learning for unencrypted signals. It can be directly carried out by using MOD and K-SVD algorithms. Moreover, we apply it to image modeling based on an image patch model. Finally, we demonstrate its excellent performance on synthetic data and natural images.

[1]  Mauro Barni,et al.  Encrypted signal processing for privacy protection: Conveying the utility of homomorphic encryption and multiparty computation , 2013, IEEE Signal Processing Magazine.

[2]  Y. C. Pati,et al.  Orthogonal matching pursuit: recursive function approximation with applications to wavelet decomposition , 1993, Proceedings of 27th Asilomar Conference on Signals, Systems and Computers.

[3]  Kjersti Engan,et al.  Method of optimal directions for frame design , 1999, 1999 IEEE International Conference on Acoustics, Speech, and Signal Processing. Proceedings. ICASSP99 (Cat. No.99CH36258).

[4]  Vijay Varadharajan,et al.  Apsipa Transactions on Signal and Information Processing Additional Services for Apsipa Transactions on Signal and Information Processing: Survey on Securing Data Storage in the Cloud , 2022 .

[5]  Balas K. Natarajan,et al.  Sparse Approximate Solutions to Linear Systems , 1995, SIAM J. Comput..

[7]  Hitoshi Kiya,et al.  Practical Secure OMP Computation and Its Application to Image Modeling , 2018, IHIP 2018.

[8]  Tsuyoshi Murata,et al.  {m , 1934, ACML.

[9]  David J. Field,et al.  Emergence of simple-cell receptive field properties by learning a sparse code for natural images , 1996, Nature.

[10]  Michael Elad,et al.  Sparse and Redundant Representation Modeling—What Next? , 2012, IEEE Signal Processing Letters.

[11]  A. Bruckstein,et al.  K-SVD : An Algorithm for Designing of Overcomplete Dictionaries for Sparse Representation , 2005 .

[12]  Hitoshi Kiya,et al.  Privacy-Preserving Network BMI Decoding of Covert Spatial Attention , 2018, 2018 12th International Conference on Signal Processing and Communication Systems (ICSPCS).

[13]  Hitoshi Kiya,et al.  On the Security of Block Scrambling-Based EtC Systems against Extended Jigsaw Puzzle Solver Attacks , 2018, IEICE Trans. Inf. Syst..