Abstract:
A methodology to protect private data when a user wishes to publicly release some data about himself, which is can be correlated with his private data. Specifically, the method and apparatus teach comparing public data with survey data having public data and associated private data. A joint probability distribution is performed to predict a private data wherein said prediction has a certain probability. At least one of said public data is altered or deleted in response to said probability exceeding a predetermined threshold.

Description:
CROSS REFERENCE TO RELATED APPLICATION 
       [0001]    This application claims priority to and all benefits accruing from a provisional application filed in the United States Patent and Trademark Office on Feb. 8, 2013, and there assigned Ser. No. 61/762,480. 
     
    
     BACKGROUND OF THE INVENTION 
       [0002]    1. Field of the Invention 
         [0003]    The present invention generally relates to a method and an apparatus for preserving privacy, and more particularly, to a method and an apparatus for generating a privacy preserving mapping mechanism in light of a mismatched or incomplete prior used in a joint probability comparison. 
         [0004]    2. Background Information 
         [0005]    In the era of Big Data, the collection and mining of user data has become a fast growing and common practice by a large number of private and public institutions. For example, technology companies exploit user data to offer personalized services to their customers, government agencies rely on data to address a variety of challenges, e.g., national security, national health, budget and fund allocation, or medical institutions analyze data to discover the origins and potential cures to diseases. In some cases, the collection, the analysis, or the sharing of a user&#39;s data with third parties is performed without the user&#39;s consent or awareness. In other cases, data is released voluntarily by a user to a specific analyst, in order to get a service in return, e.g., product ratings released to get recommendations. This service, or other benefit that the user derives from allowing access to the user&#39;s data may be referred to as utility. In either case, privacy risks arise as some of the collected data may be deemed sensitive by the user, e.g., political opinion, health status, income level, or may seem harmless at first sight, e.g., product ratings, yet lead to the inference of more sensitive data with which it is correlated. The latter threat refers to an inference attack, a technique of inferring private data by exploiting its correlation with publicly released data. 
         [0006]    In recent years, the many dangers of online privacy abuse have surfaced, including identity theft, reputation loss, job loss, discrimination, harassment, cyberbullying, stalking and even suicide. During the same time accusations against online social network (OSN) providers have become common alleging illegal data collection, sharing data without user consent, changing privacy settings without informing users, misleading users about tracking their browsing behavior, not carrying out user deletion actions, and not properly informing users about what their data is used for and whom else gets access to the data. The liability for the OSNs may potentially rise into the tens and hundreds of millions of dollars. 
         [0007]    One of the central problems of managing privacy in the Internet lies in the simultaneous management of both public and private data. Many users are willing to release some data about themselves, such as their movie watching history or their gender; they do so because such data enables useful services and because such attributes are rarely considered private. However users also have other data they consider private, such as income level, political affiliation, or medical conditions. In this work, we focus on a method in which a user can release her public data, but is able to prevent against inference attacks that may learn her private data from the public information. I would be desirable to inform a user on how to distort her public data, before releasing it, such that no inference attacks can successfully learn her private data. At the same time, the distortion should be bounded so that the original service (such as a recommendation) can continue to be useful. 
         [0008]    It is desirable to a user to obtain the benefits of the analysis of publicly released data, such as movie preferences, or shopping habits. However, it is undesirable if a third party can analyze this public data and infer private data, such as political affiliation or income level. It would be desirable for a user or service to be able to release some of the public information to obtain the benefits, but control the ability of third parties to infer private information. A difficult aspect of this control mechanism is that private data is often inferred using a joint probability comparison of prior records and private records are not easily obtained to make a reliable comparison. This limited number of samples of private and public data leads to the problem of a mismatched prior. It is therefore desirable to overcome the above difficulties and provide a user with an experience that is safe for private data. 
       SUMMARY OF THE INVENTION 
       [0009]    In accordance with an aspect of the present invention, an apparatus is disclosed. According to an exemplary embodiment, the apparatus for processing a user data comprising a memory for storing said user data wherein said user data consists of a public data, a processor for comparing said user data to a survey data, for determining a probability of a private data in response to said comparison, and for altering said public data to generate an altered data in response to said probability having a value higher than a predetermined threshold, and a network interface for transmitting said altered data. 
         [0010]    In accordance with another aspect of the present invention, a method for protecting private data is disclosed. According to an exemplary embodiment, the method comprises the steps of accessing said user data wherein said user data consists of a public data, comparing said user data to a survey data, determining a probability of a private data in response to said comparison, and altering said public data to generate an altered data in response to said probability having a value higher than a predetermined threshold. 
         [0011]    In accordance with another aspect of the present invention, a second method for protecting private data is disclosed. According to an exemplary embodiment, the method comprises the steps of collecting a plurality of user public data associated with a user, comparing said plurality of public data to a plurality of public survey data wherein said public survey data is associated with a plurality of private survey data, determining a probability of said user private data in response to said comparison, wherein the probability of said user private data being accurate exceeds a threshold value, and altering at least one of said plurality of user public data to generate a plurality of altered user public data, comparing said plurality of altered user public data to said plurality of public survey data, and determining said probability of said user private data in response to said comparison of said plurality of altered public data and said plurality of public survey data, wherein the probability of said user private data is below said threshold value. 
     
    
     
       BRIEF DESCRIPTION OF THE DRAWINGS 
         [0012]    The above-mentioned and other features and advantages of this invention, and the manner of attaining them, will become more apparent and the invention will be better understood by reference to the following description of embodiments of the invention taken in conjunction with the accompanying drawings, wherein: 
           [0013]      FIG. 1  is a flow diagram depicting an exemplary method for preserving privacy, in accordance with an embodiment of the present principles. 
           [0014]      FIG. 2  is a flow diagram depicting an exemplary method for preserving privacy when the joint distribution between the private data and public data is known, in accordance with an embodiment of the present principles. 
           [0015]      FIG. 3  is a flow diagram depicting an exemplary method for preserving privacy when the joint distribution between the private data and public data is unknown and the marginal probability measure of the public data is also unknown, in accordance with an embodiment of the present principles. 
           [0016]      FIG. 4  is a flow diagram depicting an exemplary method for preserving privacy when the joint distribution between the private data and public data is unknown but the marginal probability measure of the public data is known, in accordance with an embodiment of the present principles. 
           [0017]      FIG. 5  is a block diagram depicting an exemplary privacy agent, in accordance with an embodiment of the present principles. 
           [0018]      FIG. 6  is a block diagram depicting an exemplary system that has multiple privacy agents, in accordance with an embodiment of the present principles. 
           [0019]      FIG. 7  is a flow diagram depicting an exemplary method for preserving privacy, in accordance with an embodiment of the present principles. 
           [0020]      FIG. 8  is a flow diagram depicting a second exemplary method for preserving privacy, in accordance with an embodiment of the present principles. 
       
    
    
       [0021]    The exemplifications set out herein illustrate preferred embodiments of the invention, and such exemplifications are not to be construed as limiting the scope of the invention in any manner. 
       DESCRIPTION OF THE PREFERRED EMBODIMENTS 
       [0022]    Referring now to the drawings, and more particularly to  FIG. 1 , a diagram of an exemplary method  100  for implementing the present invention is shown. 
         [0023]      FIG. 1  illustrates an exemplary method  100  for distorting public data to be released in order to preserve privacy according to the present principles. Method  100  starts at  105 . At step  110 , it collects statistical information based on released data, for example, from the users who are not concerned about privacy of their public data or private data. We denote these users as “public users,” and denote the users who wish to distort public data to be released as “private users.” 
         [0024]    The statistics may be collected by crawling the web, accessing different databases, or may be provided by a data aggregator. Which statistical information can be gathered depends on what the public users release. For example, if the public users release both private data and public data, an estimate of the joint distribution P S,X  can be obtained. In another example, if the public users only release public data, an estimate of the marginal probability measure P X  can be obtained, but not the joint distribution P S,X . In another example, we may only be able to get the mean and variance of the public data. In the worst case, we may be unable to get any information about the public data or private data. 
         [0025]    At step  120 , the method determines a privacy preserving mapping based on the statistical information given the utility constraint. As discussed before, the solution to the privacy preserving mapping mechanism depends on the available statistical information. 
         [0026]    At step  130 , the public data of a current private user is distorted, according to the determined privacy preserving mapping, before it is released to, for example, a service provider or a data collecting agency, at step  140 . Given the value X▪x for the private user, a value Y▪y is sampled according to the distribution P Y|X▪x . This value y is released instead of the true x. Note that the use of the privacy mapping to generate the released y does not require knowing the value of the private data S=s of the private user. Method  100  ends at step  199 . 
         [0027]      FIGS. 2-4  illustrate in further detail exemplary methods for preserving privacy when different statistical information is available. Specifically,  FIG. 2  illustrates an exemplary method  200  when the joint distribution P S,X  is known,  FIG. 3  illustrates an exemplary method  300  when the marginal probability measure P X  is known, but not joint distribution P S,X , and  FIG. 4  illustrates an exemplary method  400  when neither the marginal probability measure P z  nor joint distribution P S,X  is known. Methods  200 ,  300  and  400  are discussed in further detail below. 
         [0028]    Method  200  starts at  205 . At step  210 , it estimates joint distribution P S,X  based on released data. At step  220 , the method is used to formulate the optimization problem. At step  230  a privacy preserving mapping based is determined, for example, as a convex problem. At step  240 , the public data of a current user is distorted, according to the determined privacy preserving mapping, before it is released at step  250 . Method  200  ends at step  299 . 
         [0029]    Method  300  starts at  305 . At step  310 , it formulates the optimization problem via maximal correlation. At step  320 , it determines a privacy preserving mapping based, for example, by using power iteration or Lanczos algorithm. At step  330 , the public data of a current user is distorted, according to the determined privacy preserving mapping, before it is released at step  340 . Method  300  ends at step  399 . 
         [0030]    Method  400  starts at  405 . At step  410 , it estimates distribution P based on released data. At step  420 , it formulates the optimization problem via maximal correlation. At step  430 , it determines a privacy preserving mapping, for example, by using power iteration or Lanczos algorithm. At step  440 , the public data of a current user is distorted, according to the determined privacy preserving mapping, before it is released at step  450 . Method  400  ends at step  499 . 
         [0031]    A privacy agent is an entity that provides privacy service to a user. A privacy agent may perform any of the following:
       receive from the user what data he deems private, what data he deems public, and what level of privacy he wants;   compute the privacy preserving mapping;   implement the privacy preserving mapping for the user (i.e., distort his data according to the mapping); and   release the distorted data, for example, to a service provider or a data collecting agency.       
 
         [0036]    The present principles can be used in a privacy agent that protects the privacy of user data.  FIG. 5  depicts a block diagram of an exemplary system  500  where a privacy agent can be used. Public users  510  release their private data (S) and/or public data (X). As discussed before, public users may release public data as is, that is, Y▪X. The information released by the public users becomes statistical information useful for a privacy agent. 
         [0037]    A privacy agent  580  includes statistics collecting module  520 , privacy preserving mapping decision module  530 , and privacy preserving module  540 . Statistics collecting module  520  may be used to collect joint distribution P S,X , marginal probability measure P X , and/or mean and covariance of public data. Statistics collecting module  520  may also receive statistics from data aggregators, such as bluekai.com. Depending on the available statistical information, privacy preserving mapping decision module  530  designs a privacy preserving mapping mechanism P Y|X . Privacy preserving module  540  distorts public data of private user  560  before it is released, according to the conditional probability P Y|X . In one embodiment, statistics collecting module  520 , privacy preserving mapping decision module  530 , and privacy preserving module  540  can be used to perform steps  110 ,  120 , and  130  in method  100 , respectively. 
         [0038]    Note that the privacy agent needs only the statistics to work without the knowledge of the entire data that was collected in the data collection module. Thus, in another embodiment, the data collection module could be a standalone module that collects data and then computes statistics, and needs not be part of the privacy agent. The data collection module shares the statistics with the privacy agent. 
         [0039]    A privacy agent sits between a user and a receiver of the user data (for example, a service provider). For example, a privacy agent may be located at a user device, for example, a computer, or a set-top box (STB). In another example, a privacy agent may be a separate entity. 
         [0040]    All the modules of a privacy agent may be located at one device, or may be distributed over different devices, for example, statistics collecting module  520  may be located at a data aggregator who only releases statistics to the module  530 , the privacy preserving mapping decision module  530 , may be located at a “privacy service provider” or at the user end on the user device connected to a module  520 , and the privacy preserving module  540  may be located at a privacy service provider, who then acts as an intermediary between the user, and the service provider to whom the user would like to release data, or at the user end on the user device. 
         [0041]    The privacy agent may provide released data to a service provider, for example, Comcast or Netflix, in order for private user  560  to improve received service based on the released data, for example, a recommendation system provides movie recommendations to a user based on its released movies rankings. 
         [0042]    In  FIG. 6 , we show that there are multiple privacy agents in the system. In different variations, there need not be privacy agents everywhere as it is not a requirement for the privacy system to work. For example, there could be only a privacy agent at the user device, or at the service provider, or at both. In  FIG. 6 , we show that the same privacy agent “C” for both Netflix and Facebook. In another embodiment, the privacy agents at Facebook and Netflix, can, but need not, be the same. 
         [0043]    Finding the privacy-preserving mapping as the solution to a convex optimization relies on the fundamental assumption that the prior distribution p A,B  that links private attributes A and data B is known and can be fed as an input to the algorithm. In practice, the true prior distribution may not be known, but may rather be estimated from a set of sample data that can be observed, for example from a set of users who do not have privacy concerns and publicly release both their attributes A and their original data B. The prior estimated based on this set of samples from non-private users is then used to design the privacy-preserving mechanism that will be applied to new users, who are concerned about their privacy. In practice, there may exist a mismatch between the estimated prior and the true prior, due for example to a small number of observable samples, or to the incompleteness of the observable data. 
         [0044]    Turning now to  FIG. 7  a method for privacy preserving in light of large data  700 . A problem of scalability that occurs when the size of the underlying alphabet of the user data is very large, for example, due to a large number of available public data items. To handle this, a quantization approach that limits the dimensionality of the problem is shown. To address this limitation, the method teaches to address the problem approximately by optimizing a much smaller set of variables. The method involves three steps. First, reducing the alphabet B into C representative examples, or clusters. Second, a privacy preserving mapping is generated using the clusters. Finally, all examples b in the input alphabet B to ̂C based on the learned mapping for C representative example of b. 
         [0045]    First, method  700  starts at step  705 . Next, all available public data is collected and gathered from all available sources  710 . The original data is then characterized  715  and clustered into a limited number of variables  720 , or clusters. The data can be clustered based on characteristics of the data which may be statistically similar for purposes of privacy mapping. For example, movies which may indicate political affiliation may be clustered together to reduce the number of variables. An analysis may be performed on each cluster to provide a weighted value, or the like, for later computational analysis. The advantage of this quantization scheme is that it is computationally efficient by reducing the number of optimized variables from being quadratic in the size of the underlying feature alphabet to being quadratic in the number of clusters, and thus making the optimization independent of the number of observable data samples. For some real world examples, this can lead to orders of magnitude reduction in dimensionality. 
         [0046]    The method is then used to determine how to distort the data in the space defined by the clusters. The data may be distorted by changing the values of one or more clusters or deleting the value of the cluster before release. The privacy-preserving mapping  725  is computed using a convex solver that minimizes privacy leakage subject to a distortion constraint. Any additional distortion introduced by quantization may increase linearly with the maximum distance between a sample data point and the closest cluster center. 
         [0047]    Distortion of the data may be repeatedly preformed until a private data point cannot be inferred above a certain threshold probability. For example, it may be statistically undesirable to be only 70% sure of a person&#39;s political affiliation. Thus, clusters or data points may be distorted until the ability to infer political affiliation is below 70% certainty. These clusters may be compared against prior data to determine inference probabilities. 
         [0048]    Data according to the privacy mapping is then released  730  as either public data or protected data. The method of  700  ends at  735 . A user may be notified of the results of the privacy mapping and may be given the option of using the privacy mapping or releasing the undistorted data. 
         [0049]    Turning now to  FIG. 8 , a method  800  for determining a privacy mapping in light of a mismatched prior is shown. The first challenge is that this method relies on knowing a joint probability distribution between the private and public data, called the prior. Often the true prior distribution is not available and instead only a limited set of samples of the private and public data can be observed. This leads to the mismatched prior problem. This method addresses this problem and seeks to provide a distortion and bring privacy even in the face of a mismatched prior. Our first contribution centers around starting with the set of observable data samples, we find an improved estimate of the prior, based on which the privacy-preserving mapping is derived. We develop some bounds on any additional distortion this process incurs to guarantee a given level of privacy. More precisely, we show that the private information leakage increases log-linearly with the L1-norm distance between our estimate and the prior; that the distortion rate increases linearly with the L1-norm distance between our estimate and the prior; and that the L1-norm distance between our estimate and the prior decreases as the sample size increases. 
         [0050]    Suppose that there is not perfect knowledge of the true prior distribution p A,B  but that there is an estimate q A,B . Then, if q A,B  is a good estimate of p A,B , the solution p* ̂B|B  obtained by feeding the mismatched distribution q A,B  as an input to the optimization problem should be close to the one with p A,B . In particular, the information leakage J(q A,B , p* ̂B|B ) and distortion due to the mapping p* ̂B|B , with respect to the mismatched prior q A,B  should be similar to the actual leakage J(p A,B , p* ̂B|B ) and distortion with respect to the true prior p A,B . This claim is formalized in the following theorem. 
         [0000]    
       
         
           
             Theorem 
              
             
                 
             
              
             1. 
           
         
       
       
         
           
             Let 
              
             
                 
             
              
             
               p 
               
                 
                   B 
                   ^ 
                 
                  
                 B 
               
               * 
             
              
             
                 
             
              
             be 
              
             
                 
             
              
             a 
              
             
                 
             
              
             solution 
              
             
                 
             
              
             to 
              
             
                 
             
              
             the 
              
             
                 
             
              
             optimization 
              
             
                 
             
              
             problem 
              
             
                 
             
              
             
               ( 
               6 
               ) 
             
              
             
                 
             
              
             with 
              
             
                 
             
              
             
               
                 q 
                 
                   A 
                   , 
                   B 
                 
               
               . 
               
                   
               
                
               Then 
             
              
             
               : 
             
           
         
       
       
         
           
             
                
               
                 
                   J 
                    
                   
                     ( 
                     
                       
                         p 
                         
                           A 
                           , 
                           B 
                         
                       
                       , 
                       
                         p 
                         
                           
                             B 
                             ^ 
                           
                            
                           B 
                         
                         * 
                       
                     
                     ) 
                   
                 
                 - 
                 
                   J 
                    
                   
                     ( 
                     
                       
                         q 
                         
                           A 
                           , 
                           B 
                         
                       
                       , 
                       
                         p 
                         
                           
                             B 
                             ^ 
                           
                            
                           B 
                         
                         * 
                       
                     
                     ) 
                   
                 
               
                
             
             ≤ 
             
               3 
                
               
                 
                    
                   
                     
                       p 
                       
                         A 
                         , 
                         B 
                       
                     
                     - 
                     
                       q 
                       
                         A 
                         , 
                         B 
                       
                     
                   
                    
                 
                 1 
               
                
               
                   
               
                
               log 
                
               
                 
                   
                      
                      
                      
                   
                    
                   
                       
                   
                    
                   
                      
                     ℬ 
                      
                   
                 
                 
                   
                      
                     
                       
                         p 
                         
                           A 
                           , 
                           B 
                         
                       
                       - 
                       
                         q 
                         
                           A 
                           , 
                           B 
                         
                       
                     
                      
                   
                   1 
                 
               
             
           
         
       
       
         
           
             
               
                  
                 
                   P 
                   
                     
                       n 
                       ~ 
                     
                     , 
                     n 
                   
                 
               
                
               
                 [ 
                 
                   d 
                    
                   
                     ( 
                     
                       
                         B 
                         ^ 
                       
                       , 
                       B 
                     
                     ) 
                   
                 
                 ] 
               
             
             ≤ 
             
               Δ 
               + 
               
                 
                   d 
                   max 
                 
                  
                 
                   
                      
                     
                       
                         p 
                         
                           A 
                           , 
                           B 
                         
                       
                       - 
                       
                         q 
                         
                           A 
                           , 
                           B 
                         
                       
                     
                      
                   
                   1 
                 
               
             
           
         
       
       
         
           
             
               where 
                
               
                   
               
                
               
                 d 
                 max 
               
             
             = 
             
               
                 max 
                 
                   
                     b 
                     ^ 
                   
                   , 
                   b 
                 
               
                
               
                 
                   d 
                    
                   
                     ( 
                     
                       
                         b 
                         ^ 
                       
                       , 
                       b 
                     
                     ) 
                   
                 
                  
                 
                     
                 
                  
                 is 
                  
                 
                     
                 
                  
                 the 
                  
                 
                     
                 
                  
                 maximum 
                  
                 
                     
                 
                  
                 distance 
                  
                 
                     
                 
                  
                 in 
                  
                 
                     
                 
                  
                 the 
                  
                 
                     
                 
                  
                 feature 
                  
                 
                     
                 
                  
                 
                   space 
                   . 
                 
               
             
           
         
       
     
         [0051]    The following lemma, which bounds the difference in the entropies of two distributions, will be useful in the proof of Theorem  1 . 
         [0000]    
       
         
           
             Lemma 
              
             
                 
             
              
             1. 
           
         
       
       
         
           
             
               Let 
                
               
                   
               
                
               p 
                
               
                   
               
                
               and 
                
               
                   
               
                
               q 
                
               
                   
               
                
               be 
                
               
                   
               
                
               distributions 
                
               
                   
               
                
               with 
                
               
                   
               
                
               the 
                
               
                   
               
                
               same 
                
               
                   
               
                
               support 
                
               
                   
               
                
                
                
               
                   
               
                
               such 
                
               
                   
               
                
               that 
                
               
                   
               
                
               
                 
                    
                   
                     p 
                     - 
                     q 
                   
                    
                 
                 1 
               
             
             ≤ 
             
               
                 
                   1 
                   2 
                 
                 . 
                 
                     
                 
                  
                 Then 
               
                
               
                 : 
               
             
           
         
       
       
         
           
             
                
               
                 
                   H 
                    
                   
                     ( 
                     p 
                     ) 
                   
                 
                 - 
                 
                   H 
                    
                   
                     ( 
                     q 
                     ) 
                   
                 
               
                
             
             ≤ 
             
               
                 
                    
                   
                     p 
                     - 
                     q 
                   
                    
                 
                 1 
               
                
               
                   
               
                
               log 
                
               
                 
                   
                      
                      
                      
                   
                   
                     
                        
                       
                         p 
                         - 
                         q 
                       
                        
                     
                     1 
                   
                 
                 . 
               
             
           
         
       
     
         [0052]    Based on this claim, we can bound the L1-norm error between p A,B  and q A,B  as follows: 
         [0000]    
       
         
           
             
               
                 
                    
                   
                     
                       p 
                       
                         A 
                         , 
                         
                           B 
                           ^ 
                         
                       
                     
                     - 
                     
                       q 
                       
                         A 
                         , 
                         
                           B 
                           ^ 
                         
                       
                     
                   
                    
                 
                 1 
               
               ≤ 
               
                 
                   
                     
                        
                        
                        
                     
                      
                     
                         
                     
                      
                     
                        
                       ℬ 
                        
                     
                   
                 
                  
                 
                   
                      
                     
                       
                         p 
                         
                           A 
                           , 
                           
                             B 
                             ^ 
                           
                         
                       
                       - 
                       
                         q 
                         
                           A 
                           , 
                           
                             B 
                             ^ 
                           
                         
                       
                     
                      
                   
                   2 
                 
               
             
             = 
             
               
                  
                  
                  
               
                
               
                   
               
                
               
                  
                 ℬ 
                  
               
                
               
                   
               
                
               
                 
                   O 
                   ( 
                   
                     n 
                     
                       
                         - 
                         2 
                       
                       
                         d 
                         + 
                         4 
                       
                     
                   
                   ) 
                 
                 . 
               
             
           
         
       
     
         [0053]    Therefore, as the sample size n increases, the L1-norm ∥p A,B −q A,B ∥ error decreases to zero at the rate of 
         [0000]    
       
         
           
             
               ( 
               
                 n 
                 
                   
                     - 
                     2 
                   
                   
                     d 
                     + 
                     4 
                   
                 
               
               ) 
             
             . 
           
         
       
     
         [0054]    The method of  800  starts at  805 . The method first estimates a prior from data of non private users who publish both private and public data. This information may be taken from publically available sources or may be generated through user input in surveys or the like. Some of this data may be insufficient if not enough samples can be attained or if some users provide incomplete data resulting from missing entries. This problems may be compensated for if a larger number of user data is acquired. However, these insufficiencies may lead to a mismatch between a true prior and the estimated prior. Thus, the estimated prior may not provide completely reliable results when applied to the complex solver. 
         [0055]    Next, public data is collected on the user  815 . This data is quantized  820  by comparing the user data to the estimated prior. The private data of the user is then inferred as a result of the comparison and the determination of the representative prior data. A privacy preserving mapping is then determined  825 . The data is distorted according to the privacy preserving mapping and then released to the public as either public data or protected data  830 . The method ends at  835 . 
         [0056]    With a estimated prior being used to generate the estimate the system may determining the distortion between the estimate and the mismatched prior. If the distortion exceeds an acceptable level, additional records must be added to the mismatched prior to decrease the distortion. 
         [0057]    As described herein, the present invention provides an architecture and protocol for enabling privacy preserving mapping of public data. While this invention has been described as having a preferred design, the present invention can be further modified within the spirit and scope of this disclosure. This application is therefore intended to cover any variations, uses, or adaptations of the invention using its general principles. Further, this application is intended to cover such departures from the present disclosure as come within known or customary practice in the art to which this invention pertains and which fall within the limits of the appended claims.