The DOI matches its Crossref record; 2 of the 2 references it cites were found in a registry or an index.
On the Implementation of the Discrete Fourier Transform in the Encrypted Domain
Abstract
Signal-processing modules working directly on encrypted data provide an elegant solution to application scenarios where valuable signals must 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 the direct DFT: the radix-2 and the radix-4 fast Fourier algorithms, including the error analysis and the maximum size of the sequence that can be transformed. We also provide computational complexity analyses and comparisons. The results show that the radix-4 fast Fourier transform is best suited for an encrypted domain implementation in the proposed scenarios.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Public-Key Cryptosystems Based on Composite Degree Residuosity Classes
Paillier, P. (2007) · Lecture Notes in Computer Science · doi:10.1007/3-540-48910-x_16 · Cited by 7,250
Goldreich, O., Micali, S., & Wigderson, A. (1987) · Proceedings of the nineteenth annual ACM conference on Theory of computing - STOC '87 · doi:10.1145/28395.28420 · Cited by 3,590
Cited by
Secure Medical Data Transmission Model for IoT-Based Healthcare Systems
Elhoseny, M., Ramirez-Gonzalez, G., Abu-Elnasr, O. M., Shawkat, S. A., Arunkumar, N., & Farouk, A. (2018) · IEEE Access · doi:10.1109/access.2018.2817615 · Cited by 546
Lagendijk, R. L., & Barni, M. (2013) · IEEE Signal Processing Magazine · doi:10.1109/msp.2012.2219653 · Cited by 336
Self-citationLossless and Reversible Data Hiding in Encrypted Images With Public-Key Cryptography
Zhang, X., Long, J., Wang, Z., & Cheng, H. (2016) · IEEE Transactions on Circuits and Systems for Video Technology · doi:10.1109/tcsvt.2015.2433194 · Cited by 289
Zhou, J., Liu, X., Au, O. C., & Tang, Y. Y. (2014) · IEEE Transactions on Information Forensics and Security · doi:10.1109/tifs.2013.2291625 · Cited by 192
Khelifi, F. (2018) · Signal Processing · doi:10.1016/j.sigpro.2017.09.020 · Cited by 63
Metadata
- Authors
- Bianchi, T., Piva, A., & Barni, M.
- Venue
- IEEE Transactions on Information Forensics and Security
- Published
- 2009-03
- Volume
- 4
- Issue
- 1
- Pages
- 86-97
- ISSN
- 1556-6013 (ISSN-L)
- OpenAlex
- W2142432849
- Cited by
- 177
- References
- 2
- FWCI
- 6.14
- Type
- journal article
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: On the Implementation of the Discrete Fourier Transform in the Encrypted Domain. https://app.cochat.ai/papers/10.1109/tifs.2008.2011087
- The paper
- Bianchi, T., Piva, A., & Barni, M. (2009). On the Implementation of the Discrete Fourier Transform in the Encrypted Domain. IEEE Transactions on Information Forensics and Security. https://doi.org/10.1109/tifs.2008.2011087
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.