23988 search results - page 4540 / 4798 » Social Network Computing |
129
Voted
CCS
2004
ACM
15 years 10 months ago
2004
ACM
Efforts to design faster synchronous mix networks have focused on reducing the computational cost of mixing per server. We propose a different approach: our re-encryption mixnet...
138
click to vote
CCS
2004
ACM
15 years 10 months ago
2004
ACM
In order to solve future Multi Level Security (MLS) problems, we have developed a solution based on the DARPA Polymorphous Computing Architecture (PCA). MLS-PCA uses a novel distr...
113
click to vote
CP
2004
Springer
15 years 10 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...
127
click to vote
CTRSA
2004
Springer
15 years 10 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...
122
click to vote
DSOM
2004
Springer
15 years 10 months ago
2004
Springer
Abstract. A framework for the autonomous management of clustered server systems called LAMA1 (Large-scale system’s Autonomous Management Agent) is proposed in this paper. LAMA is...