Results 1 - 10 of 15,636

Data Security

by Dorothy E. Denning, Peter J. Denning , 1979
"... The rising abuse of computers and increasing threat to personal privacy through data banks have stimulated much interest m the techmcal safeguards for data. There are four kinds of safeguards, each related to but distract from the others. Access controls regulate which users may enter the system and ..."
Abstract - Cited by 615 (3 self) - Add to MetaCart
and subsequently whmh data sets an active user may read or wrote. Flow controls regulate the dissemination of values among the data sets accessible to a user. Inference controls protect statistical databases by preventing questioners from deducing confidential information by posing carefully designed sequences

Complexity of Secure Sets∗

by Bernhard Bliem, Stefan Woltran
"... A secure set S in a graph is defined as a set of vertices such that for any X ⊆ S the majority of vertices in the neighborhood of X belongs to S. It is known that deciding whether a set S is secure in a graph is co-NP-complete. However, it is still open how this result contributes to the actual comp ..."
Abstract - Add to MetaCart
A secure set S in a graph is defined as a set of vertices such that for any X ⊆ S the majority of vertices in the neighborhood of X belongs to S. It is known that deciding whether a set S is secure in a graph is co-NP-complete. However, it is still open how this result contributes to the actual

Secure Group Communications Using Key Graphs

by Chung Kei Wong, Mohamed Gouda , Simon S. Lam - SIGCOMM '98 , 1998
"... Many emerging applications (e.g., teleconference, real-time information services, pay per view, distributed interactive simulation, and collaborative work) are based upon a group communications model, i.e., they require packet delivery from one or more authorized senders to a very large number of au ..."
Abstract - Cited by 556 (17 self) - Add to MetaCart
management. We formalize the notion of a secure group as a triple (U; K;R) where U denotes a set of users, K a set of keys held by the users, and R a user-key relation. We then introduce key graphs to specify secure groups. For a special class of key graphs, we present three strategies for securely

Parameterized Complexity of Secure Sets

by Rosa I. Enciso, Ronald D. Dutton
"... Secure sets were introduced by Brigham, Dutton, and Hedetniemi [1] as an extension of defensive alliances in a graph. Members of a defensive alliance have agreed to come to the aid of their neighbors in the alliance for mutual protection from attack by non-members. Alliances can occur, for example, ..."
Abstract - Cited by 1 (0 self) - Add to MetaCart
Secure sets were introduced by Brigham, Dutton, and Hedetniemi [1] as an extension of defensive alliances in a graph. Members of a defensive alliance have agreed to come to the aid of their neighbors in the alliance for mutual protection from attack by non-members. Alliances can occur, for example

Basic concepts and taxonomy of dependable and secure computing

by Algirdas Avizienis, Jean-claude Laprie, Brian Randell, Carl Landwehr - IEEE TDSC , 2004
"... This paper gives the main definitions relating to dependability, a generic concept including as special case such attributes as reliability, availability, safety, integrity, maintainability, etc. Security brings in concerns for confidentiality, in addition to availability and integrity. Basic defin ..."
Abstract - Cited by 779 (6 self) - Add to MetaCart
This paper gives the main definitions relating to dependability, a generic concept including as special case such attributes as reliability, availability, safety, integrity, maintainability, etc. Security brings in concerns for confidentiality, in addition to availability and integrity. Basic

Ariadne: a secure on-demand routing protocol for ad hoc networks," in

by Yih-Chun Hu , Adrian Perrig , David B Johnson - Proc. 8th ACM International Conf. Mobile Computing Networking , , 2002
"... Abstract An ad hoc network is a group of wireless mobile computers (or nodes), in which individual nodes cooperate by forwarding packets for each other to allow nodes to communicate beyond direct wireless transmission range. Prior research in ad hoc networking has generally studied the routing prob ..."
Abstract - Cited by 925 (12 self) - Add to MetaCart
problem in a non-adversarial setting, assuming a trusted environment. In this paper, we present attacks against routing in ad hoc networks, and we present the design and performance evaluation of a new secure on-demand ad hoc network routing protocol, called Ariadne. Ariadne prevents attackers

Security and Composition of Multi-party Cryptographic Protocols

by Ran Canetti - JOURNAL OF CRYPTOLOGY , 1998
"... We present general definitions of security for multi-party cryptographic protocols, with focus on the task of evaluating a probabilistic function of the parties' inputs. We show that, with respect to these definitions, security is preserved under a natural composition operation. The definiti ..."
Abstract - Cited by 463 (19 self) - Add to MetaCart
We present general definitions of security for multi-party cryptographic protocols, with focus on the task of evaluating a probabilistic function of the parties' inputs. We show that, with respect to these definitions, security is preserved under a natural composition operation

Decentralized Trust Management

by Matt Blaze, Joan Feigenbaum, Jack Lacy - In Proceedings of the 1996 IEEE Symposium on Security and Privacy , 1996
"... We identify the trust management problem as a distinct and important component of security in network services. Aspects of the trust management problem include formulating security policies and security credentials, determining whether particular sets of credentials satisfy the relevant policies, an ..."
Abstract - Cited by 1025 (24 self) - Add to MetaCart
We identify the trust management problem as a distinct and important component of security in network services. Aspects of the trust management problem include formulating security policies and security credentials, determining whether particular sets of credentials satisfy the relevant policies

Fuzzy extractors: How to generate strong keys from biometrics and other noisy data

by Yevgeniy Dodis, Rafail Ostrovsky, Leonid Reyzin, Adam Smith , 2008
"... We provide formal definitions and efficient secure techniques for • turning noisy information into keys usable for any cryptographic application, and, in particular, • reliably and securely authenticating biometric data. Our techniques apply not just to biometric information, but to any keying mater ..."
Abstract - Cited by 535 (38 self) - Add to MetaCart
We provide formal definitions and efficient secure techniques for • turning noisy information into keys usable for any cryptographic application, and, in particular, • reliably and securely authenticating biometric data. Our techniques apply not just to biometric information, but to any keying

The anatomy of the Grid: Enabling scalable virtual organizations.

by Ian Foster , • , Carl Kesselman , Steven Tuecke - The International Journal of High Performance Computing Applications , 2001
"... Abstract "Grid" computing has emerged as an important new field, distinguished from conventional distributed computing by its focus on large-scale resource sharing, innovative applications, and, in some cases, high-performance orientation. In this article, we define this new field. First, ..."
Abstract - Cited by 2673 (86 self) - Add to MetaCart
, we review the "Grid problem," which we define as flexible, secure, coordinated resource sharing among dynamic collections of individuals, institutions, and resources-what we refer to as virtual organizations. In such settings, we encounter unique authentication, authorization, resource
Results 1 - 10 of 15,636