164 search results - page 18 / 33 » Covert two-party computation |
162
click to vote
GIS
2006
ACM
15 years 6 months ago
2006
ACM
The paper is written jointly by two parties, computer scientists specializing in geovisualization and experts in forestry, who cooperated within a joint project. The authors tell ...
175
click to vote
ICDE
2011
IEEE
14 years 9 months ago
2011
IEEE
— A moving kNN query continuously reports the k nearest neighbors of a moving query point. In addition to the query result, a service provider that evaluates moving queries often...
151
click to vote
CRYPTO
2009
Springer
16 years 16 days ago
2009
Springer
Collusion-free protocols prevent subliminal communication (i.e., covert channels) between parties running the protocol. In the standard communication model, if one-way functions ex...
191
click to vote
PKC
2010
Springer
15 years 10 months ago
2010
Springer
In many practical settings, participants are willing to deviate from the protocol only if they remain undetected. Aumann and Lindell introduced a concept of covert adversaries to f...
188
click to vote
AC
1998
Springer
15 years 10 months ago
1998
Springer
Abstract. In 1982, Bennett and Brassard suggested a new way to provide privacy in long distance communications with security based on the correctness of the basic principles of qua...