• Title/Summary/Keyword: User Anonymity

Search Result 189, Processing Time 0.019 seconds

Analysis and Improvement of Andola et al.'s Dynamic ID based User Authentication Scheme

  • Mi-Og Park
    • Journal of the Korea Society of Computer and Information
    • /
    • v.28 no.7
    • /
    • pp.67-75
    • /
    • 2023
  • In this paper, we analyze the problem of the user authentication scheme that provides dynamic ID in a multi-server environment proposed by Andola et al. and propose an improved authentication one to solve this problem. As a result of analyzing the authentication scheme of Andrea et al. in this paper, it is not safe for smart card loss attack, and this attack allows users to guess passwords, and eventually, the attacker was able to generate session key. This paper proposed an improved authentication scheme to solve these problems, and as a result of safety analysis, it was safe from various attacks such as smart card loss attack, password guess attack, and user impersonation attack. Also the improved authentication scheme not only provides a secure dynamic ID, but is also effective in terms of the computational complexity of the hash function. In addition, the improved authentication scheme does not significantly increase the amount of transmission, so it can be said to be an efficient authentication scheme in terms of transmission cost.

Identity-Based Ring Signature Schemes for Multiple Domains

  • Ki, JuHee;Hwang, Jung Yeon;Lee, Dong Hoon
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.6 no.10
    • /
    • pp.2692-2707
    • /
    • 2012
  • A separable identity-based ring signature scheme has been constructed as a fundamental cryptographic primitive for protecting user privacy. Using the separability property, ring members can be selected from arbitrary domains, thereby, giving a signer a wide range of ways to control privacy. In this paper we propose a generic method to construct efficient identity-based ring signature schemes with various levels of separability. We first describe a method to efficiently construct an identity-based ring signature scheme for a single domain, in which a signer can select ring identities by choosing from identities defined only for the domain. Next, we present a generic method for linking ring signatures constructed for a single domain. Using this method, an identity-based ring signature scheme with a compact structure, supporting multiple arbitrary domains can be designed. We show that our method outperforms the best known schemes in terms of signature size and computational costs, and that the security model based on the separability of identity-based ring signatures, presented in this paper, is highly refined and effective by demonstrating the security of all of the proposed schemes, using a model with random oracles.

Cyberbullying and a Mobile Game App? An Initial Perspective on an Alternative Solution

  • Singh, Manmeet Mahinderjit;Ng, Ping Jie;Ya, Kar Ming;Husin, Mohd Heikal;Malim, Nurul Hashimah Ahamed Hassain
    • Journal of Information Processing Systems
    • /
    • v.13 no.3
    • /
    • pp.559-572
    • /
    • 2017
  • Cyberbullying has been an emerging issue in recent years where research has revealed that users generally spend an increasing amount of time in social networks and forums to keep connected with each other. However, issue arises when cyberbullies are able to reach their victims through these social media platforms. There are different types of cyberbullying and like traditional bullying; it causes victims to feel overly selfconscious, increases their tendency to self-harm and generally affects their mental state negatively. Such situations occur due to security issues such as user anonymity and the lack of content restrictions in some social networks or web forums. In this paper, we highlight the existing solutions, which are Intrusion Prevention System and Intrusion Detection System from a number of researchers. However, even with such solutions, cyberbullying acts still occurs at an alarming rate. As such, we proposed an alternative solution that aims to prevent cyberbullying activities at a younger age, e.g., young children. The application would provide an alternative method to preventing cyberbullying activities among the younger generations in the future.

