The vast number of IoT devices is distributed across multiple trust domains, each with distinct security policies, trust models, and permission management methods. This diversity increases the risk of privacy exposure during cross-domain communications. At the same time, traditional authentication methods have problems, such as complex certificate management, high risk of key escrow, and reliance on trusted third parties. To address the above problems, this article proposes a novel method, enhancing device privacy through certificateless encryption and zero-knowledge proof (DPCZK). DPCZK achieves decentralization by leveraging a consortium blockchain as a trust bridge across different domains. The adoption of certificateless encryption mitigates the incomplete trust issues associated with the key generation center. Furthermore, DPCZK incorporates an identity-hiding mechanism based on zero-knowledge proof, enabling devices to authenticate and interact with resources anonymously during cross-domain operations, thereby safeguarding their privacy. Additionally, through threshold technology, the target domain can reveal the true identities of malicious devices and revoke their access rights, ensuring a balanced approach to security and privacy protection. The proposed scheme has been experimentally validated in a virtual environment and compared with existing solutions. Results demonstrate that DPCZK offers significant improvements in both effectiveness and efficiency.

The l 0 regularized problem in compressed sensing reconstruction is nonconvex with NP-hard computational complexity. Methods available for such problems fall into one of two types: greedy pursuit methods and thresholding methods, which are characterized by suboptimal fast search strategies. Nature-inspired algorithms for combinatorial optimization are famous for their efficient global search strategies and superior performance for nonconvex and nonlinear problems. In this paper, we study and propose nonconvex compressed sensing for natural images by nature-inspired optimization algorithms. We get measurements by the block-based compressed sampling and introduce an overcomplete dictionary of Ridgelet for image blocks. An atom of this dictionary is identified by the parameters of direction, scale and shift. Of them, direction parameter is important for adapting to directional regularity. So we propose a two-stage reconstruction scheme (TS_RS) of nature-inspired optimization algorithms. In the first reconstruction stage, we design a genetic algorithm for a class of image blocks to acquire the estimation of atomic combinations in all directions; and in the second reconstruction stage, we adopt clonal selection algorithm to search better atomic combinations in the sub-dictionary resulted by the first stage for each image block further on scale and shift parameters. In TS_RS, to reduce the uncertainty and instability of the reconstruction problems, we adopt novel and flexible heuristic searching strategies, which include delicately designing the initialization, operators, evaluating methods, and so on. The experimental results show the efficiency and stability of the proposed TS_RS of nature-inspired algorithms, which outperforms classic greedy and thresholding methods.