Security and Correctness Analysis on Privacy-Preserving k-Means Clustering Schemes

スポンサーリンク

概要

• 論文の詳細を見る

• Due to the fast development of Internet and the related IT technologies, it becomes more and more easier to access a large amount of data. k-means clustering is a powerful and frequently used technique in data mining. Many research papers about privacy-preserving k-means clustering were published. In this paper, we analyze the existing privacy-preserving k-means clustering schemes based on the cryptographic techniques. We show those schemes will cause the privacy breach and cannot output the correct results due to the faults in the protocol construction. Furthermore, we analyze our proposal as an option to improve such problems but with intermediate information breach during the computation.

• （社）電子情報通信学会の論文
• 2009-04-01

著者

• SAKURAI Kouichi

  Dept. of Computer Science and Communication Engineering, Kyushu University

• Sakurai Kouichi

  Kyushu Univ. Fukuoka‐shi Jpn

• Sakurai Kouichi

  Dept. Of Computer Science And Communication Engineering Kyushu University

• Takagi Tsuyoshi

  Future Univ.‐hakodate Hakodate‐shi Jpn

• Takagi Tsuyoshi

  School Of Systems Information Science Future University-hakodate

• Sakurai Kouichi

  Information Technology And Security Group Department Of Computer Science And Communication Engineeri

• SU Chunhua

  Dept. of Computer Science and Communication Engineering, Kyushu University

• BAO Feng

  Cryptography and Security Department, Institute for Infocomm Research

• ZHOU Jianying

  Cryptography and Security Department, Institute for Infocomm Research

• Bao Feng

  Cryptography And Security Department Institute For Infocomm Research

• Su Chunhua

  Dept. Of Computer Science And Communication Engineering Kyushu University

• Zhou Jianying

  Cryptography And Security Department Institute For Infocomm Research

関連論文

• ESS-FH: Enhanced Security Scheme for Fast Handover in Hierarchical Mobile IPv6
• Analysis of Existing Privacy-Preserving Protocols in Domain Name System
• A New Secret Sharing Scheme Based on the Multi-Dealer
• Analysis of Program Obfuscation Schemes with Variable Encoding Technique
• Reliable Key Distribution Scheme for Lossy Channels
• On Effectiveness of Clock Control in Stream Ciphers(Information Theory and Its Applications)
• Experimental Analysis of Guess-and-Determine Attacks on Clock-Controlled Stream Ciphers(Cryptography and Information Security, Information Theory and Its Applications)
• ESS-FH : Enhanced Security Scheme for Fast Handover in Hierarchical Mobile IPv6
• An Enhanced Security Protocol for Fast Mobile IPv6
• A Security Analysis on Kempf-Koodli's Security Scheme for Fast Mobile IPv6
• A New Secret Sharing Scheme Based on the Multi-Dealer
• Modeling Security Bridge Certificate Authority Architecture
• An Adaptive Reputation-Based Algorithm for Grid Virtual Organization Formation
• Analysis of Existing Privacy-Preserving Protocols in Domain Name System
• Reduction Optimal Trinomials for Efficient Software Implementation of the ηT Pairing
• Efficient Implementation of the Pairing on Mobilephones Using BREW
• Generalized Powering Functions and Their Application to Digital Signatures(Digital Signature, Cryptography and Information Security)
• Analysis of Program Obfuscation Schemes with Variable Encoding Technique
• FOREWORD
• Economic-inspired truthful reputation feedback mechanism in P2P networks
• On securing open networks through trust and reputation-architecture, challenges and solutions
• Radix-r Non-Adjacent Form and Its Application to Pairing-Based Cryptosystem(Elliptic Curve Cryptography, Cryptography and Information Security)
• Distributed Noise Generation for Density Estimation Based Clustering without Trusted Third Party
• Security and Correctness Analysis on Privacy-Preserving k-Means Clustering Schemes
• Private Data Clustering based on Secure Approximation
• Special Section on Cryptography and Information Security
• Defeating Simple Power Analysis on Koblitz Curves(Discrete Mathematics and Its Applications)
• Security Analysis of the SPA-Resistant Fractional Width Method(Elliptic Curve Cryptography, Cryptography and Information Security)
• A New Upper Bound for the Minimal Density of Joint Representations in Elliptic Curve Cryptosystems(Discrete Mathematics and Its Applications)
• Efficient Context-Sensitive Intrusion Detection Based on State Transition Table
• Faster MapToPoint on Supersingular Elliptic Curves in Characteristic 3
• Improved Subset Difference Method with Ternary Tree
• A More Compact Representation of XTR Cryptosystem
• Efficient Hyperelliptic Curve Cryptosystems Using Theta Divisors(Elliptic Curve Cryptography, Cryptography and Information Security)
• Some Efficient Algorithms for the Final Exponentiation of ηT Pairing
• Universal ηT pairing algorithm over arbitrary extension degree (ワイドバンドシステム)
• Universal ηT pairing algorithm over arbitrary extension degree (情報セキュリティ)
• Universal ηT pairing algorithm over arbitrary extension degree (情報理論)
• Efficient Implementation of Pairing-Based Cryptography on a Sensor Node
• Timing Attacks against a Parallelized RSA Implementation (特集:プライバシを保護するコンピュータセキュリティ技術)
• A Progress Report on Lattice Based Public-Key Cryptosystems : Theoretical Security versus Practical Cryptanalysis(Special Issue on Algorithm Engineering : Surveys)

もっと見る 閉じる

スポンサーリンク