Signal processing modules working directly on the encrypted data could provide an elegant solution to application scenarios where valuable signals should be protected from a malicious processing device. In this paper, we investigate the implementation of the discrete Fourier transform (DFT) in the encrypted domain, by using the homomorphic properties of the underlying cryptosystem. Several important issues are considered for both the DFT and radix-2 fast Fourier transform, including the error analysis and the maximum size of the sequence that can be transformed.
Implementing the Discrete Fourier Transform in the Encrypted Domain / T. Bianchi; A. Piva; M. Barni. - ELETTRONICO. - (2008), pp. 1757-1760. (Intervento presentato al convegno 33rd IEEE International Conference on Acoustics, Speech, and Signal Processing (ICASSP2008) tenutosi a Las Vegas, Nevada nel March 30-April 4 2008).
Implementing the Discrete Fourier Transform in the Encrypted Domain
PIVA, ALESSANDRO;
2008
Abstract
Signal processing modules working directly on the encrypted data could provide an elegant solution to application scenarios where valuable signals should be protected from a malicious processing device. In this paper, we investigate the implementation of the discrete Fourier transform (DFT) in the encrypted domain, by using the homomorphic properties of the underlying cryptosystem. Several important issues are considered for both the DFT and radix-2 fast Fourier transform, including the error analysis and the maximum size of the sequence that can be transformed.
| File | Dimensione | Formato | |
|---|---|---|---|
|
C84.pdf
Accesso chiuso
Tipologia:
Versione finale referata (Postprint, Accepted manuscript)
Licenza:
Open Access
Dimensione
123.34 kB
Formato
Adobe PDF
|
123.34 kB | Adobe PDF | Richiedi una copia |
I documenti in FLORE sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
