Corpus ID: 109544319

Historic integrity in distributed systems

@inproceedings{Baker2003HistoricII,
  title={Historic integrity in distributed systems},
  author={M. Baker and Petros Maniatis},
  year={2003}
}
In an all-digital, all-online setting, long-term secure record keeping is a difficult task. The record-keeping problem comes up with increasing frequency, as we migrate to exclusively digital ways of transacting business. Accountability requires information about the content and the timing of business transactions. In the digital world, ideally, we should be able to tell with conviction when a “digital event” occurred with respect to other events—such as storing a purchase receipt on a hard… Expand
Research Statement
My research focuses primarily on Distributed Systems. Understanding what makes such systems practical in the real, error-prone, often malicious world, when central coordination and trust are tooExpand
    - 
Secure logs are powerful tools for building systems that must resist forgery, prove temporal relationships, and stand up to forensic scrutiny. The proofs of order and integrity encoded in theseExpand
CATS : Certified Authenticated Tamper-evident State Store for Network Services
This paper presents the design, implementation, and evaluation of CATS, a toolkit for indexed state storage for network services. CATS is based on a new implementation of a persistent authenticatedExpand
A distributed Integrity Catalog for digital repositories
TLDR
The introduces IntegrityCatalog, a system that collects all integrity related metadata in a single component, and treats them as first class objects, managing both their integrity and their preservation, and introduces a treap-based persistent authenticated dictionary managing arbitrary length key/value pairs, which is used to store all integrity metadata. Expand
Enabling secure and resource-efficient blockchain networks with VOLT
This paper describes VOLT, a permissioned blockchain network for a group of autonomous organizations to automate cross-organizational business processes. Specifically, VOLT ensures that a correctExpand
Strong accountability for network storage
TLDR
The results show that strong accountability is practical for network storage systems in settings with strong identity and modest degrees of write-sharing and how the accountability concepts and techniques used in CATS generalize to other classes of network services. Expand
Securing Shared Untrusted Storage by using TPM 1 . 2 Without Requiring a Trusted OS
We address the problem of using an untrusted server with a trusted platform module (TPM) to provide trusted storage for a large number of clients, where each client may own and use several differentExpand
Trust but verify: accountability for network services
TLDR
The foundation of the approach is to preserve digitally signed records of actions and/or internal state snapshots of each service, and use them to detect tampering, verify the consistency of actions, and prove responsibility for unexpected states or actions. Expand
Depot : Cloud storage with minimal trust ( extended version ) ∗
The paper describes the design, implementation, and evaluation of Depot, a cloud storage system that minimizes trust assumptions. Depot tolerates buggy or malicious behavior by any number of clientsExpand
12 Depot : Cloud Storage with Minimal Trust
This article describes the design, implementation, and evaluation of Depot, a cloud storage system that minimizes trust assumptions. Depot tolerates buggy or malicious behavior by any number ofExpand
...
1
2
3
...

References

SHOWING 1-10 OF 36 REFERENCES
Authentic Data Publication Over the Internet
TLDR
This work gives techniques based on Merkle hash trees that publishers can use to provide authenticity and nonrepudiation of the answer to database queries posed by a client without requiring a key to be held in an on-line system. Expand
Dealing with server corruption in weakly consistent, replicated data systems
TLDR
It is shown that high availability through data replication on portable computers need not be mutually exclusive with various levels of data security one might want, and how to solve the trust problem for Bayou, a weakly consistent replicated data system built at Xerox PARC. Expand
Secure History Preservation Through Timeline Entanglement
TLDR
The design and implementation of Timeweave is presented, the authors' service development framework for timeline entanglement based on two novel disk-based authenticated data structures, and it is shown that it can be deployed in a loosely-coupled distributed system of several hundred nodes with overhead of roughly 2-8% of the processing resources of a PC-grade system. Expand
Some Timestamping Protocol Failures
TLDR
Protocol failures are presented for two timestamping schemes and it is shown that although an indication of time can be included during the computation of the timestamp, the veri ation of theestamp does not allow for the recovery of this temporal measure. Expand
Enabling the Archival Storage of Signed Documents
TLDR
KASTS combines time stamping of signed documents with storage of past signature verification keys and is argued that such an extended archival storage system is feasible and one possible design for it is described. Expand
Improving the Availability of Time-Stamping Services
TLDR
Fault-tolerant linking as a new concept to neutralize fault-sensitivity as the main weakness of linkage-based time-stamping is introduced. Expand
Cryptographic Support for Secure Logs on Untrusted Machines
TLDR
A computationally cheap method is described for making all log entries generated prior to the logging machine's compromise impossible for the attacker to read, and also impossible to undetectably modify or destroy. Expand
Eliminating Counterevidence with Applications to Accountable Certificate Management
TLDR
A new primitive, undeniable attester, that allows someone to commit to some set S of bitstrings by publishing a short digest and to give attestations for any x that it is or is not a member of S, is presented. Expand
Organization and maintenance of large ordered indexes
TLDR
The index organization described allows retrieval, insertion, and deletion of keys in time proportional to logkI where I is the size of the index and k is a device dependent natural number such that the performance of the scheme becomes near optimal. Expand
Accountable certificate management using undeniable attestations
TLDR
A model for accountable certificate management, where clients receive attestations confirming inclusion/removal of their certificates from the database of valid certificates, and introduces authenticated search trees and builds an efficient undeniable attester upon them. Expand
...
1
2
3
4
...