Sciweavers

3130 search results - page 83 / 626
» Collusion without communication
Sort
View
DASFAA
2004
IEEE
125views Database» more  DASFAA 2004»
15 years 9 months ago
Reducing Communication Cost in a Privacy Preserving Distributed Association Rule Mining
Data mining is a process that analyzes voluminous digital data in order to discover hidden but useful patterns from digital data. However, discovery of such hidden patterns has sta...
Mafruz Zaman Ashrafi, David Taniar, Kate A. Smith
CORR
2010
Springer
65views Education» more  CORR 2010»
15 years 5 months ago
On Unconditionally Secure Computation with Vanishing Communication Cost
We propose a novel distortion-theoretic approach to a secure three-party computation problem. Alice and Bob have deterministic sequences, and Charlie wishes to compute a normalize...
Ye Wang, Shantanu Rane, Wei Sun, Prakash Ishwar
CCR
2011
15 years 4 days ago
The politecast communication primitive for low-power wireless
ion can improve performance without significantly breaking layered abstractions; explicit bursts are preferable to steady, constant bitrate traffic. Furthermore, the vagaries and c...
Marcus Lundén, Adam Dunkels
TDP
2010
166views more  TDP 2010»
14 years 12 months ago
Communication-Efficient Privacy-Preserving Clustering
The ability to store vast quantities of data and the emergence of high speed networking have led to intense interest in distributed data mining. However, privacy concerns, as well ...
Geetha Jagannathan, Krishnan Pillaipakkamnatt, Reb...
IACR
2011
196views more  IACR 2011»
14 years 4 months ago
Multiparty Computation with Low Communication, Computation and Interaction via Threshold FHE
Fully homomorphic encryption (FHE) provides a simple template for secure computation between two parties (Alice and Bob) where: (I) Alice encrypts her input under her key, (II) Bo...
Gilad Asharov, Abhishek Jain, Daniel Wichs