Signal processing tools working directly on encrypted data could provide an efficient solution to application scenarios where sensitive signals must be protected from an untrusted processing device. In this paper, we consider the data expansion required to pass from the plaintext to the encrypted representation of signals, due to the use of cryptosystems operating on very large algebraic structures. A general composite signal representation allowing us to pack together a number of signal samples and process them as a unique sample is proposed. The proposed representation permits us to speed up linear operations on encrypted signals via parallel processing and to reduce the size of the encrypted signal. A case study—1-D linear filtering—shows the merits of the proposed representation and provides some insights regarding the signal processing algorithms more suited to work on the composite representation.

Composite Signal Representation for Fast and Storage-Efficient Processing of Encrypted Signals / T. Bianchi; A. Piva; M. Barni. - In: IEEE TRANSACTIONS ON INFORMATION FORENSICS AND SECURITY. - ISSN 1556-6013. - STAMPA. - 5 (1):(2010), pp. 180-187.

Composite Signal Representation for Fast and Storage-Efficient Processing of Encrypted Signals

PIVA, ALESSANDRO;
2010

Abstract

Signal processing tools working directly on encrypted data could provide an efficient solution to application scenarios where sensitive signals must be protected from an untrusted processing device. In this paper, we consider the data expansion required to pass from the plaintext to the encrypted representation of signals, due to the use of cryptosystems operating on very large algebraic structures. A general composite signal representation allowing us to pack together a number of signal samples and process them as a unique sample is proposed. The proposed representation permits us to speed up linear operations on encrypted signals via parallel processing and to reduce the size of the encrypted signal. A case study—1-D linear filtering—shows the merits of the proposed representation and provides some insights regarding the signal processing algorithms more suited to work on the composite representation.
2010
5 (1)
180
187
T. Bianchi; A. Piva; M. Barni
File in questo prodotto:
File Dimensione Formato  
J26.pdf

Accesso chiuso

Tipologia: Versione finale referata (Postprint, Accepted manuscript)
Licenza: Tutti i diritti riservati
Dimensione 456.67 kB
Formato Adobe PDF
456.67 kB Adobe PDF   Richiedi una copia

I documenti in FLORE sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.

Utilizza questo identificatore per citare o creare un link a questa risorsa: https://hdl.handle.net/2158/384692
Citazioni
  • ???jsp.display-item.citation.pmc??? ND
  • Scopus 95
  • ???jsp.display-item.citation.isi??? 69
social impact