Sciweavers

38 search results - page 2 / 8
» Scalar-product based Secure Two-party Computation
Sort
View
CTRSA
2008
Springer
134views Cryptology» more  CTRSA 2008»
13 years 6 months ago
An Efficient Protocol for Fair Secure Two-Party Computation
In the 1980s, Yao presented a very efficient constant-round secure two-party computation protocol withstanding semi-honest adversaries, which is based on so-called garbled circuits...
Mehmet S. Kiraz, Berry Schoenmakers
EUROCRYPT
2003
Springer
13 years 10 months ago
Fair Secure Two-Party Computation
Abstract Benny Pinkas HP Labs Abstract. We demonstrate a transformation of Yao’s protocol for secure two-party computation to a fair protocol in which neither party gains any sub...
Benny Pinkas
ICISC
2004
173views Cryptology» more  ICISC 2004»
13 years 6 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...
CTRSA
2009
Springer
179views Cryptology» more  CTRSA 2009»
13 years 11 months ago
Adaptively Secure Two-Party Computation with Erasures
In the setting of multiparty computation a set of parties with private inputs wish to compute some joint function of their inputs, whilst preserving certain security properties (l...
Andrew Y. Lindell
CRYPTO
2004
Springer
120views Cryptology» more  CRYPTO 2004»
13 years 10 months ago
Round-Optimal Secure Two-Party Computation
Abstract. We consider the central cryptographic task of secure twoparty computation, where two parties wish to compute some function of their private inputs (each receiving possibl...
Jonathan Katz, Rafail Ostrovsky