Loading...
Loading...
Browse, search and filter the latest cybersecurity research papers from arXiv
This paper resolves two open problems from a recent paper, arXiv:2403.16981, concerning the sample complexity of distributed simple binary hypothesis testing under information constraints. The first open problem asks whether interaction reduces the sample complexity of distributed simple binary hypothesis testing. In this paper, we show that sequential interaction does not help. The second problem suggests tightening existing sample complexity bounds for communication-constrained simple binary hypothesis testing. We derive optimally tight bounds for this setting and resolve this problem. Our main technical contributions are: (i) a one-shot lower bound on the Bayes error in simple binary hypothesis testing that satisfies a crucial tensorisation property; (ii) a streamlined proof of the formula for the sample complexity of simple binary hypothesis testing without constraints, first established in arXiv:2403.16981; and (iii) a reverse data-processing inequality for Hellinger-$\lambda$ divergences, generalising the results from arXiv:1812.03031 and arXiv:2206.02765.
Integrated sensing, communication, and computation (ISCC) has emerged as a promising paradigm for enabling intelligent services in future sixth-generation (6G) networks. However, existing ISCC systems based on fixed-antenna architectures inherently lack spatial adaptability to cope with the signal degradation and dynamic environmental conditions. Recently, non-fixed flexible antenna architectures, such as fluid antenna system (FAS), movable antenna (MA), and pinching antenna, have garnered significant interest. Among them, intelligent rotatable antenna (IRA) is an emerging technology that offers significant potential to better support the comprehensive services of target sensing, data transmission, and edge computing. This article investigates a novel IRA-enabled ISCC framework to enhance received signal strength, wider coverage, and spatial adaptability to dynamic wireless environments by flexibly adjusting the boresight of directional antennas. Building upon this, we introduce the fundamentals of IRA technology and explore IRA's benefits for improving system performance while providing potential task-oriented applications. Then, we discuss the main design issues and provide solutions for implementing IRA-based ISCC systems. Finally, experimental results are provided to demonstrate the great potential of IRA-enabled ISCC system, thus paving the way for more robust and efficient future wireless networks.
Federated learning (FL) shows great promise in large-scale machine learning but introduces new privacy and security challenges. We propose ByITFL and LoByITFL, two novel FL schemes that enhance resilience against Byzantine users while keeping the users' data private from eavesdroppers. To ensure privacy and Byzantine resilience, our schemes build on having a small representative dataset available to the federator and crafting a discriminator function allowing the mitigation of corrupt users' contributions. ByITFL employs Lagrange coded computing and re-randomization, making it the first Byzantine-resilient FL scheme with perfect Information-Theoretic (IT) privacy, though at the cost of a significant communication overhead. LoByITFL, on the other hand, achieves Byzantine resilience and IT privacy at a significantly reduced communication cost, but requires a Trusted Third Party, used only in a one-time initialization phase before training. We provide theoretical guarantees on privacy and Byzantine resilience, along with convergence guarantees and experimental results validating our findings.
In this study, a new scheduling strategies for low-density parity-check (LDPC) codes under layered belief propagation (LBP) is designed. Based on the criteria of prioritizing the update of check nodes with lower error probabilities, we propose two dynamic scheduling methods: dynamic error belief propagation (Dyn-EBP) and dynamic penalty error belief propagation (Dyn-PEBP). In Dyn-EBP, each check node is restricted from being updated the same number of times, whereas Dyn-PEBP removes this restriction and instead introduces a penalty term to balance the number of updates. Simulation results show that, for 5G new radio (NR) LDPC codes, our proposed scheduling methods can outperform existing dynamic and offline scheduling strategies under various blocklengths and code rates. This demonstrates that prioritizing the update of check nodes with lower error probabilities can lead to higher decoding efficiency and validates the effectiveness of our algorithms.
Over the past two decades, several governments in developing and developed countries have started their journey toward digital transformation. However, the pace and maturity of digital technologies and strategies are different between public services. Current literature indicates that research on the digital transformation of urban planning is still developing. Therefore, the aim of this study is to understand the influencing factors and key challenges for the digital transformation of urban planning in Australia. The study adopts the inter-organisational theory and Planning Support Science (PSScience) under the Technological, Organisational, and External Environmental (TOE) framework. It involves a multiple case study, administered semi-structured interviews with thirteen IT and urban planning experts across Victoria and New South Wales governments and private industries. The study findings indicate that the main challenges for digital transformation of the Australian urban planning system are related to organisational and external environmental factors. Furthermore, a digital maturity model is absent in the Australian urban planning industry. This study offers important implications to research and practice related to digital transformation in urban planning.
The explosive growth of teletraffic, fueled by the convergence of cyber-physical systems and data-intensive applications, such as the Internet of Things (IoT), autonomous systems, and immersive communications, demands a multidisciplinary suite of innovative solutions across the physical and network layers. Fluid antenna systems (FAS) represent a transformative advancement in antenna design, offering enhanced spatial degrees of freedom through dynamic reconfigurability. By exploiting spatial flexibility, FAS can adapt to varying channel conditions and optimize wireless performance, making it a highly promising candidate for next-generation communication networks. This paper provides a comprehensive survey of the state of the art in FAS research. We begin by examining key application scenarios in which FAS offers significant advantages. We then present the fundamental principles of FAS, covering channel measurement and modeling, single-user configurations, and the multi-user fluid antenna multiple access (FAMA) framework. Following this, we delve into key network-layer techniques such as quality-of-service (QoS) provisioning, power allocation, and content placement strategies. We conclude by identifying prevailing challenges and outlining future research directions to support the continued development of FAS in next-generation wireless networks.
Sensing emerges as a critical challenge in 6G networks, which require simultaneous communication and target sensing capabilities. State-of-the-art super-resolution techniques for the direction of arrival (DoA) estimation encounter significant performance limitations when the number of targets exceeds antenna array dimensions. This paper introduces a novel sensing parameter estimation algorithm for orthogonal frequency-division multiplexing (OFDM) multiple-input multiple-output (MIMO) radar systems. The proposed approach implements a strategic two-stage methodology: first, discriminating targets through delay and Doppler domain filtering to reduce the number of effective targets for super-resolution DoA estimation, and second, introducing a fusion technique to mitigate sidelobe interferences. The algorithm enables robust DoA estimation, particularly in high-density target environments with limited-size antenna arrays. Numerical simulations validate the superior performance of the proposed method compared to conventional DoA estimation approaches.
With the rapid development of low-altitude applications, there is an increasing demand for low-altitude wireless networks (LAWNs) to simultaneously achieve high-rate communication, precise sensing, and reliable control in the low-altitude airspace. In this paper, we first present a typical system architecture of LAWNs, which integrates three core functionalities: communication, sensing, and control. Subsequently, we explore the promising prospects of movable antenna (MA)-assisted wireless communications, with emphasis on its potential in flexible beamforming, interference management, and spatial multiplexing gain. Furthermore, we elaborate on the integrated communication, sensing, and control capabilities enabled by MAs in LAWNs, and illustrate their effectiveness through representative examples. A case study demonstrates that MA-enabled LAWNs achieve significant performance improvements over traditional fixed-position antenna-based LAWNs in terms of communication throughput, sensing accuracy, and control stability. Finally, we outline several promising directions for future research, including the MA-assisted unmanned aerial vehicle (UAV) communication/sensing, the MA-assisted reliable control, and the MA-enhanced physical layer security.
A scheme to select information indices in polar codes is proposed to form signals with spectral comb shapes under BPSK modulation, whereby the signal could be separated from periodic interference in spectrum. By selecting proper indices to load information bits in polar coding, a spectral comb shape signal is formed, which has periodic zeros and notch bands uniformly distributed in its frequency spectrum. Furthermore, to mitigate the negative impact of proposed polar code on the AWGN performance, a scheme termed error performance enhancement scheme is proposed, whereby the performance loss under AWGN noise could be alleviated. Numerical results are given under periodic interference and AWGN noise, indicating that a considerable signal-to-noise power ratio (SNR) gain is accomplished in comparison with conventional polar codes.
Scalar lattice quantization with a modulo operator, dithering, and probabilistic shaping is applied to the Wyner-Ziv (WZ) problem with a Gaussian source and mean square error distortion. The method achieves the WZ rate-distortion pairs. The analysis is similar to that for dirty paper coding but requires additional steps to bound the distortion because the modulo shift is correlated with the source noise. The results extend to vector sources by reverse waterfilling on the spectrum of the covariance matrix of the source noise. Simulations with short polar codes illustrate the performance and compare with scalar quantizers and polar coded quantization without dithering.
Integrated communication and sensing, which can make full use of the limited spectrum resources to perform communication and sensing tasks simultaneously, is an up-and-coming technology in wireless communication networks. In this work, we investigate the secrecy performance of an uncrewed aerial vehicle (UAV)-assisted secure integrated communication, sensing, and computing system, where the UAV sends radar signals to locate and disrupt potential eavesdroppers while providing offload services to ground users (GUs). Considering the constraints of UAV maximum speed, transmit power, and propulsion energy, as well as secure offloading, data transmission, and computation time, the total energy consumption of GUs is minimized by jointly optimizing user offloading ratio, user scheduling strategy, transmit beamforming, and UAV trajectory. An efficient iterative optimization algorithm is proposed to solve the non-convex optimization problem caused by tightly coupled dependent variables. In particular, the original optimization problem is decomposed into four sub-optimization problems, and the non-convex sub-problems are transformed into approximately convex forms via successive convex approximation. Then, all sub-problems are solved successively by using the block coordinate descent technique. Numerical results demonstrate the convergence and validate the effectiveness of the proposed algorithm.
We study optimal reconstruction codes over the multiple-burst substitution channel. Our main contribution is establishing a trade-off between the error-correction capability of the code, the number of reads used in the reconstruction process, and the decoding list size. We show that over a channel that introduces at most $t$ bursts, we can use a length-$n$ code capable of correcting $\epsilon$ errors, with $\Theta(n^\rho)$ reads, and decoding with a list of size $O(n^\lambda)$, where $t-1=\epsilon+\rho+\lambda$. In the process of proving this, we establish sharp asymptotic bounds on the size of error balls in the burst metric. More precisely, we prove a Johnson-type lower bound via Kahn's Theorem on large matchings in hypergraphs, and an upper bound via a novel variant of Kleitman's Theorem under the burst metric, which might be of independent interest. Beyond this main trade-off, we derive several related results using a variety of combinatorial techniques. In particular, along with tools from recent advances in discrete geometry, we improve the classical Gilbert-Varshamov bound in the asymptotic regime for multiple bursts, and determine the minimum redundancy required for reconstruction codes with polynomially many reads. We also propose an efficient list-reconstruction algorithm that achieves the above guarantees, based on a majority-with-threshold decoding scheme.
We derive upper and lower bounds on the overall compression ratio of the 1978 Lempel-Ziv (LZ78) algorithm, applied independently to $k$-blocks of a finite individual sequence. Both bounds are given in terms of normalized empirical entropies of the given sequence. For the bounds to be tight and meaningful, the order of the empirical entropy should be small relative to $k$ in the upper bound, but large relative to $k$ in the lower bound. Several non-trivial conclusions arise from these bounds. One of them is a certain form of a chain rule of the Lempel-Ziv (LZ) complexity, which decomposes the joint LZ complexity of two sequences, say, $\bx$ and $\by$, into the sum of the LZ complexity of $\bx$ and the conditional LZ complexity of $\by$ given $\bx$ (up to small terms). The price of this decomposition, however, is in changing the length of the block. Additional conclusions are discussed as well.
Zero-shot denoising aims to denoise observations without access to training samples or clean reference images. This setting is particularly relevant in practical imaging scenarios involving specialized domains such as medical imaging or biology. In this work, we propose the Zero-Shot Neural Compression Denoiser (ZS-NCD), a novel denoising framework based on neural compression. ZS-NCD treats a neural compression network as an untrained model, optimized directly on patches extracted from a single noisy image. The final reconstruction is then obtained by aggregating the outputs of the trained model over overlapping patches. Thanks to the built-in entropy constraints of compression architectures, our method naturally avoids overfitting and does not require manual regularization or early stopping. Through extensive experiments, we show that ZS-NCD achieves state-of-the-art performance among zero-shot denoisers for both Gaussian and Poisson noise, and generalizes well to both natural and non-natural images. Additionally, we provide new finite-sample theoretical results that characterize upper bounds on the achievable reconstruction error of general maximum-likelihood compression-based denoisers. These results further establish the theoretical foundations of compression-based denoising. Our code is available at: github.com/Computational-Imaging-RU/ZS-NCDenoiser.
Rate-Splitting Multiple Access (RSMA) has been recognized as a promising multiple access technique for future wireless communication systems. Recent research demonstrates that RSMA can maintain its superiority without relying on Successive Interference Cancellation (SIC) receivers. In practical systems, SIC-free receivers are more attractive than SIC receivers because of their low complexity and latency. This paper evaluates the theoretical limits of RSMA with and without SIC receivers under finite constellations. We first derive the constellation-constrained rate expressions for RSMA. We then design algorithms based on projected subgradient ascent to optimize the precoders and maximize the weighted sum-rate or max-min fairness (MMF) among users. To apply the proposed optimization algorithms to large-scale systems, one challenge lies in the exponentially increasing computational complexity brought about by the constellation-constrained rate expressions. In light of this, we propose methods to avoid such computational burden. Numerical results show that, under optimized precoders, SIC-free RSMA leads to minor losses in weighted sum-rate and MMF performance in comparison to RSMA with SIC receivers, making it a viable option for future implementations.
Interference widely exists in communication systems and is often not optimally treated at the receivers due to limited knowledge and/or computational burden. Evolutions of receivers have been proposed to balance complexity and spectral efficiency, for example, for 6G, while commonly used performance metrics, such as capacity and mutual information, fail to capture the suboptimal treatment of interference, leading to potentially inaccurate performance evaluations. Mismatched decoding is an information-theoretic tool for analyzing communications with suboptimal decoders. In this work, we use mismatched decoding to analyze communications with decoders that treat interference suboptimally, aiming at more accurate performance metrics. Specifically, we consider a finite-alphabet input Gaussian channel under interference, representative of modern systems, where the decoder can be matched (optimal) or mismatched (suboptimal) to the channel. The matched capacity is derived using Mutual Information (MI), while a lower bound on the mismatched capacity under various decoding metrics is derived using the Generalized Mutual Information (GMI). We show that the decoding metric in the proposed channel model is closely related to the behavior of the demodulator in Bit-Interleaved Coded Modulation (BICM) systems. Simulations illustrate that GMI/MI accurately predicts the throughput performance of BICM-type systems. Finally, we extend the channel model and the GMI to multiple antenna cases, with an example of multi-user multiple-input-single-output (MU-MISO) precoder optimization problem considering GMI under different decoding strategies. In short, this work discovers new insights about the impact of interference, proposes novel receivers, and introduces a new design and performance evaluation framework that more accurately captures the effect of interference.
Costas arrays have been an interesting combinatorial object for decades because of their optimal aperiodic auto-correlation properties. Meanwhile, it is interesting to find families of Costas arrays or extended arrays with small maximal cross-correlation values, since for applications in multi-user systems, the cross-interferences between different signals should also be small. The objective of this paper is to study several large-size families of Costas arrays or extended arrays, and their values of maximal cross-correlation are partially bounded for some cases of horizontal shifts $u$ and vertical shifts $v$. Given a prime $p \geq 5$, in particular, a large-size family of Costas arrays over $\{1, \ldots, p-1\}$ is investigated, including both the exponential Welch Costas arrays and logarithmic Welch Costas arrays. An upper bound on the maximal cross-correlation of this family for arbitrary $u$ and $v$ is given. We also show that the maximal cross-correlation of the family of power permutations over $\{1, \ldots, p-1\}$ for $u = 0$ and $v \neq 0$ is bounded by $\frac{1}{2}+\sqrt{p-1}$. Furthermore, we give the first nontrivial upper bound of $(p-1)/t$ on the maximal cross-correlation of the larger family including both exponential Welch Costas arrays and power permutations over $\{1, \ldots, p-1\}$ for arbitrary $u$ and $v=0$, where $t$ is the smallest prime divisor of $(p-1)/2$.
Alice wishes to reveal the state $X$ to Bob, if he knows some other information $Y$ also known to her. If Bob does not, she wishes to reveal nothing about $X$ at all. When can Alice accomplish this? We provide a simple necessary and sufficient condition on the joint distribution of $X$ and $Y$. Shannon's result on the perfect secrecy of the one-time pad follows as a special case.