Secure history preservation through timeline entanglement

Proceedings of the 11th USENIX Security Symposium

Volumn , Issue , 2002, Pages

  Maniatis, Petros ^a   Baker, Mary ^a  

^a Stanford University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

AUTHENTICATED DATA STRUCTURES; DESIGN AND IMPLEMENTATIONS; DISTRIBUTED SYSTEMS; INDEPENDENT SYSTEMS; LOOSELY COUPLED; PERFORMANCE CHARACTERISTICS; PROCESSING RESOURCES; SERVICE DEVELOPMENT;

EID: 85084161556     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (25)

1. Anagnostopoulos, A., Goodrich, M. T., and Tamassia, R. Persistent Authenticated Dictionaries and Their Applications. In Proceedings of the Information Security Conference (ISC 2001) (Malaga, Spain, Oct. 2001), vol. 2200 of Lecture Notes in Computer Science, Springer, pp. 379–393.
2. Ansper, A., Buldas, A., Saarepera, M., and Willemson, J. Improving the Availability of Time-Stamping Services. In Proccedings of the 6th Australasian Conference on Information and Privacy (ACISP 2001) (Sydney, Australia, July 2001).
3. Bayer, R. Symmetric binary B-trees: Data structure and maintenance algorithms. Acta Informatica 1 (1972), 290–306.
4. Bayer, R., and McCreight, E. M. Organization and Maintenance of Large Ordered Indexes. Acta Informatica 1, 3 (1972), 173–189.
5. Benaloh, J., and de Mare, M. Efficient Broadcast Time-stamping. Tech. Rep. TR-MCS-91-1, Clarkson University, Department of Mathematics and Computer Science, Apr. 1991.
6. Buldas, A., Laud, P., and Lipmaa, H. Accountable Certificate Management using Undeniable Attestations. In Proceedings of the 7th ACM Conference on Computer and Communications Security (CCS 2000) (Athens, Greece, Nov. 2000), pp. 9–17.
7. Buldas, A., Laud, P., and Lipmaa, H. Eliminating Counterevidence with Applications to Accountable Certificate Management. Jounal of Computer Security (2002). To appear.
8. Buldas, A., Laud, P., Lipmaa, H., and Villemson, J. Time-stamping with Binary Linking Schemes. In Advances on Cryptology (CRYPTO 1998) (Santa Barbara, USA, Aug. 1998), H. Krawczyk, Ed., vol. 1462 of Lecture Notes in Computer Science, Springer, pp. 486–501.
9. Cormen, T. H., Leiserson, C. E., and Rivest, R. L. Introduction to Algorithms, first ed. McGraw-Hill, 1989.
10. Goodrich, M. T., Tamassia, R., and Schwerin, A. Implementation of an Authenticated Dictionary with Skip Lists and Commutative Hashing. In 2001 DARPA Information Survivability Conference and Exposition (DISCEX 2001) (Anaheim, CA, USA, June 2001).
11. Haber, S., and Stornetta, W. S. How to Time-stamp a Digital Document. Journal of Cryptology: the Journal of the International Association for Cryptologic Research 3, 2 (1991), 99–111.
12. Just, M. Some Timestamping Protocol Failures. In Proceedings of the Symposium on Network and Distributed Security (NDSS 98) (San Diego, CA, USA, Mar. 1998), Internet Society.
13. Kocher, P. On Certificate Revocation and Validation. In Financial Cryptography (FC 1998) (1998), vol. 1465 of Lecture Notes in Computer Science, Springer, pp. 172–177.
14. Lamport, L. Time, Clocks, and the Ordering of Events in a Distributed System. Communications of the ACM 21, 7 (July 1978), 558–565.
15. Lamport, L., Shostak, R., and Pease, M. The Byzantine Generals Problem. ACM Transactions on Programming Languages and Systems 4, 3 (July 1982), 382–401.
16. Maniatis, P., and Baker, M. Enabling the Archival Storage of Signed Documents. In Proceedings of the USENIX Conference on File and Storage Technologies (FAST 2002) (Monterey, CA, USA, Jan. 2002), USENIX Association, pp. 31–45.
17. Merkle, R. C. Protocols for Public Key Cryptosystems. In Proceedings of the 1980 Symposium on Security and Privacy (Oakland, CA, U.S.A., Apr. 1980), IEEE Computer Society, pp. 122–133.
18. Naor, M., and Nissim, K. Certificate Revocation and Certificate Update. In Proceedings of the 7th USENIX Security Symposium (San Antonio, TX, USA, Jan. 1998), pp. 217–228.
19. National Institute of Standards and Technology (NIST). Federal Information Processing Standard Publication 180-1: Secure Hash Standard. Washington, D.C., USA, Apr. 1995.
20. Pugh, W. Skip Lists: a Probabilistic Alternative to Balanced Trees. Communications of the ACM 33, 6 (June 1990), 668–676.
21. Quisquater, J. J., Massias, H., Avilla, J. S., Preneel, B., and Van Rompay, B. TIMESEC: Specification and Implementation of a Timestamping System. Technical Report WP2, Université Catholique de Lou-vain, 1999.
22. Ratnasamy, S., Francis, P., Handley, M., Karp, R., and Shenker, S. A Scalable Content-Addressable Network. In Proceedings of the ACM SIGCOMM Symposium on Communication, Architecture, and Protocols (San Diego, CA, U.S.A., Aug. 2001), ACM SIGCOMM, pp. 161–172.
23. Schneier, B., and Kelsey, J. Cryptographic Support for Secure Logs on Untrusted Machines. In Proceedings of the 7th USENIX Security Symposium (San Antonio, TX, USA, Jan. 1998), pp. 53–62.
24. Stoica, I., Morris, R., Karger, D., Kaashoek, M. F., and Balakrishnan, H. Chord: A scalable peer-to-peer lookup service for internet applications. In Proceedings of the ACM SIGCOMM Symposium on Communication, Architecture, and Protocols (San Diego, CA, U.S.A., Aug. 2001), ACM SIGCOMM, pp. 149–160.
25. Surety, Inc. Secure Time/Date Stamping in a Public Key Infrastructure. Available at http://www.surety.com/.