CN103179179A - Document processing method and system - Google Patents
Document processing method and system Download PDFInfo
- Publication number
- CN103179179A CN103179179A CN2011104557665A CN201110455766A CN103179179A CN 103179179 A CN103179179 A CN 103179179A CN 2011104557665 A CN2011104557665 A CN 2011104557665A CN 201110455766 A CN201110455766 A CN 201110455766A CN 103179179 A CN103179179 A CN 103179179A
- Authority
- CN
- China
- Prior art keywords
- user side
- far
- end server
- word
- file
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Granted
Links
Images
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L9/00—Cryptographic mechanisms or cryptographic arrangements for secret or secure communications; Network security protocols
- H04L9/008—Cryptographic mechanisms or cryptographic arrangements for secret or secure communications; Network security protocols involving homomorphic encryption
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L63/00—Network architectures or network communication protocols for network security
- H04L63/04—Network architectures or network communication protocols for network security for providing a confidential data exchange among entities communicating through data packet networks
- H04L63/0428—Network architectures or network communication protocols for network security for providing a confidential data exchange among entities communicating through data packet networks wherein the data content is protected, e.g. by encrypting or encapsulating the payload
- H04L63/0478—Network architectures or network communication protocols for network security for providing a confidential data exchange among entities communicating through data packet networks wherein the data content is protected, e.g. by encrypting or encapsulating the payload applying multiple layers of encryption, e.g. nested tunnels or encrypting the content with a first key and then with at least a second key
Abstract
A document processing method and system are provided. A client divides at least one document into a plurality of document pages, and individually encrypts the document pages by a first key to obtain a plurality of encrypted pages. The client removes a part of words from the document pages to obtain a plurality of significant words, and individually encrypts the significant words by a second key different to the first key to obtain a plurality of encrypted significant words. The client records the encrypted significant words and a plurality of first index information in a significant word set (SWS), where the first index information indicates a page in the encrypted pages where the encrypted significant word comes from. Then, the client transmits the encrypted pages and the SWS to a remote server for storage.
Description
Technical field
The disclosure relates to a kind of electronic system, and is particularly related to document handling method and the document handling system that file is stored in far-end server.
Background technology
In information age now, the file storage is an important topic with processing.Universal due to the communication technology, the user often need to be in the different location, different time access, search, the some same files of processing.Utilize remote storage (remote storage) technology, local user's end (local client) can be stored in remote storage server (Remote Storage Server, RSS) with a plurality of files by communication network.For example, cloud server (cloud server) can satisfy the mass data storage demand (Humungous data storage requirements) of a plurality of user sides.
For information security, the file that leaves far-end server in must be encrypted.For the data processing demands that satisfies user side (such as searching keyword etc.), the far-end server in the traditional file treatment system must possess decryption capabilities again.For example, traditional far-end server must have deciphering golden key (Decryption Key) in order to encrypt file is converted to expressly (plaintext), then could carry out keyword search (keyword search) to clear text file.Yet far-end server possibly can't be trusted.In the situation that far-end server possesses decryption capabilities, user side can't prevent that far-end server from carrying out unloyal query processing (unfaithful query processing).That is to say, the file content that leaves far-end server in may be spied on/leaked.
Far-end server in another traditional file treatment system does not have decryption capabilities.Therefore then user side must use golden key to be decrypted as encrypt file by user side the complete user side that is downloaded to of all possible each file in a plurality of encrypt files, processes (such as searching keyword etc.) in order to carry out data.Well imagine, in the situation that the mass data storage demand, these huge encrypt files can consume a large amount of bandwidth resources.
Summary of the invention
The disclosure provides a kind of document handling method and system, promoting the information security of remote storage file, and is convenient to far-end server and carries out the various processing demands of data.
Disclosure embodiment proposes a kind of document handling method, comprising: in user side, at least one file is divided into a plurality of file pages; Encrypt individually these file pages in this user side with the first gold medal key and obtain a plurality of encryption pages; Extract part character in these file pages and obtain a plurality of banner words in this user side; Record these banner words and its place page info at this user side; Encrypt individually these banner words and its place page info and obtain to encrypt the second file with the second gold medal key that is different from this first gold medal key in this user side; And these encryption pages and this encryption second file are sent to the far-end server storage from this user side.
Disclosure embodiment proposes a kind of document handling system, comprises far-end server and user side.User side is coupled to far-end server via communication network.User side is divided into a plurality of file pages with at least one file, and encrypts individually these file pages and obtain a plurality of encryption pages with the first gold medal key.In addition, user side extracts part character in these file pages and obtains a plurality of banner words, and records these banner words and its place page info.User side is encrypted these banner words and its place page info and obtains to encrypt the second file with the second gold medal key that is different from the first gold medal key.The second file after user side will be encrypted page and encrypt is sent to this far-end server storage.
Based on above-mentioned, in disclosure embodiment, user side uses different golden keys encrypt file page and the second file respectively, and the file page after then encrypting is sent to the far-end server storage with encryption the second file.Because far-end server does not have golden key, so far-end server can't declassified document page and the second file.Moreover the encrypt file page is not identical with encryption the second file golden key both, has therefore promoted the information security that is stored in the far-end server File.Moreover, user side extracts and makes encryption the second file with the encryption indicator word of file page in advance, makes far-end server to carry out corresponding processing in encrypted domain (Encryption-Domain) according to the various processing demands (such as demands such as search keywords) of user side.
For above-mentioned feature and advantage of the present disclosure can be become apparent, embodiment cited below particularly, and coordinate accompanying drawing to be described in detail below.
Description of drawings
Fig. 1 illustrates a kind of function block schematic diagram of document handling system according to disclosure embodiment.
Fig. 2 illustrates a kind of schematic flow sheet of document handling method according to disclosure embodiment.
Fig. 3 illustrates that according to the disclosure embodiment user side proposes to search to far-end server the schematic flow sheet that requires.
Fig. 4 illustrates that according to another embodiment of the disclosure user side proposes to search to far-end server the schematic flow sheet that requires.
Fig. 5 illustrates a kind of schematic flow sheet of document handling method according to another embodiment of the disclosure.
Fig. 6 be according to the disclosure again an embodiment schematic flow sheet that user side propose to search requires to far-end server is described.
[main element symbol description]
10: communication network
110: user side
120: far-end server
S205～S230, S310～S360, S410～S470, S510～S530, S605～S660: step
Embodiment
Fig. 1 illustrates a kind of function block schematic diagram of document handling system according to disclosure embodiment.Document handling system comprises far-end server 120 and user side 110.Far-end server 120 can be remote storage server (Remote Storage Server, RSS), cloud server (cloud server) or other types service unit.User side 110 can be personal computer (personal computer, PC), mobile computer, personal digital assistant (Personal Digital Assistant, PDA), smart mobile phone (smart phone) but or other types timer.User side 110 is coupled to far-end server 120 via communication network 10.
Fig. 2 illustrates a kind of schematic flow sheet of document handling method according to disclosure embodiment.Please refer to Fig. 1 and Fig. 2, before user side 110 was wanted one or more text files (text document) are uploaded to far-end server 120 storages via communication network 10, user side 110 can carry out flow chart shown in Figure 2.In step S205, user side 110 can be divided into a plurality of file pages with each file.For example, user side 100 can become many pages (page) with a file division (broken down), and every one page size is 128KB.Next, user side 110 can carry out step S210, in order to do not encrypt these file pages and obtain a plurality of encryption page with the first gold medal key CPS-KEY.These are encrypted page and are endowed separately a unique sign (identification, ID).In the present embodiment, then user side 110 compression (compressed) these file pages and obtain a plurality of page compressions individually in step S210 are individually encrypted these page compressions with the first gold medal key CPS-KEY and are obtained a plurality of encryption page.In other embodiments, user side 110 may not compress (compressed) these file pages in step S210, and directly individually encrypts these file pages with the first gold medal key CPS-KEY and obtain a plurality of encryptions page.Encryption page after each encryption and compression is arranged in a huge file (huge file) singly, is referred to as page compression sequence (Compressed Page Sequence, CPS).Next, user side 110 can be encrypted these page (page compression sequence) and be sent to far-end server 120 storages (step S230).
In addition, user side 110 also can carry out step S215 after completing steps S205.In step S215, user side 110 extracts these still part characters in the unencrypted file page, and obtains a plurality of banner words (significant words).User side 110 forms banner word collection (Significant Word Set, SWS) with these banner words.That is to say, user side 110 is found out (identifies) a plurality of significant words from these file pages.In certain embodiments, in step S215, user side 110 can be deleted article (removing articles) (such as " a ", " an ", " the " etc.) and other basic syntax characters (basic grammar words) (such as " to ", " for ", " with " etc.) in these file pages, and obtains these banner words.In further embodiments, in step S215 user side 110 can be in removing these file pages article and basic syntax character and after obtaining a plurality of original word, then these original word are carried out word do and extract (stemming) and obtain these banner words.Above-mentioned word is done and extracted is according to the Porter algorithm or other algorithms are converted to radical with individual character, such as all converting the characters such as retrieve, retrieval and retrieving to identical retriev radical, again such as all converting the characters such as have, having and had to identical hav radical.
Therefore, for example, the file of 10000 words can extract (extracted) and go out 500 banner words from this document by the carrying out of step S215.User side 110 then carries out step S220 after completing steps S215, the banner word collection that user side 110 record is formed by a plurality of banner words with and the page info at place, and do not encrypt these banner words and its place page info in step S225 with the second gold medal key SWS-KEY, and obtain to encrypt the second file.Above-mentioned the first gold medal key CPS-KEY and the second gold medal key SWS-KEY are not identical two keys (keys).
In certain embodiments, described place page info (index information) can comprise the filename (file name) of this document and page gap value (page offset) in this document.For example, a file of supposing file AA by name is divided into 5 pages, it is the 3rd page (namely the 3rd page in these encryption pages) that is taken from file AA that a banner word " home " is wherein arranged, and the place page info (index information) of banner word " home " comprises " AA, 3 ".
User side 110 then carries out step S230 after completing steps S225, be sent to far-end server 120 storages in order to these are encrypted page with encryption the second file (index of original).Far-end server 120 is after receiving these encryption pages, and far-end server 120 is encrypted page with these and is stored in a database.Far-end server 120 is after the second file that receives after encrypting, far-end server 120 can be logined each encryption indicator word in the second file after encrypting/add in the universe search index (Global Search Index, GSI) of far-end server 120 with corresponding place page info (index information).For example, the universe search index comprises key (key) field (key field be referred to as not only key hurdle) and value (value) field (value (value) hurdle but also be referred to as value field), wherein this key field records these encryption indicator words, and this value field records these place page infos (index information).Use some standard open source code common programs (open source utilities is for example from the Lucene of Apache) can realize the universe search index.Each encryption indicator word mapped (mapped) in the universe search index is to its manipulative indexing information, and far-end server 120 can find corresponding encryption page according to this index information from database.
Fig. 3 illustrates that according to the disclosure embodiment user side 110 proposes to search to far-end server 120 schematic flow sheet that requires.When user side 110 wishs were searched some keywords (keyword) KW, user side 110 can carry out step S310 and obtain the cryptography key word in order to use the second gold medal key SWS-KEY cryptography key word KW.User side 110 then is sent to far-end server 120 (step S320) with the cryptography key word.Far-end server 120 is searched the universe search index and is obtained all encryption that contains this cryptography key word second files with this cryptography key word, and it is returned to user side.User side is encrypted the second file decryption to obtain original keyword corresponding place page info (index information) (step S330) with the second gold medal key SWS-KEY with these, and extract these to far-end server 120 requirements and encrypt pages, far-end server 120 is obtained wherein at least one target encryption page (a step S340) from these encryption pages that are stored in database.Then, far-end server 120 is encrypted page with described target and is sent to user side 110 (step S350).Note that step S350 is that Partial encryption page with former word file returns to user side 110, rather than whole encryption pages of text file are returned to user side 110.
After user side 110 was obtained target encryption page from far-end server 120, user side 110 used the first gold medal key CPS-KEY to decipher this target and encrypts page (a step S360).In certain embodiments, if just be encrypted after the step S210 ever compressed of Fig. 2 is crossed file page, in the step S360 of Fig. 3, user side 110 can then decompress after this target encryption page is completed deciphering, is converted to clear text file (plain text document) in order to this target is encrypted page.After obtaining the clear text file page, user side 110 becomes the data that can carry out after-stage and processes (for example thin section searches).
In sum, in the present embodiment, user side 110 uses different golden key CPS-KEY and SWS-KEY encrypt file page and the second file respectively, and the file page after then encrypting is sent to far-end server 120 storages with encryption the second file.Because far-end server 120 does not have golden key CPS-KEY and SWS-KEY, so far-end server 120 can't declassified document page and the second file.Moreover the golden key CPS-KEY of encrypt file page is both not identical with the golden key SWS-KEY that encrypts the second file, has therefore promoted the information security that is stored in far-end server 120 Files.
Moreover, the encryption indicator word of the file page that user side 110 is in advance larger with data volume extracts and makes the less encryption of data volume the second file, make far-end server 120 to carry out corresponding processing to less encryption the second file of data volume in encrypted domain (Encryption-Domain) according to the various processing demands (such as demands such as search keywords) of user side 110, and do not need to search these huge encryption pages of data volume from database.Therefore, the operating efficiency of far-end server 120 can obviously promote.In addition, far-end server 120 is that the Partial encryption page with text file returns to user side 110, rather than the text file after whole part is encrypted (or all encrypting page) returns to user side 110, the bandwidth resources that therefore can effectively save communication network.
Fig. 4 illustrates that according to another embodiment of the disclosure user side 110 proposes to search to far-end server 120 schematic flow sheet that requires.Embodiment illustrated in fig. 4 can be with reference to the related description of Fig. 3.In certain embodiments, when user side 110 wishs are searched a keyword KW, do extraction if the step S215 of Fig. 2 once carries out word, user side 110 need to carry out step S410 shown in Figure 4, does extraction and obtains its radical in order to keyword KW is carried out word.After the radical that obtains keyword KW, user side 110 is encrypted this radical and is obtained a cryptography key word (step S420) with the second gold medal key SWS-KEY.User side 110 then is sent to far-end server 120 (step S320) with this cryptography key word.
After far-end server 120 obtains the cryptography key word, far-end server 120 is searched this encryption second file (encryption indicator word collection) with this cryptography key word, namely search the universe search index, to obtain the corresponding a plurality of candidate index information of this cryptography key word (step S430).Corresponding these index informations of cryptography key word consist of an index information collection, and wherein said index information collection comprises a plurality of candidate's encryption indicator words and a plurality of candidate index information pointed out.Far-end server 120 can be sent to user side 110 (step S440) with this index information collection.
In certain embodiments, far-end server 120 meeting counting user ends 110 or other user sides are uploaded to the occurrence number of the cryptography key word of far-end server 120.Therefore, far-end server 120 can be in step S440, in this encryption second file (encryption indicator word collection) according to far-end server 120, keyword (most frequently occurring keyword) the most frequently appears, namely according to the frequency or the number of times that are retrieved and hit in this banner word collection (universe search index), and far-end server 120 these index information collection of sequence, then this index information collection after the sequence is sent to user side 110.
User side 110 is deciphered these candidate's encryption indicator words and is obtained a plurality of deciphering candidate words (step S450) with the second gold medal key SWS-KEY, selects a blip word for the user from these deciphering candidate words.After user's selected target banner word, user side 110 is sent to far-end server 120 (step S460) with the corresponding target index information of this blip word in these candidate index information.
This target index information that User end 110 is uploaded, far-end server 120 is obtained corresponding target and is encrypted page (a step S470) from these encryption pages that are stored in database, then this target encryption page is sent to user side 110 (step S350) from this far-end server 120.User side 110 is then deciphered this target with the first gold medal key CPS-KEY and is encrypted page (step S360).
Fig. 5 illustrates a kind of schematic flow sheet of document handling method according to another embodiment of the disclosure.Embodiment illustrated in fig. 5 can be with reference to the related description of Fig. 2.Be different from part embodiment illustrated in fig. 2, be the step S510～S530 that also comprises embodiment illustrated in fig. 5.Please refer to Fig. 1 and Fig. 5, user side 110 also can carry out step S510 after completing steps S215.In step S510, part character in these banner words of user side 110 extraction step S215 and obtain a plurality of related words.For example, step S510 may comprise: definition one everyday character collection; And extract the character that belongs to this everyday character collection in these banner words, and obtain these related words, and just height of formation related words collection of a plurality of related words.In certain embodiments, user side 110 is selected representative sample (representative sample) from these banner words of step S215, and these characters probably appear at (most of the queries) in most inquiry.
In the present embodiment, in the user side 110 English glossarys of use (English vocabulary), the most frequently used character (most repeated words) is defined as the everyday character collection, then extract the most frequently used character in English glossary from these banner words of step S215, and obtain these related words (step S510).For example, all English glossarys according to property sequence commonly used, are then got front 1% the most frequently used character and are defined as the everyday character collection.Next, user side 110 extracts in these banner words and belongs to the character of this everyday character collection, and obtains these related words.According to the character quantity in the everyday character collection, user side 110 can be controlled the quantity of these related words in step S510.For example, the file of 10000 words can extract 500 banner words by the carrying out of step S215 from this document, then can be by the carrying out of step S510 from then on 500 banner words further extract 50 related words.
Next, user side 110 is not encrypted these height correlation word collection with the 3rd gold medal key MRWS-KEY and is obtained to encrypt height correlation word collection (step S520).Wherein, the 3rd gold medal key MRWS-KEY is different from the first gold medal key CPS-KEY and the second gold medal key SWS-KEY.The user can utilize the golden key of standard open source code (open source) to produce common program, and (key generation utilities produces the first gold medal key CPS-KEY, the second gold medal key SWS-KEY and the 3rd gold medal key MRWS-KEY.Utilize golden key to produce common program, user side 110 can use a cipher (passphrase) to produce three keys (keys) CPS-KEY, SWS-KEY and MRWS-KEY.
After completing the foundation of encrypting height correlation word collection, user side 110 carries out step S530, in order to these encryption pages of step S210, this encryption second file (encryption indicator word collection) of step S225 and the encryption height correlation word collection of step S520 are sent to far-end server 120 storages from user side 110.With encryption indicator word collection and encrypt during height correlation word collection is sent to the process of far-end server 120, user side 110 does not need to allow far-end server 120 know clearly which is encryption indicator word collection and which is to encrypt height correlation word collection.Which index information far-end server 120 can't discover is to belong to encryption indicator word collection or encrypt height correlation word collection.For far-end server 120, described encryption indicator word collection or encryption height correlation word collection look like similar.So far-end server 120 when responding user side, also indifference between banner word collection or height correlation word collection.Only have user side 110 to know this information, because user side 110 has the 3rd gold medal key MRWS-KEY.
In other embodiments, user side 110 can prevent that more far-end server 120 from obtaining any message (knowledge).For example, user side 110 periodically transmits the close height correlation word of false add collection (dummy MRWS), so that definite far-end server 120 can't be attempted deallocation to (pairing) banner word collection and the content of encrypting height correlation word collection.Based on same reasons, during (query search) searched in inquiry, then user side 110 will first be encrypted keyword with the second gold medal key SWS-KEY and transmit in order to search.Next after several random numbers (random number) that transmit these requests, user side 110 uses the 3rd gold medal key MRWS-KEY to be encrypted then and transmits in order to inquire about.So can't carrying out the subclass of search result at once, user side 110 confirms.
Far-end server 120 is after receiving these encryption pages, and far-end server 120 is encrypted page with these and is stored in database.Far-end server 120 is at receiving flag word collection and after encrypting height correlation word collection, far-end server 120 can concentrate each encryption indicator word to login/add in the universe search index of far-end server 120 with corresponding index information banner word, and will encrypt the height correlation word and concentrate each encryption related words to login/add in the universe search index of far-end server 120 with corresponding index information.Each in the universe search index is encrypted character mapped (mapped) to its respective file ID (document ID), and this file ID points out to find the encryption page of key element (given word).File ID is a filename (file name) and the combination of page gap value (page offset) in this document, both mixed (combined) with encrypt (encrypted).Use some standard open source code common programs (for example from Apache Lucene) can realize the universe search index.
By encryption indicator word collection and encryption height correlation word collection are mixed and stored in the universe search index, the assailant can prevent most of statistical attack (statistical attacks), because can't obtain information on character frequency of utilization (frequency of words used).In other embodiments, user side 110 can also locate to insert invalid key (null keywords) at the random point (random points) that encryption height correlation word is concentrated, to help preventing any statistical attack.Encrypt and must encrypt height correlation word collection (Most Relevant Word Set) in certain embodiments, then by Extraction parts word in described a plurality of banner words and with the 3rd gold medal key MRWS-KEY.These are encrypted page, encryption the second file (containing banner word collection and index information) and this encryption height correlation word collection deliver to distant place server stores.When the user uses keyword to search file, send respectively two inquiries (query) after with the second gold medal key SWS-KEY, the 3rd gold medal key MRWS-KEY, keyword being encrypted.After deciphering the first Query Result, can get the page that contains key word of the inquiry in original.Whether after deciphering the second Query Result, comparing this result is the subclass of the first Query Result, can be in order to detect the non-loyal behavior of carrying out (unfaithful execution).
Fig. 6 be according to the disclosure again an embodiment illustrate that user side 110 proposes to search to far-end server 120 schematic flow sheet that requires.When user side 110 wishs are searched some keyword KW, user side 110 can carry out step S605 in order to use the second gold medal key SWS-KEY keyword is encrypted and obtains one first cryptography key word, and carries out step S610 and obtain one second cryptography key word in order to use the 3rd gold medal key MRWS-KEY that same keyword is encrypted.After completing encryption, user side 110 can carry out step S615 in order to the first cryptography key word and the second cryptography key word are sent to far-end server 120 from user side 110.Be encrypted because same keyword KW uses different golden key SWS-KEY and MRWS-KEY, so far-end server 120 can't be distinguished (distinguished) encryption indicator word collection and encrypt these two index of height correlation word collection.
Far-end server 120 is searched this encryption the second file with this first cryptography key word, to obtain corresponding one first search result (step S620) of this first cryptography key word.In addition, far-end server 120 is searched this encryption height correlation word collection with this second cryptography key word, to obtain corresponding one second search result (step S625) of this second cryptography key word.In encryption indicator word collection and encryption height correlation word collection are mixed and stored in the embodiment of universe search index, far-end server 120 can be searched this universe search index and obtain the first search result with this first cryptography key word, and searches this universe search index and obtain the second search result with this second cryptography key word.After completing search, far-end server 120 can carry out step S630 in order to the first search result and the second search result are sent to user side 110 from far-end server 120.
Usually, user side 110 can use a plurality of keywords to propose the search request to far-end server 120.User side 110 may will be known the file of the most relevant to these keywords (most relevant) mutually.Far-end server 120 comes a plurality of passback file ID set in optimization the first search result by the combination in any (arbitrary combination) of using a plurality of keywords.Far-end server 120 can also carry out optimization by using the ordering system (keyword based ranking system) based on keyword.For example, far-end server 120 can be according to described the first search result of the ascending power sequence arrangement of file ID.Again for example, far-end server 120 may be in accordance with the order that the quantity that contains these keywords in single file arranges described the first search result File ID.Again for example, far-end server 120 can relate to the order that number of times (referred times) arranges described the first search result File ID according to these keywords.For instance, this universe search index has 1000 to encrypt character (cryptography key word and encryption related words) sensing file A, and have 500 to encrypt character (cryptography key word and encryption related words) sensing file B, before the order of described the first search result File A can be arranged at file B.
Far-end server 120 merges the multiple queries result and returns unified result, and this result sorts according to the most frequently occurring keyword (most frequently occurring keyword) in far-end server 120 encrypted indexes.This practice can make user side 110 carry out quicker and more efficient analysis.Because keyword KW is fundamentally being encrypted, the more important thing is after extraction (stemming) and deletion basic syntax character (basic grammar words) done in word, in the index of encrypting, (namely encrypting the second file) only has specific given character, therefore can avoid statistical attack (Statistical attacks).
In other embodiments, in order to prevent that far-end server 120 from obtaining any message (knowledge), during inquiry is searched, user side 110 will first be encrypted keyword and obtain the first cryptography key word with the second gold medal key SWS-KEY, then transmit the first cryptography key word to far-end server 120 in order to search.Far-end server 120 is encrypted the second file and encrypts height correlation word collection according to the first cryptography key word search, to obtain the first search result corresponding to the first cryptography key word.Far-end server 120 is sent to user side 110 with the first search result.Next, user side 110 will be encrypted and obtain the second cryptography key word same keyword with the 3rd gold medal key MRWS-KEY, then transmit the second cryptography key word to far-end server 120 in order to search.Far-end server 120 is searched encryption indicator word collection and encrypts height correlation word collection according to the second cryptography key word, to obtain the second search result corresponding to the second cryptography key word.Far-end server 120 is sent to user side 110 with the second search result.
Next, user side 110 can use the second gold medal key SWS-KEY and the 3rd gold medal key MRWS-KEY to the first search result and the deciphering of the second search result, the first search result and the second search result (step S635) after then relatively deciphering.Be the subclass of banner word collection owing to encrypting height correlation word collection, therefore under normal circumstances, the second search result should be the subclass of the first search result.If step S635 judgement the second search result is the subclass of the first search result, user side 110 can carry out step S640, in order to the corresponding target index information of this keyword KW in the first search result is sent to far-end server 120.
The target index information that User end 110 is uploaded, far-end server 120 is obtained corresponding target and is encrypted page (a step S645) from these encryption pages that are stored in database, then this target encryption page is sent to user side 110 (step S650) from far-end server 120.Should be noted, far-end server 120 is that the Partial encryption page with text file returns to user side 110, rather than the text file after whole part is encrypted (or all encrypting page) returns to user side 110, the bandwidth resources that therefore can effectively save communication network.
Search inquiry (search query) when requiring the corresponding file page of keyword KW when one, the minimum number of pages that is required in this document is only obtained to local client 110 from far-end server 120 in document handling system wisdom ground.According to the encryption page that receives, user side 110 is then deciphered this target with the first gold medal key CPS-KEY and is encrypted page, converts clear text file (plain text document) (step S655) in order to this target is encrypted page.After user side 110 deciphering and decompression this document page, local client 110 then can carry out detailed search or the data of after-stage to be processed.Therefore, the network bandwidth is optimized utilization.
If step S635 judges the subclass that this second search result is not this first search result, far-end server 120 is identified and has carried out unloyal query processing (unfaithful query processing) (step S660).In certain embodiments, step S660 can suitably move (suitable actions), for example sends the caution of sound/light, or with this logout in syslog file (log file).By using two search index: encryption indicator word collection and encryption height correlation word collection, to confirm the handled truthless request of data storage server (data storage servers, namely far-end server 120).When searching simultaneously encryption indicator word collection with same keyword and encrypting height correlation word collection, if can finding but at encryption height correlation word collection, this keyword can not find at the banner word collection, far-end server 120 is identified and has carried out unloyal query processing.
Yet encrypting the second file may be all 0 with encrypting height correlation word collection passback content both.The null set (NULL set) that encryption height correlation word collection returns is the subclass of banner word null set that collection returns really, even therefore perhaps far-end server 120 has the disloyalty practical operation to do, user side 110 but can't be found.In order to address this problem, user side 110 can carry out following operation.User side 110 is set up a test document with a plurality of known keyword (known keywords), then it is stored in storage arrangement (for example hard disk).Step S205, S210, S215, S220, S225, S510, S520 by above-mentioned Fig. 5 process this test document meeting and other a plurality of files, to obtain to encrypt the second file and the content of encrypting height correlation word collection.Then transmit and encrypt the second file and encrypt height correlation word collection to far-end server 120 (being the step S530 of Fig. 5).After a while, user side 110 will use some keywords (known keyword that comprises this test document) to inquire about.Apparently, the search result of banner word collection and height correlation word collection should comprise described known keyword.If the passback content of far-end server 120 is 0 (null sets), user side 110 can judge easily that far-end server 120 had once carried out the disloyalty practical operation and done.
Owing to using three different golden key CPS-KEY, SWS-KEY, MRWS-KEY to go to encrypt identical keyword, make document handling system more strong (robust).Even suppose that far-end server 120 knows the structure of whole document handling system (scheme), these in still can't analytical database of far-end server 120 encrypt in page and universe search index encryption the second file (encryption indicator word collection) with encrypt height correlation word collection.Encryption page, encryption the second file, this three of encryption height correlation word collection look like diverse, because they use different golden keys to be encrypted separately.So unless far-end server 120 has this three golden key CPS-KEY, SWS-KEY, MRWS-KEY, otherwise far-end server 120 can't carry out any analysis to the storage data.
Based on above-mentioned, in the present embodiment, user side 110 uses different golden key CPS-KEY, SWS-KEY, MRWS-KEY respectively file page, the second file and height correlation word collection to be encrypted, and then encrypt file page, encryption the second file is sent to far-end server 120 storages with encryption height correlation word collection.Because far-end server 120 does not have golden key, thus far-end server 120 can't the enabling decryption of encrypted file page, encryption indicator word collection with encrypt height correlation word collection.Moreover encrypt file page, encryption indicator word collection and encryption height correlation word collection three's golden key is not identical, has therefore promoted the information security that is stored in far-end server 120 Files.Moreover, user side 110 extracts the part character of file page and make encryption indicator word collection and encrypts height correlation word collection in advance, makes far-end server 120 to carry out corresponding processing in encrypted domain (Encryption-Domain) according to the various processing demands (such as demands such as search keywords) of user side 110.
Although the disclosure with embodiment openly as above; so it is not to limit the disclosure, and those skilled in the art are not within breaking away from spirit and scope of the present disclosure; when doing a little change and retouching, therefore protection range of the present disclosure is as the criterion when looking the appended claims person of defining.
Claims (27)
1. document handling method comprises:
At a user side, at least one file is divided into a plurality of file pages;
Encrypt individually these file pages at this user side with one first gold medal key and obtain a plurality of encryption pages;
Extract part character in these file pages and obtain a plurality of banner words at this user side;
Record these banner words and its place page info at this user side;
Encrypt individually these banner words and its place page info and obtain to encrypt the second file with the one second gold medal key that is different from this first gold medal key at this user side; And
These are encrypted page be sent to a far-end server storage with this encryption second file from this user side.
2. document handling method as claimed in claim 1, the step of wherein said these file pages of encryption comprises:
Individually compress these file pages and obtain a plurality of page compressions; And
Encrypt these page compressions and obtain these encryption pages with this first gold medal key.
3. document handling method as claimed in claim 1, wherein the place page info of these banner words comprises the filename of this document and page gap value in this document.
4. document handling method as claimed in claim 1, in these file pages of wherein said extraction, the step of part character comprises:
Remove in these file pages article and basic syntax character and obtain these banner words at this user side.
5. document handling method as claimed in claim 4 also comprises:
When this user side wish is searched a keyword, encrypt this keyword and obtain a cryptography key word with this second gold medal key at this user side;
This cryptography key word is sent to this far-end server from this user side;
Search this encryption the second file at this far-end server with this cryptography key word, to obtain this cryptography key word corresponding place page info;
Encrypt from these according to this cryptography key word corresponding place page info at this far-end server and obtain a target page and encrypt page;
This target is encrypted page be sent to this user side from this far-end server; And
Decipher this target at this user side with this first gold medal key and encrypt page.
6. document handling method as claimed in claim 1, in these file pages of wherein said extraction, the step of part character comprises:
Remove in these file pages article and basic syntax character and obtain a plurality of original word at this user side; And
At this user side, these original word being carried out word does extraction and obtains these banner words.
7. document handling method as claimed in claim 6 also comprises:
When this user side wish is searched a keyword, at this user side, this keyword is carried out word and do extraction and obtain a radical;
Encrypt this radical and obtain a cryptography key word with this second gold medal key at this user side;
This cryptography key word is sent to this far-end server from this user side;
Search this encryption the second file at this far-end server with this cryptography key word, to obtain the corresponding index information collection of this cryptography key word, wherein said index information collection comprises a plurality of candidate's encryption indicator words and a plurality of candidate index information pointed out;
This index information collection is sent to this user side from this far-end server;
Decipher these candidate's encryption indicator words and obtain a plurality of deciphering candidate words with this second gold medal key at this user side, select a blip word for the user from these deciphering candidate words;
The corresponding target index information of this blip word in these candidate index information is sent to this far-end server from this user side;
Encrypt from these according to this target index information at this far-end server and obtain a target encryption page page;
This target is encrypted page be sent to this user side from this far-end server; And
Decipher this target at this user side with this first gold medal key and encrypt page.
8. document handling method as claimed in claim 7 wherein saidly comprises this index information collection from the step that this far-end server is sent to this user side:
In this encryption second file according to this far-end server, keyword appears the most frequently, at this far-end server this index information collection that sorts; And
This index information collection after sequence is sent to this user side from this far-end server.
9. document handling method as claimed in claim 1 also comprises:
Extract part character in these banner words and obtain a plurality of related words at this user side;
Height of formation related words collection after this user side records these related words;
Encrypt this height correlation word collection and obtain to encrypt height correlation word collection with one the 3rd gold medal key that is different from this first gold medal key and this second gold medal key at this user side; And
Should encrypt height correlation word collection and be sent to this far-end server storage from this user side.
10. document handling method as claimed in claim 9, in these banner words of wherein said extraction, the step of part character comprises:
Define an everyday character collection; And
Extract the character that belongs to this everyday character collection in these banner words, and obtain these related words.
11. document handling method as claimed in claim 9 also comprises:
Encrypt a keyword and obtain one first cryptography key word with this second gold medal key at this user side;
Encrypt this keyword and obtain one second cryptography key word with the 3rd gold medal key at this user side;
This first cryptography key word and this second cryptography key word are sent to this far-end server from this user side;
Search this encryption the second file at this far-end server with this first cryptography key word, to obtain corresponding one first search result of this first cryptography key word;
Search this encryption height correlation word collection at this far-end server with this second cryptography key word, to obtain corresponding one second search result of this second cryptography key word;
This first search result and this second search result are sent to this user side from this far-end server; And
In this user side relatively this first search result and this second search result, if this second search result subclass that is not this first search result wherein, this far-end server is identified and has carried out unloyal query processing.
12. document handling method as claimed in claim 1 also comprises:
At this far-end server, these are encrypted page and be stored to a database; And
These encryption indicator words and these place page infos in this encryption second file are logined in a universe search index of this far-end server.
13. document handling method as claimed in claim 12, wherein this universe search index comprises a key field and a value field, and this key field records these encryption indicator words, and this value field records these place page infos.
14. a document handling system comprises:
One far-end server; And
One user side, be coupled to this far-end server via a communication network, wherein this user side is divided into a plurality of file pages with at least one file, encrypt individually these file pages and obtain a plurality of encryption pages with one first gold medal key, extract part character in these file pages and obtain a plurality of banner words, record these banner words and its place page info, encrypt individually these banner words and its place page info and after obtaining to encrypt the second file with the one second gold medal key that is different from this first gold medal key, these are encrypted page be sent to this far-end server with this encryptions second file and store.
15. document handling system as claimed in claim 14, wherein this user side individually compresses these file pages and obtains a plurality of page compressions, and this user side is encrypted these page compressions with this first gold medal key and obtained these encryption pages.
16. document handling system as claimed in claim 14, wherein said place page info comprise the filename of this document and page gap value in this document.
17. document handling system as claimed in claim 14, wherein this user side removes in these file pages article and basic syntax character and obtains these banner words.
18. document handling system as claimed in claim 17, wherein when this user side wish is searched a keyword, this user side is encrypted this keyword and is obtained a cryptography key word with this second gold medal key, and this cryptography key word is sent to this far-end server from this user side; This far-end server is searched this encryption second file to obtain the corresponding place page info of this cryptography key word with this cryptography key word, and encrypt from these according to this place page info and obtain a target encryption page page, then this target is encrypted page and be sent to this user side from this far-end server; And this user side is deciphered this target encryption page with this first gold medal key.
19. document handling system as claimed in claim 14, wherein this user side removes in these file pages article and basic syntax character and obtains a plurality of original word, and this user side carries out word to these original word and does and extract and obtain these banner words.
20. document handling system as claimed in claim 19, wherein when this user side wish was searched a keyword, this user side carries out word to this keyword to be done extraction and obtains a radical; This user side is encrypted this radical and is obtained a cryptography key word with this second gold medal key; This user side is sent to this far-end server with this cryptography key word; This far-end server is searched this encryption the second file with this cryptography key word, and to obtain the corresponding index information collection of this cryptography key word, wherein said index information collection comprises a plurality of candidate's encryption indicator words and a plurality of candidate index information pointed out; This far-end server is sent to this user side with this index information collection; This user side is deciphered these candidate's encryption indicator words and is obtained a plurality of deciphering candidate words with this second gold medal key, selects a blip word for the user from these deciphering candidate words; This user side is sent to this far-end server with the corresponding target index information of this blip word in these candidate index information; This far-end server is encrypted from these according to this target index information and is obtained a target encryption page page; This far-end server is encrypted page with this target and is sent to this user side; And this user side is deciphered this target encryption page with this first gold medal key.
21. document handling system as claimed in claim 20, wherein this far-end server is according to the most frequently occurring keyword this index information collection that sorts in this encryption second file.
22. document handling system as claimed in claim 14, wherein this user side extracts part character in these banner words and obtains a plurality of related words and form a height correlation word collection; This user side is encrypted this height correlation word collection and is obtained to encrypt this height correlation word collection with one the 3rd gold medal key that is different from this first gold medal key and this second gold medal key; And this user side should be encrypted height correlation word collection and was sent to the storage of this far-end server.
23. document handling system as claimed in claim 22, wherein this user side definition one everyday character collection; And this user side extracts the character that belongs to this everyday character collection in these banner words, and obtains these related words.
24. document handling system as claimed in claim 22, wherein this user side is encrypted a key word of the inquiry and is obtained one first cryptography key word with this second gold medal key; This user side is encrypted this key word of the inquiry and is obtained one second cryptography key word with the 3rd gold medal key; This user side is sent to this far-end server with this first cryptography key word and this second cryptography key word; This far-end server is searched this encryption the second file with this first cryptography key word, to obtain corresponding one first search result of this first cryptography key word; This far-end server is searched this encryption height correlation word collection with this second cryptography key word, to obtain corresponding one second search result of this second cryptography key word; This far-end server is sent to this user side with this first search result and this second search result; And this user side relatively this first search result and this second search result, if this second search result subclass that is not this first search result wherein, this far-end server is identified and has carried out unloyal query processing.
25. document handling system as claimed in claim 24, wherein this document comprises a test document, and this test document comprises at least one known keyword, and this key word of the inquiry comprises this known keyword.
26. document handling system as claimed in claim 14, wherein this far-end server is encrypted page with these and is stored to a database; And this far-end server will be encrypted in the second file these encryption indicator words and these place page infos and login in a universe search index of this far-end server.
27. document handling system as claimed in claim 26, wherein this universe search index comprises a key field and a value field, and this key field records these encryption indicator words, and this value field records these place page infos.
Applications Claiming Priority (2)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| US13/330,721 | 2011-12-20 | ||
| US13/330,721 US9197613B2 (en) | 2011-12-20 | 2011-12-20 | Document processing method and system |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN103179179A true CN103179179A (en) | 2013-06-26 |
| CN103179179B CN103179179B (en) | 2016-01-13 |
Family
ID=48611456
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201110455766.5A Active CN103179179B (en) | 2011-12-20 | 2011-12-30 | Document handling method and system |
Country Status (2)
| Country | Link |
|---|---|
| US (1) | US9197613B2 (en) |
| CN (1) | CN103179179B (en) |
Cited By (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN107590366A (en) * | 2016-07-06 | 2018-01-16 | 福建福昕软件开发股份有限公司 | A kind of method that PDF document presses page protection |
| CN108319862A (en) * | 2017-01-16 | 2018-07-24 | 阿里巴巴集团控股有限公司 | A kind of method and apparatus of data documents disposal |
| CN110955901A (en) * | 2019-10-12 | 2020-04-03 | 烽火通信科技股份有限公司 | Storage method and server for virtual machine image file of cloud computing platform |
| CN113923209A (en) * | 2021-09-29 | 2022-01-11 | 北京轻舟智航科技有限公司 | Processing method for downloading batch data based on levelDB |
Families Citing this family (9)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US9240883B2 (en) * | 2008-09-04 | 2016-01-19 | Intel Corporation | Multi-key cryptography for encrypting file system acceleration |
| US9449178B2 (en) * | 2012-07-24 | 2016-09-20 | ID Insight | System, method and computer product for fast and secure data searching |
| US9646166B2 (en) | 2013-08-05 | 2017-05-09 | International Business Machines Corporation | Masking query data access pattern in encrypted data |
| US9852306B2 (en) * | 2013-08-05 | 2017-12-26 | International Business Machines Corporation | Conjunctive search in encrypted data |
| US9633219B2 (en) | 2015-08-26 | 2017-04-25 | International Business Machines Corporation | Providing secure indexes for searching encrypted data |
| US10362060B2 (en) * | 2015-12-30 | 2019-07-23 | International Business Machines Corporation | Curtailing search engines from obtaining and controlling information |
| JP6836068B2 (en) * | 2017-03-24 | 2021-02-24 | 富士通株式会社 | Learning method, learning device, learning program, search method, search device and search program |
| CA3102596A1 (en) | 2018-03-13 | 2019-09-19 | Nova Chemicals Corporation | Mitigating oxygen, carbon dioxide and/or acetylene output from an odh process |
| CN110457434B (en) * | 2019-07-19 | 2023-10-27 | 平安科技（深圳）有限公司 | Webpage evidence obtaining method and device based on search, readable storage medium and server |
Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US7181017B1 (en) * | 2001-03-23 | 2007-02-20 | David Felsher | System and method for secure three-party communications |
| US20100146299A1 (en) * | 2008-10-29 | 2010-06-10 | Ashwin Swaminathan | System and method for confidentiality-preserving rank-ordered search |
Family Cites Families (31)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US6421675B1 (en) | 1998-03-16 | 2002-07-16 | S. L. I. Systems, Inc. | Search engine |
| US6976090B2 (en) | 2000-04-20 | 2005-12-13 | Actona Technologies Ltd. | Differentiated content and application delivery via internet |
| US20020091836A1 (en) | 2000-06-24 | 2002-07-11 | Moetteli John Brent | Browsing method for focusing research |
| US7080073B1 (en) * | 2000-08-18 | 2006-07-18 | Firstrain, Inc. | Method and apparatus for focused crawling |
| JP3555869B2 (en) | 2000-09-28 | 2004-08-18 | Ｎｅｃソフト株式会社 | Encrypted file search method and apparatus, and computer-readable recording medium |
| US7216290B2 (en) * | 2001-04-25 | 2007-05-08 | Amplify, Llc | System, method and apparatus for selecting, displaying, managing, tracking and transferring access to content of web pages and other sources |
| US20040101142A1 (en) | 2001-07-05 | 2004-05-27 | Nasypny Vladimir Vladimirovich | Method and system for an integrated protection system of data distributed processing in computer networks and system for carrying out said method |
| US7412535B2 (en) | 2001-12-19 | 2008-08-12 | International Business Machines Corporation | Method and system for caching fragments while avoiding parsing of pages that do not contain fragments |
| US7426534B2 (en) | 2001-12-19 | 2008-09-16 | International Business Machines Corporation | Method and system for caching message fragments using an expansion attribute in a fragment link tag |
| US6946715B2 (en) * | 2003-02-19 | 2005-09-20 | Micron Technology, Inc. | CMOS image sensor and method of fabrication |
| US8520844B2 (en) * | 2003-06-20 | 2013-08-27 | Alcatel Lucent | Methods and apparatus for providing secure two-party public key cryptosystem |
| US20040267595A1 (en) | 2003-06-30 | 2004-12-30 | Idcocumentd, Llc. | Worker and document management system |
| US8065383B2 (en) | 2004-05-17 | 2011-11-22 | Simplefeed, Inc. | Customizable and measurable information feeds for personalized communication |
| US8639947B2 (en) | 2004-06-01 | 2014-01-28 | Ben Gurion University Of The Negev Research And Development Authority | Structure preserving database encryption method and system |
| US20080077570A1 (en) * | 2004-10-25 | 2008-03-27 | Infovell, Inc. | Full Text Query and Search Systems and Method of Use |
| WO2006077850A1 (en) | 2005-01-18 | 2006-07-27 | Matsushita Electric Industrial Co., Ltd. | Data storing method, data reproducing method, data recording device, data reproducing device, and recording medium |
| US7751565B2 (en) | 2005-01-25 | 2010-07-06 | Pak Kay Yuen | Secure encryption system, device and method |
| US20070005594A1 (en) * | 2005-06-30 | 2007-01-04 | Binyamin Pinkas | Secure keyword search system and method |
| US20070180356A1 (en) | 2005-10-12 | 2007-08-02 | Yu Sun | Content that is searchable but inhibited |
| JP4838610B2 (en) | 2006-03-24 | 2011-12-14 | キヤノン株式会社 | Document management apparatus, document management method, and program |
| US20080098300A1 (en) * | 2006-10-24 | 2008-04-24 | Brilliant Shopper, Inc. | Method and system for extracting information from web pages |
| JP2009098880A (en) | 2007-10-16 | 2009-05-07 | Canon Inc | Print processing system, print processing method, and computer program |
| US9110990B2 (en) * | 2009-04-03 | 2015-08-18 | Verizon Patent And Licensing Inc. | Apparatuses, methods and systems for improving the relevancy of interactive program guide search results on a wireless user's handset and television |
| US8630422B2 (en) | 2009-11-10 | 2014-01-14 | International Business Machines Corporation | Fully homomorphic encryption method based on a bootstrappable encryption scheme, computer program and apparatus |
| KR101302137B1 (en) | 2009-12-16 | 2013-09-16 | 한국전자통신연구원 | Method for Searchable Symmetric Encryption |
| US8861716B2 (en) * | 2010-03-30 | 2014-10-14 | International Business Machines Corporation | Efficient homomorphic encryption scheme for bilinear forms |
| US8565435B2 (en) * | 2010-08-16 | 2013-10-22 | International Business Machines Corporation | Efficient implementation of fully homomorphic encryption |
| US9002007B2 (en) * | 2011-02-03 | 2015-04-07 | Ricoh Co., Ltd. | Efficient, remote, private tree-based classification using cryptographic techniques |
| US8630409B2 (en) * | 2011-04-05 | 2014-01-14 | International Business Machines Corporation | Two-party private estimation of dataset similarity |
| US20120260108A1 (en) | 2011-04-11 | 2012-10-11 | Steve Lee | Font encryption and decryption system and method |
| WO2012149395A1 (en) * | 2011-04-29 | 2012-11-01 | International Business Machines Corporation | Fully homomorphic encryption |
-
2011
- 2011-12-20 US US13/330,721 patent/US9197613B2/en active Active
- 2011-12-30 CN CN201110455766.5A patent/CN103179179B/en active Active
Patent Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US7181017B1 (en) * | 2001-03-23 | 2007-02-20 | David Felsher | System and method for secure three-party communications |
| US7869591B1 (en) * | 2001-03-23 | 2011-01-11 | Nagel Robert H | System and method for secure three-party communications |
| US20100146299A1 (en) * | 2008-10-29 | 2010-06-10 | Ashwin Swaminathan | System and method for confidentiality-preserving rank-ordered search |
Cited By (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN107590366A (en) * | 2016-07-06 | 2018-01-16 | 福建福昕软件开发股份有限公司 | A kind of method that PDF document presses page protection |
| CN107590366B (en) * | 2016-07-06 | 2019-11-15 | 福建福昕软件开发股份有限公司 | A kind of method that PDF document presses page protection |
| CN108319862A (en) * | 2017-01-16 | 2018-07-24 | 阿里巴巴集团控股有限公司 | A kind of method and apparatus of data documents disposal |
| CN110955901A (en) * | 2019-10-12 | 2020-04-03 | 烽火通信科技股份有限公司 | Storage method and server for virtual machine image file of cloud computing platform |
| CN113923209A (en) * | 2021-09-29 | 2022-01-11 | 北京轻舟智航科技有限公司 | Processing method for downloading batch data based on levelDB |
Also Published As
| Publication number | Publication date |
|---|---|
| US20130159694A1 (en) | 2013-06-20 |
| CN103179179B (en) | 2016-01-13 |
| US9197613B2 (en) | 2015-11-24 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN103179179B (en) | Document handling method and system | |
| US8819408B2 (en) | Document processing method and system | |
| CN107480163B (en) | Efficient ciphertext image retrieval method supporting privacy protection in cloud environment | |
| Wang et al. | Enabling secure and efficient ranked keyword search over outsourced cloud data | |
| Fu et al. | Smart cloud search services: verifiable keyword-based semantic search over encrypted cloud data | |
| CN109858263B (en) | Data storage and retrieval method and device, electronic equipment and storage medium | |
| Awad et al. | Chaotic searchable encryption for mobile cloud storage | |
| JP2012164031A (en) | Data processor, data storage device, data processing method, data storage method and program | |
| CN111930688B (en) | Method and device for searching secret data of multi-keyword query in cloud server | |
| Xu et al. | A large-scale secure image retrieval method in cloud environment | |
| CN103731258A (en) | Method and device for generating secret key | |
| Ma et al. | EnDAS: efficient encrypted data search as a mobile cloud service | |
| CN112632129A (en) | Code stream data management method, device and storage medium | |
| JPWO2018047698A1 (en) | Encrypted message search method, message transmission / reception system, server, terminal, program | |
| Abduljabbar et al. | Privacy-preserving image retrieval in IoT-cloud | |
| CN109213731A (en) | Multi-key word cipher text retrieval method in cloud environment based on iterative cryptographic | |
| Cui et al. | Harnessing encrypted data in cloud for secure and efficient image sharing from mobile devices | |
| CN108390760A (en) | Public key keyword can search for encryption method end to end in a kind of cloud data transmission | |
| CN112202919B (en) | Picture ciphertext storage and retrieval method and system under cloud storage environment | |
| US20210224242A1 (en) | Systems and methods for indexing and searching data | |
| CN103716419B (en) | The domain name processing method and system of a kind of cross-terminal | |
| CN114201573B (en) | System and method for generating and querying an index associated with a target communication | |
| CN107124418B (en) | User position information protection system and method in position service | |
| CN109672525A (en) | It is a kind of to can search for public key encryption method and system with efficient forward index | |
| Yin et al. | A new approximate image verification mechanism in cloud computing |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| C14 | Grant of patent or utility model | ||
| GR01 | Patent grant |