• Title/Summary/Keyword: 프라이버시 계산

Search Result 104, Processing Time 0.027 seconds

An Algorithm for Improving the Accuracy of Privacy-Preserving Technique Based on Random Substitutions (랜덤대치 기반 프라이버시 보호 기법의 정확성 개선 알고리즘)

  • Kang, Ju-Sung;Lee, Chang-Woo;Hong, Do-Won
    • The KIPS Transactions:PartC
    • /
    • v.16C no.5
    • /
    • pp.563-574
    • /
    • 2009
  • The merits of random substitutions are various applicability and security guarantee on the view point of privacy breach. However there is no research to improve the accuracy of random substitutions. In this paper we propose an algorithm for improving the accuracy of random substitutions by an advanced theoretical analysis about the standard errors. We examine that random substitutions have an unpractical accuracy level and our improved algorithm meets the theoretical results by some experiments for data sets having uniform and normal distributions. By our proposed algorithm, it is possible to upgrade the accuracy level under the same security level as the original method. The additional cost of computation for our algorithm is still acceptable and practical.

Privacy-Preserving K-means Clustering using Homomorphic Encryption in a Multiple Clients Environment (다중 클라이언트 환경에서 동형 암호를 이용한 프라이버시 보장형 K-평균 클러스터링)

  • Kwon, Hee-Yong;Im, Jong-Hyuk;Lee, Mun-Kyu
    • The Journal of Korean Institute of Next Generation Computing
    • /
    • v.15 no.4
    • /
    • pp.7-17
    • /
    • 2019
  • Machine learning is one of the most accurate techniques to predict and analyze various phenomena. K-means clustering is a kind of machine learning technique that classifies given data into clusters of similar data. Because it is desirable to perform an analysis based on a lot of data for better performance, K-means clustering can be performed in a model with a server that calculates the centroids of the clusters, and a number of clients that provide data to server. However, this model has the problem that if the clients' data are associated with private information, the server can infringe clients' privacy. In this paper, to solve this problem in a model with a number of clients, we propose a privacy-preserving K-means clustering method that can perform machine learning, concealing private information using homomorphic encryption.

RFID 활용 현황 및 보호대책

  • Rhee, Keun-Woo;Won, Dong-Ho;Kim, Seung-Joo
    • Review of KIISC
    • /
    • v.18 no.2
    • /
    • pp.12-22
    • /
    • 2008
  • RFID는 우리의 삶을 바꿔놓고 있다. 이미 RFID 기술은 도서관에서 한 번에 여러 권의 책을 식별하여 대출 시간을 단축시키고 있고, 상점에서는 계산원 없이 소비자가 스스로 계산할 수 있도록 하고 있다. 이렇듯 RFID는 U-City를 실현하기 위한 기술로서 손색이 없지만, RFID가 가진 자동식별의 특징은 우리에게 혜택뿐만 아니라 보안 및 프라이버시 침해라는 부작용을 가져오기도 한다. 그리하여 세계적으로 다양한 기술적 제도적 보호대책들이 연구되고 있다. 따라서 본 고에서는 RFID 기술의 현재 상황을 파악할 수 있도록 RFID의 활용 현황과 보호대책에 대해 소개하고자 한다.

행정기관이 보유한 전자계산기처리 관련 일본의 개인정보 보호법

  • Korean Associaton of Information & Telecommunication
    • 정보화사회
    • /
    • s.16
    • /
    • pp.52-57
    • /
    • 1989
  • 오늘날 개인정보를 둘러싼 문제는 세계적 관심으로 부상하고 있다. 정보처리 정보통신기술의 비약적인 발전으로 대량의 데이터 수집과 가공이 가능하고 소비생활의 개성화. 다양화에 대응하기 위한 기업들의 개인정보 수집 열기는 날로 뜨거워지고 있다. 우리나라도 국가 기간전산망 구축이전에 프라이버시보호법이 제정, 시행될 전망이다. 따라서 고속으로 변화하는 정보관리환경에 적절히 대응하고 건전한 정보화사회의 구현을 위한 개인정보보호법 제정을 위해 지난해 12월 9일 제정된 일본의 행정기관보유 전자계산처리에 관한 개인정보보호법을 소개한다.

  • PDF

Privacy-Preserving Credit Scoring Using Zero-Knowledge Proofs (영지식 증명을 활용한 프라이버시 보장 신용평가방법)

  • Park, Chul;Kim, Jonghyun;Lee, Dong Hoon
    • Journal of the Korea Institute of Information Security & Cryptology
    • /
    • v.29 no.6
    • /
    • pp.1285-1303
    • /
    • 2019
  • In the current credit scoring system, the credit bureau gathers credit information from financial institutions and calculates a credit score based on it. However, because all sensitive credit information is stored in one central authority, there are possibilities of privacy violations and successful external attacks can breach large amounts of personal information. To handle this problem, we propose privacy-preserving credit scoring in which a user gathers credit information from financial institutions, calculates a credit score and proves that the score is calculated correctly using a zero-knowledge proof and a blockchain. In addition, we propose a zero-knowledge proof scheme that can efficiently prove committed inputs to check whether the inputs of a zero-knowledge proof are actually provided by financial institutions with a blockchain. This scheme provides perfect zero-knowledge unlike Agrawal et al.'s scheme, short CRSs and proofs, and fast proof and verification. We confirmed that the proposed credit scoring can be used in the real world by implementing it and experimenting with a credit score algorithm which is similar to that of the real world.

