• Documents
  • Authors
  • Tables
  • Other Seers ▼
    RefSeer AckSeer CollabSeer SeerSeer
  • Log in
  • Sign up
  • MetaCart

CiteSeerX logo

Advanced Search Include Citations
Advanced Search Include Citations | Disambiguate

Secure History Preservation through Timeline Entanglement (2002)

Cached

  • Download as a PDF
  •  
  • Download as a PS

Download Links

  • [berkeley.intel-research.net]
  • [berkeley.intel-research.net]
  • [www.usenix.org]
  • [www.ssrc.ucsc.edu]
  • [mosquitonet.stanford.edu]
  • [www.enhyper.com]

  • Save to List
  • Add to Collection
  • Correct Errors
  • Monitor Changes
by Petros Maniatis , Mary Baker
Citations:53 - 9 self
  • Summary
  • Active Bibliography
  • Co-citation
  • Clustered Documents
  • Version History

BibTeX

@MISC{Maniatis02securehistory,
    author = {Petros Maniatis and Mary Baker},
    title = {Secure History Preservation through Timeline Entanglement },
    year = {2002}
}

Years of Citing Articles

Bookmark

citeulike Connotea Bibsonomy Del.icio.us Digg Reddit

OpenURL

 

Abstract

A secure timeline is a tamper-evident historic record of the states through which a system goes throughout its operational history. Secure timelines can help us reason about the temporal ordering of system states in a provable manner. We extend secure timelines to encompass multiple, mutually distrustful services, using timeline entanglement. Timeline entanglement associates disparate timelines maintained at independent systems, by linking undeniably the past of one timeline to the future of another. Timeline entanglement is a sound method to map a time step in the history of one service onto the timeline of another, and helps clients of entangled services to get persistent temporal proofs for services rendered that survive the demise or noncooperation of the originating service. In this paper we present the design and implementation of Timeweave, our service development framework for timeline entanglement based on two novel disk-based authenticated data structures. We evaluate Timeweave's performance characteristics and show that it can be e#ciently 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.

Citations

229 Organization and Maintenance of Large Ordered Indexes - Bayer, McCreight - 1972
102 Symmetric Binary B-Trees: Data Structure and Maintenance Algorithms - Bayer - 1972
53 Time-stamping with binary linking schemes - Buldas, Laud, et al. - 1998
49 Persistent authenticated dictionaries and their applications - Anagnostopoulos, Goodrich, et al. - 2001
36 Accountable certificate management using undeniable attestations - Buldas, Laud, et al. - 2000
29 Efficient broadcast time-stamping - Benaloh, deMare - 1991
25 Eliminating counterevidence with applications to accountable certificate management - Buldas, Laud, et al.
10 Ecient Broadcast Time-stamping - Benaloh, Mare - 1991
9 Improving the Availability of TimeStamping Services - Ansper, Buldas, et al. - 2001
1 Accountable Certi Management using Undeniable Attestations - Buldas, Laud, et al. - 2000
The National Science Foundation
  • About CiteSeerX
  • Submit Documents
  • Privacy Policy
  • Help
  • Data
  • Source
  • Contact Us

Developed at and hosted by The College of Information Sciences and Technology

© 2007-2010 The Pennsylvania State University