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

Linman Yu

dblp:172/8345 · DBLP profile ↗
← Back
3ranked-venue papers
0as first author
0since 2021 · last 2019
—ORCID · none

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

Computer networks · 1Security and privacy · 1Theory of computation · 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.

Theoretical computer science
1 paper
Information theory · 75% Coding theory · 25%
Network and information security
2 papers
Cryptographic primitives and cryptanalysis · 100%
Computer networks
1 paper
Physical-layer communications · 100%

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

TopicWeightPapersLastEvidence papers
Information theory › network information theory
broadcast channel
0.412019
Feedback Coding Schemes for the Broadcast Channel With Mutual Secrecy Requirement at the Receivers · IEEE Trans. Commun. 2019
Coding theory › channel coding › feedback communication
feedback coding
0.412019
Feedback Coding Schemes for the Broadcast Channel With Mutual Secrecy Requirement at the Receivers · IEEE Trans. Commun. 2019
Information theory › information-theoretic security
physical-layer security
0.412019
Feedback Coding Schemes for the Broadcast Channel With Mutual Secrecy Requirement at the Receivers · IEEE Trans. Commun. 2019
Information theory › information-theoretic security › secrecy capacity
secrecy capacity region
0.412019
Feedback Coding Schemes for the Broadcast Channel With Mutual Secrecy Requirement at the Receivers · IEEE Trans. Commun. 2019
Physical-layer communications › relaying
relay channel
0.212016
Relay Broadcast Channel With Confidential Messages · IEEE Trans. Inf. Forensics Secur. 2016
Cryptographic primitives and cryptanalysis
key generation
0.112019
Feedback Coding Schemes for the Broadcast Channel With Mutual Secrecy Requirement at the Receivers · IEEE Trans. Commun. 2019
Cryptographic primitives and cryptanalysis
information-theoretic security
0.112016
Relay Broadcast Channel With Confidential Messages · IEEE Trans. Inf. Forensics Secur. 2016
Cryptographic primitives and cryptanalysis › information-theoretic security
secrecy capacity
0.112016
Relay Broadcast Channel With Confidential Messages · IEEE Trans. Inf. Forensics Secur. 2016

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

information-theoretic security · 0.8degraded gaussian example · 0.5capacity-equivocation region bounds · 0.5inner bounds · 0.4inner bound · 0.4
YearPublicationVenuePosition
2019 Feedback Coding Schemes for the Broadcast Channel With Mutual Secrecy Requirement at the Receivers
abstract
The broadcast channel with mutual secrecy requirement at the receivers (BC-MSR-R) is a basic model characterizing the physical layer security (PLS) in the down-link of the wireless communication systems, where one transmitter sends two independent messages to two receivers via a broadcast channel, and each receiver can successfully decode his/her intended message and wishes to overhear the other one's message. This paper studies how to enhance the already existing secrecy rate region of the BC-MSR-R via receivers' feedback. Specifically, we propose two feedback strategies for the BC-MSR-R, where one uses the feedback to generate pure secret keys protecting the transmitted messages, and the other uses the feedback to generate not only keys but also cooperative messages helping the receivers to improve their decoding performance. Different inner bounds on the secrecy capacity region of the BC-MSR-R with noiseless feedback are constructed according to different feedback strategies, and these bounds are further illustrated by a Dueck-type example.
Bin Dai 0003, Linman Yu, Xuxun Liu 0001, Zheng Ma 0001
IEEE Trans. Commun.2
2018 New Results on the Wire-tap Channel with Noiseless Feedback
abstract
The model of wiretap channel (WTC) is important as it constitutes the essence of physical layer security (PLS). Wiretap channel with noiseless feedback (WTC-NF) is especially interesting as it shows what can be done when a private feedback is available. The already existing secret key based feedback coding scheme focuses on generating key from the feedback and using this key to protect part of the transmitted message. It has been shown that this secret key based feedback coding scheme is only optimal for the degraded WTC-NF, and finding an optimal feedback scheme for the general WTC-NF motivates us to exploit other uses of the feedback. In this paper, a new feedback coding scheme for the general WTC-NF is proposed, where the feedback is not only used to generate key, but also used to generate help information which helps the legitimate parties to improve the communication between them. We show that the proposed new feedback scheme performs better than the already existing one, and a binary example is given to further explain the results of this paper.
Bin Dai 0003, Linman Yu, Yuan Luo 0003
ITW2
2016 Relay Broadcast Channel With Confidential Messages
abstract
In this paper, we investigate the effects of a trusted relay node on the secrecy of the broadcast channel by considering the model of relay broadcast channel with confidential messages (RBC-CM). Inner and outer bounds on the capacity-equivocation region of the RBC-CM are provided, and the capacity results are further explained via a degraded Gaussian example, which we call the degraded Gaussian relay broadcast channel with one common and one confidential messages. Numerical results show that this trusted relay node helps to enhance the security of the Gaussian broadcast channel with one common and one confidential messages.
Bin Dai 0003, Linman Yu, Zheng Ma 0001
IEEE Trans. Inf. Forensics Secur.2