Idioma:

Delay-sensitive approaches for anonymizing numerical streaming data

Zakerzadeh, Hessam ; Osborn, Sylvia L.

International journal of information security, 2013-10, Vol.12 (5), p.423-437 [Periódico revisado por pares]

Berlin/Heidelberg: Springer Berlin Heidelberg

Texto completo disponível

Citações Citado por

Enviar para

Título:
Delay-sensitive approaches for anonymizing numerical streaming data
Autor: Zakerzadeh, Hessam ; Osborn, Sylvia L.
Assuntos: Algorithms ; Alliances ; Applied sciences ; Approximation ; Coding and Information Theory ; Communications Engineering ; Computer Communication Networks ; Computer Science ; Computer science; control theory; systems ; Computer security ; Computer systems and distributed systems. User interface ; Cryptology ; Customers ; Datasets ; Delay ; Exact sciences and technology ; Gender ; Management of Computing and Information Systems ; Mathematical analysis ; Mathematical models ; Memory and file management (including protection and security) ; Memory organisation. Data processing ; Network security ; Networks ; On-line systems ; Operating Systems ; Privacy ; Regular Contribution ; Security management ; Software ; Streams ; Studies
É parte de: International journal of information security, 2013-10, Vol.12 (5), p.423-437
Notas: ObjectType-Article-2
SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 23
Descrição: Streaming data are widely used in today’s world. Data come from different sources in streams and must be processed online and with minimum delay. These data stream can contain confidential data such as customers’ purchase information and need to be mined in order to reveal other useful information like customers’ purchase patterns. Privacy preservation throughout these processes plays a crucial role. K-anonymity is a well-known technique for preserving privacy. The principle issues in k-anonymity are information loss and running time. Although some of the existing k-anonymity techniques are able to generate anonymized data with acceptable information loss, their main drawback is that they are very time-consuming and are not applicable in a streaming context since streaming data are usually very sensitive to delay and need to be processed quite fast. In [ 32 ], we proposed a cluster-based k-anonymity algorithm called fast anonymizing algorithm for numerical streaming data (FAANST) which can anonymize numerical streaming data quite fast while providing an admissible information loss. The main drawback of FAANST is that some tuples may remain in the system for a long time and are output when they might be considered to have expired. In this paper, we propose two extensions for FAANST, passive and proactive solutions. These two solutions put a soft deadline, called , on the time each tuple can stay in the system, and if a tuple passes this deadline, these algorithms force the tuple to be output. The proactive solution goes even one step further and utilizes a simple heuristic function to predict when a tuple in the system may expire and outputs the tuple if it will expire in the next round of the algorithm’s execution.
Editor: Berlin/Heidelberg: Springer Berlin Heidelberg
Idioma: Inglês

Links

View record in Pascal Francis

Voltar para lista de resultados

Realização: Logos de Redes Sociais:

Delay-sensitive approaches for anonymizing numerical streaming data

Zakerzadeh, Hessam ; Osborn, Sylvia L.

Berlin/Heidelberg: Springer Berlin Heidelberg

Buscando em bases de dados remotas. Favor aguardar.