Sciweavers

164 search results - page 22 / 33
» Covert two-party computation
Sort
View
EUROCRYPT
2004
Springer
14 years 1 months ago
Efficient Private Matching and Set Intersection
We consider the problem of computing the intersection of private datasets of two parties, where the datasets contain lists of elements taken from a large domain. This problem has m...
Michael J. Freedman, Kobbi Nissim, Benny Pinkas
SDM
2004
SIAM
242views Data Mining» more  SDM 2004»
13 years 11 months ago
Privacy-Preserving Multivariate Statistical Analysis: Linear Regression and Classification
Multivariate statistical analysis is an important data analysis technique that has found applications in various areas. In this paper, we study some multivariate statistical analy...
Wenliang Du, Yunghsiang S. Han, Shigang Chen
ACL
1998
13 years 11 months ago
Exploring the Characteristics of Multi-Party Dialogues
This paper describes novel results on the characteristics of three-party dialogues by quantitatively comparing them with those of two-party. In previous dialogue research, two-par...
Masato Ishizaki, Tsuneaki Kato
WISEC
2010
ACM
14 years 4 months ago
Timing-based localization of in-band wormhole tunnels in MANETs
The problem of localizing in-band wormhole tunnels in MANETs is considered. In an in-band wormhole attack, colluding attackers use a covert tunnel to create the illusion that two ...
Jinsub Kim, Dan Sterne, Rommie Hardy, Roshan K. Th...
ACSAC
2002
IEEE
14 years 2 months ago
A Practical Approach to Identifying Storage and Timing Channels: Twenty Years Later
Secure computer systems use both mandatory and discretionary access controls to restrict the flow of information through legitimate communication channels such as files, shared ...
Richard A. Kemmerer