네트웍 기반 그룹의사결정지원시스템의 정보공유와 사용자관리를 위한 설계

  • 이동호
    • Proceedings of the Korea Association of Information Systems Conference
    • /
    • 1997.10a
    • /
    • pp.165-181
    • /
    • 1997
  • 경영환경과 조직의 분사화의 정도가 증가함에 따라서 의사결정지원시스템 (Decision Support System)에 있어서도 분산화 된 시스템의 요구가 증가되고 있다. 이러한 관점에서 본 연구는 분산화 된 환경인 네트웍을 기반으로 하는 의사결정지원시스템을 대상 으로 사용자간의 정보공유와 사용자의 참여의 효과적인 관리를 위한 기능적 설계를 제시한 다. 정보의 공유는 의사결정지원시스템과 그룹의사결정지원시스템을 차별화 하는 가장 큰 특징이다. 이러한 정보의 공유는 과업을 수행하는 그룹단위(WorkGroup)로 이루어지는 것이 바람직하며, 그룹의 구성원들간의 의사소통과 정보를 저장하는 자료저장소(Data Warehouse)와 서버(Server)의 구축, 보다 사용하기 쉬운 그래픽 사용자 인터페이스 (Graphic User Interface)를 포함하는 전자우편(Electronic Mail), 의사결정에 참여한 사용자 에게 의사결정결과에 대한 구체적인 피드백(Feedback)을 제공할 수 있는 시스템의 구축과 같은 방법을 통해서 보다 효과적인 관리가 이루어질 수 있게 된다. 사용자의 관리는 의사결 정지원시스템이 효과를 결정하는데 중요한 요소의 하나로써 보다 많은 참여는 그륩시너지효 과(Group Synergy Effect)를 가능하게 한다. 또한 완전한 익명성(Anonymity)의 확보는 기존 의 물리적인 제한을 가진 의사결정실 GDSS의 불완전한 익명성을 충분히 대체할 수 있을 것이다. 의사결정과정의 지원에 있어서도 사용자에게 회의의 기록을 자동적으로 제공하는 것과 병행하여 회의 중에 자신이 기록해야 할 사항을 추가적으로 기록할 수 있는 모듈 (Module)을 제공하는 것이 보다 효과적일 것이다. 물론 이러한 모듈은 앞서 언급한 정보의 공유의 관점에서 본다면 참여자 자신의 피드백에 도움을 주며, 또한 유사한 수준의 다른 참 여자에게 있어서 문제에 대한 인식을 다른 사용자와의 비교를 통하여 일정수준으로 동질화 시킬 수 있게 된다.

  • PDF

Study on the System Design of a Service Method for a Customized Electronic Card (주문형 전자카드 서비스 방법 및 시스템설계에 관한 연구)

  • Park Hwa-Jin;Kim Sang-Beom
    • Journal of Digital Contents Society
    • /
    • v.4 no.1
    • /
    • pp.1-10
    • /
    • 2003
  • This research focuses on the system design of a service method for a customized electronic card on the internet. It develops the system which covers from the input stage of the credit information including a credit card number, a debit card number, and a bank account number, through the process of decision for issuing the customized electronic card and for the payment of business transaction, to the payment stage. Users are allowed to make their own customized card depending on their situations by choosing a limit of balance, a number of usage, expiration date, recharge, and, anonymity of electronic card on the internet. These characteristics enhances convenience and security of card users. In addition, user's financial damage can be minimized when a credit card is lost by any reason.

  • PDF

An Anonymous Authentication with Key-Agreement Protocol for Multi-Server Architecture Based on Biometrics and Smartcards

  • Reddy, Alavalapati Goutham;Das, Ashok Kumar;Yoon, Eun-Jun;Yoo, Kee-Young
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.10 no.7
    • /
    • pp.3371-3396
    • /
    • 2016
  • Authentication protocols for multi-server architectures have gained momentum in recent times due to advancements in computing technologies and associated constraints. Lu et al. recently proposed a biometrics and smartcards-based authentication scheme for multi-server environment. The careful analysis of this paper demonstrates Lu et al.'s protocol is susceptible to user impersonation attacks and comprises insufficient data. In addition, this paper proposes an improved authentication with key-agreement protocol for multi-server architecture based on biometrics and smartcards. The formal security of the proposed protocol is verified using the widely accepted AVISPA (Automated Validation of Internet Security Protocols and Applications) tool to ensure that our protocol can withstand active and passive attacks. The formal and informal security analysis, and performance analysis sections determines that our protocol is robust and efficient compared to Lu et al.'s protocol and existing similar protocols.

A Lightweight Pseudonym Authentication and Key Agreement Protocol for Multi-medical Server Architecture in TMIS

  • Liu, Xiaoxue;Li, Yanping;Qu, Juan;Ding, Yong
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.11 no.2
    • /
    • pp.924-944
    • /
    • 2017
  • Telecare Medical Information System (TMIS) helps the patients to gain the health monitoring information at home and access medical services over the mobile Internet. In 2015, Das et al proposed a secure and robust user AKA scheme for hierarchical multi-medical server environment in TMIS, referred to as DAKA protocol, and claimed that their protocol is against all possible attacks. In this paper, we first analyze and show DAKA protocol is vulnerable to internal attacks, impersonation attacks and stolen smart card attack. Furthermore, DAKA protocol also cannot provide confidentiality. We then propose a lightweight pseudonym AKA protocol for multi-medical server architecture in TMIS (short for PAKA). Our PAKA protocol not only keeps good security features declared by DAKA protocol, but also truly provides patient's anonymity by using pseudonym to protect sensitive information from illegal interception. Besides, our PAKA protocol can realize authentication and key agreement with energy-saving, extremely low computation cost, communication cost and fewer storage resources in smart card, medical servers and physical servers. What's more, the PAKA protocol is proved secure against known possible attacks by using Burrows-Abadi-Needham (BAN) logic. As a result, these features make PAKA protocol is very suitable for computation-limited mobile device.

