skip to main content
article
Free Access

How to think about security failures

Published:01 January 2006Publication History
Skip Abstract Section

Abstract

Understanding complexity and feedback in security models highlights the need for better failure modes in solutions.

References

  1. RD ([email protected]). Writing Linux Kernel Keylogger. Phrack 11, 59 (June 2002); www.phrack.org/phrack/59/p59-0x0e.txt.Google ScholarGoogle Scholar
  2. Schneier, B. Secrets & Lies: Digital Security in a Networked World. Wiley Computer Publishing, New York, 2000. Google ScholarGoogle ScholarDigital LibraryDigital Library
  3. Wang, Y.-M. Strider HoneyMonkeys: Active client-side honeypots for finding Web sites that exploit browser vulnerabilities. Part of Works in Progress at the 14th Usenix Security Symposium (Baltimore, July 31--Aug. 5, 2005); www.usenix.org/events/sec05/wips/wang.pdf and research.microsoft.com/HoneyMonkey/.Google ScholarGoogle Scholar
  4. Melstorm ([email protected]). Trust Transience: Post-Intrusion SSH Hijacking Melstorm. Presentation at Defcon 14 (Las Vegas, Aug. 4--6, 2005); opensores.thebunker.net/pub/mirrors/blackhat/presentations/bh-usa-05/BH_US_05-Boileau/metlstorms_sshjack-1.02.tar.gz.Google ScholarGoogle Scholar

Index Terms

  1. How to think about security failures

            Recommendations

            Comments

            Login options

            Check if you have access through your login credentials or your institution to get full access on this article.

            Sign in

            Full Access

            • Published in

              cover image Communications of the ACM
              Communications of the ACM  Volume 49, Issue 1
              Personal information management
              January 2006
              123 pages
              ISSN:0001-0782
              EISSN:1557-7317
              DOI:10.1145/1107458
              Issue’s Table of Contents

              Copyright © 2006 ACM

              Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

              Publisher

              Association for Computing Machinery

              New York, NY, United States

              Publication History

              • Published: 1 January 2006

              Permissions

              Request permissions about this article.

              Request Permissions

              Check for updates

              Qualifiers

              • article

            PDF Format

            View or Download as a PDF file.

            PDF

            eReader

            View online with eReader.

            eReader

            HTML Format

            View this article in HTML Format .

            View HTML Format