Universitat Rostock

Displaying 1-40 of 83 results

  • White Papers // Nov 2013

    Improving the Utility of Differentially Private Data Releases via K-Anonymity

    A common view in some data anonymization literature is to oppose the \"Old\" k-anonymity model to the \"New\" differential privacy model, which offers more robust privacy guarantees. However, the utility of the masked results provided by differential privacy is usually limited, due to the amount of noise that needs to...

    Provided By Universitat Rostock

  • White Papers // Aug 2013

    Privacy-Preserving Trust Management Mechanisms From Private Matching Schemes

    Cryptographic primitives are essential for constructing privacy-preserving communication mechanisms. There are situations in which two parties that do not know each other need to exchange sensitive information over the Internet. Trust management mechanisms make use of digital credentials in order to establish trust among these strangers. The authors present a...

    Provided By Universitat Rostock

  • White Papers // Jul 2013

    Facility Location and Social Choice Via Microaggregation

    Microaggregation is a clustering problem that originally arose in data anonymization for privacy protection. Microaggregation is a cardinality-constrained clustering problem that arose in the context of data privacy. In microaggregation, the number of clusters is not fixed beforehand, but each cluster must have at least k elements. The authors illustrate...

    Provided By Universitat Rostock

  • White Papers // Jul 2013

    Optimal Data-Independent Noise for Differential Privacy

    Differential privacy is a property that seeks to characterize privacy in data sets. It is formulated as a query-response method, and computationally achieved by output perturbation. Several noise-addition methods to implement such output perturbation have been proposed in the literature. The authors focus on data-independent noise, that is, noise whose...

    Provided By Universitat Rostock

  • White Papers // Jun 2013

    Using Search Results to Microaggregate Query Logs Semantically

    Query log anonymization has become an important challenge nowadays. A query log contains the search history of the users, as well as the selected results and their position in the ranking. These data are used to provide a personalized re-ranking of results and trend studies. However, query logs can disclose...

    Provided By Universitat Rostock

  • White Papers // Jun 2013

    Differential Privacy Via T-Closeness in Data Publishing

    k-Anonymity and \"Differential privacy is two mainstream privacy models originated within the computer science community. Their approaches towards disclosure limitation are quite different: k-anonymity is a model for releases of microdata (i.e. individual records) that seeks to prevent record re-identification by hiding each original record within a group of k...

    Provided By Universitat Rostock

  • White Papers // Jun 2013

    Anonymous and Transferable Electronic Ticketing Scheme

    Electronic tickets demonstrate, without the use of paper, the possession of an authorization or access to a determined service. In this scenario, some security requirements must be accomplished. Moreover, some determined services should guarantee the anonymity of the users in the system. In addition to these requirements, the transferability of...

    Provided By Universitat Rostock

  • White Papers // May 2013

    StackSync: Architecturing the Personal Cloud to Be in Sync

    In the last few years, the authors have experienced a rush of online storage services with a complete set of tools for file syncing, sharing and collaboration. Unfortunately, commercial personal cloud solutions, e.g. dropbox, box, sky-drive and the likes, are closed and proprietary, which supposes a serious impediment to progress...

    Provided By Universitat Rostock

  • White Papers // May 2013

    Utility Preserving Query Log Anonymization via Semantic Microaggregation

    Query logs are of great interest for scientists and companies for research, statistical and commercial purposes. However, the availability of query logs for secondary uses raises privacy issues since they allow the identification and/or revelation of sensitive information about individual users. Hence, query anonymization is crucial to avoid identity disclosure....

    Provided By Universitat Rostock

  • White Papers // May 2013

    Preserving the User's Privacy in Social Networking Sites

    In the last years, Social Networking Sites (SNSs) have enjoyed an undeniable success. Those web platforms have huge quantities of active users sharing lots of information every day. Usually, user-generated content may be almost innocuous, however, some studies have shown that it may also contain very sensitive personal data. This...

    Provided By Universitat Rostock

  • White Papers // May 2013

    Providing Useful and Private Web Search by Means of Social Network Profiling

    Web Search Engines (WSEs) build user profiles and use them to offer an enhanced web search experience. Nevertheless, these elements might contain sensitive data that may represent a privacy threat for the users. There are some works in the literature that address this situation while preserving the profile usefulness. These...

    Provided By Universitat Rostock

  • White Papers // May 2013

    Detecting Term Relationships to Improve Textual Document Sanitization

    Now-a-days, the publication of textual documents provides critical benefits to scientific research and business scenarios where information analysis plays an essential role. Nevertheless, the possible existence of identifying or confidential data in this kind of documents motivates the use of measures to sanitize sensitive information before being published, while keeping...

    Provided By Universitat Rostock

  • White Papers // May 2013

    Cloud-as-a-Gift: Effectively Exploiting Personal Cloud Free Accounts via REST APIs

    Personal clouds, such as DropBox and Box, provide open REST APIs for developers to create clever applications that make their service even more attractive. These APIs are a powerful abstraction that makes it possible for applications to transparently manage data from user accounts, blurring the lines between a personal cloud...

    Provided By Universitat Rostock

  • White Papers // Apr 2013

    DNA-Inspired Anonymous Fingerprinting for Efficient Peer-to-Peer Content Distribution

    When selling electronic content, the merchant would like each buyer to receive a different copy of the content fingerprinted with a serial number, in order to be able to trace redistributors should illegal redistribution happen. On the other hand, the merchant would like content distribution to be as scalable as...

    Provided By Universitat Rostock

  • White Papers // Mar 2013

    A Generic Construction of Proxy Signatures From Certificateless Signatures

    The primitive of proxy signatures allows the original signer to delegate proxy signers to sign on messages on behalf of the original signer. It has found numerous applications in distributed computing scenarios where delegation of signing rights is common. Certificateless public key cryptography eliminates the complicated certificates in traditional public...

    Provided By Universitat Rostock

  • White Papers // Feb 2013

    Actively Measuring Personal Cloud Storage

    The personal cloud model is a mainstream service that meets the growing demand of millions of users for reliable off-site storage. However, despite their broad adoption, very little is known about the Quality of Service (QoS) of personal clouds. In this paper, the authors present a measurement study of three...

    Provided By Universitat Rostock

  • White Papers // Jan 2013

    Towards K-Anonymous Non-Numerical Data via Semantic Resampling

    Privacy should be carefully considered during the publication of data (e.g. database records) collected from individuals to avoid disclosing identities or revealing confidential information. Anonymisation methods aim at achieving a certain degree of privacy by performing transformations over non-anonymous data while minimising, as much as possible, the distortion (i.e. information...

    Provided By Universitat Rostock

  • White Papers // Jan 2013

    Analysis and Improvements of Two Identity Based Anonymous Signcryption Schemes for Multiple Receivers

    Anonymous signcryption provides anonymity of the sender with the advantages of signcryption. When a sender wants to send a message to multiple receivers in the confidential and authenticated way, multi receiver signcryption is needed. The researchers proposed an identity based anonymous signcryption scheme for multiple receivers which is proved secure...

    Provided By Universitat Rostock

  • White Papers // Jan 2013

    A Post-processing Method to Lessen k-Anonymity Dissimilarities

    Protecting personal data is essential to guarantee the rule of law. Due to the new Information and Communication Technologies (ICTs) unprecedented amounts of personal data can be stored and analyzed. Thus, if the proper measures are not taken, individual privacy could be in jeopardy. Being the aim to protect individual...

    Provided By Universitat Rostock

  • White Papers // Dec 2012

    Natural Generalizations of Threshold Secret Sharing

    The authors present new families of access structures that, similarly to the multilevel and compartmented access structures introduced in previous papers, are natural generalizations of threshold secret sharing. Namely, they admit an ideal linear secret sharing schemes over every large enough finite field, they can be described by a small...

    Provided By Universitat Rostock

  • White Papers // Oct 2012

    Injecting Discrimination and Privacy Awareness into Pattern Discovery

    Data mining is gaining societal momentum due to the ever increasing availability of large amounts of human data, easily collected by a variety of sensing technologies. Data mining comes with unprecedented opportunities and risks: a deeper understanding of human behavior and how the people society works is darkened by a...

    Provided By Universitat Rostock

  • White Papers // Oct 2012

    A Study on the Impact of Data Anonymization on Anti-discrimination

    In last years, data mining has raised some risks related to privacy invasion of the individuals and potential discrimination based on the extracted patterns and profiles. Efforts at fighting against these risks have led to developing Privacy Preserving Data Mining (PPDM) techniques and antidiscrimination techniques in data mining. However, there...

    Provided By Universitat Rostock

  • White Papers // Sep 2012

    Marginality: A Numerical Mapping for Enhanced Exploitation of Taxonomic Attributes

    Hierarchical attributes appear in taxonomic or ontology based data (e.g. NACE economic activities, ICD-classified diseases, animal/ plant species, etc.). Such taxonomic data are often exploited as if they were flat nominal data without hierarchy, which implies losing substantial information and analytical power. The authors introduce marginality, a numerical mapping for...

    Provided By Universitat Rostock

  • White Papers // Sep 2012

    Sensitivity-Independent Differential Privacy via Prior Knowledge Refinement

    The authors propose a new mechanism to implement differential privacy. Unlike the usual mechanism based on adding a noise whose magnitude is proportional to the sensitivity of the query function; their proposal is based on the refinement of the user's prior knowledge about the response. Their mechanism is shown to...

    Provided By Universitat Rostock

  • White Papers // Aug 2012

    Anonymization Methods for Taxonomic Microdata

    Often microdata sets contain attributes which are neither numerical nor ordinal, but take nominal values from a taxonomy, ontology or classification (e.g. diagnosis in a medical data set about patients, economic activity in an economic data set, etc.). Such data sets must be anonymized if transferred outside the data collector's...

    Provided By Universitat Rostock

  • White Papers // Jul 2012

    Secret Sharing Schemes for Very Dense Graphs

    A secret-sharing scheme realizes a graph if every two vertices connected by an edge can reconstruct the secret while every independent set in the graph does not get any information on the secret. Similar to secret-sharing schemes for general access structures, there are gaps between the known lower bounds and...

    Provided By Universitat Rostock

  • White Papers // Jun 2012

    Privacy Protection of Textual Attributes Through a Semantic-Based Masking Method

    Using micro-data provided by statistical agencies has many benefits from the data mining point of view. However, such data often involve sensitive information that can be directly or indirectly related to individuals. An appropriate anonymisation process is needed to minimize the risk of disclosure. Several masking methods have been developed...

    Provided By Universitat Rostock

  • White Papers // Jun 2012

    Semantic Adaptive Microaggregation of Categorical Microdata

    In the context of statistical disclosure control, microaggregation is a privacy preserving method aimed to mask sensitive microdata prior to publication. It iteratively creates clusters of, at least, k elements, and replaces them by their prototype so that they become k-indistinguishable (anonymous). This data transformation produces a loss of information...

    Provided By Universitat Rostock

  • White Papers // Jun 2012

    Semantically-Grounded Construction of Centroids for Datasets with Textual Attributes

    Centroids are key components in many data analysis algorithms such as clustering or micro-aggregation. They are understood as the central value that minimizes the distance to all the objects in a dataset or cluster. Methods for centroid construction are mainly devoted to datasets with numerical and categorical attributes, focusing on...

    Provided By Universitat Rostock

  • White Papers // Jun 2012

    A Practice-Oriented Framework for Measuring Privacy and Utility in Data Sanitization Systems

    Published data is prone to privacy attacks. Sanitization methods aim to prevent these attacks while maintaining usefulness of the data for legitimate users. Quantifying the trade-off between usefulness and privacy of published data has been the subject of much research in recent years. The authors propose a pragmatic framework for...

    Provided By Universitat Rostock

  • White Papers // Jun 2012

    Single-Party Private Web Search

    Web search engines profile their users by storing and analyzing their past searches. Profiles reflect the interests of the users and enable web search engines to offer a better service. In this way, search results are personalized to fulfill the expectations of each individual user. Nevertheless, this service is not...

    Provided By Universitat Rostock

  • White Papers // May 2012

    Linear Threshold Multisecret Sharing Schemes

    In a multisecret sharing scheme, several secret values are distributed among a set of n users, and each secret may have a different associated access structure. The authors consider here information-theoretic secure schemes with multithreshold access structures. Namely, for every subset P of k users there is a secret key...

    Provided By Universitat Rostock

  • White Papers // May 2012

    Knowledge-Based Scheme to Create Privacy-Preserving but Semantically-Related Queries for Web Search Engines

    Web Search Engines (WSEs) are basic tools for finding and accessing data in the internet. However, they also put the privacy of their users at risk. This happens because users frequently reveal private information in their queries. WSEs gather this personal data and build user profiles which are used to...

    Provided By Universitat Rostock

  • White Papers // May 2012

    Differential Privacy Trough Knowledge Refinement

    The authors introduce a novel mechanism to attain differential privacy. Contrary to the common mechanism based on the addition of a noise whose magnitude is proportional to the sensitivity of the query function, their proposal is based on the refinement of the user's prior knowledge about the response. They show...

    Provided By Universitat Rostock

  • White Papers // Mar 2012

    Predictive Protocol for the Scalable Identification of RFID Tags Through Collaborative Readers

    Radio Frequency IDentification (RFID) is a technology aimed at efficiently identifying products that has greatly influenced the manufacturing businesses in recent years. Although the RFID technology has been widely accepted by the manufacturing and retailing sectors, there are still many issues regarding its scalability, security and privacy. With regard to...

    Provided By Universitat Rostock

  • White Papers // Mar 2012

    Probabilistic K-Anonymity Through Microaggregation and Data Swapping

    A microdata file is composed of records that contain information specific to individuals (who may be citizens, companies, etc.) in the data set. These records contain, for each specific individual, the values corresponding to a list of attributes. Microdata files are the result of data collection processes carried out by...

    Provided By Universitat Rostock

  • White Papers // Nov 2011

    Implementing a Hybrid SRAM / EDRAM NUCA Architecture

    Advances in technology allowed for integrating DRAM-like structures into the chip, called embedded DRAM (eDRAM). This technology has already been successfully implemented in some GPUs and other graphic-intensive SoC, like game consoles. The most recent processor from IBM R, POWER7, is the first general-purpose processor that integrates an eDRAM module...

    Provided By Universitat Rostock

  • White Papers // Sep 2011

    Rational Behavior in Peer-to-Peer Profile Obfuscation for Anonymous Keyword Search

    User profiling in web search has the advantage of enabling personalized web search: the quality of the results offered by the search engine to the user is increased by taking the user's interests into account when presenting those results. The negative side is that the interests and the query history...

    Provided By Universitat Rostock

  • White Papers // Sep 2011

    Fully Distributed Broadcast Encryption

    Broadcast encryption schemes rely on a centralized authority to generate decryption keys for each user. It is observed that, when a broadcast encryption scheme is deployed for secret escrows, a dishonest dealer can read the escrowed secrets without leaving any witnesses. The authors present a new broadcast encryption paradigm referred...

    Provided By Universitat Rostock

  • White Papers // Sep 2011

    Multi-Party Private Web Search With Untrusted Partners

    Web search engines are tools employed to find specific information in the Internet. However, they also represent a threat for the privacy of their users. This happens because the web search engines store and analyze the personal information that the users reveal in their queries. In order to avoid this...

    Provided By Universitat Rostock

  • White Papers // May 2013

    StackSync: Architecturing the Personal Cloud to Be in Sync

    In the last few years, the authors have experienced a rush of online storage services with a complete set of tools for file syncing, sharing and collaboration. Unfortunately, commercial personal cloud solutions, e.g. dropbox, box, sky-drive and the likes, are closed and proprietary, which supposes a serious impediment to progress...

    Provided By Universitat Rostock

  • White Papers // Feb 2013

    Actively Measuring Personal Cloud Storage

    The personal cloud model is a mainstream service that meets the growing demand of millions of users for reliable off-site storage. However, despite their broad adoption, very little is known about the Quality of Service (QoS) of personal clouds. In this paper, the authors present a measurement study of three...

    Provided By Universitat Rostock

  • White Papers // May 2013

    Cloud-as-a-Gift: Effectively Exploiting Personal Cloud Free Accounts via REST APIs

    Personal clouds, such as DropBox and Box, provide open REST APIs for developers to create clever applications that make their service even more attractive. These APIs are a powerful abstraction that makes it possible for applications to transparently manage data from user accounts, blurring the lines between a personal cloud...

    Provided By Universitat Rostock

  • White Papers // Jul 2011

    Enforcing Fairness in P2P Storage Systems using Asymmetric Reciprocal Exchange

    In P2P storage systems peers need to contribute some local storage resources in order to obtain a certain online and reliable storage capacity. To guarantee that the storage service works, P2P storage systems have to meet two main requirements. The storage system needs to maintain fairness among peers by ensuring...

    Provided By Universitat Rostock

  • White Papers // Jun 2010

    Availability and Redundancy in Harmony: Measuring Retrieval Times in P2P Storage Systems

    Peer-To-Peer (P2P) storage systems are strongly affected by churn - temporal and permanent peer failures. Because of this churn, the main requirement of such systems is to guarantee that stored objects can always be retrieved. This requirement is specially needed in two main situations: when users want to access the...

    Provided By Universitat Rostock

  • White Papers // Jul 2009

    Heterogeneity-Aware Erasure Codes for Peer-to-Peer Storage Systems

    Peer-To-Peer (P2P) storage systems rely on data redundancy to obtain high levels of data availability. Among the existing data redundancy schemes, erasure coding is a widely adopted scheme in existing P2P storage systems. By properly tunning its parameters, erasure codes can minimize the required data redundancy, which reduces both the...

    Provided By Universitat Rostock

  • White Papers // Nov 2011

    Implementing a Hybrid SRAM / EDRAM NUCA Architecture

    Advances in technology allowed for integrating DRAM-like structures into the chip, called embedded DRAM (eDRAM). This technology has already been successfully implemented in some GPUs and other graphic-intensive SoC, like game consoles. The most recent processor from IBM R, POWER7, is the first general-purpose processor that integrates an eDRAM module...

    Provided By Universitat Rostock

  • White Papers // Apr 2011

    Cost Analysis of Redundancy Schemes for Distributed Storage Systems

    Distributed storage infrastructures require the use of data redundancy to achieve high data reliability. Unfortunately, the use of redundancy introduces storage and communication overheads, which can either reduce the overall storage capacity of the system or increase its costs. To mitigate the storage and communication overhead, different redundancy schemes have...

    Provided By Universitat Rostock

  • White Papers // Jul 2012

    Secret Sharing Schemes for Very Dense Graphs

    A secret-sharing scheme realizes a graph if every two vertices connected by an edge can reconstruct the secret while every independent set in the graph does not get any information on the secret. Similar to secret-sharing schemes for general access structures, there are gaps between the known lower bounds and...

    Provided By Universitat Rostock

  • White Papers // Dec 2012

    Natural Generalizations of Threshold Secret Sharing

    The authors present new families of access structures that, similarly to the multilevel and compartmented access structures introduced in previous papers, are natural generalizations of threshold secret sharing. Namely, they admit an ideal linear secret sharing schemes over every large enough finite field, they can be described by a small...

    Provided By Universitat Rostock

  • White Papers // Jul 2009

    Reciprocal Exchange for Resource Allocation in Peer-to-Peer Networks

    Symmetric exchanges have been used for Peer-To-Peer resource allocation systems to maintain fairness among the number of resources that each peer contributes to the network. The problem of these systems is that they do not take into account resource's quality in their fairness measure. Resource quality is an important factor...

    Provided By Universitat Rostock

  • White Papers // Feb 2008

    On the Computational Security of a Distributed Key Distribution Scheme

    In a distributed key distribution scheme, a set of servers help a set of users in a group to securely obtain a common key. Security means that an adversary who corrupts some servers and some users has no information about the key of a non-corrupted group. In this paper the...

    Provided By Universitat Rostock

  • White Papers // Apr 2010

    Transparent Security for Cloud

    Large distributed systems such as clouds are increasingly be-coming targets of attacks. Virtualization can be leveraged to increase the security of such systems by protecting the integrity of guest components. This paper discusses the integrity protection problem in the clouds and sketches a novel architecture, Transparent Cloud Protection System (TCPS)...

    Provided By Universitat Rostock

  • White Papers // May 2012

    Knowledge-Based Scheme to Create Privacy-Preserving but Semantically-Related Queries for Web Search Engines

    Web Search Engines (WSEs) are basic tools for finding and accessing data in the internet. However, they also put the privacy of their users at risk. This happens because users frequently reveal private information in their queries. WSEs gather this personal data and build user profiles which are used to...

    Provided By Universitat Rostock

  • White Papers // May 2013

    Utility Preserving Query Log Anonymization via Semantic Microaggregation

    Query logs are of great interest for scientists and companies for research, statistical and commercial purposes. However, the availability of query logs for secondary uses raises privacy issues since they allow the identification and/or revelation of sensitive information about individual users. Hence, query anonymization is crucial to avoid identity disclosure....

    Provided By Universitat Rostock

  • White Papers // Jul 2013

    Optimal Data-Independent Noise for Differential Privacy

    Differential privacy is a property that seeks to characterize privacy in data sets. It is formulated as a query-response method, and computationally achieved by output perturbation. Several noise-addition methods to implement such output perturbation have been proposed in the literature. The authors focus on data-independent noise, that is, noise whose...

    Provided By Universitat Rostock

  • White Papers // Nov 2010

    Asymmetric Homomorphisms for Secure Aggregation in Heterogeneous Scenarios

    In multicast communication, a single source transmits the same content to a large amount of receivers. This kind of communication is usually represented following a tree model where the root of the tree is the multicast source and the leaves are the receivers. Scalability problems arise when the root needs...

    Provided By Universitat Rostock

  • White Papers // Sep 2012

    Sensitivity-Independent Differential Privacy via Prior Knowledge Refinement

    The authors propose a new mechanism to implement differential privacy. Unlike the usual mechanism based on adding a noise whose magnitude is proportional to the sensitivity of the query function; their proposal is based on the refinement of the user's prior knowledge about the response. Their mechanism is shown to...

    Provided By Universitat Rostock

  • White Papers // Jun 2012

    Privacy Protection of Textual Attributes Through a Semantic-Based Masking Method

    Using micro-data provided by statistical agencies has many benefits from the data mining point of view. However, such data often involve sensitive information that can be directly or indirectly related to individuals. An appropriate anonymisation process is needed to minimize the risk of disclosure. Several masking methods have been developed...

    Provided By Universitat Rostock

  • White Papers // May 2012

    Linear Threshold Multisecret Sharing Schemes

    In a multisecret sharing scheme, several secret values are distributed among a set of n users, and each secret may have a different associated access structure. The authors consider here information-theoretic secure schemes with multithreshold access structures. Namely, for every subset P of k users there is a secret key...

    Provided By Universitat Rostock

  • White Papers // Mar 2012

    Predictive Protocol for the Scalable Identification of RFID Tags Through Collaborative Readers

    Radio Frequency IDentification (RFID) is a technology aimed at efficiently identifying products that has greatly influenced the manufacturing businesses in recent years. Although the RFID technology has been widely accepted by the manufacturing and retailing sectors, there are still many issues regarding its scalability, security and privacy. With regard to...

    Provided By Universitat Rostock

  • White Papers // Jun 2012

    Semantic Adaptive Microaggregation of Categorical Microdata

    In the context of statistical disclosure control, microaggregation is a privacy preserving method aimed to mask sensitive microdata prior to publication. It iteratively creates clusters of, at least, k elements, and replaces them by their prototype so that they become k-indistinguishable (anonymous). This data transformation produces a loss of information...

    Provided By Universitat Rostock

  • White Papers // Sep 2011

    Rational Behavior in Peer-to-Peer Profile Obfuscation for Anonymous Keyword Search

    User profiling in web search has the advantage of enabling personalized web search: the quality of the results offered by the search engine to the user is increased by taking the user's interests into account when presenting those results. The negative side is that the interests and the query history...

    Provided By Universitat Rostock

  • White Papers // Jun 2012

    Semantically-Grounded Construction of Centroids for Datasets with Textual Attributes

    Centroids are key components in many data analysis algorithms such as clustering or micro-aggregation. They are understood as the central value that minimizes the distance to all the objects in a dataset or cluster. Methods for centroid construction are mainly devoted to datasets with numerical and categorical attributes, focusing on...

    Provided By Universitat Rostock

  • White Papers // Mar 2011

    Coprivacy: An Introduction to the Theory and Applications of Co-Operative Privacy

    The authors introduce the novel concept of co-privacy or co-operative privacy to make privacy preservation attractive. A protocol is co-private if the best option for a player to preserve the user's privacy is to help another player in preserving his privacy. Co-privacy makes an individual's privacy preservation a goal that...

    Provided By Universitat Rostock

  • White Papers // Mar 2011

    Semantic Microaggregation for the Anonymization of Query Logs Using the Open Directory Project

    Web search engines gather information from the queries performed by the user in the form of query logs. These logs are extremely useful for research, marketing, or profiling, but at the same time they are a great threat to the user's privacy. The authors provide a novel approach to anonymize...

    Provided By Universitat Rostock

  • White Papers // Jul 2009

    A Collaborative Protocol for Private Retrieval of Location-Based Information

    Privacy and security are paramount for the proper deployment of Location-Based Services (LBSs). The authors present a novel protocol based on user collaboration to privately retrieve location-based information from an LBS provider. Their approach neither assumes that users or the LBS can be completely trusted with regard to privacy, nor...

    Provided By Universitat Rostock

  • White Papers // Jun 2012

    A Practice-Oriented Framework for Measuring Privacy and Utility in Data Sanitization Systems

    Published data is prone to privacy attacks. Sanitization methods aim to prevent these attacks while maintaining usefulness of the data for legitimate users. Quantifying the trade-off between usefulness and privacy of published data has been the subject of much research in recent years. The authors propose a pragmatic framework for...

    Provided By Universitat Rostock

  • White Papers // Jan 2006

    V-MDAV: A Multivariate Microaggregation With Variable Group Size

    Micro-aggregation is a clustering problem with minimum size constraints on the resulting clusters or groups; the number of groups is unconstrained and the within-group homogeneity should be maximized. In the context of privacy in statistical databases, micro-aggregation is a well-known approach to obtaining anonymized versions of confidential microdata. Optimally solving...

    Provided By Universitat Rostock

  • White Papers // Apr 2006

    Re-Identification and Synthetic Data Generators: A Case Study

    Synthetic generators are increasingly used to replace sensitive data with artificial data preserving to a predetermined extent the utility of the original data. When using synthetic data generators, re-identification analysis is usually disregarded on the grounds that, the released data being artificial, no real re-identification is possible. While this may...

    Provided By Universitat Rostock

  • White Papers // Mar 2006

    A 2d-Tree-Based Blocking Method for Microaggregating Very Large Data Sets

    Blocking is a well-known technique used to partition a set of records into several subsets of manageable size. The standard approach to blocking is to split the records according to the values of one or several attributes (called blocking attributes). This paper presents a new blocking method based on 2d-trees...

    Provided By Universitat Rostock

  • White Papers // Jul 2011

    Discrimination Prevention in Data Mining for Intrusion and Crime Detection

    Automated data collection has fostered the use of data mining for intrusion and crime detection. Indeed, banks, large corporations, insurance companies, casinos, etc. are increasingly mining data about their customers or employees in view of detecting potential intrusion, fraud or even crime. Mining algorithms are trained from datasets which may...

    Provided By Universitat Rostock

  • White Papers // Jun 2011

    Scalable Trajectory-based Protocol for RFID Tags Identification

    RFID systems allow the fast and automatic identification of items through a wireless channel. Items' information like name, model, purpose, and expiration date can be easily stored and retrieved from RFID tags attached to items. Consequently, in the near future, RFID tags might be an active part of the people...

    Provided By Universitat Rostock

  • White Papers // Aug 2011

    A Secure Automatic Fare Collection System for Time-Based or Distance-Based Services With Revocable Anonymity for Users

    Automatic Fare Collection (AFC) systems calculate the fare that the users must pay depending on the time of service (time-based) or the points of entrance and exit of the system (distance-based). The progressive introduction of Information and Communication Technologies (ICT) allows the use of electronic tickets, which helps to reduce...

    Provided By Universitat Rostock

  • White Papers // Jul 2011

    Evaluation of the Disclosure Risk of Masking Methods Dealing With Textual Attributes

    Record linkage methods evaluate the disclosure risk of revealing confidential information in anonymized datasets that are publicly distributed. Concretely, they measure the capacity of an intruder to link records in the original dataset with those in the masked one. In the past, masking and record linkage methods have been developed...

    Provided By Universitat Rostock

  • White Papers // Jan 2013

    A Post-processing Method to Lessen k-Anonymity Dissimilarities

    Protecting personal data is essential to guarantee the rule of law. Due to the new Information and Communication Technologies (ICTs) unprecedented amounts of personal data can be stored and analyzed. Thus, if the proper measures are not taken, individual privacy could be in jeopardy. Being the aim to protect individual...

    Provided By Universitat Rostock

  • White Papers // Sep 2008

    On Intuitionistic Fuzzy Clustering for Its Application to Privacy

    Clustering and fuzzy clustering are well established areas, and clustering algorithms are standard tools in unsupervised machine learning and statistical learning. Their goal is to divide the data into meaningful clusters. That is, similar objects should be put in the same clusters and dissimilar objects should be left into different...

    Provided By Universitat Rostock

  • White Papers // Aug 2012

    Anonymization Methods for Taxonomic Microdata

    Often microdata sets contain attributes which are neither numerical nor ordinal, but take nominal values from a taxonomy, ontology or classification (e.g. diagnosis in a medical data set about patients, economic activity in an economic data set, etc.). Such data sets must be anonymized if transferred outside the data collector's...

    Provided By Universitat Rostock

  • White Papers // Sep 2012

    Marginality: A Numerical Mapping for Enhanced Exploitation of Taxonomic Attributes

    Hierarchical attributes appear in taxonomic or ontology based data (e.g. NACE economic activities, ICD-classified diseases, animal/ plant species, etc.). Such taxonomic data are often exploited as if they were flat nominal data without hierarchy, which implies losing substantial information and analytical power. The authors introduce marginality, a numerical mapping for...

    Provided By Universitat Rostock

  • White Papers // Jul 2013

    Facility Location and Social Choice Via Microaggregation

    Microaggregation is a clustering problem that originally arose in data anonymization for privacy protection. Microaggregation is a cardinality-constrained clustering problem that arose in the context of data privacy. In microaggregation, the number of clusters is not fixed beforehand, but each cluster must have at least k elements. The authors illustrate...

    Provided By Universitat Rostock