Pub. online:6 May 2020Type:Research ArticleOpen Access
Journal:Informatica
Volume 31, Issue 2 (2020), pp. 277–298
Abstract
The vulnerable part of communications between user and server is the poor authentication level at the user’s side. For example, in e-banking systems for user authentication are used passwords that can be lost or swindled by a person maliciously impersonating bank.
To increase the security of e-banking system users should be supplied by the elements of public key infrastructure (PKI) but not necessary to the extent of standard requirements which are too complicated for ordinary users.
In this paper, we propose two versions of authenticated key agreement protocol (AKAP) which can be simply realized on the user’s side. AKAP is a collection of cryptographic functions having provable security properties.
It is proved that AKAP1 is secure against active adversary under discrete logarithm assumption when formulated certain conditions hold. AKAP2 provides user’s anonymity against eavesdropping adversary. The partial security of AKAP2 is investigated which relies on the security of asymmetric encryption function.
Journal:Informatica
Volume 23, Issue 2 (2012), pp. 283–298
Abstract
The notion of general backlash is introduced where instead of the straight lines determining the upward and downward parts of backlash characteristic general curves are considered. An analytic form of general backlash characteristic description is proposed, which is based on appropriate switching and internal functions. Consequently, this multi-valued mapping is represented by one difference equation. All the parameters in the equation describing this hard nonlinearity are separated; hence the general backlash identification can be solved as a quasi-linear problem using an iterative parameter estimation method with internal variable estimation. Also the identification of cascaded systems consisting of a general input backlash followed by a linear dynamic system is presented. Simulation studies of general backlash identification and that of cascaded systems with general input backlash are included.
Journal:Informatica
Volume 23, Issue 1 (2012), pp. 155–172
Abstract
User anonymity is very important security technique in distributed computing environments that an illegal entity cannot determine any information concerning the user's identity. In 2006, Kumar–Rajendra proposed a Secure Identification and Key agreement protocol with user Anonymity (SIKA). This paper demonstrates the vulnerability of the SIKA protocol and then presents an improvement to repair the security flaws of the SIKA protocol.
Journal:Informatica
Volume 22, Issue 2 (2011), pp. 225–240
Abstract
This paper presents a hand-shape biometric system based on a novel feature extraction methodology using the morphological pattern spectrum or pecstrum. Identification experiments were carried out using the obtained feature vectors as an input to some recognition systems using neural networks and support vector machine (SVM) techniques, obtaining in average an identification of 98.5%. The verification case was analyzed through an Euclidean distance classifier, obtaining the acceptance rate (FAR) and false rejection rate (FRR) of the system for some K-fold cross validation experiments. In average, an Equal Error Rate of 2.85% was obtained. The invariance to rotation and position properties of the pecstrum allow the system to avoid a fixed hand position using pegs, as is the case in other reported systems. The results indicate that the pattern spectrum represents a good alternative of feature extraction for biometric applications.
Journal:Informatica
Volume 21, Issue 4 (2010), pp. 575–596
Abstract
This paper presents GSM speech coder indirect identification algorithm based on sending novel identification pilot signals through the GSM speech channel. Each GSM subsystem disturbs identification pilot, while speech coder uniquely changes the tempo-spectral characteristics of the proposed pilot signal. Speech coder identification algorithm identifies speech coder with the usage of robust linear frequency cepstral coefficient (LFCC) feature extraction procedure and fast artificial neural networks. First step of speech coder identification algorithm is the exact position detection of the identification pilot signal using normalized cross correlation approach. Next stage is time-domain windowing of the input signal to convolve each frame of the input speech signal and window spectrum. Consecutive step is a short-time Fast Fourier Transformation to produce the magnitude spectrum of each windowed frame. Further, a noise reduction with spectral subtraction based on spectral smoothing is carried out. In last steps we perform the frequency filtering and Discrete Cosine Transformation to receive 24 uncorrelated cepstral coefficients per frame as a result. Speech coder identification is completed with fast artificial neural network classification using the input feature vector of 24 LFCC coefficients, giving a result of identified speech coder. For GSM speech coder indirect identification evaluation, the standardized GSM ETSI bit-exact implementations were used. Furthermore, a set of custom tools was build. These tools were used to simulate and control various conditions in the GSM system. Final results show that proposed algorithm identifies the GSM-EFR speech coder with the accuracy of 98.85%, the GSM-FR speech coder with 98.71%, and the GSM-HR coder with 98.61%. These scores were achieved at various types of surrounding noises and even at very low SNR conditions.
Journal:Informatica
Volume 12, Issue 3 (2001), pp. 439–454
Abstract
The aim of the given paper is development of a joint input-output approach and its comparison with a direct one in the case of an additive correlated noise acting on the output of the system (Fig. 1), when the prediction error method is applied to solve the closed-loop identification problem by processing observations. In the case of the known regulator, the two-stage method, which belongs to the ordinary joint input-output approach, reduces to the one-stage method. In such a case, the open-loop system could be easily determined after some extended rational transfer function (25) is identified, including the transfer functions of the regulator and of the open-loop system, respectively, as additional terms. In the case of the unknown regulator, the estimate of the extended transfer function (27) is used to generate an auxiliary input. The form of an additive noise filter (36), that guarantees the minimal value of the mean square criterion (35), is determined. The results of numerical simulation and identification of the closed-loop system (Fig. 5) by computer, using the two-stage method and the direct approach are given (Figures 6–12, Table 1).
Journal:Informatica
Volume 11, Issue 3 (2000), pp. 297–310
Abstract
In the previous paper (Pupeikis, 2000) the problem of closed-loop robust identification using the direct approach in the presence of outliers in observations have been considered. The aim of the given paper is a development of the indirect approach used for the estimation of parameters of a closed-loop discrete-time dynamic system in the case of additive correlated noise with outliers contaminated uniformly in it. To calculate current M-estimates of unknown parameters of such a system by means of processing input and noisy output observations, obtained from closed-loop experiments, the recursive robust technique based on an ordinary recursive least square (RLS) algorithm is applied here. The results of numerical simulation of closed-loop system (Fig. 3) by computer (Figs. 4–7) are given.
Journal:Informatica
Volume 11, Issue 2 (2000), pp. 163–178
Abstract
The aim of the given paper is a development of the direct approach used for the estimation of parameters of a closed-loop discrete-time dynamic system in the case of additive noise with outliers contaminated uniformly in it (Fig. 1). To calculate M-estimates of unknown parameters of such a system by means of processing input and noisy output observations (Fig. 2), the recursive robust H-technique based on an ordinary recursive least square (RLS) algorithm is applied here. The results of numerical simulation of closed-loop system (Fig. 3) by computer (Figs. 4–7) are given.
Journal:Informatica
Volume 5, Issues 3-4 (1994), pp. 324–337
Abstract
The problem of the parameters estimation of quasihomogeneous autoregressive random field is considered. An algorithm is proposed for the parameter estimation of certain classes of such fields.
Journal:Informatica
Volume 3, Issue 1 (1992), pp. 98–118
Abstract
We consider a class of identification algorithms for distributed parameter systems. Utilizing stochastic optimization techniques, sequences of estimators are constructed by minimizing appropriate functionals. The main effort is to develop weak and strong invariance principles for the underlying algorithms. By means of weak convergence methods, a functional central limit theorem is established. Using the Skorohod imbedding, a strong invariance principle is obtained. These invariance principles provide very precise rates of convergence results for parameter estimates, yielding important information for experimental design.