نتایج جستجو برای: secure sets
تعداد نتایج: 266654 فیلتر نتایج به سال:
Let G be a connected simple graph. A restrained dominating set S of the vertex set of G, V (G) is a secure restrained dominating set of G if for each u ∈ V (G) \ S, there exists v ∈ S such that uv ∈ E(G) and the set (S \ {v}) ∪ {u} is a restrained dominating set of G. The minimum cardinality of a secure restrained dominating set of G, denoted by γsr(G), is called the secure restrained dominatio...
In 2004, Canetti-Halevi-Katz and later Boneh-Katz showed generic CCA-secure PKE constructions from a CPA-secure IBE. Goyal et al. in 2006 further extended the aforementioned idea implicitly to provide a specific CCA-secure KP-ABE with policies represented by monotone access trees. Later, Yamada et al. in 2011 generalized the CPA to CCA conversion to all those ABE, where the policies are represe...
We use grip pattern based biometrics as a secure side channel to achieve pre-authentication in a protocol that sets up a secure channel between two hand held devices. The protocol efficiently calculates a shared secret key from biometric data. The protocol is used in an application where grip pattern based biometrics is used to control access to police hand guns.
In this paper, we shall give examples to answer that an open problem posed by De Baets et al. in “Triangular norms on product lattices (Fuzzy Sets and Systems 104(1999), 61-75)”.
We study the heuristically secure mix-net proposed by Puiggalı́ and Guasch (EVOTE 2010). We present practical attacks on both correctness and privacy for some sets of parameters of the scheme. Although our attacks only allow us to replace a few inputs, or to break the privacy of a few voters, this shows that the scheme can not be proven secure.
in this paper we obtain a necessary and a sufficient condition for the set of ω_0-nearest points ( ω_0-farthest points) to be non-empty or a singleton set in normed linear spaces. we shall find a necessary and a sufficient condition for an uniquely remotal set to be a singleton set.
The formulation of strong and weak laws of large numbers for fuzzy random variables based on variance is given. The concept of the variance of fuzzy random variables, introduced by K1 orner (Fuzzy Sets and Systems 92 (1997) 83) and by Feng (Fuzzy Sets and Systems 120 (2001) 487) demonstrates its e2ciency. c © 2002 Elsevier Science B.V. All rights reserved.
In this note, we show by counterexamples that some results of Qiu and colleagues [On the restudy of fuzzy complex analysis: Part I. The sequence and series of fuzzy complex numbers and their convergences, Fuzzy Sets and Systems 115 (2000) 445–450; On the restudy of fuzzy complex analysis: Part II. The continuity and differentiation of fuzzy complex functions, Fuzzy Sets and Systems 120 (2001) 5...
The aim of this paper is to point out and correct some errors of two theorems for IFSs in Atanassov (Two theorems for intuitionistic fuzzy sets, Fuzzy Sets and Systems, 2000) and bring forward a new theorem for IFSs. In the end, some elementary, but non-standard equalities between IFSs were formulated.
Using mid-infrared and radio criteria, we select a sample of candidate z ∼ 2 obscured quasars. Optical spectroscopy confirms about half of these as type-2 quasars, and modelling the population suggests 50-80% of the quasars are obscured. We find some flat radio spectrum type-2 quasars, and tentative evidence for obscuration unrelated to the torus. Using a similar sample, we also find evidence f...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید