186 search results - page 22 / 38 » Secure Association Rule Sharing |
KDD
2004
ACM
14 years 7 months ago
2004
ACM
Secure multiparty computation allows parties to jointly compute a function of their private inputs without revealing anything but the output. Theoretical results [2] provide a gen...
EUROISI
2008
13 years 9 months ago
2008
The tragic events of September 11th have caused drastic effects on many aspects of society. Academics in the fields of computational and information science have been called upon ...
CORR
2007
Springer
13 years 7 months ago
2007
Springer
An analysis of steganographic systems subject to the following perfect undetectability condition is presented in this paper. Following embedding of the message into the covertext,...
TKDE
2002
13 years 7 months ago
2002
Database systems for real-time applications must satisfy timing constraints associated with transactions. Typically, a timing constraint is expressed in the form of a deadline and ...
CRYPTO
2007
Springer
14 years 1 months ago
2007
Springer
Abstract. We study the natural problem of secure n-party computation (in the passive, computationally unbounded attack model) of the n-product function fG(x1, . . . , xn) = x1 · x...