• Journal of Industrial Technology
• /
• v.36
• /
• pp.89-92
• /
• 2016

In this paper, we propose an efficient anonymity algorithm for personal information protections in big data systems. Firstly, we briefly introduce fundamental algorithms of k-anonymity, l-diversity, t-closeness. And then we propose an anonymity algorithm using controlling the size of anonymity groups as well as exchanging the data tuple between anonymity groups. Finally, we demonstrate an example on which proposed algorithm applied. The proposed scheme gave an efficient and simple algorithms for the processing of a big amount of data.

• Journal of the Korea Convergence Society
• /
• v.9 no.11
• /
• pp.75-81
• /
• 2018

Anonymity and privacy issues are becoming important as all transactions in the blockchain are open to users. Public blockchains appear to guarantee anonymity by using public-key addresses on behalf of users, but they can weaken anonymity by tracking with various analytic techniques based on transaction graph. In this paper, we propose a scheme to protect anonymity and privacy by converging various security techniques such as k-anonymity, mixing, blind signature, multi-phase processing, random selection, and zero-knowledge proof techniques with incentive mechanism and contributor participation. Through performance analysis, our proposed scheme shows that it is difficult to invade privacy and anonymity through collusion attacks if the number of contributors is larger than that of conspirators.

• ETRI Journal
• /
• v.35 no.3
• /
• pp.501-511
• /
• 2013

Protecting privacy is an important goal in designing location-based services. Service providers want to verify legitimate users and allow permitted users to enjoy their services. Users, however, want to preserve their privacy and prevent tracking. In this paper, a new framework providing users with more privacy and anonymity in both the authentication process and the querying process is proposed. Unlike the designs proposed in previous works, our framework benefits from a combination of three important techniques: k-anonymity, timed fuzzy logic, and a one-way hash function. Modifying and adapting these existing schemes provides us with a simpler, less complex, yet more mature solution. During authentication, the one-way hash function provides users with more privacy by using fingerprints of users' identities. To provide anonymous authentication, the concept of confidence level is adopted with timed fuzzy logic. Regarding location privacy, spatial k-anonymity prevents the users' locations from being tracked. The experiment results and analysis show that our framework can strengthen the protection of anonymity and privacy of users by incurring a minimal implementation cost and can improve functionality.

• The Journal of Society for e-Business Studies
• /
• v.20 no.1
• /
• pp.217-241
• /
• 2015

One of the challenges in online community management is what level of perceived anonymity can be granted to encourage active participation from members while discouraging unhealthy activities. Few studies developed a scheme of anonymity and investigated how different levels of anonymity influence community activities. This study develops a classification scheme of anonymity encompassing the following three different levels : (1) real name(no anonymity), (2) nickname (partial anonymity), and (3) random assignment of a temporal ID (complete anonymity). Then, it examines how different levels of anonymity influence trust and perceived risk, which in turn affect virtual team performance. A series of laboratory experiments were performed, manipulating the levels of anonymity, in the context of well-structured communities that allow prior interactions among community members. The data was collected from 364 laboratory participants and analyzed using ANOVA and PLS. The results indicate that the difference of anonymity between (2) and (3) had not be significant and the only (1) could not guarantee the anonymity. The impact of anonymity on trust and perceived risk could not be significant in this situation. These findings could contribute to make more beneficial member identification strategies in online community practice.

• Journal of Distribution Science
• /
• v.14 no.8
• /
• pp.101-112
• /
• 2016

Purpose - The objective of this study is to identify the effects of the communication cues and anonymity on group polarization in mobile communication settings, both in terms of route and extent. Research design, data and methodology - Laboratory experiments were conducted to achieve the above research objective; the effect of communication cues on group polarization with social presence as mediation and the direct effect of anonymity, social presence, and perceived cohesion were analyzed. The experiments were conducted by the participation of 240 people, who were divided into 48 groups of 5 people. Results - According to the results, the difference in intergroup polarization due to communication cues and anonymity was insignificant. From this analysis, the structural equation model, communication cues and anonymity did not affect group polarization through social presence. Moreover, anonymity did not affect group polarization through perceived cohesion; however, anonymity directly affected group polarization. Conclusions - This research can help to explain the discussions and the related decision-making actions on internet forums, which have recently come to the rise as well as provide foundational basis in newly establishing policies for the forums.

• Journal of KIISE:Computing Practices and Letters
• /
• v.15 no.8
• /
• pp.606-610
• /
• 2009

In Location-Based Service (LBS), a scheme to hide the exact locations of users is required for privacy protection, In this paper, we propose a grid-based cloaking method considering K-anonymity and L-diversity. For this, our method creates a minimum cloaking region by finding L number of buildings (L-diversity) and then finding number of users (K-anonymity). Especially, we use a effective filtering method for generating the minimum cloaking region in a fast way. Finally, we show from a performance analysis that our cloaking method outperforms the existing method, in terms of query processing time based on the size of cloaking regions.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.10 no.3
• /
• pp.1289-1310
• /
• 2016

