Making data structures persistent
Journal of Computer and System Sciences - 18th Annual ACM Symposium on Theory of Computing (STOC), May 28-30, 1986
Accountable certificate management using undeniable attestations
Proceedings of the 7th ACM conference on Computer and communications security
Enabling the Archival Storage of Signed Documents
FAST '02 Proceedings of the Conference on File and Storage Technologies
Dynamic Accumulators and Application to Efficient Revocation of Anonymous Credentials
CRYPTO '02 Proceedings of the 22nd Annual International Cryptology Conference on Advances in Cryptology
CRYPTO '89 Proceedings of the 9th Annual International Cryptology Conference on Advances in Cryptology
Time-Stamping with Binary Linking Schemes
CRYPTO '98 Proceedings of the 18th Annual International Cryptology Conference on Advances in Cryptology
Secure History Preservation Through Timeline Entanglement
Proceedings of the 11th USENIX Security Symposium
On Certificate Revocation and Validation
FC '98 Proceedings of the Second International Conference on Financial Cryptography
Persistent Authenticated Dictionaries and Their Applications
ISC '01 Proceedings of the 4th International Conference on Information Security
An Efficient Dynamic and Distributed Cryptographic Accumulator
ISC '02 Proceedings of the 5th International Conference on Information Security
Optimally Efficient Accountable Time-Stamping
PKC '00 Proceedings of the Third International Workshop on Practice and Theory in Public Key Cryptography: Public Key Cryptography
FOCS '03 Proceedings of the 44th Annual IEEE Symposium on Foundations of Computer Science
CHRONOS: an authenticated dictionary based on skip lists for timestamping systems
Proceedings of the 2005 workshop on Secure web services
Certificate revocation and certificate update
SSYM'98 Proceedings of the 7th conference on USENIX Security Symposium - Volume 7
Strong accountability for network storage
FAST '07 Proceedings of the 5th USENIX conference on File and Storage Technologies
ICDCS '08 Proceedings of the 2008 The 28th International Conference on Distributed Computing Systems
On the cost of persistence and authentication in skip lists
WEA'07 Proceedings of the 6th international conference on Experimental algorithms
Efficient data structures for tamper-evident logging
SSYM'09 Proceedings of the 18th conference on USENIX security symposium
Universally composable time-stamping schemes with audit
ISC'05 Proceedings of the 8th international conference on Information Security
A new timestamping scheme based on skip lists
ICCSA'06 Proceedings of the 2006 international conference on Computational Science and Its Applications - Volume Part III
An asymmetric fingerprinting scheme based on tardos codes
IH'11 Proceedings of the 13th international conference on Information hiding
ACM Transactions on Information and System Security (TISSEC)
Hi-index | 0.00 |
We study the problem of authenticating the content and creation time of documents generated by an organization and retained in archival storage. Recent regulations (e.g., the Sarbanes-Oxley act and the Securities and Exchange Commission rule) mandate secure retention of important business records for several years. We provide a mechanism to authenticate bulk repositories of archived documents. In our approach, a space efficient local data structure encapsulates a full document repository in a short (e.g., 32-byte) digest. Periodically registered with a trusted party, these commitments enable compact proofs of both document creation time and content integrity. The data structure, an append-only persistent authenticated dictionary, allows for efficient proofs of existence and non-existence, improving on state-of-the-art techniques. We confirm through an experimental evaluation with the Enron email corpus its feasibility in practice.