26 September 2022 in IEEE Access
To protect the information of video stream, many selective video encryption schemes have been proposed based on the H.265/HEVC video. However, most of the existing algorithms are not robust, thus failing to decrypt under packet loss. To further improve the robustness capability of video protection, a robust selective encryption scheme is proposed in this paper. In H.265/HEVC standard, video is encoded into multiple slices, and the slices are decoded independently. Inspired by the feature, each slice is individually encrypted using RC4 stream cipher. The pseudorandom binary sequence (PRBS) for one slice is related to encoding parameters and the SHA-256 hash value of the corresponding slice header, thus ensuring the real-time update of the PRBS and increasing the resistance to chosen-plaintext attack. A two-rounds shifting algorithm is designed to scramble non-zero coefficients of the transform units (TUs), and then motion vector difference (MVD) parameters, quantized transform coefficients (QTCs) and intra prediction modes (IPMs) are selected for encryption. The combination of coefficient scrambling and syntax elements encryption further improves the encryption performance. The proposed scheme is slice-synchronized. Hence, it decrypts normally in the case of packet loss, and supports online real-time interaction. Furthermore, the simulation and analysis results show that the proposed algorithm has format compatibility, high security and low time complexity, which is a promising tool for video cryptographic applications.
17 January 2023 in Computer Communications
28 June 2022 in Proceedings of the AAAI Conference on Artificial Intelligence
Since Bitcoin, blockchain has attracted the attention of researchers. The consensus mechanism at the center of blockchain is often criticized for wasting a large amount of computing power for meaningless hashing. At the same time, state-of-the-art models in deep learning require increasing computing power to be trained. Proof of Learning (PoL) is dedicated to using the originally wasted computing power to train neural networks. Most of the previous PoL consensus mechanisms are based on two methods, recomputation or performance metrics. However, in practical scenarios, these methods both do not satisfy all properties necessary to build a large-scale blockchain, such as certainty, constant verification, therefore are still far away from being practical. In this paper, we observe that the opacity of deep learning models is similar to the pre-image resistance of hash functions and can naturally be used to build PoL. Based on our observation, we propose a method called Directed Guiding Gradient. Using this method, our proposed PoL consensus mechanism has a similar structure to the widely used Proof of Work (PoW), allowing us to build practical blockchain on it and train neutral networks simultaneously. In experiments, we build a blockchain on top of our proposed PoL consensus mechanism and results show that our PoL works well.