Search

Aiming at the problem that the existing video steganography algorithm modifies the carrier too much during the embedding process, this paper proposes a new video steganography algorithm based on the tailing ones and N-dimensional cubic coding. First calculate the N-dimensional cubic eigenvalues of the tailing ones and modify them according to the specific embedding mechanism. When blindly extracting, receiver only need to obtain the tailing ones of the embedding block and recalculate its N-dimensional cubic encoding eigenvalues. Converting the obtained value into binary is the embedded secret information. Experimental results show that the algorithm has higher invisibility and lower modification rate, while the bit rate increases less, and the anti-steganalysis ability is better.

Digital signature is a very important primitive in the area of public key cryptography. It guarantees the integrity and irreversibility of the electronic data. Such as the national cryptography SM2 digital signature scheme, which is denoted as SM2 concisely. As everyone knows, there are so many domestic organizations apply SM2 to guarantee the irreversibility and integrity of electronic data, such as Tencent, Ali and the variety of commercial banks. However since the emerging of side-channel attacks which could steal the inner secret information of SM2 during its execution by analyzing running-time, electromagnetic radiation, power consumption, fault detection and many more, the traditional SM2 is no longer secure. For example, once the adversary obtain the secret information such as the secret key used to sign electronic data it can forge any data’s signature. This means that the adversary could steal money and privacy of organizations by forge the corresponding signatures. This is a fatal disease. In this paper we give a continual leakage resilient version of SM2, which aims at achieving that although a part of secret key is continual leaked by side-channel attacks, the adversary couldn’t forge signatures. And then we prove our scheme in the generic bilinear model. Finally, we implement our scheme and test the efficiency which demonstrates the validity and practicability of our scheme.

In CRYPTO'13, Gentry et al. proposed a fully homomorphic encryption scheme, called GSW. We find that the scheme has three special properties, which are not sufficiently recognized and applied in current literatures.