Idioma:

Toward inference attacks for k-anonymity

Sun, Yan ; Yin, Lihua ; Liu, Licai ; Xin, Shuang

Personal and ubiquitous computing, 2014-12, Vol.18 (8), p.1871-1880 [Periódico revisado por pares]

London: Springer London

Texto completo disponível

Citações Citado por

Enviar para

Título:
Toward inference attacks for k-anonymity
Autor: Sun, Yan ; Yin, Lihua ; Liu, Licai ; Xin, Shuang
Assuntos: Algorithmics. Computability. Computer arithmetics ; Algorithms ; Anonymity ; Applied sciences ; Approximation ; Combinatorics ; Combinatorics. Ordered structures ; Computer privacy ; Computer Science ; Computer science; control theory; systems ; Exact sciences and technology ; Graph theory ; Graphs ; Inference ; Information retrieval. Graph ; Mathematics ; Memory and file management (including protection and security) ; Memory organisation. Data processing ; Mobile Computing ; Optimization ; Original Article ; Personal Computing ; Privacy ; Sciences and techniques of general use ; Software ; Strategy ; Theoretical computing ; User Interfaces and Human Computer Interaction
É parte de: Personal and ubiquitous computing, 2014-12, Vol.18 (8), p.1871-1880
Notas: ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 23
Descrição: Current research still cannot effectively prevent an inference attacker from inferring privacy information for k -anonymous data sets. To solve the issue, we must first study all kinds of aggressive reasoning behaviors and process for the attacker thoroughly. Our work focuses on describing comprehensively the inference attack and analyzing their privacy disclosures for k -anonymous data sets. In this paper, we build up a privacy inference graph based on attack graph theory, which is an extension of attack graph. The privacy inference graph describes comprehensively the inference attack in k -anonymous databases by considering attacker background knowledge and external factors. In the privacy inference graph, we introduce a concept of valid inference path to analyze the privacy disclosures in face of inference attack. According to both above, we design an algorithm to compute the n -valid inference paths. These paths can deduce some privacy information resulting in privacy disclosure. Moreover, we study the optimal privacy strategies to resist inference attack by key attribute sets and valid inference paths in the attack graph. An approximate algorithm is designed to obtain the approximate optimal privacy strategy set. At last, we prove the correctness in theory and analyze the performance of the approximate algorithm and their time complexity.
Editor: London: Springer London
Idioma: Inglês

Links

View record in Pascal Francis

Voltar para lista de resultados

Anterior Resultado 6 Avançar Ir para próxima página

Realização: Logos de Redes Sociais:

Toward inference attacks for k-anonymity

Sun, Yan ; Yin, Lihua ; Liu, Licai ; Xin, Shuang

London: Springer London

Buscando em bases de dados remotas. Favor aguardar.