International Conference on Pattern Analysis and Intelligent Systems最新文献_第2页

An efficient clustering method for k-anonymization 一种有效的k-匿名聚类方法

International Conference on Pattern Analysis and Intelligent Systems Pub Date : 2008-03-29 DOI: 10.1145/1379287.1379297

Jun-Lin Lin, Meng-Cheng Wei

引用次数: 96

Data utility and privacy protection trade-off in k-anonymisation k-匿名中数据效用与隐私保护的权衡

International Conference on Pattern Analysis and Intelligent Systems Pub Date : 2008-03-29 DOI: 10.1145/1379287.1379296

G. Loukides, J. Shao

引用次数: 36

Distributed privacy preserving k-means clustering with additive secret sharing 具有可加性秘密共享的分布式隐私保护k-means聚类

International Conference on Pattern Analysis and Intelligent Systems Pub Date : 2008-03-29 DOI: 10.1145/1379287.1379291

M. Doganay, T. Pedersen, Y. Saygin, E. Savaş, A. Levi

{"title":"Distributed privacy preserving k-means clustering with additive secret sharing","authors":"M. Doganay, T. Pedersen, Y. Saygin, E. Savaş, A. Levi","doi":"10.1145/1379287.1379291","DOIUrl":"https://doi.org/10.1145/1379287.1379291","url":null,"abstract":"Recent concerns about privacy issues motivated data mining researchers to develop methods for performing data mining while preserving the privacy of individuals. However, the current techniques for privacy preserving data mining suffer from high communication and computation overheads which are prohibitive considering even a modest database size. Furthermore, the proposed techniques have strict assumptions on the involved parties which need to be relaxed in order to reflect the real-world requirements. In this paper we concentrate on a distributed scenario where the data is partitioned vertically over multiple sites and the involved sites would like to perform clustering without revealing their local databases. For this setting, we propose a new protocol for privacy preserving k-means clustering based on additive secret sharing. We show that the new protocol is more secure than the state of the art. Experiments conducted on real and synthetic data sets show that, in realistic scenarios, the communication and computation cost of our protocol is considerably less than the state of the art which is crucial for data mining applications.","PeriodicalId":245552,"journal":{"name":"International Conference on Pattern Analysis and Intelligent Systems","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-03-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124682896","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 88

Attribute selection in multivariate microaggregation 多元微聚合中的属性选择

International Conference on Pattern Analysis and Intelligent Systems Pub Date : 2008-03-29 DOI: 10.1145/1379287.1379299

Jordi Nin, Javier Herranz, V. Torra

{"title":"Attribute selection in multivariate microaggregation","authors":"Jordi Nin, Javier Herranz, V. Torra","doi":"10.1145/1379287.1379299","DOIUrl":"https://doi.org/10.1145/1379287.1379299","url":null,"abstract":"Microaggregation is one of the most employed microdata protection methods. The idea is to build clusters of at least k original records, and then replace them with the centroid of the cluster. When the number of attributes of the dataset is large, a common practice is to split the dataset into smaller blocks of attributes. Microaggregation is successively and independently applied to each block. In this way, the effect of the noise introduced by microaggregation is reduced, but at the cost of losing the k-anonymity property.\u0000 The goal of this work is to show that, besides of the specific microaggregation method employed, the value of the parameter k, and the number of blocks in which the dataset is split, there exists another factor which can influence the quality of the microaggregation: the way in which the attributes are grouped to form the blocks. When correlated attributes are grouped in the same block, the statistical utility of the protected dataset is higher. In contrast, when correlated attributes are dispersed into different blocks, the achieved anonymity is higher, and, so, the disclosure risk is lower. We present quantitative evaluations of such statements based on different experiments on real datasets.","PeriodicalId":245552,"journal":{"name":"International Conference on Pattern Analysis and Intelligent Systems","volume":"29 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-03-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127780318","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 8

Location privacy via unlinkability: an alternative to cloaking and perturbation 通过不可链接的位置隐私:伪装和干扰的替代方案

International Conference on Pattern Analysis and Intelligent Systems Pub Date : 2008-03-29 DOI: 10.1145/1379287.1379289

J. Domingo-Ferrer

引用次数: 2

Design of PriServ, a privacy service for DHTs 为dht设计的隐私服务PriServ

International Conference on Pattern Analysis and Intelligent Systems Pub Date : 2008-03-29 DOI: 10.1145/1379287.1379293

M. Jawad, Patricia Serrano-Alvarado, P. Valduriez

{"title":"Design of PriServ, a privacy service for DHTs","authors":"M. Jawad, Patricia Serrano-Alvarado, P. Valduriez","doi":"10.1145/1379287.1379293","DOIUrl":"https://doi.org/10.1145/1379287.1379293","url":null,"abstract":"By decentralizing control, P2P systems provide efficient, scalable data sharing. However, when sharing data for different purposes (e.g., billing, purchase, shipping, etc.), data privacy can be easily violated by untrustworthy peers wich may use data for other purposes (e.g., marketing, fraudulence, profiling, etc.). A basic principle of data privacy is purpose specification which states that data providers should be able to specify the purpose for which their data will be collected and used. In the context of P2P systems, decentralized control makes it hard to enforce purpose-based privacy. And the major problem of data disclosure is not addressed. Hippocratic databases provide mechanisms for enforcing purpose-based disclosure control within a corporation datastore. In this paper, we apply the Hippocratic database principles to P2P systems to enforce purpose-based privacy. We focus on Distributed Hash Tables (DHTs), because they provide strong guarantees in terms of access performance. We propose PriServ, a privacy service which prevents privacy violation by prohibiting malicious data access. The performance evaluation of our approach through simulation shows that the overhead introduced by PriServ is small.","PeriodicalId":245552,"journal":{"name":"International Conference on Pattern Analysis and Intelligent Systems","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-03-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131823090","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 17

Protecting privacy in recorded conversations 保护谈话记录中的隐私

International Conference on Pattern Analysis and Intelligent Systems Pub Date : 2008-03-29 DOI: 10.1145/1379287.1379295

Scot Cunningham, T. Truta

引用次数: 7

Towards formal verification of cryptographic circuits: A functional approach 迈向加密电路的形式化验证:一种功能方法

International Conference on Pattern Analysis and Intelligent Systems Pub Date : 1900-01-01 DOI: 10.1109/PAIS.2018.8598527

Abir Bitat, S. Merniz

引用次数: 1

Stereo Visual Odometry for Mobile Robot 移动机器人的立体视觉里程计

International Conference on Pattern Analysis and Intelligent Systems Pub Date : 1900-01-01 DOI: 10.1109/PAIS.2018.8598501

Abdelghani Boucheloukh, F. Boudjema, A. Nemra, Fethi Demim, R. Louali

引用次数: 1

Improved Multicriteria Ranking based web service Discovery approach 改进的基于多标准排名的web服务发现方法

International Conference on Pattern Analysis and Intelligent Systems Pub Date : 1900-01-01 DOI: 10.1109/PAIS.2018.8598539

D. E. Abdelli, F. M. Bouyakoub

引用次数: 1