Source Certification System And Structure,

As the flourishing development and the wide application of network communication, information security has come a new interesting field of science research and technology development. Privacy and authentication are two important aspects of in formation security. Privacy is to keep information secret from all but those who are authorized to see it by data encryption. The goal of authentication consists of two contents, one is to verify sender s identity, another is to verify the integrity of information,and to show that informtion is not falsifed,is not replayed, or is not delayed in the process of store or transmission. Privacy is not the same as authentication.In gerenal,privacy does not have authentication function, authentication does not have privacy function. Cryptology is key technique in information security, digital signatiure and authentication code in cryptograpy are very important means to guarantee authenticity of information. Authentication code can be used to provide information relialitity service, information integrity service,access control service,non-reputiation service in group communication (wetwork communication).In the paper,the theory and the technique of authentication are investigated,a few new authentication schemes are put forward,They have the same character-to authenticate multi-source state,to protect against both outside opponent and malicious groups inside users, for the opponeents to attack any tramsimitted message. We investigate the unconditional security of authentication schemes by information - theory, derive information-theoretic bounds on the probabilty of success in several attacks,show the size of the secret key space for each participation , and size of source state set under the security level. We provide the constructions about the authentication schemes.This paper consists of five parts.In part 1 ,we summary the results of authentication code and multiple authentication codes, supplement unexcellent results, give proof for our conclusions .In part 2,we put forward multiple authentication schemes with multi - receiver, which has numerous applications. We analyse the probability of success in deception by malicious groups of receivers, discuss the threshould schemes with limited the number of malicious receivers, give the calculation formule of probability of successful attacks in any transmitted information, and information - theoretic lower bounds,show the size of the secret key space for each participation under the securiey level, provide the construction about the authentication schemes.PartS provides basic definition of authentication schemes for dynamic conferences . We use the character of dynamic conferences, introduce verification secret key set, give the calculation formule of probability of some successful attacks in authentication schemes for dynamic confereices. Under limited the number of malicious users, we derive information - theoretic lower bounds on probability of some successful attacks, and the size of the secret key space for each partipation,and combinatorial bounds under the security level,through the means of entropy, mutual information and probability distribution. This part provides the construction about authentication schemes for dynamic conferences. In the part,we discuss authentication schemes for computer network which topology is not complete graph,put forward authentication schemes for communication graph. We use the character of graph, derive the size of secret key space, and combinatorial bounds under the security level,give the construction about it.In part 4, we put forward mutiple authentication codes with arbitration which provides information reliability service, information integrity sendee, non -repudiation service,for messages transmitted in network communication inwhich transmitter and receiver don t trust each other. We give calculation for mule of probability of all successful attacks, derive the information - theoretic lower bounds on probability of all successful attacks with simple mea...