Mobile-ID · Long-term digital evidence preservation
Customers and partnersWorkflow demoContact
Trusted LTANS
Evaluate
MOBILE-ID · TRUSTED LTANS

Evidence Record Model

Evidence structures, hash trees, timestamps, trust context and their relation to Trusted LTANS REST resources.

VI–EN terminology

What must remain bound together

Original data

Exact object/member bytes and source/revision mapping. Hash-only assigns byte custody to the customer.

Cryptographic evidence

An ERS or XMLERS record, timestamps and binding structures; not merely a JSON resource.

Trust context

Certificates, paths and status material under evaluation time/policy; current sources cannot automatically replace history.

Processing history

Policy revisions, renewal continuity and original/rendition relations; audit explains actions but does not replace ERS.

Binding bytes to time

01

Identify members

Freeze bytes, members, processing/order rules and syntax; retain inventory outside the cryptographic structure as needed.

02

Build hash binding

Compute digests/tree paths under the applicable ERS/XMLERS profile; claimed digests are not byte verification.

03

Bind timestamp

Validate token, imprint, algorithm, TSA and certificate material before publication.

Standard structures and product resources

ComponentRoleBoundary
EvidenceRecord / ArchiveTimeStampSequenceRFC 4998 defines ERS structures requiring actual decoding/validation.The JSON EvidenceRecord resource is not ASN.1 encoding.
Reduced hash treeBinds member digests to timestamps through evidence structures.Missing members/paths limit group validation.
XMLERSXML model with its own RFC 6283 processing rules.No simple relabeling/serialization conversion from ERS.
EvidenceRecord resourceIdentity, syntax and references under the REST contract.Resource retrieval does not prove cryptographic validation.
EvidenceRecord schema

How renewal retains history

DecisionInputResult
Timestamp renewalPrevious evidence; tree hash remains suitable.New archive timestamp in the applicable chain.
Hash-tree renewalOriginal data and prior evidence under the processing model.Rehash, new tree, new timestamp and new chain.

Hash-Tree Renewal requires access to the archived data and prior evidence required by the applicable Evidence Record processing model.

Timestamp and hash-tree renewal need different inputs. Preserve starting revisions, algorithms, tokens and continuation checks. Never alter original bytes to fit evidence.

Completeness before export

Next steps

Search LTANS documentation

Expanded illustration