Sciweavers

562 search results - page 10 / 113
» Secure Multiparty Computation with General Interaction Patte...
Sort
View
SDM
2008
SIAM
135views Data Mining» more  SDM 2008»
15 years 5 months ago
Preemptive Measures against Malicious Party in Privacy-Preserving Data Mining
Currently, many privacy-preserving data mining (PPDM) algorithms assume the semi-honest model and/or malicious model of multi-party interaction. However, both models are far from ...
Shuguo Han, Wee Keong Ng
106
Voted
SDM
2009
SIAM
149views Data Mining» more  SDM 2009»
16 years 28 days ago
Speeding Up Secure Computations via Embedded Caching.
Most existing work on Privacy-Preserving Data Mining (PPDM) focus on enabling conventional data mining algorithms with the ability to run in a secure manner in a multi-party setti...
K. Zhai, W. K. Ng, A. R. Herianto, S. Han
149
Voted
STOC
2004
ACM
117views Algorithms» more  STOC 2004»
16 years 4 months ago
New notions of security: achieving universal composability without trusted setup
We propose a modification to the framework of Universally Composable (UC) security [3]. Our new notion, involves comparing the protocol executions with an ideal execution involvin...
Manoj Prabhakaran, Amit Sahai
153
Voted
JOC
2007
84views more  JOC 2007»
15 years 3 months ago
Concurrent Composition of Secure Protocols in the Timing Model
In the setting of secure multiparty computation, a set of mutually distrustful parties wish to securely compute some joint function of their inputs. In the stand-alone case, it ha...
Yael Tauman Kalai, Yehuda Lindell, Manoj Prabhakar...
146
Voted
ICFEM
2005
Springer
15 years 9 months ago
A Compositional Framework for Service Interaction Patterns and Interaction Flows
We provide precise high-level models for eight fundamental service interaction patterns, together with schemes for their composition into complex service-based business process int...
Alistair P. Barros, Egon Börger