Implementation of Tag Identification Process Model with Scalability for RFID Protecting Privacy on the Grid Environment (그리드환경에서 RFID 프라이버시 보호를 위한 확장성있는 태그판별처리 모델 구현)

  • Shin, Myeong Sook;Lee, Joon
    • The Journal of Korea Institute of Information, Electronics, and Communication Technology
    • /
    • v.2 no.1
    • /
    • pp.81-87
    • /
    • 2009
  • Recently RFID system has been adopted in various fields rapidly. However, we ought to solve the problem of privacy invasion that can be occurred by obtaining information of RFID Tag without any permission for popularization of RFID system To solve the problems, it is Ohkubo et al.'s Hash-Chain Scheme which is the safest method. However, this method has a problem that requesting lots of computing process because of increasing numbers of Tag. Therefore, in this paper we apply the previous method into the grid environment by analyzing Hash-Chain scheme in order to reduce processing time when Tags are identified. We'll implement the process by offering Tag Identification Process Model to divide SPs evenly by node.

  • PDF

An Analysis of Privacy and Accuracy for Privacy-Preserving Techniques by Matrix-based Randomization (행렬 기반 랜덤화를 적용한 프라이버시 보호 기술의 안전성 및 정확성 분석)

  • Kang, Ju-Sung;An, A-Ron;Hong, Do-Won
    • Journal of the Korea Institute of Information Security & Cryptology
    • /
    • v.18 no.4
    • /
    • pp.53-68
    • /
    • 2008
  • We study on the practical privacy-preserving techniques by matrix-based randomization approach. We clearly examine the relationship between the two parameters associated with the measure of privacy breach and the condition number of matrix in order to achieve the optimal transition matrix. We propose a simple formula for efficiently calculating the inverse of transition matrix which are needed in the re-construction process of random substitution algorithm, and deduce some useful connections among standard error and another parameters by obtaining condition numbers according to norms of matrix and the expectation and variance of the transformed data. Moreover we give some experimental results about our theoretical expressions by implementing random substitution algorithm.

Secure Multiparty Computation of Principal Component Analysis (주성분 분석의 안전한 다자간 계산)

  • Kim, Sang-Pil;Lee, Sanghun;Gil, Myeong-Seon;Moon, Yang-Sae;Won, Hee-Sun
    • Journal of KIISE
    • /
    • v.42 no.7
    • /
    • pp.919-928
    • /
    • 2015
  • In recent years, many research efforts have been made on privacy-preserving data mining (PPDM) in data of large volume. In this paper, we propose a PPDM solution based on principal component analysis (PCA), which can be widely used in computing correlation among sensitive data sets. The general method of computing PCA is to collect all the data spread in multiple nodes into a single node before starting the PCA computation; however, this approach discloses sensitive data of individual nodes, involves a large amount of computation, and incurs large communication overheads. To solve the problem, in this paper, we present an efficient method that securely computes PCA without the need to collect all the data. The proposed method shares only limited information among individual nodes, but obtains the same result as that of the original PCA. In addition, we present a dimensionality reduction technique for the proposed method and use it to improve the performance of secure similar document detection. Finally, through various experiments, we show that the proposed method effectively and efficiently works in a large amount of multi-dimensional data.

User Privacy management model using multiple group factor based on Block chain (블록 체인 기반의 다중 그룹 요소를 이용한 사용자 프라이버시 관리 모델)

  • Jeong, Yoon-Su;Kim, Yong-Tae;Park, Gil-Cheol
    • Journal of Convergence for Information Technology
    • /
    • v.8 no.5
    • /
    • pp.107-113
    • /
    • 2018
  • With the rapid development of big data and Internet technologies among IT technologies, it is being changed into an environment where data stored in the cloud environment can be used wherever the Internet is connected, without storing important data in an external storage device such as USB. However, protection of users' privacy information is becoming increasingly important as the data being processed in the cloud environment is changed into an environment that can be easily handled. In this paper, we propose a user-reserving management model that can improve the user 's service quality without exposing the information used in the cloud environment to a third party. In the proposed model, user group is grouped into virtual environment so that third party can not handle user's privacy information among data processed in various cloud environments, and then identity property and access control policy are processed by block chain.

A Secure Technique Design for Privacy Protection in RFID System (RFID 시스템에서 프라이버시 보호를 위한 보안기법 설계)

  • Oh, Gi-Oug;Park, Mi-Og
    • Journal of the Korea Society of Computer and Information
    • /
    • v.15 no.8
    • /
    • pp.107-115
    • /
    • 2010
  • RFID (Radio Frequency IDentification) technology, automatic identification and data capture technologies in ubiquitous computing is an essential skill. Low-cost Radio Frequency Identification tags using memory and no physical contact due to the ease of use and maintenance of excellence are going to use expanded. However, it is possible to the illegal acquisition of the information between RFID tags and readers because RFID uses the RF signal, and the obtained information can be used for the purpose of location tracking and invasion of privacy. In this paper, we proposed the security scheme to protect against the illegal user location tracking and invasion of privacy. The security scheme proposed in this paper, using Gray Code and reduced the capacity of the calculation of the actual tags, However, it is impossible for the malicious attacker to track information because tag information transmitted from the reader is not fixed. Therefore, even if the tags information is obtained by a malicious way, our scheme provides more simple and safe user privacy than any other protection methods to protect user privacy, because not actual information but encrypted information is becoming exposed.