Research on the Management Mechanism of Teachers in Public Security Colleges and Universities Based on Psychological Contract

In today＇s management of the teaching staff of public security colleges and universities, the research on the Psychological Contract problem is not only beneficial to the management and estimation of the teachers, but also has an important role in the coordination and stability of the whole system of public security colleges and universities. Based on the theory of Psychological Contract, this paper expounds the basic understanding and research value of Psychological Contract, and puts forward the measures to cultivate teachers＇ good character and understanding, and as well as coordinate teachers＇ needs, effectively change teachers＇ attitude and actively promote the establishment of good interpersonal relationship to explain the research on the Management Mechanism of Teachers in Public Security Colleges and Universities from the Perspective of Psychological Contract.

Universally composable anonymous Hash certification model

Ideal function is the fundamental component in the universally composable security model. However, the certification ideal function defined in the universally composable security model realizes the identity authentication by binding identity to messages and the signature, which fails to characterize the special security requirements of anonymous authentication with other kind of certificate. Therefore, inspired by the work of Marten, an anonymous hash certification ideal function and a more universal certificate CA model are proposed in this paper. We define the security requirements and security notions for this model in the framework of universal composable security and prove in the plain model （not in the random-oracle model） that these security notions can be achieved using combinations of a secure digital signature scheme, a symmetrical encryption mechanism, a family of pseudorandom functions, and a family of one-way collision-free hash functions. Considering the limitation of wireless environment and computation ability of wireless devices, this anonymous Hash certification ideal function is realized by using symmetry primitives.

Using IND-CVA for constructing secure communication

Within the framework of UC （universally composable） security, a general method is presented to construct a secure channel protocol with using IND-CVA （indistinguishability of encryption scheme under ciphertext verification attacks）. A channel protocol with using the method first invokes an ideal keyexchange protocol to get a session key, and then computes the messages with an authenticated encryption scheme. The paper shows that a channel protocol is UC secure if and only if the underlying authenticated encryption scheme is both IND-CVA secure and INT-PTXT secure. The condition about secure channel protocol in this paper is much weaker than IND-CCA secure and INT-CTXT secure. The IND-CVA can be presented for describing the privacy requirements of secure channels in detail. Moreover, the method for designing secure channel protocol in the paper reduces the UC security of secure channels, which are measured by action-simulation in the UC security framework, to the security of authenticated encryption schemes, which are measured semantically.