Sciweavers

310 search results - page 9 / 62
» An Efficient Protocol for Fair Secure Two-Party Computation
Sort
View
ACNS
2009
Springer
162views Cryptology» more  ACNS 2009»
14 years 3 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
ISCN
2006
IEEE
14 years 2 months ago
An optimistic fair e-commerce protocol for large e-goods
Suppose two entities that do not trust each other want to exchange some arbitrary data over a public channel. A fair exchange protocol ensures that both parties get what they want ...
Cagil Can Oniz, Erkay Savas, Albert Levi
CSI
2008
82views more  CSI 2008»
13 years 8 months ago
Efficient and secure protocol in fair document exchange
This paper presents a new fair document exchange protocol based on bilinear pairing with off-line trusted third party (TTP). In such a fair exchange scenario, each party owns a va...
Xiaohui Liang, Zhenfu Cao, Rongxing Lu, Liuquan Qi...
TDP
2010
166views more  TDP 2010»
13 years 3 months ago
Communication-Efficient Privacy-Preserving Clustering
The ability to store vast quantities of data and the emergence of high speed networking have led to intense interest in distributed data mining. However, privacy concerns, as well ...
Geetha Jagannathan, Krishnan Pillaipakkamnatt, Reb...
ICDE
2009
IEEE
168views Database» more  ICDE 2009»
14 years 10 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