feed icon rss

Your email was sent successfully. Check your inbox.

An error occurred while sending the email. Please try again.

Proceed reservation?

Export
Filter
  • Association for Computing Machinery (ACM)  (24)
  • 1
    Online Resource
    Online Resource
    Association for Computing Machinery (ACM) ; 2005
    In:  ACM SIGOPS Operating Systems Review Vol. 39, No. 5 ( 2005-10-20), p. 59-74
    In: ACM SIGOPS Operating Systems Review, Association for Computing Machinery (ACM), Vol. 39, No. 5 ( 2005-10-20), p. 59-74
    Abstract: A fault-scalable service can be configured to tolerate increasing numbers of faults without significant decreases in performance. The Query/Update (Q/U) protocol is a new tool that enables construction of fault-scalable Byzantine fault-tolerant services. The optimistic quorum-based nature of the Q/U protocol allows it to provide better throughput and fault-scalability than replicated state machines using agreement-based protocols. A prototype service built using the Q/U protocol outperforms the same service built using a popular replicated state machine implementation at all system sizes in experiments that permit an optimistic execution. Moreover, the performance of the Q/U protocol decreases by only 36% as the number of Byzantine faults tolerated increases from one to five, whereas the performance of the replicated state machine decreases by 83%.
    Type of Medium: Online Resource
    ISSN: 0163-5980
    RVK:
    Language: English
    Publisher: Association for Computing Machinery (ACM)
    Publication Date: 2005
    detail.hit.zdb_id: 2082220-0
    detail.hit.zdb_id: 243805-7
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 2
    Online Resource
    Online Resource
    Association for Computing Machinery (ACM) ; 2012
    In:  ACM Transactions on Storage Vol. 8, No. 3 ( 2012-09), p. 1-26
    In: ACM Transactions on Storage, Association for Computing Machinery (ACM), Vol. 8, No. 3 ( 2012-09), p. 1-26
    Abstract: File system virtual appliances (FSVAs) address the portability headaches that plague file system (FS) developers. By packaging their FS implementation in a virtual machine (VM), separate from the VM that runs user applications, they can avoid the need to port the file system to each operating system (OS) and OS version. A small FS-agnostic proxy, maintained by the core OS developers, connects the FSVA to whatever OS the user chooses. This article describes an FSVA design that maintains FS semantics for unmodified FS implementations and provides desired OS and virtualization features, such as a unified buffer cache and VM migration. Evaluation of prototype FSVA implementations in Linux and NetBSD, using Xen as the virtual machine manager (VMM), demonstrates that the FSVA architecture is efficient, FS-agnostic, and able to insulate file system implementations from OS differences that would otherwise require explicit porting.
    Type of Medium: Online Resource
    ISSN: 1553-3077 , 1553-3093
    Language: English
    Publisher: Association for Computing Machinery (ACM)
    Publication Date: 2012
    detail.hit.zdb_id: 2177816-4
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 3
    Online Resource
    Online Resource
    Association for Computing Machinery (ACM) ; 2011
    In:  ACM Transactions on Information and System Security Vol. 14, No. 1 ( 2011-05), p. 1-28
    In: ACM Transactions on Information and System Security, Association for Computing Machinery (ACM), Vol. 14, No. 1 ( 2011-05), p. 1-28
    Abstract: Access-control policy misconfigurations that cause requests to be erroneously denied can result in wasted time, user frustration, and, in the context of particular applications (e.g., health care), very severe consequences. In this article we apply association rule mining to the history of accesses to predict changes to access-control policies that are likely to be consistent with users' intentions, so that these changes can be instituted in advance of misconfigurations interfering with legitimate accesses. Instituting these changes requires the consent of the appropriate administrator, of course, and so a primary contribution of our work is how to automatically determine from whom to seek consent and how to minimize the costs of doing so. We show using data from a deployed access-control system that our methods can reduce the number of accesses that would have incurred costly time-of-access delays by 43%, and can correctly predict 58% of the intended policy. These gains are achieved without impacting the total amount of time users spend interacting with the system.
    Type of Medium: Online Resource
    ISSN: 1094-9224 , 1557-7406
    Language: English
    Publisher: Association for Computing Machinery (ACM)
    Publication Date: 2011
    detail.hit.zdb_id: 2006415-9
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 4
    Online Resource
    Online Resource
    Association for Computing Machinery (ACM) ; 2011
    In:  ACM Transactions on Information and System Security Vol. 14, No. 1 ( 2011-05), p. 1-33
    In: ACM Transactions on Information and System Security, Association for Computing Machinery (ACM), Vol. 14, No. 1 ( 2011-05), p. 1-33
    Abstract: A power grid is a complex system connecting electric power generators to consumers through power transmission and distribution networks across a large geographical area. System monitoring is necessary to ensure the reliable operation of power grids, and state estimation is used in system monitoring to best estimate the power grid state through analysis of meter measurements and power system models. Various techniques have been developed to detect and identify bad measurements, including interacting bad measurements introduced by arbitrary, nonrandom causes. At first glance, it seems that these techniques can also defeat malicious measurements injected by attackers. In this article, we expose an unknown vulnerability of existing bad measurement detection algorithms by presenting and analyzing a new class of attacks, called false data injection attacks , against state estimation in electric power grids. Under the assumption that the attacker can access the current power system configuration information and manipulate the measurements of meters at physically protected locations such as substations, such attacks can introduce arbitrary errors into certain state variables without being detected by existing algorithms. Moreover, we look at two scenarios, where the attacker is either constrained to specific meters or limited in the resources required to compromise meters. We show that the attacker can systematically and efficiently construct attack vectors in both scenarios to change the results of state estimation in arbitrary ways. We also extend these attacks to generalized false data injection attacks , which can further increase the impact by exploiting measurement errors typically tolerated in state estimation. We demonstrate the success of these attacks through simulation using IEEE test systems, and also discuss the practicality of these attacks and the real-world constraints that limit their effectiveness.
    Type of Medium: Online Resource
    ISSN: 1094-9224 , 1557-7406
    Language: English
    Publisher: Association for Computing Machinery (ACM)
    Publication Date: 2011
    detail.hit.zdb_id: 2006415-9
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 5
    Online Resource
    Online Resource
    Association for Computing Machinery (ACM) ; 1994
    In:  ACM Transactions on Computer Systems Vol. 12, No. 4 ( 1994-11), p. 340-371
    In: ACM Transactions on Computer Systems, Association for Computing Machinery (ACM), Vol. 12, No. 4 ( 1994-11), p. 340-371
    Abstract: Process groups are a common abstraction for fault-tolerant computing in distributed systems. We present a security architecture that extends the process group into a security abstraction. Integral parts of this architecture are services that securely and fault tolerantly support cryptographic key distribution. Using replication only when necessary, and introducing novel replication techniques when it was necessary, we have constructed these services both to be easily defensible against attack and to permit key distribution despite the transient unavailability of a substantial number of servers. We detail the design and implementation of these services and the secure process group abstraction they support. We also give preliminary performance figures for some common group operations.
    Type of Medium: Online Resource
    ISSN: 0734-2071 , 1557-7333
    Language: English
    Publisher: Association for Computing Machinery (ACM)
    Publication Date: 1994
    detail.hit.zdb_id: 602353-8
    detail.hit.zdb_id: 2006326-X
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 6
    Online Resource
    Online Resource
    Association for Computing Machinery (ACM) ; 2008
    In:  ACM Transactions on Information and System Security Vol. 12, No. 2 ( 2008-12), p. 1-35
    In: ACM Transactions on Information and System Security, Association for Computing Machinery (ACM), Vol. 12, No. 2 ( 2008-12), p. 1-35
    Abstract: In biology, a vaccine is a weakened strain of a virus or bacterium that is intentionally injected into the body for the purpose of stimulating antibody production. Inspired by this idea, we propose a packet vaccine mechanism that randomizes address-like strings in packet payloads to carry out fast exploit detection and signature generation. An exploit with a randomized jump address behaves like a vaccine: it will likely cause an exception in a vulnerable program’s process when attempting to hijack the control flow, and thereby expose itself. Taking that exploit as a template, our signature generator creates a set of new vaccines to probe the program in an attempt to uncover the necessary conditions for the exploit to happen. A signature is built upon these conditions to shield the underlying vulnerability from further attacks. In this way, packet vaccine detects exploits and generates signatures in a black-box fashion, that is, not relying on the knowledge of a vulnerable program’s source and binary code. Therefore, it even works on the commodity software obfuscated for the purpose of copyright protection. In addition, since our approach avoids the expense of tracking the program’s execution flow, it performs almost as fast as a normal run of the program and is capable of generating a signature of high quality within seconds or even subseconds. We present the design of the packet vaccine mechanism and an example of its application. We also describe our proof-of-concept implementation and the evaluation of our technique using real exploits.
    Type of Medium: Online Resource
    ISSN: 1094-9224 , 1557-7406
    Language: English
    Publisher: Association for Computing Machinery (ACM)
    Publication Date: 2008
    detail.hit.zdb_id: 2006415-9
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 7
    Online Resource
    Online Resource
    Association for Computing Machinery (ACM) ; 1999
    In:  Communications of the ACM Vol. 42, No. 2 ( 1999-02), p. 32-48
    In: Communications of the ACM, Association for Computing Machinery (ACM), Vol. 42, No. 2 ( 1999-02), p. 32-48
    Type of Medium: Online Resource
    ISSN: 0001-0782 , 1557-7317
    RVK:
    Language: English
    Publisher: Association for Computing Machinery (ACM)
    Publication Date: 1999
    detail.hit.zdb_id: 80254-2
    detail.hit.zdb_id: 2004542-6
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 8
    Online Resource
    Online Resource
    Association for Computing Machinery (ACM) ; 1996
    In:  Communications of the ACM Vol. 39, No. 4 ( 1996-04), p. 71-74
    In: Communications of the ACM, Association for Computing Machinery (ACM), Vol. 39, No. 4 ( 1996-04), p. 71-74
    Type of Medium: Online Resource
    ISSN: 0001-0782 , 1557-7317
    RVK:
    Language: English
    Publisher: Association for Computing Machinery (ACM)
    Publication Date: 1996
    detail.hit.zdb_id: 80254-2
    detail.hit.zdb_id: 2004542-6
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 9
    Online Resource
    Online Resource
    Association for Computing Machinery (ACM) ; 2019
    In:  ACM Transactions on Privacy and Security Vol. 22, No. 3 ( 2019-08-31), p. 1-30
    In: ACM Transactions on Privacy and Security, Association for Computing Machinery (ACM), Vol. 22, No. 3 ( 2019-08-31), p. 1-30
    Abstract: Images perturbed subtly to be misclassified by neural networks, called adversarial examples , have emerged as a technically deep challenge and an important concern for several application domains. Most research on adversarial examples takes as its only constraint that the perturbed images are similar to the originals. However, real-world application of these ideas often requires the examples to satisfy additional objectives, which are typically enforced through custom modifications of the perturbation process. In this article, we propose adversarial generative nets (AGNs), a general methodology to train a generator neural network to emit adversarial examples satisfying desired objectives. We demonstrate the ability of AGNs to accommodate a wide range of objectives, including imprecise ones difficult to model, in two application domains. In particular, we demonstrate physical adversarial examples—eyeglass frames designed to fool face recognition—with better robustness, inconspicuousness, and scalability than previous approaches, as well as a new attack to fool a handwritten-digit classifier.
    Type of Medium: Online Resource
    ISSN: 2471-2566 , 2471-2574
    Language: English
    Publisher: Association for Computing Machinery (ACM)
    Publication Date: 2019
    detail.hit.zdb_id: 2855393-7
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 10
    Online Resource
    Online Resource
    Association for Computing Machinery (ACM) ; 2007
    In:  ACM SIGOPS Operating Systems Review Vol. 41, No. 6 ( 2007-10-14), p. 73-86
    In: ACM SIGOPS Operating Systems Review, Association for Computing Machinery (ACM), Vol. 41, No. 6 ( 2007-10-14), p. 73-86
    Abstract: This paper presents an erasure-coded Byzantine fault-tolerant block storage protocol that is nearly as efficient as protocols that tolerate only crashes. Previous Byzantine fault-tolerant block storage protocols have either relied upon replication, which is inefficient for large blocks of data when tolerating multiple faults, or a combination of additional servers, extra computation, and versioned storage. To avoid these expensive techniques, our protocol employs novel mechanisms to optimize for the common case when faults and concurrency are rare. In the common case, a write operation completes in two rounds of communication and a read completes in one round. The protocol requires a short checksum comprised of cryptographic hashes and homomorphic fingerprints. It achieves throughput within 10% of the crash-tolerant protocol for writes and reads in failure-free runs when configured to tolerate up to 6 faulty servers and any number of faulty clients.
    Type of Medium: Online Resource
    ISSN: 0163-5980
    RVK:
    Language: English
    Publisher: Association for Computing Machinery (ACM)
    Publication Date: 2007
    detail.hit.zdb_id: 2082220-0
    detail.hit.zdb_id: 243805-7
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
Close ⊗
This website uses cookies and the analysis tool Matomo. Further information can be found on the KOBV privacy pages