Sciweavers

80 search results - page 9 / 16
» Zero-knowledge from secure multiparty computation
Sort
View
SIAMCOMP
2011
13 years 5 months ago
Black-Box Constructions of Protocols for Secure Computation
In this paper, we study the question of whether or not it is possible to construct protocols for general secure computation in the setting of malicious adversaries and no honest m...
Iftach Haitner, Yuval Ishai, Eyal Kushilevitz, Yeh...
ICDM
2010
IEEE
160views Data Mining» more  ICDM 2010»
13 years 8 months ago
A Privacy Preserving Framework for Gaussian Mixture Models
Abstract--This paper presents a framework for privacypreserving Gaussian Mixture Model computations. Specifically, we consider a scenario where a central service wants to learn the...
Madhusudana Shashanka
ESAS
2007
Springer
14 years 2 months ago
The Candidate Key Protocol for Generating Secret Shared Keys from Similar Sensor Data Streams
Secure communication over wireless channels necessitates authentication of communication partners to prevent man-in-the-middle attacks. For spontaneous interaction between independ...
Rene Mayrhofer
EUROCRYPT
2008
Springer
14 years 4 days ago
New Constructions for UC Secure Computation Using Tamper-Proof Hardware
The Universal Composability framework was introduced by Canetti to study the security of protocols which are concurrently executed with other protocols in a network environment. U...
Nishanth Chandran, Vipul Goyal, Amit Sahai
TCC
2010
Springer
169views Cryptology» more  TCC 2010»
14 years 7 months ago
On Complete Primitives for Fairness
Abstract. For secure two-party and multi-party computation with abort, classification of which primitives are complete has been extensively studied in the literature. However, for...
S. Dov Gordon, Yuval Ishai, Tal Moran, Rafail Ostr...