惯性聚合 高效追踪和阅读你感兴趣的博客、新闻、科技资讯
阅读原文 在惯性聚合中打开

推荐订阅源

U
Unit 42
F
Fortinet All Blogs
Martin Fowler
Martin Fowler
钛媒体:引领未来商业与生活新知
钛媒体:引领未来商业与生活新知
IT之家
IT之家
Blog — PlanetScale
Blog — PlanetScale
罗磊的独立博客
V
V2EX
Vercel News
Vercel News
Apple Machine Learning Research
Apple Machine Learning Research
J
Java Code Geeks
freeCodeCamp Programming Tutorials: Python, JavaScript, Git & More
T
Tailwind CSS Blog
I
InfoQ
Engineering at Meta
Engineering at Meta
WordPress大学
WordPress大学
S
SegmentFault 最新的问题
H
Help Net Security
腾讯CDC
D
Docker
P
Proofpoint News Feed
GbyAI
GbyAI
博客园 - 三生石上(FineUI控件)
aimingoo的专栏
aimingoo的专栏

cs.IT updates on arXiv.org

Theoretical Limits of Language Model Alignment $f$-Divergence Regularized RLHF: Two Tales of Sampling and Unified Analyses A Unified Measure-Theoretic View of Diffusion, Score-Based, and Flow Matching Generative Models When Can Voting Help, Hurt, or Change Course? Exact Structure of Binary Test-Time Aggregation When Semantic Communication Meets Queueing: Cross-Layer Latency and Task Fidelity Optimization Convexity in Disguise: A Theoretical Framework for Nonconvex Low-Rank Matrix Estimation Conditional Diffusion Under Linear Constraints: Langevin Mixing and Information-Theoretic Guarantees Sharp Capacity Thresholds in Linear Associative Memory: From Winner-Take-All to Listwise Retrieval Expert Routing for Communication-Efficient MoE via Finite Expert Banks Contextual Memory-Enhanced Source Coding for Low-SNR Communications Realizable Bayes-Consistency for General Metric Losses Leveraging Code Automorphisms for Improved Syndrome-Based Neural Decoding A Hierarchical Sampling Framework for bounding the Generalization Error of Federated Learning Dueling DDQN-Based Adaptive Multi-Objective Handover Optimization for LEO Satellite Networks The Causal Description Gap: Information-Theoretic Separations Across Pearl's Hierarchy Optimization of CV-QKD Under Practical Constraints Benchmarking Wireless Representations: High-Dimensional vs. Compressed Embeddings for Efficiency and Robustness Real-Time Text Transmission via LLM-Based Entropy Coding over Fixed-Rate Channels SwiftChannel: Algorithm-Hardware Co-Design for Deep Learning-Based 5G Channel Estimation Evolving Token Communication with Parametric Memory Network Remote Action Generation: Remote Control with Minimal Communication The (Marginal) Value of a Search Ad: An Online Causal Framework for Repeated Second-price Auctions Stabilizing Private LASSO under Heterogeneous Covariates via Anisotropic Objective Perturbation Linear-Readout Floors and Threshold Recovery in Computation in Superposition Soft Graph Diffusion Transformer for MIMO Detection Hierarchical Federated Learning for Networked AI: From Communication Saving to Architecture-Aware Design Exponential families from a single KL identity MIFair: A Mutual-Information Framework for Intersectionality and Multiclass Fairness Diffusion-OAMP for Joint Image Compression and Wireless Transmission Decoupled Descent: Exact Test Error Tracking Via Approximate Message Passing
Can Artificial Noise Boost Further the Secrecy of Dual-ho...
Elmehdi Illi, Marwa K. Qaraqe, Faissal El Bouanani, Saif M. Al-K · 2022-08-03 · via cs.IT updates on arXiv.org

In this paper, we quantify the physical layer security of a dual-hop regenerative relaying-based wireless communication system assisted by reconfigurable intelligent surfaces (RISs). In particular, the setup consists of a source node communicating with a destination node via a regenerative relay. In this setup, a RIS is installed in each hop to increase the source-relay and relay-destination communications reliability, where the RISs' phase shifts are subject to quantization errors. The legitimate transmission is performed under the presence of a malicious eavesdropper attempting to compromise the legitimate transmissions by overhearing the broadcasted signal from the relay. To overcome this problem, we incorporate a jammer to increase the system's secrecy by disrupting the eavesdropper through a broadcasted jamming signal. Leveraging the well-adopted Gamma and Exponential distributions approximations, the system's secrecy level is quantified by deriving approximate and asymptotic expressions of the secrecy intercept probability (IP) metric in terms of the main network parameters. The results show that the secrecy is enhanced significantly by increasing the jamming power and/or the number of reflective elements (REs). In particular, an IP of approximately $10^{-4}$ can be reached with $40$ REs and $10$ dB of jamming power-to-noise ratio even when the legitimate links' average signal-to-noise ratios are $10$-dB less than the eavesdropper's one. We show that cooperative jamming is very helpful in strong eavesdropping scenarios with a fixed number of REs, and the number of quantization bits does not influence the secrecy when exceeding $3$ bits. All the analytical results are endorsed by Monte Carlo simulations.