• Journal of Computing Science and Engineering
• /
• v.5 no.3
• /
• pp.210-222
• /
• 2011

In this work, we study the problem of privacy-preservation data publishing in moving objects databases. In particular, the trajectory of a mobile user in a plane is no longer a polyline in a two-dimensional space, instead it is a two-dimensional surface of fixed width $2A_{min}$, where $A_{min}$ defines the semi-diameter of the minimum spatial circular extent that must replace the real location of the mobile user on the XY-plane, in the anonymized (kNN) request. The desired anonymity is not achieved and the entire system becomes vulnerable to attackers, since a malicious attacker can observe that during the time, many of the neighbors' ids change, except for a small number of users. Thus, we reinforce the privacy model by clustering the mobile users according to their motion patterns in (u, ${\theta}$) plane, where u and ${\theta}$ define the velocity measure and the motion direction (angle) respectively. In this case, the anonymized (kNN) request looks up neighbors, who belong to the same cluster with the mobile requester in (u, ${\theta}$) space: Thus, we know that the trajectory of the k-anonymous mobile user is within this surface, but we do not know exactly where. We transform the surface's boundary poly-lines to dual points and we focus on the information distortion introduced by this space translation. We develop a set of efficient spatiotemporal access methods and we experimentally measure the impact of information distortion by comparing the performance results of the same spatiotemporal range queries executed on the original database and on the anonymized one.

• KIPS Transactions on Software and Data Engineering
• /
• v.9 no.6
• /
• pp.187-194
• /
• 2020

This paper proposes a website fingerprinting method using ensemble learning over a Tor network that guarantees client anonymity and personal information. We construct a training problem for website fingerprinting from the traffic packets collected in the Tor network, and compare the performance of the website fingerprinting system using tree-based ensemble models. A training feature vector is prepared from the general information, burst, cell sequence length, and cell order that are extracted from the traffic sequence, and the features of each website are represented with a fixed length. For experimental evaluation, we define four learning problems (Wang14, BW, CW_T, CW_H) according to the use of website fingerprinting, and compare the performance with the support vector machine model using CUMUL feature vectors. In the experimental evaluation, the proposed statistical-based training feature representation is superior to the CUMUL feature representation except for the BW case.

• Convergence Security Journal
• /
• v.7 no.1
• /
• pp.29-34
• /
• 2007

Recently, the distribution and using of the digital multimedia contents are easy by developing the internet application program and related technology. However, the digital signal is easily duplicated and the duplicates have the same quality compare with original digital signal. To solve this problem, there is the multimedia fingerprint which is studied for the protection of copyright. Fingerprinting scheme is a technique which supports copyright protection to track redistributers of electronic information using cryptographic techniques. Only regular user can know the inserted fingerprint data in fingerprinting schemes differ from a symmetric/asymmetric scheme and the scheme guarantee an anonymous before re-contributed data. In this paper, we present a new scheme which is the detection of colluded multimedia fingerprint by neural network. This proposed scheme is consists of the anti-collusion code generation and the neural network for the error correction.

• 한국HCI학회:학술대회논문집
• /
• 2006.02b
• /
• pp.639-645
• /
• 2006

During abstinence from alcohol, craving is elicited by the cues and contexts previously associated with alcohol, and contributes to relapse. To prevent the craving and relapse experienced by alcoholics, cue-exposure therapy (CET) has been used to extinguish the association between alcohol and alcohol-related cues and contexts. This study applied CET, using a virtual reality (VR) system, to eight members of an Alcoholics Anonymous group, in eight sessions. Cues and contexts most likely to elicit an urge to drink were selected through a preliminary survey in order to compose VR-CET scenarios: a glass, bottle, food, and a bar were judged to be the most tempting for people in alcohol dependence and abstinence. By these cues and contexts, a Japanese style pub and a western bar were composed. Each session was administered for 30 minutes by a psychiatrist and included an introduction, immersion, VR navigation, interviews about feelings, and self-report questionnaires about cravings. The eight sessions consisted of initial and closing sessions, and six cue- and context-focused sessions. As a result, a reduction in cue-elicited craving after VR-CET was reported. A mean score of 15.75 (SD = 10.91) on the Alcohol Urge Questionnaire in the first session decreased to 11.57 (SD = 6.88) in the final session.

• Korean Journal of Oriental Medicine
• /
• v.10 no.2
• /
• pp.37-49
• /
• 2004

In the existing Medical Literatures in Korea and China, there is neither the same book name nor same contents of the Medical Book named ${\ulcorner}$Yoryak(要略)${\lrcorner}$, but in viewing of the different name as written as ${\ulcorner}$GyoinYoryak(敎人要略)${\lrcorner}$, it is considered that written as an unpublished manuscript-book for the purpose of Medical Education in the latter period of Chosun Dynasty. While the author, Songgyesanin(松溪散人) is even anonymous as yet, it is regarded that he was much familiar with medical science as a secluded ascetic aiming for Taoism-like Life In ${\ulcorner}$Yoryak${\lrcorner}$, the contents of Taoism Literature named as ${\ulcorner}$OjangYukbudo(五臟六腑圖)${\lrcorner}$ which was regarded that had been actually initiated since ${\ulcorner}$Euibangyoochui(醫方類聚)${\lrcorner}$ is being quoted thereat, also it attempts to combine with ${\ulcorner}$DonguiBogam(東醫寶鑑)${\lrcorner}$, the typical Medical Literature of Chosun Dynasty. With reference to Cause of Disease, since Chin Moo-Taek(陳無擇) asserted 'Theory of Three-Causes(三因說)' in his Book ${\ulcorner}$Samin Keukilbyungjeung Bangron(三因極一病證方論)${\lrcorner}$, it effects many influences to the coming generation, However, on coming up to ${\ulcorner}$Yoryak${\lrcorner}$, the medical science book of Chosun Dynasty, the 'Theory of Two-Causes(二因說)' which consisted of 'Internal Causes by Seven Emotions' and 'Exterior Causes by Six Harmful Surroundings' is also being asserted. In accordance with this Theory, it refers to the 'Seven Emotions(七情)' as the fundamental factor to possibly weaken the viscera and entrails, and also regards that the Exterior Harmful Surroundings invade to body when the viscera and entrails are under weakened condition. Therefore, since Cause of Disease naming as 'Cause Theory at Neither Interior Nor Exterior' is not tolerable in such Diagnostic System, it is daringly advocating the 'Two Causes Theory', getting free from the viewpoint of 'Three Causes Theory' that Chin Moo-Taek has ever maintained.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.33 no.12C
• /
• pp.1021-1028
• /
• 2008

In a network environment, when a user requests a server's service, a remote user authentication system using smart cards is a very practical solution to validate the eligibility of a user and provide secure communication. In these authentication schemes, due to fast progress of networks and information technology, most of provided services are in multi-server environments. However, there are no studies in multi-server authentication schemes using smart cards providing mutual anonymity so far. In this paper, we propose a novel user authentication scheme using smart cards providing mutual authentication and mutual anonymity for multi-server environments. Our proposed scheme achieves the low-computation requirement for smart cards and a user can use permitted various services in eligible servers by only one registration. Also, this scheme guarantees perfect mutual anonymity of participants.

• Safety and Health at Work
• /
• v.9 no.3
• /
• pp.296-307
• /
• 2018

