Sciweavers

175 search results - page 28 / 35
» Chosen-Ciphertext Security of Multiple Encryption
Sort
View
TCC
2009
Springer
184views Cryptology» more  TCC 2009»
16 years 3 months ago
Secure Arithmetic Computation with No Honest Majority
We study the complexity of securely evaluating arithmetic circuits over finite rings. This question is motivated by natural secure computation tasks. Focusing mainly on the case o...
Yuval Ishai, Manoj Prabhakaran, Amit Sahai
110
Voted
FC
2004
Springer
105views Cryptology» more  FC 2004»
15 years 8 months ago
Secure Generalized Vickrey Auction without Third-party Servers
This paper presents a secure Generalized Vickrey Auction (GVA) scheme that does not require third-party servers, i.e., the scheme is executed only by an auctioneer and bidders. Com...
Makoto Yokoo, Koutarou Suzuki
137
Voted
CSE
2009
IEEE
15 years 9 months 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
155
Voted
ICISC
2004
173views Cryptology» more  ICISC 2004»
15 years 4 months ago
On Private Scalar Product Computation for Privacy-Preserving Data Mining
In mining and integrating data from multiple sources, there are many privacy and security issues. In several different contexts, the security of the full privacy-preserving data mi...
Bart Goethals, Sven Laur, Helger Lipmaa, Taneli Mi...
137
Voted
CORR
2010
Springer
144views Education» more  CORR 2010»
15 years 2 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