Symmetric ciphers purposed for Fully Homomorphic Encryption (FHE) have recently been proposed for two main reasons. First, minimizing the implementation (time and memory) overheads that are inherent to current FHE schemes. Second, improving the homomorphic capacity, i.e. the amount of operations that one can perform on homomorphic ciphertexts before bootstrapping, which amounts to limit their l...

Of these definitions, the first and third may make some sense, since the definition of a filter base describes the family C of sets in the “generalized Cantor intersection theorem” except for dropping the requirement that they be closed (which would not make sense in a general set X anyway). The definition of a filter is motivated in two ways. The first is that, since one is only interested in ...

In this paper, we present a simple yet effective Boolean map based representation that exploits connectivity cues for visual tracking. We describe a target object with histogram of oriented gradients and raw color features, of which each one is characterized by a set of Boolean maps generated by uniformly thresholding their values. The Boolean maps effectively encode multi-scale connectivity cu...

The filter generator consists of a linear feedback shift register (LFSR) and a Boolean filtering function that combines some bits from the shift register to create a key stream. A new attack on the filter generator has recently been described by Rønjom and Helleseth [6]. This paper gives an alternative and extended attack to reconstruct the initial state of the LFSR using the underlying subspac...

Our work proposes the use of topic taxonomies as part of a filtering language. Given a taxonomy, a classifier is trained for each one of its topics. The user is able to formulate logical rules combining the available topics, e.g. (Topic1 AND Topic2) OR Topic3, in order to filter related documents in a stream. Using the trained classifiers, every document in the stream is assigned a belief value...

An important concept in the theory of residuated lattices and other algebraic structures used for formal fuzzy logic, is that of a filter. Filters can be used, amongst others, to define congruence relations. Specific kinds of filters include Boolean filters and prime filters. In this paper, we define several different filters of residuated lattices and triangle algebras and examine their mutual...

Stack filters are nonlinear filters used for image processing (examples: median filters, order statistics). In the translation-invariant case a stack filter is determined by a positive Boolean function b. Many important properties of stack filters (idempotency, co-idempotency, order relations) can be tested in polynomial time if the DNF and/or CNF of b are known. © 2005 Elsevier B.V. All rights...

This paper considers actuator-fault estimation for discrete-time descriptor systems with unknown but bounded system disturbance and measurement noise. A zonotopic fault estimation filter is designed based on the analysis of fault detectability indexes. To ensure estimation accuracy, the filter gain in the zonotopic fault estimation filter is optimized through the zonotope minimization. The desi...

Introduced here is a novel application of Satisfiability (SAT) to the set membership problem with specific focus on efficiently testing whether large sets contain a given element. Such tests can be greatly enhanced via the use of filters, probabilistic algorithms that can quickly decide whether or not a given element is in a given set. This article proposes SAT filters (i.e., filters based on S...