Random Fingerprinting Codes For Secure Communication

Early in the digital era,the distribution of copyright-restricted digital content(such as software,video,and music)needs to be solved urgently.Now in the era of big data,various digital products are emerging in an endless stream.Information security and data security are particularly concerned.Coding theory has played a very important role in solving data management and data storage.In the context of the cloud computing model,this paper introduces the fingerprinting system in detail,a method of tracking unauthorized pirated data through each user's unique mark,so as to prevent some users from sharing information to form alliances and causing data leakage.A central theme of this paper is the application of randomization in fingerprinting system design.For many complex problems in system design,deterministic solutions either do not exist,or show poor performance or implementation complexity.The application of randomization can introduce probability schemes to simplify some problems,improve performance,and reduce complexity.Sometimes randomization is the only optimal solution to certain problems,because deterministic solutions do not exist.This paper focuses on the deterministic fingerprinting code,adds a certain tolerance error rate on the basis of the traditional t-IPP code,and proposes the t-IPP code with ? error.Based on the t-IPP code with ? error,an index to measure its pros and cons is proposed,that is,fingerprinting capability.In the process of concretely constructing t-IPP codes with ? error,two different methods are used to give the lower bounds of fingerprint capacity in different situations.The specific content of this paper is divided as follows:The first chapter introduces the research background and significance of the selected topic,and the current research status of the fingerprinting system.The second chapter mainly introduces the basic concepts of the fingerprinting system,explains the definitions of several common deterministic fingerprinting codes and random fingerprinting codes.This chapter mainly gives the definition of t-IPP codes with ? error,and also gives the definition of fingerprinting capacity.In Chapter 3,the Lower Bound I of Fingerprint Capacity is established when t=2 and t=3 under the ternary alphabet,through the establishment of a connection between the parent-identifying scheme and the minimal forbidden configuration.The above results are further extended to the case of any q.Compared with the previous results,the lower bound of fingerprinting capacity further improves when q is arbitrary.Chapter 4 focuses on the Lower Bounds II of Fingerprint Capacity.A typical fingerprint set is constructed by combining the codeword Hamming distance of coding theory,and the lower bounds of fingerprint capacity under different alphabets are given when t=2 and t=3.Compared with the previous result of q=2,the lower bounds of fingerprinting capacity are extended to the case when q is arbitrary.Chapter 5 summarizes the innovations and main conclusions of this paper,and gives directions for future research.