default search action
Khurram Shahzad 0003
Person information
- affiliation: Australian National University, Canberra, ACT, Australia
Other persons with the same name
- Khurram Shahzad — disambiguation page
- Muhammad Khuram Shahzad (aka: Khurram Shahzad 0001) — Sungkyunkwan University, Suwon, South Korea
- Khurram Shahzad 0002 — University of the Punjab, Lahore, Pakistan (and 1 more)
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j6]Qazi Emad-ul-Haq, Tanveer A. Zia, Muhammad Hamza Faheem, Khurram Shahzad, Muhammad Imran, Zeeshan Ahmed:
Zero-Touch Network Security (ZTNS): A Network Intrusion Detection System Based on Deep Learning. IEEE Access 12: 141625-141638 (2024) - 2022
- [j5]Yurika Pant Khanal, Abeer Alsadoon, Khurram Shahzad, Ahmad Baheej Al-Khalil, Penatiyana W. C. Prasad, Sabih ur Rehman, Rafiqul Islam:
Utilizing Blockchain for IoT Privacy through Enhanced ECIES with Secure Hash Function. Future Internet 14(3): 77 (2022) - [j4]Khurram Shahzad, Tanveer A. Zia, Emad-ul-Haq Qazi:
A Review of Functional Encryption in IoT Applications. Sensors 22(19): 7567 (2022) - 2021
- [j3]Khurram Shahzad, Xiangyun Zhou:
Covert Wireless Communications Under Quasi-Static Fading With Channel Uncertainty. IEEE Trans. Inf. Forensics Secur. 16: 1104-1116 (2021) - 2020
- [i5]Khurram Shahzad, Xiangyun Zhou:
Covert Wireless Communications under Quasi-Static Fading with Channel Uncertainty. CoRR abs/2009.13023 (2020)
2010 – 2019
- 2019
- [j2]Khurram Shahzad, Xiangyun Zhou, Shihao Yan:
Covert Wireless Communication in Presence of a Multi-Antenna Adversary and Delay Constraints. IEEE Trans. Veh. Technol. 68(12): 12432-12436 (2019) - [c4]Khurram Shahzad, Xiangyun Zhou:
Covert Communication in Backscatter Radio. ICC 2019: 1-6 - [i4]Khurram Shahzad, Xiangyun Zhou, Shihao Yan:
Covert Wireless Communication in Presence of a Multi-Antenna Adversary and Delay Constraints. CoRR abs/1910.07246 (2019) - 2018
- [j1]Khurram Shahzad, Xiangyun Zhou, Shihao Yan, Jinsong Hu, Feng Shu, Jun Li:
Achieving Covert Wireless Communications Using a Full-Duplex Receiver. IEEE Trans. Wirel. Commun. 17(12): 8517-8530 (2018) - [c3]Jinsong Hu, Khurram Shahzad, Shihao Yan, Xiangyun Zhou, Feng Shu, Jun Li:
Covert Communications with a Full-Duplex Receiver over Wireless Fading Channels. ICC 2018: 1-6 - [c2]Khurram Shahzad:
Relaying via Cooperative Jamming in Covert Wireless Communications. ICSPCS 2018: 1-6 - [i3]Khurram Shahzad, Xiangyun Zhou, Shihao Yan, Jinsong Hu, Feng Shu, Jun Li:
Achieving Covert Wireless Communications Using a Full-Duplex Receiver. CoRR abs/1810.06741 (2018) - 2017
- [c1]Khurram Shahzad, Xiangyun Zhou, Shihao Yan:
Covert Communication in Fading Channels under Channel Uncertainty. VTC Spring 2017: 1-5 - [i2]Khurram Shahzad, Xiangyun Zhou, Shihao Yan:
Covert Communication in Fading Channels under Channel Uncertainty. CoRR abs/1703.02169 (2017) - [i1]Jinsong Hu, Khurram Shahzad, Shihao Yan, Xiangyun Zhou, Feng Shu, Jun Li:
Covert Communications with A Full-Duplex Receiver over Wireless Fading Channels. CoRR abs/1711.03684 (2017)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from , , and to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-01-20 23:59 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint