Pattarasinee Bhattarakosol

Authenticating User Using Keystroke Dynamics and Finger Pressure

Now mobile devices are developed to serve various functions, storing the sensitive information. As a consequence, the authentication of users for mobile devices has become an important issue. Additionally, the development of the mobile system is moving forward to the touch screen system for user friendly and quick access mechanism. In this paper, we proposed behavioral manners of users over the touchpad acting like touch screen that is able to detect finger pressure. We study the potential of each biometrics behavioral by individual and couple, comprise with hold-time, inter-key and finger pressure. The finding has shown that, the finger pressure gives the discriminative information more than keystroke dynamics with the PNN analytical method. Moreover, using only the finger pressure produces high accuracy rate of 99%.

Feasibility study on authentication based keystroke dynamic over touch-screen devices

Currently, people uses mobile devices as a part of their lives. This leads to the risk of data leaking or stealing. Due to the security issue, there are many studies try to increase security in these devices. The authentication process was bringing to the device with hope that it will prevent users from the securitys risk. Since the technology is developing fast, a new kind of risk comes to users without doubt. This study proposed a new study of feasibility to use keystroke dynamics on touch-screen devices. Using combination of four factors from keystroke dynamics, which are dwell time, interval time, interval timing ratio and distance between buttons, this study gives an accuracy at 82.18% with FAR and FRR at 0.020 and 0.178 respectively.

PIMSI: A Partial Image Spam Inspector

Abstract - at the present time, the high enlargement of spam e-mail is not easy to preclude and the spam is vastly stretch. These spam e-mails cause various problems to the Internet users, for instance full mailbox, and wasting time. Consequently, prodigious methods have been proposed but most of them have some limitations in mapping features and the processing times. Therefore, this paper proposed a novel method that can detect a set of image spam e- mail called a Partial Image Spam Inspector (PIMSI). The method focuses on spam that consists of both texts and images over the e-mail system. The significant feature of this technique is that it will sensitively protect the distribution of all messages which have a partial similarity of spam e- mail. As a result, users will have a green mailbox as wishes.

IT direction in Thailand: cultivating an e-society

For decades, advances in information technology have enhanced lives and economics around the world. Attempting to ride this wave, Thailand has worked since the late 1980s to develop a nationwide IT infrastructure that could serve government and the private sector. In 2002, dissatisfied with the limited success of earlier efforts, Thailands current government established the Ministry of Information and Communication Technology (ICT), charged with developing and supporting completely electronic processes for government, commerce, industry, and education. The new ICT policies aim to bring IT to bear on every aspect of Thai society and, ultimately, transform the economy.

Conformance Verification between Web Service Choreography and Implementation Using Learning and Model Checking

In this paper, we propose an alternative approach for verifying a conformance between choreography and the black box implementation of stateful Web service whose only external behaviors can be observed. Our framework uses an adapted version of Angluins algorithm to infer a Mealy machine model that represents the observable behaviors of the implemented Web service. By transforming the Mealy machine to the modeling formalism LTS, the model checker LTSA can be used for checking a trace equivalence relation which is the conformance criterion in this work.

e-mail authentication system: a spam filtering for smart senders

In the present time, the electronic mail is the most popular communication method of people around the world. However, the increasing of electronic mails is the beginning of a malevolent aftereffect e-mail. The transgressors have developed a set of codes that is the electronic bomb of the electronic mails passing through the communication line. As a result, various protection methods and software have been implemented. However, miscellaneous problems caused by spams still remain. Therefore, this paper proposed a novel method, called EMAS, to certify delivered mails. The benefits obtained from this system do not only solve the spam problem, but also untie the indirect effects from spams that no other methods have been missed.

Information searching protocol: a smart protocol for specific content search over the Internet

Currently, information is very important to Internet users. Unfortunately, searching for specific information from the Internet is not easy as wishes. The existing search engine mechanisms cannot be performed using a pathname of URL as a search key. Therefore, users who have a partial pathname of URL cannot use their knowledge to narrow down the search results. Thus, users have to spend a long time searching for the required web site from the result list. This paper proposes a search protocol named Information Searching Protocol (ISP) that supports the multiple search contents for users who know a partial pathname of URL and keywords. Moreover, the architecture of the Global Search Engine System (GSES) that cooperates with the ISP and is responsible for the search mechanism is also proposed. The GSES consists of two separated parts: an Internet Search Protocol agent at the client site, and GSES components at the server site. These components allow users to perform the search using a pathname of URL composing with keywords. The functions of GSES components indicate that the ISP enhances the search mechanism. So, users receive more specific URL and can, shortly, get access to the required site.

Active Learning of Nondeterministic Finite State Machines

We consider the problem of learning nondeterministic finite state machines (NFSMs) from systems where their internal structures are implicit and nondeterministic. Recently, an algorithm for inferring observable NFSMs (ONFSMs), which are the potentially learnable subclass of NFSMs, has been proposed based on the hypothesis that the complete testing assumption is satisfied. According to this assumption, with an input sequence (query), the complete set of all possible output sequences is given by the so-called Teacher, so the number of times for asking the same query is not taken into account in the algorithm. In this paper, we propose , a refined ONFSM learning algorithm that considers the amount for repeating the same query as one parameter. Unlike the previous work, our approach does not require all possible output sequences in one answer. Instead, it tries to observe the possible output sequences by asking the same query many times to the Teacher. We have proved that can infer the corresponding ONFSMs of the unknown systems when the number of tries for the same query is adequate to guarantee the complete testing assumption. Moreover, the proof shows that our algorithm will eventually terminate no matter whether the assumption is fulfilled or not. We also present the theoretical time complexity analysis of . In addition, experimental results demonstrate the practical efficiency of our approach.

A Study of Human Bio-detection Function under Text-Based CAPTCHA System

Currently, most authentication system requires users to answer the CAPTCHA (Completely Automated Public Turing Test to Tell Computer and Human Apart) before gaining the system access. CAPTCHA is a standard security technology for distinguish between human and computer program automatically. The problem of using CAPTCHA is the difficulty of reading the text-based presentation, or interpreting the image-based presentation. In addition, CAPTCHA cannot protect the third party attack. Therefore, this paper proposed a study of bio-detection function (BDF) of human based on the CAPTCHA system to identify the factors to be implemented into the CAPTCHA. The results can indicate that there are limitations in BDF of each person when uses CAPTCHA system and this limitation influences to the correctness of CAPTCHA typing.

Solving the learning parity with noise's open question

The classical cryptographic primitives are constructed on the assumptions that the private key is securely kept and uniformly distributed. Learning parity with noise is a famous problem used to construct several cryptographic primitives. This research studies the open question about the hardness of the learning parity with noise assumption when the secret vector is not uniform and has sufficient min-entropy. The proofs show that the standard learning parity with noise implies that it is secure even if the secret vector is sampled from an arbitrary distribution with sufficient entropy. Furthermore, this paper shows that the symmetric encryption scheme from learning parity with noise is secure even if the secret key has min-entropy at least k.