3. Data Types 3.1 Definition 3.1.1 File This section introduces the file types supported in the protocol. The file operations in the protocol are: file upload and file update. The file types supported in this protocol are: files (including the files with the suffix: .txt, .doc, .docx, .pptx, .xls, etc.), sound files (including the files with the suffix: .mp3, .wav and so on), video files (including the files with the suffix: .avi, .mp4 etc.) 3.1.2 : Search array. The linked list indexed by the keywords of the files is called the keywords linked list. The file identifier is written into the corresponding node list. All the keywords linked list form the inverted index. In order to ensure the server cannot acquire any effective information from the index, use the pseudo random function to encrypt the inverted index. Store the encrypted index in the search array As randomly and the head nodes of each linked list are stored in the dictionary Ts (Search Table). Deletion In order to update the encrypted index efficiently, the linked list : constructed by the keywords of each file is called the file linked list. All the file linked lists form the file index. Encrypt the index and then store it in the random position of the array which is called the deletion array Ad. The head node of the linked list is stored in the dictionary . Td 3.1.3 Index In this protocol contains two kinds of indexes: the inverted index and the
3. Data Types 3.1 Definition 3.1.1 File This section introduces the file types supported in the protocol. The file operations in the protocol are: file upload and file update. The file types supported in this protocol are: files (including the files with the suffix: .txt, .doc, .docx, .pptx, .xls, etc.), sound files (including the files with the suffix: .mp3, .wav and so on), video files (including the files with the suffix: .avi, .mp4 etc.) 3.1.2 : Search array. The linked list indexed by the keywords of the files is called the keywords linked list. The file identifier is written into the corresponding node list. All the keywords linked list form the inverted index. In order to ensure the server cannot acquire any effective information from the index, use the pseudo random function to encrypt the inverted index. Store the encrypted index in the search array As randomly and the head nodes of each linked list are stored in the dictionary Ts (Search Table). : Deletion In order to update the encrypted index efficiently, the linked list constructed by the keywords of each file is called the file linked list. All the file linked lists form the file index. Encrypt the index and then store it in the random position of the array which is called the deletion array Ad. The head node of the linked list is stored in the dictionary Td . 3.1.3 Index In this protocol contains two kinds of indexes: the inverted index and the
Cloud%20Storage%20Oriented%20Cipher-text%20Search%20Protocol.docx