Sciweavers

521 search results - page 22 / 105
» Scalable Secure Multiparty Computation
Sort
View
STOC
2004
ACM
117views Algorithms» more  STOC 2004»
14 years 8 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
ICICS
2009
Springer
14 years 2 months ago
GUC-Secure Join Operator in Distributed Relational Database
Privacy-preserving SQL computation in distributed relational database is one of important applications of secure multiparty computation. In contrast with comparatively more works o...
Yuan Tian, Hao Zhang
ICDM
2006
IEEE
131views Data Mining» more  ICDM 2006»
14 years 1 months ago
Transforming Semi-Honest Protocols to Ensure Accountability
The secure multi-party computation (SMC) model provides means for balancing the use and confidentiality of distributed data. This is especially important in the field of privacy...
Wei Jiang, Chris Clifton
VLDB
2006
ACM
122views Database» more  VLDB 2006»
14 years 8 months ago
A secure distributed framework for achieving k-anonymity
k-anonymity provides a measure of privacy protection by preventing re-identification of data to fewer than a group of k data items. While algorithms exist for producing k-anonymous...
Wei Jiang, Chris Clifton
PKDD
2007
Springer
214views Data Mining» more  PKDD 2007»
14 years 2 months ago
Multi-party, Privacy-Preserving Distributed Data Mining Using a Game Theoretic Framework
Abstract. Analysis of privacy-sensitive data in a multi-party environment often assumes that the parties are well-behaved and they abide by the protocols. Parties compute whatever ...
Hillol Kargupta, Kamalika Das, Kun Liu