Sciweavers

164 search results - page 18 / 33
» Covert two-party computation
Sort
View
GIS
2006
ACM
13 years 9 months ago
Reactions to geovisualization: an experience from a European project
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 ...
Gennady L. Andrienko, Natalia V. Andrienko, Richar...
ICDE
2011
IEEE
271views Database» more  ICDE 2011»
13 years 1 months ago
Authentication of moving kNN queries
— 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...
Man Lung Yiu, Eric Lo, Duncan Yung
CRYPTO
2009
Springer
121views Cryptology» more  CRYPTO 2009»
14 years 4 months ago
Collusion-Free Multiparty Computation in the Mediated Model
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...
Joël Alwen, Jonathan Katz, Yehuda Lindell, Gi...
PKC
2010
Springer
148views Cryptology» more  PKC 2010»
14 years 1 months ago
On the Feasibility of Consistent Computations
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...
Sven Laur, Helger Lipmaa
AC
1998
Springer
14 years 2 months ago
The Search for the Holy Grail in Quantum Cryptography
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...
Louis Salvail