Immutability and traceability are the main reasons for the popularity of blockchain. Nevertheless, its transparency also makes the transactions visible to all participants, which seriously violates the privacy of some dealers. In order to transfer accounts over blockchain, all verifiers should be empowered with the ability to confirm the transactions, leading to the conflict between extensive consensus and individual privacy. Orienting to privacy issues of UTXO (Unspent Transaction Output), this paper exploited the unconditional security of Shamir’s secret sharing to construct a logic-physical map for public chain, which enabled noninteractive transaction verification without privacy infringement. A comprehensive analysis indicated that the proposed scheme is secure under UC (Universal Composability) framework with practical computation and communication overheads.

With the advancement of national policies and the rise of Internet of things (IoT) technology, smart meters, smart home appliances, and other energy monitoring systems continue to appear, but due to the fixed application scenarios, it is difficult to apply to different equipment monitoring. At the same time, the limited computing resources of sensing devices make it difficult to guarantee the security in the transmission process. In order to help users better understand the energy consumption of different devices in different scenarios, we designed a nonintrusive load management based on distributed edge and secure key agreement, which uses narrowband Internet of things (NB‐IoT) for transmission and uses edge devices to forward node data to provide real‐time power monitoring for users. At the same time, we measured the changes of server power under different behaviors to prepare for further analysis of the relationship between server operating state and energy consumption.

Emerging intelligent systems rely on secure and efficient signal processing to ensure reliable operation in environments where there is limited prior knowledge and significant interference. Single-channel blind source separation (SCBSS) is critical for applications such as wireless communication and sensor networks, where signals are often mixed and corrupted. Variational mode decomposition (VMD) has proven effective for SCBSS, but its performance depends heavily on selecting the optimal modal component count k and quadratic penalty parameter $\alpha$. To address this challenge, we propose a secure and intelligent SCBSS algorithm leveraging adaptive VMD optimized with Improved Particle Swarm Optimization (IPSO). The IPSO dynamically determines the optimal k and $\alpha$ parameters, enabling VMD to filter noise and create a virtual multi-channel signal. This signal is then processed using improved Fast Independent Component Analysis (IFastICA) for high-fidelity source isolation. Experiments on the RML2016.10a dataset demonstrate a 15.7% improvement in separation efficiency over conventional methods, with robust performance for BPSK and QPSK signals, achieving correlation coefficients above 0.9 and signal-to-noise ratio (SNR) improvements of up to 24.66 dB.

In future, hundreds of years of mathematical problems that the security of public key cryptography algorithms rely on may be defeated by quantum algorithms. How can a digital signature scheme gracefully balance security and efficiency? This study uses the conjugate search problem and the left self-distributive system to combine and uses the RSA-like algorithm as the underlying structure to propose a new aggregated signature scheme. We, through the EUF game, under the random metaphor model, prove that the security of the scheme satisfies the adaptation unforgeability under selective message attack, the scheme can be finally reduced to the discrete logarithm problem or large prime number decomposition problem. In addition, we can achieve antiquantum attack and exhaustive attack by performing matrix calculations on the message, defining and changing the structure of the matrix by encoding, and setting thresholds for the matrix dimension and the length of the private key. In terms of efficiency, the message signature implementation is linear compared with the expansion rate in terms of storage and computing overhead, and the generation and verification of the final signature pair have nothing to do with the number of users. In addition, the length of the signature is fixed and the size is only the length of a single group, which effectively reduces the generation of public and private key pairs and saves a lot of storage space. The storage space and computational complexity are also effectively improved compared with other solutions.