661 search results - page 61 / 133 » Robustness Guarantees for Anonymity |
185
click to vote
ACMICEC
2003
ACM
15 years 11 months ago
2003
ACM
A multi-agent marketplace, MAGNET (Multi AGent Negotiation Testbed), is a promising solution to conduct online combinatorial auctions. The trust model of MAGNET is somewhat diffe...
139
click to vote
IPPS
2000
IEEE
15 years 10 months ago
2000
IEEE
A self-stabilizing algorithm, regardless of the initial system state, converges in finite time to a set of states that satisfy a legitimacy predicate without the need for explici...
160
click to vote
KDD
2010
ACM
15 years 10 months ago
2010
ACM
Motivated by the insufficiency of the existing quasi-identifier/sensitiveattribute (QI-SA) framework on modeling real-world privacy requirements for data publishing, we propose ...
173
click to vote
ASIACRYPT
2009
Springer
15 years 9 months ago
2009
Springer
Abstract. Public-key encryption schemes rely for their IND-CPA security on per-message fresh randomness. In practice, randomness may be of poor quality for a variety of reasons, le...
138
click to vote
AUSDM
2008
Springer
15 years 8 months ago
2008
Springer
Given the threat of re-identification in our growing digital society, guaranteeing privacy while providing worthwhile data for knowledge discovery has become a difficult problem. ...