Abstract This paper presents an adaptive algorithm to estimate states and unknown parameters simultaneously for nonlinear time invariant systems which depend affinely on the unknown parameters. The system output signals are filtered and re-parameterized into a regression form from which the least squares error scheme is applied to identify the unknown parameters. The states are then estimated b...

Due to the low performance caused by the traditional "embedded" watermark and the shortages about low accuracy and weak anti-aggressive of single-attribute birthmark in checking obfuscated software theft, a software identification scheme is proposed which is based on classification of multi-dimensional features. After disassembly analysis and static analysis on protecting software and its resis...

This article is concerned with the identification of switched linear multiple-inputs–multiple-outputs state-space systems in a recursive way. First, a structured subspace identification scheme for linear systems is presented which turns out to have many attractive features. More precisely, it does not require any singular value decomposition but is derived using orthogonal projection techniques...

There are three well-known identification schemes: the Fiat-Shamir, GQ and Schnorr identification schemes. All of them are proven secure against the passive or active attacks under some numbertheoretic assumptions. However, efficiencies of the reductions in those proofs of security are not tight, because they require “rewinding” a cheating prover. We show an identification scheme IDKEA1, which ...

In this paper, a realistic simulation model for Wheeled Mobile Robot (WMR) is given by a dynamical system that switches between three models corresponding to three different tire/road contact conditions: ideal condition, skidding condition and slipping condition. Then, an algebraic based numerical identification for the discrete state (tire/road contact condition) of this switching system is pr...

A scheme suitable for the detection and identification of faults in power systems is presented. Two notable contributions are made: a re-modelling of faulty components of power systems that is applicable to both normal and faulty conditions, and a fault detection scheme for power systems. The faults are modelled as unknown inputs, decoupled from the state and output measurements through coordin...

A Σ-protocol for proving equality of the discrete logarithm of two pairs of numbers is presented and used in an electronic voting scheme originally proposed in [CGS97]. Further, the notion of zero knowledge is introduced and a modified (1-bit challenge) version of Schnorr’s identification scheme is shown to be zero knowledge. 1 Proving Discrete Logarithm Equality

Traditional cryptographic hash functions allow one to easily check whether the original plaintexts are equal or not, given a pair of hash values. Probabilistic hash functions extend this concept where given a probabilistic hash of a value and the value itself, one can efficiently check whether the hash corresponds to the given value. However, given distinct probabilistic hashes of the same valu...

Parameter identification scheme and discrete-time adaptive sliding-mode controller applied to Pioneer 3-DX wheeled mobile robot (WMR) are presented in this paper. The dynamical model for mobile robot with one pair of active wheels, time–varying mass and moment of inertia have been used in slidingmode control. Two sliding-mode controllers corresponding to angular and position motion have been de...

Generally, the goal of identification schemes is to provide security assurance against impersonation attacks. Identification schemes based on zero knowledge protocols have more advantages, for example, deniability, which enables the prover to deny an identification proof so that the verifier couldn’t persuade others that it is indeed the prover who identified itself to him. This kind of identif...