Dynamic ID-based authentication solves the ID-theft problem by changing the ID in each session instead of using a fixed ID while performing authenticated key exchanges between communicating parties. User anonymity is expected to be maintained and the exchanged key kept secret even if one of the long-term keys is compromised in the future. However, in the conventional dynamic ID-based authentication scheme, if the server's long-term key is compromised, user anonymity can be broken or the identities of the users can be traced. In addition, these schemes are vulnerable to replay attacks, in which any adversary who captures the authentication message can retransmit it, and eventually cause the legitimate user to be denied service. This paper proposes a novel dynamic ID-based authentication scheme that preserves forward anonymity as well as forward secrecy and obviates replay attacks.

• 한국경영정보학회:학술대회논문집
• /
• 2007.06a
• /
• pp.680-689
• /
• 2007

The objective of this paper is to contemplate a possible alternative to the examination, published as a research article in Information Systems Research(Sia et al. 2002), of the effects of communication cues, anonymity, and social presence on group polarization in computer-mediated communication(CMC) settings. Sia et al. introduced the concept of social presence to explain the effects of communication cues and anonymity on group polarization, but we believe that anonymity alone provides a clearer explanation of the results. This paper classifies levels of anonymity to provide possible explanations for Sia et a1. (2002)'s results and presents the results of a new experiment to confirm our explanation. We also want to emphasize that our comments are not intended to disparage the usefulness of social presence as a mediating variable to explain group polarization; our intention instead IS to encourage further investigation to better understand group polarization in CMC settings.

• Journal of Information Processing Systems
• /
• v.7 no.1
• /
• pp.121-136
• /
• 2011

With the rapid growth of GPS-enable Smartphones, the interest on using Location Based Services (LBSs) has increased significantly. The evolution in the functionalities provided by those smartphones has enabled them to accurately pinpoint the location of a user. Because location information is what all LBSs depend on to process user's request, it should be properly protected from attackers or malicious service providers (SP). Additionally, maintaining user's privacy and confidentiality are imperative challenges to be overcome. A possible solution for these challenges is to provide user anonymity, which means to ensure that a user initiating a request to the SP should be indistinguishable from a group of people by any adversary who had access to the request. Most of the proposals that maintain user's anonymity are based on location obfuscation. It mainly focuses on adjusting the resolution of the user's location information. In this paper, we present a new protocol that is focused on using cryptographic techniques to provide anonymity for LBSs users in the smartphone environment. This protocol makes use of a trusted third party called the Anonymity Server (AS) that ensures anonymous communication between the user and the service provider.

• Journal of Distribution Science
• /
• v.13 no.2
• /
• pp.75-83
• /
• 2015

Purpose - This study aims to identify the effects of communication cues, anonymity, and social presence on group polarization in computer-mediated communication (CMC) settings. Extant literature has introduced some theoretical backgrounds of social presence and SIDE (Social Identity model of Deindividuation Effects) to explain the effects of communication cues and anonymity. The concept of social presence emphasized the mediating role on communication cues and anonymity. However, most literature did not measure social presence and compare group polarization of all condition groups. This does not sufficiently explain the result of group polarization. Research design, data, and methodology - We believe that the direct impact of anonymity on group polarization can provide a more admissible and clearer explanation for the results. In addition, this study categorizes anonymity into two levels, as anonymity of group and anonymity of self. To justify the anonymity view, a laboratory experiment was conducted. The experiment was conducted in communication cues settings (visual cue; without visual cue) and anonymity settings (identified; anonymous). Each of the four settings has 10 groups consisting of five subjects each (total 200 subjects). The subjects are undergraduates from a large university, majoring in business. All experimental procedures and calculations of choice shift and preference change follow the literature. Results - First, the removal of visual cues does not produce a significant impact on group polarization, which cannot be explained by the social presence view. Second, the anonymous condition does not significantly affect group polarization, which also cannot be explained by the social presence view. However, the anonymous condition directly affects group polarization. Specifically, anonymity of self has a stronger effect on group polarization than anonymity of group. The result explains about the leading factor affecting group polarization. This study examines another view of how computer-mediated communication may be associated with group polarization. The process and outcome data from the experiment reveal that group polarization is not affected by level of social presence, but by level of anonymity. Group discussions conducted with visual cue CMC setting and identified CMC setting result in weaker group polarization. Conversely, group discussions conducted without visual cue CMC setting and anonymous CMC setting lead to stronger group polarization. The results of the study have the following implications. First, they provide clues for business organizations to design the most appropriate media conditions and preemptive social conditions to implement when making group decisions through CMC, to maximize achievements, generate amicable agreements, or actively share information. Second, this study can be useful in analyzing different adverse effects generated through Internet use. Conclusions - This research can help explain discussions and decision-making actions on Internet forums, which have recently increased, as well as providing a foundational basis in newly establishing policies for the forums. Finally, it should be noted that many other factors such as group size, topics, and group history may affect group polarization. These should be examined in future studies.