• Title/Summary/Keyword: 익명화

Search Result 95, Processing Time 0.025 seconds

Robust Data, Event, and Privacy Services in Real-Time Embedded Sensor Network Systems (실시간 임베디드 센서 네트워크 시스템에서 강건한 데이터, 이벤트 및 프라이버시 서비스 기술)

  • Jung, Kang-Soo;Kapitanova, Krasimira;Son, Sang-H.;Park, Seog
    • Journal of KIISE:Databases
    • /
    • v.37 no.6
    • /
    • pp.324-332
    • /
    • 2010
  • The majority of event detection in real-time embedded sensor network systems is based on data fusion that uses noisy sensor data collected from complicated real-world environments. Current research has produced several excellent low-level mechanisms to collect sensor data and perform aggregation. However, solutions that enable these systems to provide real-time data processing using readings from heterogeneous sensors and subsequently detect complex events of interest in real-time fashion need further research. We are developing real-time event detection approaches which allow light-weight data fusion and do not require significant computing resources. Underlying the event detection framework is a collection of real-time monitoring and fusion mechanisms that are invoked upon the arrival of sensor data. The combination of these mechanisms and the framework has the potential to significantly improve the timeliness and reduce the resource requirements of embedded sensor networks. In addition to that, we discuss about a privacy that is foundation technique for trusted embedded sensor network system and explain anonymization technique to ensure privacy.

A Privacy Protection Method in Social Networks Considering Structure and Content Information (소셜 네트워크에서 구조정보와 내용정보를 고려한 프라이버시 보호 기법)

  • Sung, Minh-Kyoung;Lee, Ki-Yong;Chung, Yon-Dohn
    • Journal of the Korea Society of Computer and Information
    • /
    • v.15 no.1
    • /
    • pp.119-128
    • /
    • 2010
  • Recently, social network services are rapidly growing and it is estimated that this trend will continue in the future. Social network data can be published for various purposes such as statistical analysis and population studies. When data publication, however, it may disclose the personal privacy of some people, since it can be combined with external information. Therefore, a social network data holder has to remove the identifiers of persons and modify data which have the potential to disclose the privacy of the persons by combining it with external information. The utility of data is maximized when the modification of data is minimized. In this paper, we propose a privacy protection method for social network data that considers both structural and content information. Previous work did not consider content information in the social network or distorted too much structural information. We also verify the effectiveness and applicability of the proposed method under various experimental conditions.

Peer to Peer Anonymous Protocol Based Random Walk (랜덤 워크 기반의 P2P 익명 프로토콜)

  • Cho, Jun-Ha;Rhee, Hyun-Sook;Park, Hyun-A;Lee, Dong-Hoon
    • Journal of the Korea Institute of Information Security & Cryptology
    • /
    • v.17 no.6
    • /
    • pp.65-76
    • /
    • 2007
  • The P2P file sharing system sends the results to users by searching the files in the shared folders. In the process of it, the problem is that the transferred information includes the pathname and file information and it can be revealed who searches which files. In related to this problem, anonymous file sharing P2P protocol has been an active research area where a number of works have been produced. However, the previous studies still have a few of weakness. Therefore, We propose two anonymous P2P file sharing protocols based on the decentralized and unstructured Random Walk. The first scheme uses the dynamic onion routing where the requester can receive the wanted file without knowing other peers' IDs. The second scheme uses the IP multicast method which lowers the computational overhead. Both of them are more suited for the dynamic P2P system.

Research on technical protection measures through risk analysis of pseudonym information for life-cycle (가명정보 Life-Cycle에 대한 위험 분석을 통한 관리적/기술적 보호조치 방안에 대한 연구)

  • Cha, Gun-Sang
    • Convergence Security Journal
    • /
    • v.20 no.5
    • /
    • pp.53-63
    • /
    • 2020
  • In accordance with the revision of the Data 3 Act, such as the Personal Information Protection Act, it is possible to process pseudonym information without the consent of the information subject for statistical creation, scientific research, and preservation of public records, and unlike personal information, it is legal for personal information leakage notification and personal information destruction There are exceptions. It is necessary to revise the pseudonym information in that the standard for the pseudonym processing differs by country and the identification guidelines and anonymization are identified in the guidelines for non-identification of personal information in Korea. In this paper, we focus on the use of personal information in accordance with the 4th Industrial Revolution, examine the concept of pseudonym information for safe use of newly introduced pseudonym information, and generate / use / provide / destroy domestic and foreign non-identification measures standards and pseudonym information. At this stage, through the review of the main contents of the law or the enforcement ordinance (draft), I would like to make suggestions on future management / technical protection measures.

