Compressive sampling (CS) has received extensive research attention in the past decade. By exploiting the property of natural signals to be either sparse or compressible, the CS theory demonstrates that such signals can be faithfully recovered from a small set of linear, nonadaptive measurements, allowing sampling at a rate lower than that required by the Nyquist-Shannon sampling theorem.

CS shows great potential in information security field from its birth date, owing to its intrinsic simplicity, convenience, robustness in various scenarios, and simultaneous encryption and compression performances. In recent years, extensive studies of CS-based security techniques have been launched from both theoretical and practical aspects. The primary object of theoretical security research is to investigate the confidentiality provided by the CS paradigm, such as its resistance under different attack assumptions, designing keyed sparsifying basis and measurement matrix, and developing adaptive quantization approach with cryptographic features. The other active topic is to exploit the great potentials of CS for various security applications, such as multimedia encryption, multimedia hashing, watermarking/data hiding, information authentication, privacy-preserving data aggregation, and compressing lightweight encrypted data.

We invite investigators to contribute original research articles as well as review articles that exploit the security potentials of CS from various aspects. Original, high quality contributions that are not yet published and are not currently under review by other journals or peer-reviewed conferences will be highly appreciated.

Potential topics include but are not limited to the following:

• Theoretic security evaluation of CS-based ciphers
• Research on cryptographic measurement matrix and keyed sparsifying basis
• Joint sampling-cryptographic-source coding schemes based on CS
• CS application for multimedia encryption
• Employing CS for image/video watermarking, hashing, and authentication
• Privacy-preserving data aggregation using CS
• Privacy-preserving CS reconstruction services
• Novel techniques integrating CS with Double Random Phase Encoding
• Illuminating ciphers using CS and chaos theory
• Other theoretical and practical achievements of CS