Method and system for assured document retention

• US 20060106857A1
• Filed: 11/12/2004
• Published: 05/18/2006
• Est. Priority Date: 11/12/2004
• Status: Abandoned Application

• Current Assignee: Hewlett-Packard Development Company, L.P. (HP Inc.)
• Original Assignee: Hewlett-Packard Development Company, L.P. (HP Inc.)
• Inventors: Lillibridge, Mark D., Eshghi, Kave
• Application Number:
  US10/988,415
• Publication Number:
  US 20060106857A1
• Time in Patent Office: Days
• US Class Current: 1/1
• CPC Class Codes: G06F 16/125 characterised by the use of retention policies retention policies for HSM systems G06F16/185

Abstract

Embodiments of the present invention relate to a system and method of providing computer archive system accountability. In accordance with some embodiments of the present invention, the system and method may comprise receiving a plurality of documents and assigning document IDs to the plurality of documents, each of the document IDs corresponding to one of the received documents. Further, embodiments of the present invention may comprise building a hash-based directed acyclic graph (HDAG) specifying the received documents and their document IDs, the HDAG having a plurality of nodes, a root node, and a root hash, wherein the root hash depends on the HDAG and is a hash of the root node. Additionally, embodiments of the present invention may comprise making the root hash available, providing proofs that the received documents and document IDs are properly incorporated into the HDAG, and providing a copy of a particular document that corresponds to a given document ID on request.

Claims

1. A method of providing computer archive system accountability, comprising:

receiving a plurality of documents;

assigning document IDs to the plurality of documents, each of the document IDs corresponding to one of the received documents;

building a hash-based directed acyclic graph (HDAG) specifying the received documents and their document IDs, the HDAG having a plurality of nodes, a root node, and a root hash, wherein the root hash depends on the HDAG and is a hash of the root node;

making the root hash available;

providing proofs that the received documents and document IDs are properly incorporated into the HDAG; and

providing a copy of a particular document that corresponds to a given document ID on request.

2. The method of claim 1, wherein the HDAG is built and its root hash published at the end of each of a plurality of time periods.

3. The method of claim 2, comprising building the HDAG to incorporate a pointer to a previous period'"'"'s HDAG.

4. The method of claim 3, comprising saving storage space by using a previous period'"'"'s HDAG when no documents are added in a current period.

5. The method of claim 2, comprising building the HDAG to incorporate information about when each document was received.

6. The method of claim 1, comprising providing HDAG nodes on a path from the root node of the HDAG as one of the proofs.

7. The method of claim 1, comprising assigning the document IDs to the plurality of documents from a sequence.

8. The method of claim 7, wherein the sequence is continuous.

9. The method of claim 7, wherein the sequence is not continuous.

10. The method of claim 1, comprising including a list of the received documents in the HDAG, the list comprising list nodes.

11. The method of claim 10, wherein the list of received documents is stored in a linked list.

12. The method of claim 10, comprising including a size of the rest of the list in some list nodes.

13. The method of claim 2, comprising including a list of lists of the received documents in the HDAG, the list of lists comprising a sublist for each of a plurality of time periods.

14. The method of claim 13, wherein each sublist is labeled with size information relating to the number of elements in that sublist and all following sublists.

15. The method of claim 14, wherein the number of elements a sublist is considered to have depends on the associated size labels for it and its following sublists.

16. The method of claim 13, wherein the list of lists is an append-only persistent skip list.

17. The method of claim 13, wherein some sublists are an ordered tree.

18. The method of claim 2, comprising incorporating round numbers in the HDAG, wherein the round numbers represent time periods relating to document storage times.

19. The method of claim 1, comprising including a document'"'"'s hash as part of its document ID.

20. The method of claim 18, comprising including a round number associated with a particular document in that document'"'"'s document ID.

21. The method of claim 18, comprising including a round number associated with a particular document in that document'"'"'s document ID and including that document'"'"'s hash as part of its document ID.

22. A system for providing computer archive system accountability, comprising:

a receiving module adapted to receive a plurality of documents;

an assignment module adapted to assign document IDs to the plurality of documents, each of the document IDs corresponding to one of the received documents;

a building module adapted to build a hash-based directed acyclic graph (HDAG) specifying the received documents and their document IDs, the HDAG having a plurality of nodes, a root node, and a root hash, wherein the root hash depends on the HDAG and is a hash of the root node;

an access module adapted to make the root hash available;

a proof module adapted to provide proofs that the received documents and document IDs are properly incorporated into the HDAG; and

a document module adapted to provide a copy of a particular document that corresponds to a given document ID on request.

23. The system of claim 22, wherein the building module is adapted to build the HDAG at the end of each of a plurality of time periods and the root hash module is adapted to publish a latest root hash at the end of each of the plurality of time periods.

24. The system of claim 23, wherein the building module is adapted to include a list of lists of the received documents in the HDAG, the list of lists comprising a sublist for each of a plurality of time periods.

25. The system of claim 24, wherein each sublist is labeled with size information relating to the number of elements in that sublist and all following sublists.

26. A computer program for providing computer archive system accountability, comprising:

a tangible medium;

a receiving module stored on the tangible medium, the receiving module adapted to receive a plurality of documents;

an assignment module stored on the tangible medium, the assignment module adapted to assign document IDs to the plurality of documents, each of the document IDs corresponding to one of the received documents;

a building module stored on the tangible medium, the building module adapted to build a hash-based directed acyclic graph (HDAG) specifying the received documents and their document IDs, the HDAG having a plurality of nodes, a root node, and a root hash, wherein the root hash depends on the HDAG and is a hash of the root node;

an access module stored on the tangible medium, the access module adapted to make the root hash available;

a proof module stored on the tangible medium, the proof module adapted to provide proofs that the received documents and document IDs are properly incorporated into the HDAG; and

a document module stored on the tangible medium, the document module adapted to provide a copy of a particular document that corresponds to a given document ID on request.