Efficient k-ATY Method to Protect the User's Trajectory in Continuous Queries (연속적인 질의에서 사용자의 이동 경로를 보호할 수 있는 효율적인 k-ATY 기법)

  • Song, Doo Hee
    • KIPS Transactions on Computer and Communication Systems
    • /
    • v.10 no.8
    • /
    • pp.231-234
    • /
    • 2021
  • Various problems arise as applications using locations increase. In order to solve this problem, related works are being conducted to protect the location of users. A fundamental reason for this problem is that users must provide their location information to the service provider (server) to receive the service. To improve these problems, there are works such as generating cloaking regions or generating dummies around them. However, if a user periodically asks the server for queries, the user's trajectory may be exposed by time zone. To improve this problem, in this paper, we propose a k-Anonymity Trajectory (k-ATY) technique that can improve the exposure probability of the trajectory even if the user requests continuous queries. Experimental results demonstrated the superiority of the proposed technique.

Construction of Artificial Intelligence Training Platform for Machine Learning Based on Web Radiology_CDM (Web Radiology_CDM기반 기계학습을 위한 인공지능 학습 플랫폼 구축)

  • Noh, Si-Hyeong;Kim, SeungJin;Kim, Ji-Eon;Lee, Chungsub;Kim, Tae-Hoon;Kim, KyungWon;Kim, Tae-Gyu;Yoon, Kwon-Ha;Jeong, Chang-Won
    • Proceedings of the Korea Information Processing Society Conference
    • /
    • 2020.05a
    • /
    • pp.487-489
    • /
    • 2020
  • 인공지능 기술을 도입한 의료분야에서 진단 및 예측과 연계한 임상의사결정지원 시스템(CDSS)에 관련된 연구가 활발하게 진행되고 있다. 특히, 인공지능 기술 적용에 가장 많은 이슈를 일으키고 있는 의료영상기반의 질환진단연구가 다양한 제품으로 출시되고 있는 실정이다. 그러나 의료영상 데이터는 일관되지 않은 데이터들로 이루어져 있으며, 그것을 정제하여 연구에 사용하기 위해서는 상당한 시간이 필요한 것이 현실이다. 본 논문에서는 익명화된 데이터를 정제하여 인공지능 연구에 사용할 수 있는 표준화된 데이터 셋을 만들고, 그 데이터를 기반으로 인공지능 알고리즘 개발 연구를 지원하기 위한 원스톱 인공지능학습 플랫폼에 대하여 기술한다. 이를 위해 전체 인공지능 연구프로세스를 보이고 이에 따라 학습을 위한 데이터셋 생성과 인공지능 학습학습용 플랫폼에서 수행되는 수행 과정을 결과로 보인다 제안한 플랫폼을 통해 다양한 영상기반 인공지능 연구에 활용될 것으로 기대하고 있다.

Mix-based Decentralized Anonymous Transaction for Blockchain (블록체인을 위한 믹스 기반 분산화된 익명 거래)

  • Lee, Yun-ho
    • Journal of Internet Computing and Services
    • /
    • v.21 no.6
    • /
    • pp.51-56
    • /
    • 2020
  • Cryptocurrencies, including Bitcoin, has decentralization, distribution and P2P properties unlike traditional currencies relies on trusted central party such as banks. All transactions are stored transparently and distributively, hence all participants can check the details of those transactions. Due to the properties of cryptographic hash function, deletion or modification of the stored transations is computationally not possible. However, cryptocurrencies only provide pseudonymity, not anonymity, which is provided by traditional currencies. Therefore many researches were conducted to provide anonymity to cryptocurrencies such as mix-based methods. In this paper, I will propose more efficient hybrid mix-based method for anonymity than previous mix-based one.

