Search the web
Sign In
New User? Sign Up
archivists
? Already a member? Sign in to Yahoo!

Yahoo! Groups Tips

Did you know...
Real people. Real stories. See how Yahoo! Groups impacts members worldwide.

Best of Y! Groups

   Check them out and nominate your group.
Having problems with message search? Fill out this form to ensure your group is one of the first to be migrated to the new message search system.

Messages

  Messages Help
Advanced
New genealogy website: mortalityschedules.com   Message List  
Reply | Forward Message #184 of 244 |
National Archives timestamp

For those who are not aware, there is a computational procedure
you can do for any digital file, that creates a unique number,
called a hash, that only matches that exact file.

There is a Federal standard for one hashing algorithm, called
SHA-1. That is a 160-biit number. More commonly used today is the
SHA-256 hash, that generates a 256 bit number.

Another term for this is 'digital thumbprint'.

In the following discussion I am referring implicitly to the use
of the SHA-256 hash.

If you take a digital file 'A', and you change the order of two
characters in the file, the hash becomes completely different.

No two digital files will have the same thumbprint. You cannot
predict what the thumbprint will be for a file. You cannot forge
or modify a file to match an existing thumbprint.

There are digital time stamping services on the internet that
register these 'thumbprints' to prove a particular file existed
at a particular date and time, and it has not changed.

The US Postal Service offers a time stamping service for a small
fee that they call an 'Electronic Postmark' but it only is kept
for seven years. They also require the user to have a digital
certificate to establish identity of the person time stamping the
file.

I propose something simpler.

I propose that the National Archives create and offer a free time
stamping service that does not require a digital certificate. The
purpose of this is to store and retrieve unique file identifiers
that will establish that a file existed at a certain date and
time, and has not changed.

Then files can be archived in multiple locations across a
distributed network, and their identity and authenticity will
remain unquestionable.

This service would be a public good, similar to the digital time
source offered by the Navy, for example.

The National Archives will keep these timestamps in perpetuity.
They would basically be entries in a database, with a 32-byte
thumbprint, date and time. They would be a public record, so
anyone can look up a thumbprint and now the date and time it was
registered.

Can others see the value of this idea?

I can write the basic software for this. One part would be a
database for the National Archives with a web XML interface for
registering and retrieving the thumbprints.

It would include a feature to thumbprint each day's database
entries, to eliminate any possibility of human interference in
the process. You don't have to trust anybody or even the
institution, since the thumbprints are impossible to forge.

The second thing would be a program, downloadable from a web
page, to calculate and submit the thumbprint. I can write it in
Windows, publish the source, and others could do the same for
Linux, etc.

What could it be used for? Scanned images, photographs, text
documents, backup files, sound recordings, web pages, newspapers,
anything that can be digitized.

Since the only submission is the thumbprint and not the file,
files can remain private yet still be authenticated later.

And the processing load on the server is tiny.

The other alternative to have someone like the National Archives
do it, is to do it ourselves as a distributed database with
replication across many sites and servers.

I can do it myself, but this needs institutional support to last
forever.

That institution can be a formal body like the National Archives,
or an ad hoc self-organizing one. Perhaps the latter makes sense
in this global internet world.

I think of this as the 'Forever Project' since it is the first
thing designed to last forever.

Brad Jensen
President
LaserVault LLC
www.laservault.com
















Tue Jul 10, 2007 6:52 pm

eraser74146
Offline Offline
Send Email Send Email

Forward
Message #184 of 244 |
Expand Messages Author Sort by Date

Hi all, A new web site is now online, http://www.mortalityschedules.com and it is a directory of every found transcription of the census mortality schedules...
Bill Cribbs
cribbswh
Offline Send Email
Jul 10, 2007
2:59 pm

I'm wondering why somebody like the National Archives doesn't put out a specification for a scratch-resistant, archival quality CD and DVD? Or maybe the...
Brad Jensen
eraser74146
Offline Send Email
Jul 10, 2007
6:48 pm

I have often argued that producing longer-lived storage media would not be cost-effective, since they will become obsolete before they wear out. It makes...
Jeff Rothenberg
jeff@...
Send Email
Jul 10, 2007
8:11 pm

I understand archivists have been burned by the many formats and generations of magnetic tape, but CDs have now been available for 25 years, and current drives...
Brad Jensen
eraser74146
Offline Send Email
Jul 25, 2007
1:03 am

Dunno if this will get to the list, but..... 7 years ago, I burned all our family home movies to DVD. Today, most are scratched, unrreadable, and in quite...
Jim Carroll
jcarroll@...
Send Email
Jul 25, 2007
1:31 am

... Yes, digital storage makes for a binary result, it would either still be perfect, or it would have lost a few bits along the way and would be a pixelated...
Charles MacDonald
cmacd123
Offline Send Email
Jul 25, 2007
1:33 am

For those who are not aware, there is a computational procedure you can do for any digital file, that creates a unique number, called a hash, that only matches...
Brad Jensen
eraser74146
Offline Send Email
Jul 10, 2007
8:10 pm

Without knowing the technical details, the idea makes sense, but I wonder if the Library of Congress, under their NDIPP program, would be the more appropriate...
Chris Prom
prom@...
Send Email
Jul 25, 2007
1:03 am
Advanced

Copyright © 2009 Yahoo! Inc. All rights reserved.
Privacy Policy - Terms of Service - Guidelines - Help