Sciweavers

42 search results - page 4 / 9
» Semi-homomorphic Encryption and Multiparty Computation
Sort
View
ICASSP
2011
IEEE
12 years 9 months ago
Efficiently computing private recommendations
Online recommender systems enable personalized service to users. The underlying collaborative filtering techniques operate on privacy sensitive user data, which could be misused ...
Zekeriya Erkin, M. Beye, T. Veugen, Reginald L. La...
CSE
2009
IEEE
14 years 24 days ago
Privacy-Preserving Multi-agent Constraint Satisfaction
—Constraint satisfaction has been a very successful paradigm for solving problems such as resource allocation and planning. Many of these problems pose themselves in a context in...
Thomas Léauté, Boi Faltings
PROVSEC
2009
Springer
14 years 18 days ago
GUC-Secure Set-Intersection Computation
Secure set-intersection computation is one of important problems in secure multiparty computation with various applications. We propose a general construction for secure 2-party se...
Yuan Tian, Hao Zhang
CORR
2010
Springer
144views Education» more  CORR 2010»
13 years 6 months ago
Privacy-Preserving Protocols for Eigenvector Computation
Abstract. In this paper, we present a protocol for computing the principal eigenvector of a collection of data matrices belonging to multiple semi-honest parties with privacy const...
Manas A. Pathak, Bhiksha Raj
ASIACRYPT
2009
Springer
14 years 19 days ago
Secure Two-Party Computation Is Practical
Abstract. Secure multi-party computation has been considered by the cryptographic community for a number of years. Until recently it has been a purely theoretical area, with few im...
Benny Pinkas, Thomas Schneider, Nigel P. Smart, St...