We investigate the problem of secure message transmission in the presence of a ‘fully generalised’ adversary, who disrupts and listens to separate sets of communication wires. We extend previous results by considering the case when these sets may have arbitrary size, providing necessary and sufficient conditions for both one-way and two-way communication.

A simple and effective way of coordinating distributed, mobile, and parallel applications is to use a virtual shared memory (VSM), such as a Linda tuple-space. In this paper, we propose a new kind of VSM, called a tagged set. Each element in the VSM is a value with an associated tag, and values are read or removed from the VSM by matching the tag. Tagged sets exhibit three properties useful for...

Abstract We design and implement an efficient, secure, homomorphic k-Nearest Neighbours determination algorithm, to be used for regression or classification over private data. Our algorithm runs in quadratic complexity with regard the size of database but is only one literature make secure completely non-interactively. show that our both efficient accurate when applied problems requiring a smal...

The classical results in unconditional multi-party computation among a set of n players state that less than n=2 passive or less than n=3 active adversaries can be tolerated; assuming a broadcast channel the threshold for active adversaries is n=2. Strictly generalizing these results we specify the set of potentially misbehaving players as an arbitrary set of subsets of the player set. We prove...

in this work, we define a fuzzy soft set theory and its related properties. we then define fuzzy soft aggregation operator that allows constructing more efficient decision making method. finally, we give an example which shows that the method can be successfully applied to many problems that contain uncertainties.

We consider a multiple-rule, generalized modus ponens inference scheme, with an interpretation based on compositional rule of inference (CRI) and a residuated implication. We show that such a system is equivalent, as far as CRI is concerned, to a system that satis5es the “basic requirement for fuzzy reasoning”, proposed by Turksen and Tian (Fuzzy Sets and Systems 58 (1993) 3–40). We establish a...

The description of the error dynamics (30) in our paper [1] contains an omission that leads to some bounds used in the conditions of Theorem 8 and Corollary 2 in the paper to be incorrectly defined. In what follows, the correct error dynamics and the corresponding conditions are given. Instead of (30) in [1], the error dynamics are actually given by ė = m ∑ i=1 wi(z)[(Ai − LiC +MiAδi)e +Mi(Āδix̂...

A private set intersection protocol consists of two parties, a Sender and a Receiver, each with a secret input set. The protocol aims to have the Receiver output an intersection of the two sets while keeping the elements in the sets secret. This thesis thoroughly analyzes four recently published set intersection protocols, where it explains each protocol and checks whether it satisfies its corr...

The concepts of secure sets and security number in graphs were introduced first by Brigham et al. in 2007 as a generalization of the concept of alliances in graphs. Defensive alliances are related to the defense of a single vertex. But, in a general realistic settings, alliances should be formed so that any attack on the entire alliance or any subset of the alliance can be defended. In this sen...