Self-Updating One-Time Password Mutual Authentication Protocol for Ad Hoc Network

  • Xu, Feng;Lv, Xin;Zhou, Qi;Liu, Xuan
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.8 no.5
    • /
    • pp.1817-1827
    • /
    • 2014
  • As a new type of wireless network, Ad hoc network does not depend on any pre-founded infrastructure, and it has no centralized control unit. The computation and transmission capability of each node are limited. In this paper, a self-updating one-time password mutual authentication protocol for Ad hoc network is proposed. The most significant feature is that a hash chain can update by itself smoothly and securely through capturing the secure bit of the tip. The updating process does not need any additional protocol or re-initialization process and can be continued indefinitely to give rise to an infinite length hash chain, that is, the times of authentication is unlimited without reconstructing a new hash chain. Besides, two random variable are added into the messages interacted during the mutual authentication, enabling the protocol to resist man-in-the-middle attack. Also, the user's identity information is introduced into the seed of hash chain, so the scheme achieves anonymity and traceability at the same time.

Loyalty System as a Secure Payment Scheme in Multiple Internet Shopping Malls (복수의 인터넷 쇼핑몰에서 통용되는 안전한 전자상거래 지불수단으로서 로열티시스템)

  • Yoon, Hye-Suk;Kim, Young-Kuk;Choi, Hoon;Hong, Seung-Jae
    • The Transactions of the Korea Information Processing Society
    • /
    • v.7 no.5S
    • /
    • pp.1676-1686
    • /
    • 2000
  • The growth of the Internet has brought may kinds of electronic payment schemes that can be applied to electronic commerce applications. Generally speaking, conventional loyalty system is not a payment system but a part of customer service. Our loyalty system, however, adds monetary functions and security mechanism to the concept of bonus point, so it can make the electronic markets user entire bonus system as an electronic payment scheme, First, we introduce the organization and the protocol structure of he loyalty system. Next, we describe monetary characteristics, security scheme and anonymity to show our loyalty system can be used a functionally complete payment system.

  • PDF

An Anonymization Scheme Protecting User Identification Threat in Profile-based LBS Model (프로필을 고려한 위치 기반 서비스 모델에서 사용자 식별 위협을 막는 익명화 기법)

  • Chung, Seung-Joo;Park, Seog
    • Proceedings of the Korean Information Science Society Conference
    • /
    • 2010.06c
    • /
    • pp.170-174
    • /
    • 2010
  • 최근 무선 인터넷에서 사용자의 위치정보가 다양한 응용의 정보 요소로 활용되기 시작하였고, 이러한 응용의 하나로 위치기반 서비스(Location-Based Service: LBS)가 주목을 받고 있다. 그러나 위치기반 서비스에서는 서비스를 요청하는 사용자가 자신의 정확한 위치 정보를 데이터베이스 서버로 보내기 때문에 사용자의 개인 정보가 노출될 수 있는 취약성을 지니고 있다. 이에 모바일 사용자가 안전하고 편리하게 위치기반 서비스를 사용하기 위한 개인 정보보호 방법이 요구되었다. 사용자의 위치 정보를 보호하기 위해 전통적인 데이터베이스에서의 개인정보 보호를 위해 사용되었던 K-anonymity의 개념이 적용되었고, 그에 따른 익명화를 수행할 수 있는 모델이 제시되었다. 하지만 기존 연구되었던 모델들은 오직 사용자의 정확한 위치 정보만을 민감한 속성으로 고려하여 익명화를 수행하였기 때문에, 이후 제시된 사용자의 프로필 정보를 고려한 모델에 대해서는 기존의 익명화만으로는 완전한 프라이버시를 보장할 수 없게 되어 추가적인 처리 과정을 필요로 하게 되었다. 본 연구는 프로필 정보를 고려한 위치기반 서비스 모델에서 Private-to-Public 질의가 주어지는 경우에 발생하는 추가적인 개인 식별의 위협에 관한 문제를 정의하고 이에 대한 해결책을 제시하며, 또한 제안 기법이 사용자 정보 보호를 보장하며 기존 방안보다 효율적임을 보인다.

  • PDF