Abstract Set membership proofs are an invaluable part of privacy preserving systems. These allow a prover to demonstrate knowledge witness w corresponding secret element x public set, such that they jointly satisfy given NP relation, i.e. ?( w, ) = 1 and is member set { , . ???? }. This allows the identity remain hidden, eg. ring signatures confidential transactions in cryptocurrencies. In this...

In this article, we investigate the set-membership state estimation problem for a class of time-varying systems with non-Gaussian noises over FlexRay network. To mitigate communication load and improve flexibility data scheduling, protocol (FRP) governed by both time-triggered event-triggered rules is exploited to regulate signal transmission in cyclic fashion. A new expression input estimator ...

The present research aimed to study the application of Fuzzy logic in social science research. In this regard, based on two variables, Social Capital and Quality of Life, the degree of Tehran’s membership in the set of social development was studied using FSQCA software.This research was an applied and descriptive research methodologically; and extensive in quantitative...

In this work a constrained adaptive filtering strategy based on conjugate gradient (CG) and set-membership (SM) techniques is presented for adaptive beamforming. A constraint on the magnitude of the array output is imposed to derive an adaptive algorithm that performs data-selective updates when calculating the beamformer’s parameters. We consider a linearly constrained minimum variance (LCMV) ...

In this paper, diagnosis for hybrid systems using a parity space approach that considers model uncertainty is proposed. The hybrid diagnoser is composed of modules which carry out the mode recognition and diagnosis tasks interacting each other, since the diagnosis module adapts accordingly to the current hybrid system mode. Moreover, the methodology takes into account the unknown but bounded un...

A wide variety of powerful cryptographic tools have been built using RSA, Diffie-Hellman, and other similar assumptions as their basis. Computational security has been achieved relative to complexity assumptions about the computational difficulty of a variety of number theoretic problems. However, these problems are closely related, and it is likely that if any one of them turns out to be effic...

This paper deals with offline nonlinear state estimation where measurements are available only when some given equality conditions are satisfied. For this type of problems, which are often met in robot localization when sonar or radar are involved, the data are qualified as fleeting because the measurements are available only at some given unknown dates. In this paper, the first approach able t...