Sciweavers

860 search results - page 7 / 172
» Completeness in two-party secure computation: a computationa...
Sort
View
STOC
2004
ACM
94views Algorithms» more  STOC 2004»
15 years 10 months ago
Completeness in two-party secure computation: a computational view
Danny Harnik, Moni Naor, Omer Reingold, Alon Rosen
CCS
2000
ACM
15 years 1 months ago
PRUNES: an efficient and complete strategy for automated trust negotiation over the Internet
The Internet provides an environment where two parties, who are virtually strangers to each other, can make connections and do business together. Before any actual business starts...
Ting Yu, Xiaosong Ma, Marianne Winslett
GRC
2008
IEEE
14 years 10 months ago
Scalar-product based Secure Two-party Computation
—Secure multiparty computation is a very important research topic in cryptography. A secure multi-party computation involves N untrusful parties. It takes input xi from the ith p...
Chih-Hao Shen, Justin Zhan, Tsan-sheng Hsu, Churn-...
WPES
2003
ACM
15 years 3 months ago
Leveraging the "Multi" in secure multi-party computation
Secure Multi-Party Computation enables parties with private data to collaboratively compute a global function of their private data, without revealing that data. The increase in s...
Jaideep Vaidya, Chris Clifton
ACNS
2009
Springer
162views Cryptology» more  ACNS 2009»
15 years 4 months ago
Secure Hamming Distance Based Computation and Its Applications
Abstract. This paper examines secure two-party computation of functions which depend only on the Hamming distance of the inputs of the two parties. We present efficient protocols f...
Ayman Jarrous, Benny Pinkas