RE: [dss] Timestamping

["Dimitri Andivahis" <dimitri@surety.com>]

Trevor,

> -----Original Message-----
> From: Trevor Perrin [mailto:trevp@trevp.net]
> Sent: Thursday, April 03, 2003 2:55 PM
> To: Dimitri Andivahis; dss@lists.oasis-open.org
> Subject: RE: [dss] Timestamping
> 
> 
> 
> Dimitri,
> 
> thanks, this is helpful.  Some questions/comments:
> 
>   - I think I understand aggregation of A values into an 
> aggregated value, 
> and the simple linking of these aggregated values.  I don't understand 
> "accumulated linking", though.  What's the rationale?  How 
> exactly does it 
> work?  When you say that the TSA 'maintains recent A and S 
> values, as well 
> as the A and S values corresponding to the reduced subsequence of 
> timestamping "rounds"', I don't understand the phrase 'reduced 
> subsequence 
> of timestamping "rounds"'.
> 

I think the authors of the accumulated linking techniques
were mostly interested in providing optimal results for 
the length of proofs for relative temporal ordering amongst 
linked tokens.  A commercial system implementing such techniques 
exists, but I don't know specific details about it.

Accumulated techniques are a bit hard to describe in short form.
My novel term "reduced subsequence" is probably not a very successful 
one and I'm sorry if I confused you.  Accumulated schemes
encapsulate the linking and publishing process in the same
general linking scheme, instead of using one scheme for
the linking process and a different scheme for publishing.