our aim in this paper is to introduce the notion of fuzzy soft near-subtraction semigroupsand fuzzy soft ideals of near-subtraction semigroups. we discuss some important properties of these new fuzzy algebraic structure and investigate some examples and counter examples.

The present paper studies fuzzy matroids in view of degree. First wegeneralize the notion of $(L,M)$-fuzzy independent structure byintroducing the degree of $M$-fuzzy family of independent $L$-fuzzysets with respect to a mapping from $L^X$ to $M$. Such kind ofdegrees is proved to satisfy some axioms similar to those satisfiedby $(L,M)$-fuzzy independent structure. ...

In this paper, we discuss the equivalent conditions of pretopological and topological $L$-fuzzy Q-convergence structures and define $T_{0},~T_{1},~T_{2}$-separation axioms in $L$-fuzzy Q-convergence space. {Furthermore, $L$-ordered Q-convergence structure is introduced and its relation with $L$-fuzzy Q-convergence structure is studied in a categorical sense}.

This paper presents protocols for Byzantine agreement, i.e. for reliable broadcast, among a set of n players, some of which may be controlled by an adversary. It is well-known that Byzantine agreement is possible if and only if the number of cheaters is less than n=3. In this paper we consider a general adversary that is speciied by a set of subsets of the player set (the adversary structure), ...

Security support is a must for ad hoc networks. However, existing key agreement schemes for ad hoc networks ignore the issue of entity anonymity. Without anonymity, the adversary can easily identify and track specific entities in the communications. Not only entities’ movement information is valuable to the adversary but also the adversary can launch heavy attacks on those important nodes, base...

This paper presents protocols for Byzantine agreement, i.e. for reliable broadcast, among a set of n players, some of which may be controlled by an adversary. It is well-known that Byzantine agreement is possible if and only if the number of cheaters is less than n=3. In this paper we consider a general adversary that is speciied by a set of subsets of the player set (the adversary structure), ...

The round complexity of verifiable secret sharing (VSS) schemes has been studied extensively for threshold adversaries. In particular, Fitzi et al. showed an efficient 3-round VSS for n ≥ 3t+1 [4], where an infinitely powerful adversary can corrupt t (or less) parties out of n parties. This paper shows that for non-threshold adversaries, 1. Two round VSS is possible iff the underlying adversary...

A large body of work studies the complexity of selecting the j-th largest element in an arbitrary set of n elements (a.k.a. the select(j) operation). In this work, we study the complexity of select in data that is partially structured by an initial preprocessing stage and in a data structure that is dynamically maintained. We provide lower and upper bounds in the comparison based model. For pre...