Public Electronic Document Dating List

• US 20110125718A1
• Filed: 01/31/2011
• Published: 05/26/2011
• Est. Priority Date: 04/25/2008
• Status: Active Grant

• Current Assignee: Kelce S. Wilson
• Original Assignee: Kelce S. Wilson
• Inventors: Wilson, Kelce S.
• Granted Patent: US 8,135,714 B2
• Time in Patent Office: Days
• US Class Current: 707/687
• CPC Class Codes: G06F 16/152 using file content signatures, e.g. hash values
• CPC Class Codes: G06F 16/2365 Ensuring data consistency and integrity
• CPC Class Codes: G06F 16/24 Querying
• CPC Class Codes: G06F 16/907 Retrieval characterised by using metadata, e.g. metadata not derived from the content or metadata generated manually
• CPC Class Codes: G06F 16/908 using metadata automatically derived from the content
• CPC Class Codes: G06F 16/951 Indexing; Web crawling techniques
• CPC Class Codes: G06F 21/57 Certifying or maintaining trusted computer platforms, e.g. secure boots or power-downs, version controls, system software checks, secure updates or assessing vulnerabilities
• CPC Class Codes: G06F 21/645 using a third party
• CPC Class Codes: G06F 2221/03 Indexing scheme relating to G06F21/50, monitoring users, programs or devices to maintain the integrity of platforms
• CPC Class Codes: G06F 2221/2151 Time stamp
• CPC Class Codes: G06Q 20/145 Payments according to the detected use or quantity
• CPC Class Codes: G06Q 2220/12 Usage or charge determination
• CPC Class Codes: H04L 2209/42 Anonymization, e.g. involving pseudonyms
• CPC Class Codes: H04L 2209/56 Financial cryptography, e.g. electronic payment or e-cash
• CPC Class Codes: H04L 2209/603 Digital right managament [DRM]
• CPC Class Codes: H04L 63/12 Applying verification of the received information cryptographic mechanisms or cryptographic arrangements for data integrity or data verification H04L9/32
• CPC Class Codes: H04L 9/3226 using a predetermined code, e.g. password, passphrase or PIN network architectures or network communication protocols for supporting authentication of entities using passwords in a packet data network H04L63/083
• CPC Class Codes: H04L 9/3271 using challenge-response
• CPC Class Codes: H04L 9/3297 involving time stamps, e.g. generation of time stamps

Abstract

Systems and methods are disclosed which enable the establishment of file dates and the absence of tampering, even for documents held in secrecy and those stored in uncontrolled environments, but which does not require trusting a timestamping authority or document archival service. A trusted timestamping authority (TTSA) may be used, but even if the TTSA loses credibility or a challenger refuses to acknowledge the validity of a timestamp, a date for an electronic document may still be established. Systems and methods are disclosed which enable detection of file duplication in large collections of documents, which can improve searching for documents within the large collection.

Claims

1. A computer implemented method of establishing date evidence for a plurality of documents, the method executable by a processor, the method comprising:

providing a document dating list (DDL) node on a computer network, stored on a non-transitory computer readable medium;

receiving, at the DDL node, a first user account information;

receiving, at the DDL node, a first input record associated with the first user account information;

generating a first DDL record from the first input record;

receiving, at the DDL node, a second user account information, the second user account information different from the first user account information;

receiving, at the DDL node, a second input record associated with the second user account information;

generating a second DDL record from the second input record;

appending the first DDL record and the second DDL record to an open first DDL edition;

closing the first DDL edition, wherein closing the first DDL edition comprises generating an integrity verification code (IVC) for the first DDL edition;

generating a third DDL record from the IVC for the first DDL edition;

receiving, at the DDL node, a third user account information, the third user account information different from the first user account information and the second user account information;

receiving, at the DDL node, a third input record associated with the third user account information;

generating a fourth DDL record from the third input record; and

appending the third DDL record and the fourth DDL record to an open second DDL edition.

2. The method of claim 1 wherein the first user account information indicates an anonymous user.

3. The method of claim 2 wherein the second user account information indicates an anonymous user but different payment information.

4. The method of claim 1 wherein the first user account information indicates a prior existing subscription account ID.

