Papers
Topics
Authors
Recent
Search
2000 character limit reached

Notarial timestamps savings in logs management via Merkle trees and Key Derivation Functions

Published 5 Oct 2021 in cs.CR | (2110.02103v1)

Abstract: Nowadays log files handling imposes to ISPs (intended in their widest scope) strict normative duties apart from common technological issues. This work analyses how retention time policies and timestamping are deeply interlinked from the point of view of service providers, possibly leading to costs rise. A new schema is proposed trying to mitigate the need for third-party suppliers, enforcing cryptographic primitives well established in other fields of Information Technology but perhaps not yet widespread in logs management. The foundations of timestamping are recapped, and properties of cryptographic primitives introduced as a natural way to bypass legacy schema inefficiency and as an extra level of protection: these choices are justified by savings estimation (with regard to different ISP magnitudes) and by some basic security considerations.

Authors (1)

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Collections

Sign up for free to add this paper to one or more collections.