Background: Safety culture, acting as the oil necessary in an efficient safety management system, has its own weaknesses in the current conceptualization and utilization in practice. As a new approach, resilience safety culture (RSC) has been proposed to reduce these weaknesses and improve safety culture; however, it requires a valid and reliable instrument to be measured. This study aimed at evaluating the reliability and validity of such an instrument in measuring the RSC in sociotechnical systems. Methods: The researchers designed an instrument based on resilience engineering principles and safety culture as the first instrument to measure the RSC. The RSC instrument was distributed among 354 staff members from 12 units of an anonymous petrochemical plant through hand delivery. Content validity, confirmatory, and exploratory factor analysis were used to examine the construct validity, and Cronbach alpha and test-retest were employed to examine the reliability of the instrument. Results: The results of the content validity index and content validity ratio were calculated as 0.97 and 0.83, respectively. The explanatory factor analysis showed 14 factors with 68.29% total variance and 0.88 Kaiser-Meyer-Olkin index. The results were also confirmed with confirmatory factor analysis (relative Chi-square = 2453.49, Root Mean Square Error of Approximation = 0.04). The reliability of the RSC instrument, as measured by internal consistency, was found to be satisfactory (Cronbach ${\alpha}=0.94$). The results of test-retest reliability was r = 0.85, p < 0.001. Conclusion: The results of the study suggest that the measure shows acceptable validity and reliability.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.15 no.8
• /
• pp.2827-2848
• /
• 2021

Mobile Crowdsourcing (MCS) has become an emerging paradigm evolved from crowdsourcing by employing advanced features of mobile devices such as smartphones to perform more complicated, especially spatial tasks. One of the key procedures in MCS is to collect answers from mobile users (workers), which may face several security issues. First, authentication is required to ensure that answers are from authorized workers. In addition, MCS tasks are usually location-dependent, so the collected answers could disclose workers' location privacy, which may discourage workers to participate in the tasks. Finally, the overhead occurred by authentication and privacy protection should be minimized since mobile devices are resource-constrained. Considering all the above concerns, in this paper, we propose a lightweight and privacy-preserving answer collection scheme for MCS. In the proposed scheme, we achieve anonymous authentication based on traceable ring signature, which provides authentication, anonymity, as well as traceability by enabling malicious workers tracing. In order to balance user location privacy and data availability, we propose a new concept named current location privacy, which means the location of the worker cannot be disclosed to anyone until a specified time. Since the leakage of current location will seriously threaten workers' personal safety, causing such as absence or presence disclosure attacks, it is necessary to pay attention to the current location privacy of workers in MCS. We encrypt the collected answers based on timed-release encryption, ensuring the secure transmission and high availability of data, as well as preserving the current location privacy of workers. Finally, we analyze the security and performance of the proposed scheme. The experimental results show that the computation costs of a worker depend on the number of ring signature members, which indicates the flexibility for a worker to choose an appropriate size of the group under considerations of privacy and efficiency.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.13 no.6
• /
• pp.149-161
• /
• 2003

Partially blind signature scheme allows the signer to insert non-removable common information into his blind signature. Blind signatures providing with both users privacy and data authenticity are one of key parts of information systems, such anonymous electronic cash and electronic voting as typical examples. Partially blind signature, with which all expired e-cash but for still-alive can be removed from the banks database, copes well with the problem of unlimited growth of the banks' database in an electronic cash system. In this paper we propose an efficient ID-based partially blind signature scheme using the Weil-pairing on Gap Diffie-Hellman group. The security of our scheme relies on the hardness of Computational Diffie-Hellman Problem. The proposed scheme provides higher efficiency than existing partially blind signature schemes by using three-pass protocol between two participants, the signer and requesters also by reducing the computation load. Thus it can be efficiently used in wireless environment.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.22 no.5
• /
• pp.394-402
• /
• 2021

Electronic voting systems have been widely used in many countries around the world since the mid-1990s. In recent years, studies have applied blockchain to existing electronic voting systems in order to provide reliability, fairness, and transparency for voters. This approach is highly useful as a technology that promotes decentralized citizen participation. However, the existing electronic voting systems using blockchain have not sufficiently considered anonymity. Lack of anonymity acts as an important constraint in cases of small- and medium-sized voting, which is often required in decentralized citizen participation. In this study, we propose a model that provides anonymity to a voting system using blockchain by applying the concept of the master node in Dash cryptocurrency. First, we define the differences in the requirements of the transfer and voting systems in blockchain. We propose a parallel and autonomous model and algorithm to provide anonymity in the blockchain-that is, a decentralized development environment. In addition, a discussion of security and the environment for the proposed model is described.