5. The method of claim 4 further comprising:

determining whether a count of submissions during a pre-determined time interval exceeds a predetermined number; and

responsive to determining that the count exceeds the number, generating billing information.

6. The method of claim 1 further comprising:

transmitting a receipt acknowledgment to the first user.

7. The method of claim 1 wherein generating a DDL record from a received input record comprises timestamping the received input record.

8. The method of claim 1 wherein generating a DDL record from a received input record comprises adding a unique index number.

9. The method of claim 1 further comprising:

prior to receiving the first input record, transmitting a time reference to the first user.

10. The method of claim 1 further comprising:

prior to receiving the first input record, transmitting a submission security code to the first user.

11. The method of claim 10 further comprising:

determining whether a valid security code accompanies the first input record;

responsive to determining that a valid security code is received, continuing with generating the first DL record; and

responsive to determining that a valid security code is not received, rejecting the first input record, wherein rejecting the first input record comprises failing to append the first DDL edition with information from the first input record.

12. The method of claim 1 wherein closing the first DDL edition comprises transmitting the IVC to a remote node across a computer network.

13. The method of claim 1 wherein generating an IVC comprises:

generating a hash function message digest.

17. The program of claim 1 further comprising:

code for generating a hash function message digest from the first DDL edition.

14. A computer program embodied on a non-transitory computer readable medium and configured to be executed by a processor, the program comprising:

code for providing a document dating list (DDL) node on a computer network;

code for receiving, at the DDL node, a first user account information;

code for receiving, at the DDL node, a first input record associated with the first user account information;

code for generating a first DDL record from the first input record;

code for receiving, at the DDL node, a second user account information, the second user account information different from the first user account information;

code for receiving, at the DDL node, a second input record associated with the second user account information;

code for generating a second DDL record from the second input record;

code for appending the first DDL record and the second DDL record to an open first DDL edition;

code for closing the first DDL edition, wherein closing the first DDL edition comprises generating an integrity verification code (IVC) for the first DDL edition;

code for generating a third DDL record from the IVC for the first DDL edition;

code for receiving, at the DDL node, a third user account information, the third user account information different from the first user account information and the second user account information;

code for receiving, at the DDL node, a third input record associated with the third user account information;

code for generating a fourth DDL record from the third input record; and

code for appending the third DDL record and the fourth DDL record to an open second DDL edition.

15. The program of claim 14 further comprising:

code for determining whether a count of submissions during a pre-determined time interval exceeds a predetermined number.

16. The program of claim 14 further comprising:

code for determining whether a valid security code accompanies the first input record.

18. An apparatus for scoring a plurality of documents, the apparatus comprising:

a processor; and

a non-transitory computer readable medium comprising;

a user account database;

a document dating list (DDL) administration logic, the logic comprising;

logic for providing a DDL node on a computer network;

logic for receiving, at the DDL node, a first user account information;

logic for receiving, at the DDL node, a first input record associated with the first user account information;

logic for generating a first DDL record from the first input record;

logic for receiving, at the DDL node, a second user account information, the second user account information different from the first user account information;

logic for receiving, at the DDL node, a second input record associated with the second user account information;

logic for generating a second DDL record from the second input record;

logic for appending the first DDL record and the second DDL record to an open first DDL edition;

logic for closing the first DDL edition, wherein closing the first DDL edition comprises generating an integrity verification code (IVC) for the first DDL edition;

logic for generating a third DDL record from the IVC for the first DDL edition;

logic for receiving, at the DDL node, a third user account information, the third user account information different from the first user account information and the second user account information;

logic for receiving, at the DDL node, a third input record associated with the third user account information;

logic for generating a fourth DDL record from the third input record; and

logic for appending the third DDL record and the fourth DDL record to an open second DDL edition.

19. The apparatus of claim 18 further comprising at least one selected from the list consisting of:

logic for determining whether a count of submissions during a pre-determined time interval exceeds a predetermined number;

logic for determining whether a valid security code accompanies the first input record; and

logic for generating a hash function message digest from the first DDL edition.

20. The apparatus of claim 18 wherein processor and computer readable medium reside on an application specific integrated circuit (ASIC).