4908 search results - page 213 / 982 » On the Complexity of Optimal K-Anonymity |
169
click to vote
CRYPTO
2004
Springer
15 years 12 months ago
2004
Springer
Abstract. We consider the central cryptographic task of secure twoparty computation, where two parties wish to compute some function of their private inputs (each receiving possibl...
195
click to vote
CRYPTO
2001
Springer
15 years 11 months ago
2001
Springer
Consider a scenario where an l-bit secret has been distributed among n players by an honest dealer using some secret sharing scheme. Then, if all players behave honestly, the secre...
182
click to vote
APNOMS
2006
Springer
15 years 10 months ago
2006
Springer
Peer-to-Peer systems are based on the concept of resources localization and mutualization in dynamic context. In specific environment such as mobile networks, characterized by high...
159
click to vote
CEC
2009
IEEE
16 years 1 months ago
2009
IEEE
— Genetic algorithms (GAs) have been argued to constitute a flexible search thereby enabling to solve difficult problems which classical optimization methodologies may find ha...
156
click to vote
CEC
2007
IEEE
16 years 28 days ago
2007
IEEE
— Particle swarm optimization (PSO) is a stochastic global optimization algorithm inspired by social behavior of bird flocking in search for food, which is a simple but powerful...