Efficient and Secure Physical Encryption Scheme for Low-Power Wireless M2M Devices
The DOI matches its Crossref record; 2 of the 2 references it cites were found in a registry or an index.
Abstract
Recently, physical layer security has emerged as a promising security scheme for wireless networks, in contrast to traditional solutions that mainly rely on upper network layers. As such, several physical layer encryption algorithms that benefit from the random characteristics of physical channels have appeared in the literature. However, the majority of these schemes lack the notion of secrecy and dynamicity. In this paper, we focus on enhancing the physical layer encryption for wireless machine-to-machine devices, which share the same channel, with the aim of striking a good balance between performance and security robustness. The main idea is to perform encryption at the physical layer after symbol modulation. The cipher scheme is based on one round and one operation that reduces the encryption overhead in terms of latency and required resources. Furthermore, we propose a dynamic key approach that combines a pre-shared/stored secret key with a dynamic nonce extracted from the channel information to generate a dynamic key. The main advantage of the dynamic key approach is that it achieves a high-security level with minimal overhead. The dynamic key can be changed frequently upon any change in channel parameters or upon starting a new session. In addition to data encryption, a preamble encryption scheme is also proposed to prevent unauthorized synchronization or channel estimation by illegitimate users. Finally, security and performance analyses are performed to demonstrate the validity, efficiency and robustness of the proposed approach.
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
Bassham, L. E., Rukhin, A. L., Soto, J., Nechvatal, J. R., Smid, M. E., Barker, E. B., Leigh, S. D., Levenson, M., Vangel, M., Banks, D. L., et al. (2010) · NIST Special Publication 800-22 Revision 1a · doi:10.6028/nist.sp.800-22r1a · Cited by 3,617 · cited 1×
“To test the randomness of the produced dynamic keys, the empirical NIST statistical test [9] is applied on 100 sequences of one million bits, produced with 100 different secret keys.”
MethodOverview on Selective Encryption of Image and Video: Challenges and Perspectives
Massoudi, A., Lefebvre, F., De Vleeschouwer, C., Macq, B., & Quisquater, J.-J. (2008) · EURASIP Journal on Information Security · doi:10.1155/2008/179290 · Cited by 172 · cited 1×
“Consequently, this error might propagate and lead to data corruption, which is a big challenge since there exists a strong trade-off between the Avalanche effect and error propagation, as seen in the above traditional cryptographic algorithms [10].”
Background
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-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
“Moreover, recent approaches use common channel parameters as “you know” factor and the secret key as “you have” factor [350,351].”
Self-citationEfficient 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-citationEfficient and secure message authentication algorithm at the physical layer
Noura, H. N., Melki, R., Chehab, A., & Hernandez Fernandez, J. (2024) · Wireless Networks · doi:10.1007/s11276-020-02371-7 · Cited by 10
Self-citationSecure MIMO D2D communication based on a lightweight and robust PLS cipher scheme
Noura, H. N., Melki, R., Kanj, R., & Chehab, A. (2021) · Wireless Networks · doi:10.1007/s11276-020-02468-z · Cited by 6
Self-citation
Metadata
- Authors
- Noura, H., Melki, R., Chehab, A., Mansour, M. M., & Martin, S.
- Venue
- 2018 14th International Wireless Communications & Mobile Computing Conference (IWCMC)
- Publisher
- IEEE
- Published
- 2018-06
- Pages
- 1267-1272
- OpenAlex
- W2889037924
- Cited by
- 17
- References
- 2
- FWCI
- 6.03
- Type
- conference paper
- 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: Efficient and Secure Physical Encryption Scheme for Low-Power Wireless M2M Devices. https://app.cochat.ai/papers/10.1109/iwcmc.2018.8450330
- The paper
- Noura, H., Melki, R., Chehab, A., Mansour, M. M., & Martin, S. (2018). Efficient and Secure Physical Encryption Scheme for Low-Power Wireless M2M Devices. 2018 14th International Wireless Communications & Mobile Computing Conference (IWCMC). https://doi.org/10.1109/iwcmc.2018.8450330
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.