|
Dartmouth College Computer Science Technical Report series |
CS home TR home TR search TR listserv |
| By author: | A B C D E F G H I J K L M N O P Q R S T U V W X Y Z | |
| By number: | 2008, 2007, 2006, 2005, 2004, 2003, 2002, 2001, 2000, 1999, 1998, 1997, 1996, 1995, 1994, 1993, 1992, 1991, 1990, 1989, 1988, 1987, 1986 | |
Abstract:
We consider the problem of secure long-term archiving of
network traffic, an instance of the problem of storing data
securely. We approach the problem using secure hardware, which enables
the enforcement of flexible access policy. The policy cannot be
circumvented by anyone, even insiders, and so we are assured that
access to the data is as originally intended. The policy can be
expressed as any feasible computation, as it will be checked inside
the secure hardware without possibility of interference. We discuss
our design of a device to perform such network data archiving and have
implemented a prototpe device. We discuss other possible application
areas of the design.
Note:
Senior Honors Thesis.
Advisor: Sean Smith.
Bibliographic citation for this report: [plain text] [BIB] [BibTeX] [Refer]
Or copy and paste:
Alex Iliev,
"An Armored Data Vault."
Dartmouth Computer Science Technical Report TR2001-400,
May 2001.
Notify me about new tech reports.

To receive paper copy of a report, by mail, send your address and the TR number to reports AT cs.dartmouth.edu
Copyright notice: The documents contained in this server are included by the contributing authors as a means to ensure timely dissemination of scholarly and technical work on a non-commercial basis. Copyright and all rights therein are maintained by the authors or by other copyright holders, notwithstanding that they have offered their works here electronically. It is understood that all persons copying this information will adhere to the terms and constraints invoked by each author's copyright. These works may not be reposted without the explicit permission of the copyright holder.
Technical reports collection maintained by David Kotz.