Sciweavers

321 search results - page 28 / 65
» Secure Multiparty Computation of Approximations
Sort
View
ISI
2007
Springer
13 years 10 months ago
Privacy Preserving Collaborative Data Mining
Privacy-preserving data mining is an important issue in the areas of data mining and security. In this paper, we study how to conduct association rule mining, one of the core data...
Justin Z. Zhan
CRYPTO
2005
Springer
116views Cryptology» more  CRYPTO 2005»
14 years 4 months ago
New Monotones and Lower Bounds in Unconditional Two-Party Computation
Since bit and string oblivious transfer and commitment, two primitives of paramount importance in secure two- and multi-party computation, cannot be realized in an unconditionally ...
Stefan Wolf, Jürg Wullschleger
ASIACRYPT
2007
Springer
14 years 4 months ago
Secure Protocols with Asymmetric Trust
Abstract. In the standard general-adversary model for multi-party protocols, a global adversary structure is given, and every party must trust in this particular structure. We intr...
Ivan Damgård, Yvo Desmedt, Matthias Fitzi, J...
COCO
2007
Springer
85views Algorithms» more  COCO 2007»
14 years 4 months ago
Norms, XOR Lemmas, and Lower Bounds for GF(2) Polynomials and Multiparty Protocols
This paper presents a unified and simple treatment of basic questions concerning two computational models: multiparty communication complexity and GF(2) polynomials. The key is t...
Emanuele Viola, Avi Wigderson
ESORICS
2008
Springer
14 years 13 days ago
Sharemind: A Framework for Fast Privacy-Preserving Computations
Gathering and processing sensitive data is a difficult task. In fact, there is no common recipe for building the necessary information systems. In this paper, we present a provably...
Dan Bogdanov, Sven Laur, Jan Willemson