### Citations

405 | On the design and quantification of privacy preserving data mining algorithms
- AGRAWAL, AGGARWAL
(Show Context)
Citation Context ...n submit their randomized data to the miner who can later reconstruct some useful information. Different random perturbation methods have been proposed and applied in different data mining algorithms =-=[9, 5, 42, 90, 41, 38]-=-. Randomization approaches are very efficient, but in general they can induce a tradeoff between privacy of respondents and accuracy of the data mining result: the more privacy each respondent has, th... |

404 | Security-Control Methods for Statistical Databases
- Adam, Wortmann
- 1989
(Show Context)
Citation Context ...s. In statistical databases, it has been studied how to protect individual privacy while allowing information sharing. There is an array of literature on privacy in statistical databases (see surveys =-=[4, 95]-=-). Proposed methods can be categorized into query restriction (e.g., [63, 28]) and data perturbation (e.g., [88, 102, 13, 3]). In particular, the tradeoff between privacy and utility in statistical da... |

263 | Information Sharing Across Private Databases
- Agrawal, Evfimievski, et al.
(Show Context)
Citation Context ...network parameters [78]. Privacy-preserving primitives for simple statistical computations are very useful for designing privacy-preserving distributed data mining algorithms: finding common elements =-=[44, 6]-=-, scalar product [21, 12, 103, 98, 44, 48], and computing correlation matrices [76]. The field of distributed data mining provides distributed data mining algorithms for different applications [71, 97... |

245 | Y.: Hippocratic databases
- Agrawal, Kiernan, et al.
- 2002
(Show Context)
Citation Context ...[1, 2]. By considering different privacy policies for different data records, Hippocratic databases combine privacy policies with sensitive to prevent unauthorized users from accessing sensitive data =-=[7]-=-. With data stored in an encrypted form, a crucial question is how to perform queries. Hacigumus et al. [56] studied querying encrypted data in the database-as-service (DAS) model where sensitive data... |

196 | Order preserving encryption for numeric data
- Agrawal, Kiernan, et al.
(Show Context)
Citation Context ...s. In comparison, we give a solution that speeds up queries using metadata and that metadata does not introduce any additional information leakage. For range queries on numerical data, Agrawal et al. =-=[8]-=- propose a solution which allows convenient indexing. Their solution is built on an encoding which preserves the order of the numerical data in each column. Consequently, if a database intruder observ... |

187 |
Privacy preserving data mining
- Agrawal, Srikant
(Show Context)
Citation Context ...ptographic techniques to provide secure solutions in distributed settings [75]. The other approach randomizes the original data such that the underlying patterns are still kept in the randomized data =-=[9]-=-. In Chapter 6, we provide a privacy-preserving distributed solution for a particular data mining algorithm—Bayesian network learning. Our solution enables learning of Bayesian networks on the combina... |

123 | Priced oblivious transfer: How to sell digital goods
- Aiello, Ishai, et al.
- 2001
(Show Context)
Citation Context ...ic group mentioned above is of a prime order, it follows that σ (i,i′ ) j = (s (i) j /s(i′ ) j ) e i,i ′ ,j, (5.4.0.1) where ei,i ′ ,j is a uniformly random exponent. This technique was first used in =-=[11]-=-. Equation (5.4.0.1) holds because, if s (i) j �= s (i′ ) j , then s (i) j /s(i′ ) j �= 1. Any element of a prime-order cyclic group not equal to 1 is a generator; and a generator raised to a uniforml... |

19 | K-anonymous message transmission
- Ahn, Bortz, et al.
- 2003
(Show Context)
Citation Context ... nontrivial task. General-purpose ways to build anonymous channels include mix networks [23, 85, 91, 65, 54], dining cryptographer networks (DC-nets) [24, 107, 53] and kanonymous message transmission =-=[10]-=-, all of which are still under active study. Compared with mix networks, our methods can be viewed as a (nontrivial) application of certain techniques in their design to the scenario of distributed da... |

15 | The effectiveness of output modification by rounding for protection of statistical databases - Achugbue, Chin - 1979 |