نتایج جستجو برای: adversary fuzzy structure
تعداد نتایج: 1657955 فیلتر نتایج به سال:
the automatic assignment of protein secondary structure from three dimensional coordinates is an essentialstep in the characterization of protein structure.although, the recognition of secondary structures suchas alpha-helices and beta-sheets seem straightforward, but there are many different definitions, eachregarding different criteria. we have developed a newalgorithm for protein helix assig...
Patra et al. [25] gave a necessary and sufficient condition for the possibility of almost perfectly secure message transmission protocols tolerating general, non-threshold Q adversary structure. However, their protocol requires at least three rounds and performs exponential (exponential in the size of the adversary structure) computation and communication. Moreover, they have left it as an open...
in this paper, we establish the theory of fuzzy ideal convergence on completely distributive lattices and give characterizations of some topological notions. we also study fuzzy limit structures and discuss the relationship between fuzzy co-topologies and fuzzy limit structures.
Problems of unconditionally secure communication have been studied extensively in network models. Dolev-Dwork-Waarts-Yung considered the Byzantine threats model, in which the adversary can only take over a number of nodes bounded by a threshold. They studied two cases: 1. all communication links (edges in the graph) are two-way communication, 2. all communication links are one-way communication...
Recently, Sarier [1] proposed an efficient biometric Identity Based Encryption (IBE) scheme called BIO-IBE using the Sakai Kasahara Key Construction and prove its security in the random oracle model based on the well-exploited k-BDHI computational problem. Despite its efficiency compared to other fuzzy IBE systems implemented for biometric identities, BIO-IBE is not secure against a new type of...
اساس نظریه مجموعه های ناهموار، بدین صورت است که برای هر زیرمجموعه از یک مجموعه کلی، با استفاده از یک رابه هم ارزی، یک زوج مرتب از مجموعه ها را معرفی می کند. هر موفه را به ترتیب، تقریب پایینی و بالایی می نامند. تقریب پایین از یک زیرمجموعه،اجتماع تمام عناصری از مجموعه ی کلی است که کلاس هم ارزی مربوط به آن عنصر، در زیرمجموعه ی مورد نظر قرار گیرد و همچنین، تقریب بالا از آن زیرمجموعه، اجتماع تمام عن...
—Any linear code can be used to construct a linear secret sharing scheme. In this paper, it is shown how to decide optimal linear codes (i.e., with the biggest information rate) realizing a given access structure over finite fields. It amounts to solving a system of quadratic equations constructed from the given access structure and the corresponding adversary structure. The system becomes a li...
Sensor networks can be easily compromised by an adversary because of hostile environments. An adversary may use compromised nodes to inject false reports into the network. The dynamic en-route scheme to filter false data injection can detect and drop such false reports during the forwarding phase. In this scheme, determining between a threshold value and the period for dissemination are importa...
A multiparty computation (MPC) protocol allows a set of players to compute a function of their inputs while keeping the inputs private and at the same time securing the correctness of the output. Most MPC protocols assume that the adversary can corrupt up to a fixed fraction of the number of players. Hirt and Maurer initiated the study of MPC under more general corruption patterns, in which the...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید