An Efficient OFDM-Based Encryption Scheme Using a Dynamic Key Approach
The DOI matches its Crossref record; 1 of the 1 references it cites were found in a registry or an index.
Abstract
Physical layer (PHY) security has emerged as a promising methodology for securing current and future networks that employ orthogonal frequency-division multiplexing (OFDM) technology. OFDM is the basic building block for multicarrier modulation in most contemporary networks such as vehicular ad hoc networks, Internet of Things (IoT), as well as 4G/5G systems. Most existing OFDM-based security solutions lack the notion of secrecy and dynamicity when combining a secret key with random information extracted from the physical channel. Yet, some solutions perform encryption preinverse fast Fourier transform and some postinverse fast Fourier transform, without clear guidelines concerning the impact on performance and security. In this paper, OFDM-based encryption schemes at the PHY are investigated, analyzed, and weaknesses are identified. It is shown that encryption in the frequency domain slightly mitigates the effects of channel fading and improves the bit error-rate performance. On the other hand, time-domain encryption is shown to be more secure. Furthermore, a dynamic secret key approach that enhances the security level of OFDM-based encryption schemes, in addition to a new technique for updating cipher primitives for input OFDM symbols or frames, are proposed. These schemes are shown to strike a good balance between performance and security robustness as demonstrated through experimental simulations.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
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
Communication Theory of Secrecy Systems
Shannon, C. E. (1949) · Bell System Technical Journal · doi:10.1002/j.1538-7305.1949.tb00928.x · Cited by 9,440
Cited by
Security analysis of drones systems: Attacks, limitations, and recommendations
Yaacoub, J.-P., Noura, H., Salman, O., & Chehab, A. (2020) · Internet of Things · doi:10.1016/j.iot.2020.100218 · Cited by 727
“This is the case of the approach in [410] , [411] , which uses a single-round function by relying on common channel parameters as "you know" factor and the secret key as "you have" factor to produce a dynamic key since wireless channel parameters change in a random manner [322] .”
Self-citationCyber-physical systems security: Limitations, issues and future trends
Yaacoub, J.-P. A., Salman, O., Noura, H. N., Kaaniche, N., Chehab, A., & Malli, M. (2020) · Microprocessors and Microsystems · doi:10.1016/j.micpro.2020.103201 · Cited by 491
Self-citationRobotics cyber security: vulnerabilities, attacks, countermeasures, and recommendations
Yaacoub, J.-P. A., Noura, H. N., Salman, O., & Chehab, A. (2022) · International Journal of Information Security · doi:10.1007/s10207-021-00545-8 · Cited by 320
Self-citationSecuring internet of medical things systems: limitations, issues and recommendations
Yaacoub, J.-P. A., Noura, M., Noura, H. N., Salman, O., Yaacoub, E., Couturier, R., & Chehab, A. (2020) · Future Generation Computer Systems · doi:10.1016/j.future.2019.12.028 · Cited by 308
“To address this issue, the cryptographic algorithms proposed in [97]-[112] rely on a dynamic structure instead of the typical static structure, whereby the cipher primitives change for each”
MethodEfficient data confidentiality scheme for 5G wireless NOMA communications
Noura, H. N., Melki, R., & Chehab, A. (2021) · Journal of Information Security and Applications · doi:10.1016/j.jisa.2021.102781 · Cited by 15
Self-citation
Metadata
- Authors
- Melki, R., Noura, H. N., Mansour, M. M., & Chehab, A.
- Venue
- IEEE Internet of Things Journal
- Published
- 2019-02
- Volume
- 6
- Issue
- 1
- Pages
- 361-378
- ISSN
- 2327-4662 (ISSN-L)
- 2372-2541
- OpenAlex
- W2808282987
- Cited by
- 62
- References
- 1
- FWCI
- 3.29
- 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
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.