Protecting secret data from insider attacks

Lecture Notes in Computer Science

Volumn 3570, Issue , 2005, Pages 16-30

  Dagon, David ^a   Lee, Wenke ^a   Lipton, Richard ^a  

^a GEORGIA INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

DATA PROCESSING; DATA STORAGE EQUIPMENT; ELECTRONIC DOCUMENT IDENTIFICATION SYSTEMS; TELECOMMUNICATION NETWORKS;

ISOLATION; SECRET DATA; STRUCTURED FILES;

SECURITY OF DATA;

EID: 26444473627     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/11507840_2     Document Type: Conference Paper

References (20)

1. [AKL93] Lars Arge, Mikael Knudseni, and Kirsten Larsent. A general lower bound on the complexity of comparison-based algorithm. In Proceedings of the 3d Workshop on Algorithms and Data Structures, volume 709, pages 83-94, 1993.
2. [AV87] A. Aggarwal and J.S. Vitter. The i/o complexity of sorting and related problems. In Proc. 14th ICALP, 1987.
3. [Bis03] Matt Bishop. Computer Security: Art and Science. Addison-Wesley-Longman, 2003.
4. [CFIJ99] Giovanni Di Crescenzo, Niels Ferguson, Russell Impagliazzo, and Markus Jakobsson. How to forget a secret. In Proc. of STAGS 99, 1999.
5. [Che90] B. Cheswick. The design of a secure internet gateway. In Proc. of Usenix Summer Conference, 1990.
6. [CSGV81] R.M. Capocelli, A. De Santis, L. Gargano, and U. Vaccaro. On the size of shares for secret sharing schemes. Lecture Notes in Computer Science, 576, 1981.
7. +88] Y. Deswarte, J.C. Fabre, J.M. Fray, D. Powell, and P.O. Ranea. Saturne: a distributed computing system which tolerates faults and intrusions. In Workshop on the Future Trends of Distributed Computing Systems in the 1990s, pages 329-338, September 1988.
8. [FDP91] J.-M. Fray, Y. Deswarte, and D. Powell. Intrusion tolerance using fine-grain fragmentation-scattering. In Proc. IEEE Symp. on Security and Privacy, pages 194-201, 1991.
9. [FDR92] Jean-Charles Fabre, Yves Deswarte, and Brian Randall. Designing secure and reliable applications using fragmentation-redundancy-scattering: an object-oriented approach. In PDCS 2, 1992.
10. [FM03] Holly Frost and Aaron Martz. The storage performance dilemma. http://www.texmemsys.com/files/f000160.pdf, 2003.
11. [HP03] John L. Hennessy and David A. Patterson. Computer Organization and Design. Morgan Kaufman Publishers, 2003.
12. [KP00] Stefan Katzenbeisser and Fabien A. P. Petitcolas, editors. Information Hiding Techniques for Steganography and Digital Watermarking. Artech House Books, 2000.
13. [LAV01] Subramanian Lakshmanan, Mustaque Ahamad, and H. Venkateswaran. A secure and highly available distributed store for meeting diverse data storage needs. In Proceedings of the International Conference on Dependable Systems and Networks (DSN'01), 2001.
14. [Mau92] Ueli M. Maurer. Conditionally-perfect secrecy and a provably-secure randomized cipher. 1992.
15. [MR98] Dahlia Malkhi and Michael Reiter. Byzantine quorum systems. Distributed Computing, 11:203-213, 1998.
16. [Pat94] N.P. Patt. The I/O subsystem: A candidate for improvement. IEEE Computer: Special Issue, 24, 1994.
17. [PM99] Niels Provos and David Mazieres. A future-adaptable password scheme. http://www.openbsd.org/papers/bcrypt-paper.ps, 1999.
18. [Rab89] Michael O. Rabin. Efficient dispersal of information for security, load balancing, and fault tolerance. Journal of the ACM, 36, April 1989.
19. [Sha70] A. Shamir. How to share a secret. Comm. of ACM, 13(7):422-426, 1970.
20. +00] Jay Wylie, Michael Bigrigg, John Strunk, Gregory Ganger, Han Kiliccote, and Pradeep KhoslaComputer. Survivable information storage systems. In IEEE Computer, volume 33, pages 61-68, August 2000.