다자 간 환경에서 수직 분할된 데이터에서 프라이버시 보존 k번째 항목의 score 계산
Privacy-Preserving Kth Element Score over Vertically Partitioned Data on Multi-Party
1
조회
0
다운로드
0
인용
0
참고문헌
키워드
초록
데이터 마이닝은 보유한 데이터를 가공하여 패턴 분석이나 마케팅 등에 활용할 수 있는 유용한 정보를 얻어내는 기술이다. 그러나 이러한 데이터 마이닝 기술을 사용 시 데이터의 제공자의 개인정보가 의도치 않게 유출 될 가능성이 존재하게 된다. 이러한 정보의 유출을 막기 위하여 여러 가지 프라이버시를 보호하는 기법이 연구되고 있다. 수직 분할 데이터는 같은 집단에 관한 데이터가 복수의 소유자에게 나누어 제공되어 있는 상태를 말한다. 이러한 수직 분할된 데이터에서 프라이버시를 보호하면서 k번째 항목과 (k+1)번째 항목을 score 값을 이용하여 구분하는 방법이 개발되었다. 그러나 기존의 연구에서는 양자간의 환경에서만 사용이 가능하였기 때문에 본 논문에서는 Paillier암호화 기법을 사용하여, 기존의 연구를 다자간 환경으로 확장한 기법을 제안한다.
Abstract
Data mining is a technique to get the useful information that can be utilized for marketing and pattern analysis by processingthe data that we have. However, when we use this technique, data provider’s personal data can be leaked by accident. To protectthese data from leakage, there were several techniques have been studied to preserve privacy. Vertically partitioned data is a state called that the data is separately provided to various number of user. On these verticallypartitioned data, there was some methods developed to distinguishing kth element and (k+1)th element by using score. However, in previous method, we can only use on two-party case, so in this paper, we propose the extended technique by using paillier cryptosystem which can use on multi-party case.
참고문헌 (21)
- A. C. Yao, "Protocols for secure computations", 2013 IEEE 54th Annual Symposium on Foundations of Computer Science, pp.160~164 (1982), IEEE
- A. C. Yao, "How to Generate and Exchange Secrets, In Foundations of Computer Science", 27th Annual Symposium on IEEE, pp.162~167 (1986)
- O. Goldreich, "Secure Multi-Party Computation", Department of Computer Science and Applied Mathematics, pp.1998
- J. Vaidya, "Privacy Preserving Association Rule Mining in Vertically Partitioned Data", Proceedings of the 8th ACM SIGKDD international conference on Knowledge discovery and data mining, pp.639~644 (2002)
- J. Vaidya, "Privacy-Preserving Kth Element Score over Vertically Partitioned Data", Knowledge and Data Engineering, IEEE Transactions on, 21(2), pp.253~258 (2009)
- G. Aggarwal, "“Secure Computation of the Kth-Ranked Element,” Advances in Cryptology, EUROCRYPT 2004", LNCS, 3027, pp.40~55 (2004)
- P. Paillier, "“Public-Key Cryptosystems Based on Composite Degree Residuosity Classes,” Advances in Cryptology, EUROCRYPT 1999", LNCS, 1592, pp.223~238 (1999)
- L. Liu, "Encyclopedia of database systems", pp.3263~3265 (2009), Springer
- D. J. Abadi, "Scalable Semantic Web Data Management Using Vertical Partitioning", Proceedings of the 33rd international conference on Very large data bases, pp.411~422 (2007)
- S. Goldwasser, "Multi-Party Computations: Past and Present", Proceedings of the 16th annual ACM symposium on Principles of distributed Computing, pp.1~6 (1997)
- M. C. Doganay, "Distributed Privacy Preserving k-means Clustering with Additive Secret Sharing", Proceedings of the 2008 international workshop on Privacy and Anonymity in Information Society, pp.3~11 (2008)
- R. Agrawal, "Information sharing across private databases", Proceedings of the 2003ACM SIGMOD international conference on Management of data, pp.86~97 (2003)
- J. W. Byun, ""Efficient k-anonymization using clustering techniques," Advances in Databases: Concepts, Systems and Applications", LNCS, 4443, pp.188~200 (2007)
- R. Agrawal, "Privacy preserving OLAP", Proceedings of the 2005 ACM SIGMOD international conference on Management of data, pp.251~262 (2005)
- R. Canetti, "Universally composable two-party and multi-party secure computation", Proceedings of the 34th annual ACM symposium on Theory of computing, pp.494~503 (2002)
- R. Agrawal, "Privacy-preserving data mining", Proceedings of the 2000 ACM SIGMOD international conference on Management of data, 29(2), pp.439~450 (2000)
- J. Vaidya, "Privacy-preserving k-means clustering over vertically partitioned data", Proceedings of the 9th ACM SIGKDD international conference on Knowledge discovery and data mining, pp.206~215 (2003)
- W. Diffie, "New directions in cryptography", IEEE Transactions on Information Theory, IT-22(6), pp.644~654 (1976)
- T. ElGamal, ""A public key cryptosystem and a signature scheme based on discrete logarithms," Advances in Cryptology", LNCS, 196, pp.10~18 (1985)
- R. Rivest, "A method for obtaining digital signatures and public-key cryptosystems", Communications of the ACM, 21(2), pp.120~126 (1978)
- Digitalized Signatures and Public-Key Functions as Intractable as Factorization, "M. O. Rabin", MIT, ~, pp.MIT (1979), LCS[DOI]