If a secret key or a password is to be used in an application, where multi users are involved, then it is better to share the key or the password to all the authorized users in such a way that a minimum or all the shares of the users put together must result in the key or the password. This method avoids the unauthorized access to the information by a single user with out the knowledge of the o...

WARNING: FLUDARA FOR INJECTION should be administered under the supervision of a 6 qualified physician experienced in the use of antineoplastic therapy. FLUDARA FOR 7 INJECTION can severely suppress bone marrow function. When used at high doses in dose8 ranging studies in patients with acute leukemia, FLUDARA FOR INJECTION was associated 9 with severe neurologic effects, including blindness, co...

A time-bound hierarchical key assignment scheme is a cryptographic key assignment scheme that organizes and encrypts the resources, according to the hierarchical tree relations and the time constraint, such that only authorized users can efficiently access the resources. This paper proposes a practical time-bound key assignment scheme, which is efficient and is proved secure. We, based on the t...

Thirty years ago, Congress passed the Computer Fraud and Abuse Act ("CFAA ") to combat the emerging problem of computer crime. The statute's core prohibitions targeted one who "accesses" a computer "without authorization" or who "exceeds authorized access." Over time, the incremental statutory changes and large-scale technological changes have dramatically expanded the potential scope of the CF...

A secret-sharing scheme enables a dealer to distribute a secret among n parties such that only some predefined authorized sets of parties will be able to reconstruct the secret from their shares. The (monotone) collection of authorized sets is called an access structure, and is freely identified with its characteristic monotone function f : f0; 1gn ! f0; 1g. A family of secret-sharing schemes i...

A secret-sharing scheme enables a dealer to distribute a secret among n parties such that only some predefined authorized sets of parties will be able to reconstruct the secret from their shares. The (monotone) collection of authorized sets is called an access structure, and is freely identified with its characteristic monotone function f : f0; 1gn ! f0; 1g. A family of secret-sharing schemes i...

A secret-sharing scheme enables a dealer to distribute a secret among n parties such that only some predefined authorized sets of parties will be able to reconstruct the secret from their shares. The (monotone) collection of authorized sets is called an access structure, and is freely identified with its characteristic monotone function f : {0, 1}n → {0, 1}. A family of secret-sharing schemes i...

The insider threat remains one of the most serious challenges to computer security. An insider attack occurs when an authorized user misuses his privileges and causes damages to the organization. Deception techniques have served as a common solution to insider threat detection, and several techniques, such as approaches based on honey entities, have been proposed. On the other hand, access cont...

Turing structures, standing waves, oscillatory clusters, and accelerating waves have been found in the spatially extended Belousov-Zhabotinsky system dispersed in water droplets of a reverse AOT microemulsion. The variety of patterns is determined by the tunable microstructure of the medium, i.e., by the concentration and size of water droplets. We propose a simple model to describe this system.

In secret sharing schemes a secret is distributed among a set of users P in such a way that only some sets, the authorized sets, can recover it. The family Γ of authorized sets is called access structure. Given such a monotone family Γ ⊂ 2P , we introduce the concept of extended access structures, defined over a larger set P ′ = P ∪ P̃, satisfying these two properties: • the set P is a minimal s...