On the implementation of the discrete fourier transform in the encrypted domain

IEEE Transactions on Information Forensics and Security

Volumn 4, Issue 1, 2009, Pages 86-97

  Bianchi, Tiziano ^a   Piva, Alessandro ^a   Barni, Mauro ^b  

^a UNIVERSITY OF FLORENCE   (Italy)

^b UNIVERSITY OF SIENA   (Italy)

Author keywords

Discrete Fourier transform (DFT); Error analysis; Fast Fourier transform (FFT); Homomorphic encryption; Secure signal processing; Signal processing in the encrypted domain; Signal representation

Indexed keywords

BLOCK CODES; COMPUTATIONAL COMPLEXITY; CRYPTOGRAPHY; DISCRETE FOURIER TRANSFORMS; ERROR ANALYSIS; ERRORS; FAST FOURIER TRANSFORMS; IMAGE QUALITY; OBJECT RECOGNITION; PROBABILITY DENSITY FUNCTION; SIGNAL PROCESSING;

DISCRETE FOURIER TRANSFORM (DFT); FAST FOURIER TRANSFORM (FFT); HOMOMORPHIC ENCRYPTION; SECURE SIGNAL PROCESSING; SIGNAL PROCESSING IN THE ENCRYPTED DOMAIN; SIGNAL REPRESENTATION;

FOURIER TRANSFORMS;

EID: 60449095773     PISSN: 15566013     EISSN: None     Source Type: Journal    
DOI: 10.1109/TIFS.2008.2011087     Document Type: Article

References (24)

1. Z. Erkin, A. Piva, S. Katzenbeisser, R. L. Lagendijk, J. Shokrollahi, G. Neven, and M. Barni, "Protection and retrieval of encrypted multimedia content: When cryptography meets signal processing," EURASIP J. Inf. Security, vol. 2007, pp. 20-20, 2007.
2. R. Rivest, L. Adleman, and M. Dertouzos, "On data banks and privacy homomorphisms," in Foundations of Secure Computation, R. DeMillo, Ed. et al. London, U.K.: Academic, 1978, pp. 169-179.
3. S. Goldwasser and S. Micali, "Probabilistic encryption," J. Comput. Syst. Sci., vol. 28, no. 2, pp. 270-299, 1984.
4. A. C. Yao, "Protocols for secure computations," in Proc. IEEE Symp. Foundations Computer Science, Chicago, IL, Nov. 1982, pp. 160-164.
5. O. Goldreich, S. Micali, and A. Wigderson, "How to play ANY mental game," in Proc. 19th Annu. ACM Conf. Theory of Computing, New York, 1987, pp. 218-229.
6. R. Cramer, I. Damgård, and J. B. Nielsen, "Multiparty computation from threshold homomorphic encryption," in, ser. Lect. Notes Comput. Sci. New York: Springer, 2001, vol. 2045, pp. 280-300.
7. B. Schoenmakers and P. Tuyls, "Efficient binary conversion for Paillier encrypted values," in Proc. Eurocrypt: Advances in Cryptology, ser. Lect. Notes Comput. Sci. Berlin, Germany: Springer, 2006, vol. 4004, pp. 522-537.
8. N. Memon and P. Wong, "A buyer-seller watermarking protocol," IEEE Trans. Image Process., vol. 10, no. 4, pp. 643-649, Apr. 2001.
9. C.-L. Lei, P.-L. Yu, P.-L. Tsai, and M.-H. Chan, "An efficient and anonymous buyer-seller watermarking protocol," IEEE Trans. Image Process., vol. 13, no. 12, pp. 1618-1626, Dec. 2004.
10. M. Kuribayashi and H. Tanaka, "Fingerprinting protocol for images based on additive homomorphic property," IEEE Trans. Image Processing, vol. 14, no. 12, pp. 2129-2139, Dec. 2005.
11. P. Paillier, "Public-key cryptosystems based on composite degree residuosity classes," in Proc. Eurocrypt: Advances in Cryptology, ser. Lect. Notes Comput. Sci. Berlin, Germany: Springer-Verlag, 1999, vol. 1592, pp. 223-238.
12. I. Damgârd and M. Jurik, "A generalisation, a simplification and some applications of Paillier's probabilistic public-key system," in Public Key Cryptography, 2001, pp. 119-136.
13. m DFT's," IEEE Trans. Acoust., Speech, Signal Process., vol. 37, no. 1, pp. 57-64, Jan. 1989.
14. H. Sorensen, D. Jones, M. Heideman, and C. Burrus, "Real-valued fast Fourier transform algorithms," IEEE Trans. Acoust., Speech, Signal Process., vol. 35, no. 6, pp. 849-863, Jun. 1987.
15. A. V. Oppenheim and R. W. Schafer, Digital Signal Processing. Englewood Cliffs, NJ: Prentice-Hall, 1975.
16. L. R. Rabiner and B. Gold, Theory and Application of Digital Signal Processing. Englewood Cliffs, NJ: Prentice-Hall, 1975.
17. P. D. Welch, "A fixed-point fast Fourier transform error analysis," IEEE Trans. Audio Electroacoust., vol. AU-17, no. 2, pp. 151-157, Jun. 1969.
18. A. V. Oppenheim and C. J. Weinstein, "Effects of finite register length in digital filtering and the fast Fourier transform," Proc. IEEE, vol. 60, no. 8, pp. 957-976, Aug. 1972.
19. D. V. James, "Quantization errors in the fast Fourier transform," IEEE Trans. Acoust., Speech, Signal Process., vol. ASSP-23, no. 3, pp. 277-283, Jun. 1975.
20. E. Savas and Ç. K. Koç, "The Montgomery modular inverse-Revisited," IEEE Trans. Comput., vol. 49, no. 7, pp. 763-766, Jul. 2000.
21. M. E. Kaihara and N. Takagi, "A hardware algorithm for modular multiplication/division," IEEE Trans. Comput., vol. 54, no. 1, pp. 12-21, Jan. 2005.
22. Ç. K. Koç, T. Acar, and B. S. Kalinski, "Analyzing and comparing Montgomery multiplication algorithms," IEEE Micro, vol. 16, no. 3, pp. 26-33, Jun. 1996.
23. B. S. Kalinski, "The Montgomery inverse and its applications," IEEE Trans. Comput., vol. 44, no. 8, pp. 1064-1065, Aug. 1995.
24. D. E. Knuth, The Art of Computer Programming, 3rd: Seminumerical algorithms ed. Reading, MA: Addison-Wesley Longman, 1997, vol. 2.