Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Mohamed F. Haroun

dblp:166/3067 · DBLP profile ↗
← Back
1ranked-venue papers
1as first author
0since 2021 · last 2015
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Security and privacy · 1 · 1 first-author

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Network and information security
1 paper
Cryptographic primitives and cryptanalysis · 100%
Computer networks
1 paper
Physical-layer communications · 100%

Topics — the 4 heaviest of 4, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Cryptographic primitives and cryptanalysis
key generation
0.212015
Secret Key Generation Using Chaotic Signals Over Frequency Selective Fading Channels · IEEE Trans. Inf. Forensics Secur. 2015
Cryptographic primitives and cryptanalysis › key generation
physical-layer key generation
0.212015
Secret Key Generation Using Chaotic Signals Over Frequency Selective Fading Channels · IEEE Trans. Inf. Forensics Secur. 2015
Physical-layer communications › fading channels
frequency-selective fading
0.112015
Secret Key Generation Using Chaotic Signals Over Frequency Selective Fading Channels · IEEE Trans. Inf. Forensics Secur. 2015
Physical-layer communications › fading channels
wireless fading channel
0.112015
Secret Key Generation Using Chaotic Signals Over Frequency Selective Fading Channels · IEEE Trans. Inf. Forensics Secur. 2015

Methods — techniques the papers use, named apart from their topics

information reconciliation · 0.4chaotic signal · 0.4
YearPublicationVenuePosition
2015 Secret Key Generation Using Chaotic Signals Over Frequency Selective Fading Channels
abstract
This paper presents a practical key generation algorithm based on the reciprocity of wireless fading channels. A broadband chaotic signal is employed for transmission so that the fading is frequency selective. In this case, signal components in the frequency domain spaced greater than the coherence bandwidth of the channel can be considered uncorrelated. The proposed algorithm exploits this property to generate a unique shared key between two parties. The nonperiodicity of the chaotic signal provides a unique signal for key generation, which can be used even with static fading channels. The proposed approach is robust to timing differences between the parties because the frequency spectrum of the signals is employed. A technique for information reconciliation is presented which does not reveal any information about the values used to generate the key. The randomness of the key is confirmed, and the effects of additive white Gaussian noise and timing differences on the performance of the algorithm are examined.
Mohamed F. Haroun, T. Aaron Gulliver
IEEE Trans. Inf. Forensics Secur.1