Sciweavers

38 search results - page 4 / 8
» Scalar-product based Secure Two-party Computation
Sort
View
SIGMOD
2009
ACM
197views Database» more  SIGMOD 2009»
14 years 6 months ago
Secure kNN computation on encrypted databases
Service providers like Google and Amazon are moving into the SaaS (Software as a Service) business. They turn their huge infrastructure into a cloud-computing environment and aggr...
Wai Kit Wong, David Wai-Lok Cheung, Ben Kao, Nikos...
IACR
2011
196views more  IACR 2011»
12 years 5 months ago
Multiparty Computation with Low Communication, Computation and Interaction via Threshold FHE
Fully homomorphic encryption (FHE) provides a simple template for secure computation between two parties (Alice and Bob) where: (I) Alice encrypts her input under her key, (II) Bo...
Gilad Asharov, Abhishek Jain, Daniel Wichs
ICDE
2009
IEEE
168views Database» more  ICDE 2009»
14 years 7 months ago
Privacy-Preserving Singular Value Decomposition
Abstract-- In this paper, we propose secure protocols to perform Singular Value Decomposition (SVD) for two parties over horizontally and vertically partitioned data. We propose va...
Shuguo Han, Wee Keong Ng, Philip S. Yu
CIS
2004
Springer
13 years 11 months ago
General Public Key m-Out-of-n Oblivious Transfer
Abstract. In the m-out-of-n oblivious transfer model, Alice has n messages, Bob has m choices. After the interaction between the two parties, Bob can get m but only m messages from...
Zhide Chen, Hong Zhu
TIFS
2010
186views more  TIFS 2010»
13 years 4 months ago
An abuse-free fair contract-signing protocol based on the RSA signature
A fair contract signing protocol allows two potentially mistrusted parities to exchange their commitments (i.e., digital signatures) to an agreed contract over the Internet in a f...
Guilin Wang