Information processing apparatus, information processing method, and program

Patent metadata

Field	Value
Publication number	US-9300471-B2
Application number	US-201214131404-A
Country	US
Kind code	B2
Filing date	Jul 6, 2012
Priority date	Jul 7, 2011
Publication date	Mar 29, 2016
Grant date	Mar 29, 2016

Abstract

An information processing apparatus includes: a storage unit that stores a tree structure formed by nodes, each of which is stores identification information identifying a document; and a registration unit that registers documents in the storage unit. The registration unit receives a document including identification information identifying the document and a word set and a key, registers the identification information in a leaf node in the tree structure, and calculates a secure index corresponding to identification information registered in each node from a root node to the leaf node in the tree structure based on the word set and the key. In addition, the registration unit generates a value calculated by adding the calculated secure index as a search index for the document and stores a value calculated by adding a search index generated for each of a plurality of received documents as a search index for the plurality of documents in the storage unit.

First claim

What is claimed is:

1. An information processing apparatus, comprising:
a storage unit that stores instructions to be executed by a processor of a computer regarding a tree structure formed by nodes, each of which stores identification information identifying a document;
a registration unit, as executed by the processor on the computer, that registers documents in the storage unit,
wherein the registration unit comprises:
a reception unit that receives a document including identification information identifying the document and a word set and a key;
an identification information registration unit that registers received identification information in a leaf node in the tree structure;
a secure index generation unit that calculates a secure index corresponding to identification information registered in each node from a root node to the leaf node in the tree structure based on the word set and the key and generates a value calculated by adding the calculated secure index as a search index for the document; and
an index registration unit that computes a value by adding a plurality of search indexes generated respectively for a plurality of received documents, and stores the value in the storage unit as a single index for the plurality of received documents, and

wherein the index registration unit stores information obtained by associating an encrypted text obtained by encrypting a search index generated for each of the plurality of documents with identification information about the document in the storage unit as deletion information for deleting the document; and

a deletion unit that receives identification information for identifying a document that needs to be deleted and decoding information for cancelling the encryption, deletes the identification information from the tree structure, decodes encrypted text associated with the identification information in the deletion information by using the decoding information, obtains a search index generated for the document, and subtracts the obtained search index from a search index for the plurality of documents.

2. The information processing apparatus according to claim 1 , further comprising:
a search request unit receiving a word and the key and generating a trapdoor for the word by using the key; and
a search unit receiving the trapdoor, reading a search index for the plurality of documents and the tree structure from the storage unit, selecting a node closest to a root node among nodes to which a flag has not been allocated from the tree structure, and performing secure index determination based on identification information registered in the selected node, the trapdoor, and the search index,
wherein the search unit repeats, until a flag is allocated to all the nodes included in the tree structure, processing for allocating a first flag to the node if the search unit determines that the word is included in a document identified by the identification information, and otherwise, allocating a second flag to the node and descendant node(s) of the node, and
wherein the search unit outputs identification information registered in a node to which the first flag is allocated among the nodes included in the tree structure.

3. The information processing apparatus according to claim 1 , wherein a first document is updated to a second document by causing the deletion unit to delete the first document and causing the registration unit to register the second document.

4. The information processing apparatus according to claim 1 , wherein the tree structure comprises a binary tree structure.

5. The information processing apparatus according to claim 2 , wherein the search unit selects a node from the tree structure based on a breadth-first search method.

6. The information processing apparatus according to claim 2 , wherein the search unit selects a node from the tree structure based on a depth-first search method.

7. An information processing method, comprising:
receiving a document including identification information identifying the document and a word set and a key;
registering received identification information in a leaf node in a tree structure formed by nodes, each of which stores identification infoiniation identifying a document;
calculating a secure index corresponding to identification information registered in each node from a root node to the leaf node in the tree structure based on the word set and the key and generating a value calculated by adding the calculated secure index as a search index for the document;
computing a value by adding a plurality of search indexes generated respectively for a plurality of received documents, and storing the value in a storage unit as a single index for the plurality of received documents;
storing information obtained by associating obtained by encrypting the search index generated for each of the plurality of documents with identification information about the document in the storage unit as deletion information for deleting the document;
receiving identification information for identifying a document that needs to be deleted and decoding information for cancelling the encryption; and
deleting the received identification information from the tree structure, decoding encrypted text associated with the identification information in the deletion information by using the decoding information, obtaining a search index generated for the document, and subtracting the obtained search index from a search index for the plurality of documents.

8. The information processing method according to claim 7 , further comprising:
receiving a word and the key and generating a trapdoor for the word by using the key;
selecting a node closest to the root node among nodes to which a flag has not been allocated from the tree structure and performing secure index determination based on identification information registered in the selected node, the trapdoor, and the search index for the plurality of documents, and repeating, until a flag is allocated to all the nodes included in the tree structure, processing for allocating a first flag to the node if it is determined that the word is included in a document identified by the identification information, and otherwise, allocating a second flag to the node and descendant node(s) of the node; and
outputting identification information registered in a node to which the first flag is allocated among the nodes included in the tree structure.

9. A non-transient computer-readable storage medium, storing a program that causes a computer to execute:
receiving a document including identification information identifying the document and a word set and a key;
registering received identification information in a leaf node in a tree structure formed by nodes, each of which stores identification information identifying a document;
calculating a secure index corresponding to identification information registered in each node from a root node to the leaf node in the tree structure based on the word set and the key and generating a value calculated by adding the calculated secure index as a search index for the document;
computing a value by adding a plurality of the search indexes generated respectively for a plurality of received documents, and storing the value in a storage unit as a single index for the plurality of received documents;
storing information obtained by associating an encrypted text obtained by encrypting a search index generated for each of the plurality of documents with identification information about the document in the storage unit as deletion information for deleting the document;
receiving identification information for identifying a document that needs to be deleted and decoding information f

Assignees

• Araki Toshinori
• Teranishi Isamu
• Furukawa Jun
• Nec Corp

Inventors

• Araki Toshinori
• Teranishi Isamu
• Furukawa Jun

Classifications

• H04L9/3242 Primary

  involving keyed hash functions, e.g. message authentication codes [MACs], CBC-MAC or HMAC · CPC title

• G06F21/62

  Protecting access to data via a platform, e.g. using keys or access control rules · CPC title

• G06F17/30625

  Physics · mapped topic

• G06F16/322 Primary

  Trees · CPC title