1274 search results - page 194 / 255 » New Proofs for |
166
click to vote
CRYPTO
2005
Springer
15 years 11 months ago
2005
Springer
Forgery and counterfeiting are emerging as serious security risks in low-cost pervasive computing devices. These devices lack the computational, storage, power, and communication r...
158
click to vote
FC
2005
Springer
15 years 11 months ago
2005
Springer
Two parties, say Alice and Bob, possess two sets of elements that belong to a universe of possible values and wish to test whether these sets are disjoint or not. In this paper we ...
131
click to vote
COMPGEOM
2004
ACM
15 years 11 months ago
2004
ACM
In a landmark survey of visibility algorithms in 1974, Sutherland, Sproull, and Schumacker stated that “We believe the principal untapped source of help for hidden surface algor...
159
click to vote
APPROX
2004
Springer
15 years 11 months ago
2004
Springer
Consider the following communication problem, that leads to a new notion of edge coloring. The communication network is represented by a bipartite multigraph, where the nodes on o...
139
click to vote
ASIACRYPT
2004
Springer
15 years 11 months ago
2004
Springer
Abstract. We consider the problem of increasing the threshold parameter of a secret-sharing scheme after the setup (share distribution) phase, without further communication between...