arXiv subjects

Haonan Miao

Publications and source records attributed to Haonan Miao.

2 recordsLinked to original sources

arXiv2026

Subsampling Under Two-way Clustering with Serial Correlation

We prove the validity of using subsampling method for inference under a two-way clustered panel in which the time effects are serially correlated. Subsamples should be drawn without replacement from randomly partitioned individual index set and consecutive blocks of time effects. We present two subsampling inference methods: estimating the quantiles directly and constructing the confidence interval by first estimating the asymptotic variance. The quantile method is very adaptive, allowing for non-Gaussian limit which invalidates all existing methods in two-way clustering with serial correlation. Although the variance method only works under Gaussian limit, it comes with a data-driven bandwidth selection algorithm and a bias-correction under suitable estimators. Monte Carlo simulations demonstrate our methods exhibiting the desired coverage level in the finite sample except when the serial correlation is extremely strong. This paper is the first one that allows for inference on non-Gaussian asymptotics under two-way clustering with serial correlation.

econ.EM↗

arXiv2025

DDIM-Driven Coverless Steganography Scheme with Real Key

With the advancement of information hiding techniques, generation-based coverless steganography has emerged as an alternative to traditional methods, leveraging generative models to transform secret information into stego-objects rather than embedding it within the redundancy of the cover. However, existing generation-based approaches require pseudo-keys that must be shared between communication parties, leading to high overhead of frequent key exchanges and security risks due to their tight coupling with the secret information. This paper proposes a DDIM-driven coverless steganography scheme that utilizes a real-key mechanism, improving the key management. By integrating reversible data hiding (RDH) and chaotic encryption into generation model, the proposed method eliminates excessive key exchanges and reduces the correlation between the key and the secret information. Furthermore, it requires only a single key negotiation for multiple communication, which lowers overhead. Experimental results demonstrate that the proposed scheme resists substitution attacks, enhancing the security of covert communication.

cs.CR↗