Digital Creative Labour -A Perspective of the Ethics of Labour and Subjectivity of the Younger Generation in Korea (디지털 창의노동 -젊은 세대의 노동 윤리와 주체성에 관한 한 시각)

  • Kim, Yeran
    • Korean journal of communication and information
    • /
    • v.69
    • /
    • pp.71-110
    • /
    • 2015
  • Beyond the technological behaviorism-oriented notion of prosumers, the current study explores the question of digital creative labour of the youth in the interrelated context of post-capitalist crisis and neoliberal ethos of selfhood. This analysis is situated particularly in the social conflicts and struggles in Korea, where the problems related to the precarization of the younger generation have been increasingly aggravated (in the realm of embodied reality) whereas their digital activities have been highly expressive (in the realm of mediated reality). The contradictions embedded in the question of the labour of the youth are delineated in the respect of the subjectivities of young free labour, or 'digital creative labour' in proposed terms: the precarious young free labour in Korea is the compound of social fragmentation, economic polarization, expansion of cognitive and emotion labour, boom of hedonistic consumerism, economic-cultural celebration of creativity and self-entrepreneurship, technological saturation of digital media, subjective/collective affects around excitement and ambition but also of anxiety and fear. The ambivalence and complexity of the young free labour is converged at the emergence of homo-economicus (Michel Foucault) through the subjectivation of the social (con)fusion of post-capitalist crisis and neoliberal governmentality of selfhood.

  • PDF

Personalized Session-based Recommendation for Set-Top Box Audience Targeting (셋톱박스 오디언스 타겟팅을 위한 세션 기반 개인화 추천 시스템 개발)

  • Jisoo Cha;Koosup Jeong;Wooyoung Kim;Jaewon Yang;Sangduk Baek;Wonjun Lee;Seoho Jang;Taejoon Park;Chanwoo Jeong;Wooju Kim
    • Journal of Intelligence and Information Systems
    • /
    • v.29 no.2
    • /
    • pp.323-338
    • /
    • 2023
  • TV advertising with deep analysis of watching pattern of audiences is important to set-top box audience targeting. Applying session-based recommendation model(SBR) to internet commercial, or recommendation based on searching history of user showed its effectiveness in previous studies, but applying SBR to the TV advertising was difficult in South Korea due to data unavailabilities. Also, traditional SBR has limitations for dealing with user preferences, especially in data with user identification information. To tackle with these problems, we first obtain set-top box data from three major broadcasting companies in South Korea(SKB, KT, LGU+) through collaboration with Korea Broadcast Advertising Corporation(KOBACO), and this data contains of watching sequence of 4,847 anonymized users for 6 month respectively. Second, we develop personalized session-based recommendation model to deal with hierarchical data of user-session-item. Experiments conducted on set-top box audience dataset and two other public dataset for validation. In result, our proposed model outperformed baseline model in some criteria.

ABox Reasoning with Relational Databases (관계형 데이터베이스 기반 ABox Reasoning)

  • Khandelwal, Ankesh;Bisai, Summit;Kim, Ju-Ri;Lee, Hyun-Chang;Han, Sung-Kook
    • 한국IT서비스학회:학술대회논문집
    • /
    • 2009.05a
    • /
    • pp.353-356
    • /
    • 2009
  • OWL 온톨로지의 확장 가능한(scalable) 추론(reasoning)에 대한 접근 방법으로 SQL로 구축된 논리 규칙을 관계형 데이터베이스에 저장되어있는 개체(individual)에 대한 사실(facts)과 공리(axioms)들에 적용하는 것이다. 예로서 미네르바(Minerva)는 서술 논리 프로그램(Description Logic Program, DLP)을 적용함으로써 ABox 추론을 수행한다. 본 연구에서는 관계형 데이터베이스를 기반으로 추론을 시도하며, 대규모 논리 규칙 집합을 사용한 추론을 시도한다. 뿐만 아니라, 특정 클래스에 속한 익명(anonymous)의 개체들과 개체들의 묵시적(implicit)인 관계성 추론을 시도하며, 필요한 경우 새로운 개체를 생성함으로써 명시화하여 추론을 시도한다. 더욱이, 추론의 논리 패러다임(paradigm)에서부터 데이터베이스 패러다임에 이르기까지 변화 시켜가면서 카디널리티(cardinality) 제약을 만족하는 개체들에 대한 제약적인 추정 추론을 시도하며, 벤치마크 테스트 결과 향상된 추론 능력을 얻을 수 있음을 보인다.

  • PDF