A Hash authentication algorithm of speech perception based on MDCT coefficients was proposed to solve the problems of large amount of computation and bad real-time capability when using traditional authentication algorithm in compressed domain speech. Firstly, the algorithm extracts MDCT coefficients by partly decompressing speech sound in MP3 format. Then MDCT coefficients of each frame of speech are processed by Mel filter in the compressed domain, forming the 15-dimensional MFCC coefficient vector. Finally the perceptual Hash string is generated by Hash structure. The perceptual Hash string can perceive the content of voice authentication. Experimental results show that the algorithm keeping on content presents the strong robustness and good real-time capability.

According to the situation that traditional speech authentication algorithms don’t be appropriated for present speech communication, we proposed a speech authentication algorithm of perceptual hashing based on Immittance Spectral Pairs. It can satisfy the requirement of the efficiency and the robustness for speech authentication. Firstly, the speech signal pre-processing, for framing, adding window, obtained for each speech frame immittance spectral Pairs parameters, constitute an immittance spectral Pairs parameter matrix. Then process cepstral mean and variance normalization for immittance spectral Pairs parameter matrix, cepstral mean and variance normalization can effectively improve the robustness of the Gaussian white noise. And parameter matrix for non-negative matrix factorization. Finally, quantifying the formed weight matrix and getting perceptual hashing sequences.Experiments show that the proposed algorithm has good robustness for content preserving operations, and it doesn’t reduce the efficiency while meeting robustness, it can satisfy the real-time requirement of speech communication.

Steganslysis is an important research issue in information security. Aimed at the most commonly used cover media, digital images, the paper proposed a new method of universal steganalysis method based on multi-domain features. Features were extracted from spatial domain and DWT domain to overcome the drawbacks of steganslysis algorithm for specific steganography, such as high complexity and low correct detecting ratio. Experiment results show that the proposed algorithm can solve the low detecting problem and achieve a better reliability on low embedding rates.

<b></b>For the existing certification that ignores trust relationship between inter-domains will lead to the certification failure phenomenon, in the consideration of trust relationship circumstances this paper presents an alliance certification scheme based on the lattice combining Dijkstra path search algorithm between the domains. Theoretical analysis shows that dual-traction certification mechanism greatly increases system security, also avoids the single point collapse. According to calculating the path weight by Dijkstra algorithm to find the shortest path in the weighted graph, the scheme can improve the certification efficiency.

A bran-new lattice based cross-domain model is proposed to solve the shortcomings of the existing authentication model. Firstly, using the lattice theory, this model builds credit-domain alliance and user alliance on the two dimensional coordinates to avoid the abuse of centralized plans. Secondly, it uses the superiority thought of the existing authentication system to strengthen the integrity of the model. Finally, the detailed work flow, formula, domain disposal, extended algorithm, and identity-based Stealth transport protocols of the new model are drafted. It ensures the user’s identity information and privacy. After the certification and analysis, this model proved to have a good Practical character and an extremely large extension space.