Sciweavers

251 search results - page 37 / 51
» On privacy preservation against adversarial data mining
Sort
View
ESORICS
2007
Springer
14 years 1 months ago
Synthesizing Secure Protocols
Abstract. We propose a general transformation that maps a cryptographic protocol that is secure in an extremely weak sense (essentially in a model where no adversary is present) in...
Véronique Cortier, Bogdan Warinschi, Eugen ...
COMPSAC
2005
IEEE
13 years 9 months ago
A Novel Method for Protecting Sensitive Knowledge in Association Rules Mining
Discovering frequent patterns from huge amounts of data is one of the most studied problems in data mining. However, some sensitive patterns with security policies may cause a thr...
En Tzu Wang, Guanling Lee, Yu Tzu Lin
VLDB
2007
ACM
137views Database» more  VLDB 2007»
14 years 7 months ago
Fast Data Anonymization with Low Information Loss
Recent research studied the problem of publishing microdata without revealing sensitive information, leading to the privacy preserving paradigms of k-anonymity and -diversity. k-a...
Gabriel Ghinita, Panagiotis Karras, Panos Kalnis, ...
CCS
2009
ACM
14 years 2 months ago
HAIL: a high-availability and integrity layer for cloud storage
We introduce HAIL (High-Availability and Integrity Layer), a distributed cryptographic system that allows a set of servers to prove to a client that a stored file is intact and r...
Kevin D. Bowers, Ari Juels, Alina Oprea
PVLDB
2010
95views more  PVLDB 2010»
13 years 6 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