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

Stephan Adams

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

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

Computer networks · 1

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
Network security · 75% Cryptographic primitives and cryptanalysis · 25%
Computer networks
1 paper
Physical-layer communications · 100%

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

TopicWeightPapersLastEvidence papers
Network security › wireless network security › physical layer security
artificial noise
0.112011
Artificial Noise Generation from Cooperative Relays for Everlasting Secrecy in Two-Hop Wireless Networks · IEEE J. Sel. Areas Commun. 2011
Network security
eavesdropper
0.112011
Artificial Noise Generation from Cooperative Relays for Everlasting Secrecy in Two-Hop Wireless Networks · IEEE J. Sel. Areas Commun. 2011
Network security › wireless network security
physical layer security
0.112011
Artificial Noise Generation from Cooperative Relays for Everlasting Secrecy in Two-Hop Wireless Networks · IEEE J. Sel. Areas Commun. 2011
Cryptographic primitives and cryptanalysis › information-theoretic security
secrecy capacity
0.112011
Artificial Noise Generation from Cooperative Relays for Everlasting Secrecy in Two-Hop Wireless Networks · IEEE J. Sel. Areas Commun. 2011
Physical-layer communications › relaying
cooperative relaying
0.012011
Artificial Noise Generation from Cooperative Relays for Everlasting Secrecy in Two-Hop Wireless Networks · IEEE J. Sel. Areas Commun. 2011

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

stochastic analysis · 0.2multiuser diversity · 0.1multi-user diversity · 0.1
YearPublicationVenuePosition
2011 Artificial Noise Generation from Cooperative Relays for Everlasting Secrecy in Two-Hop Wireless Networks
abstract
The secure transmission of information in wireless networks without knowledge of eavesdropper channels or locations is considered. Two key mechanisms are employed: artificial noise generation from system nodes other than the transmitter and receiver, and a form of multi-user diversity that allows message reception in the presence of the artificial noise. We determine the maximum number of independently-operating and uniformly distributed eavesdroppers that can be present while the desired secrecy is achieved with high probability in the limit of a large number of system nodes. While our main motivation is considering eavesdroppers of unknown location, we first consider the case where the path-loss is identical between all pairs of nodes. In this case, a number of eavesdroppers that is exponential in the number of systems nodes can be tolerated. In the case of uniformly distributed eavesdroppers of unknown location, any number of eavesdroppers whose growth is sub-linear in the number of system nodes can be tolerated. The proposed approach significantly outperforms a power control approach based on standard multi-user diversity.
Dennis Goeckel, Sudarshan Vasudevan, Don Towsley, Stephan Adams, Zhiguo Ding 0001, Kin K. Leung
IEEE J. Sel. Areas Commun.4