20638 search results - page 3889 / 4128 » Network Computing |
147
click to vote
CP
2004
Springer
15 years 12 months ago
2004
Springer
Cardinality matrix problems are the underlying structure of several real world problems such as rostering, sports scheduling , and timetabling. These are hard computational problem...
164
click to vote
CTRSA
2004
Springer
15 years 12 months ago
2004
Springer
We introduce a new cryptographic technique that we call universal re-encryption. A conventional cryptosystem that permits reencryption, such as ElGamal, does so only for a player w...
195
click to vote
EGPGV
2004
Springer
15 years 12 months ago
2004
Springer
This paper investigates assignment strategies (load balancing algorithms) for process farms which solve the problem of online placement of a constant number of independent tasks w...
204
click to vote
ESAS
2004
Springer
15 years 12 months ago
2004
Springer
In this paper we describe the advantages of using iterative Diffie-Hellman (IDH) key trees for mobile ad-hoc group communication. We focus on the Treebased Group Diffie-Hellman (...
147
click to vote
EUROCRYPT
2004
Springer
15 years 12 months ago
2004
Springer
Abstract. Dining cryptographers networks (or DC-nets) are a privacypreserving primitive devised by Chaum for anonymous message publication. A very attractive feature of the basic D...