Sciweavers

11 search results - page 1 / 3
» Small Domain Randomization: Same Privacy, More Utility
Sort
View
PVLDB
2010
95views more  PVLDB 2010»
13 years 3 months ago
Small Domain Randomization: Same Privacy, More Utility
Random perturbation is a promising technique for privacy preserving data mining. It retains an original sensitive value with a certain probability and replaces it with a random va...
Rhonda Chaytor, Ke Wang
ACSC
2008
IEEE
13 years 11 months ago
Privacy preserving set intersection based on bilinear groups
We propose a more efficient privacy preserving set intersection protocol which improves the previously known result by a factor of O(N) in both the computation and communication c...
Yingpeng Sang, Hong Shen
STOC
2009
ACM
167views Algorithms» more  STOC 2009»
14 years 5 months ago
Universally utility-maximizing privacy mechanisms
A mechanism for releasing information about a statistical database with sensitive data must resolve a trade-off between utility and privacy. Publishing fully accurate information ...
Arpita Ghosh, Tim Roughgarden, Mukund Sundararajan
SDM
2008
SIAM
177views Data Mining» more  SDM 2008»
13 years 6 months ago
Practical Private Computation and Zero-Knowledge Tools for Privacy-Preserving Distributed Data Mining
In this paper we explore private computation built on vector addition and its applications in privacypreserving data mining. Vector addition is a surprisingly general tool for imp...
Yitao Duan, John F. Canny
JAIR
2010
139views more  JAIR 2010»
13 years 3 months ago
Multiattribute Auctions Based on Generalized Additive Independence
We develop multiattribute auctions that accommodate generalized additive independent (GAI) preferences. We propose an iterative auction mechanism that maintains prices on potentia...
Yagil Engel, Michael P. Wellman