Sciweavers

3130 search results - page 4 / 626
» Collusion without communication
Sort
View
CRYPTO
2012
Springer
223views Cryptology» more  CRYPTO 2012»
11 years 9 months ago
Collusion-Preserving Computation
In collusion-free protocols, subliminal communication is impossible and parties are thus unable to communicate “any information beyond what the protocol allows”. Collusion-fre...
Joël Alwen, Jonathan Katz, Ueli Maurer, Vassi...
INFOCOM
1997
IEEE
13 years 11 months ago
An Algorithm to Compute Collusion Paths
In earlier work we have formulated a collusion problem that determines whether it is possible for a set of colluders to collectively discover a target set of information, starting...
Steven H. Low, Nicholas F. Maxemchuk
CRYPTO
2009
Springer
121views Cryptology» more  CRYPTO 2009»
14 years 2 months ago
Collusion-Free Multiparty Computation in the Mediated Model
Collusion-free protocols prevent subliminal communication (i.e., covert channels) between parties running the protocol. In the standard communication model, if one-way functions ex...
Joël Alwen, Jonathan Katz, Yehuda Lindell, Gi...
AMMA
2009
Springer
14 years 2 months ago
Manipulating Scrip Systems: Sybils and Collusion
Abstract. Game-theoretic analyses of distributed and peer-to-peer systems typically use the Nash equilibrium solution concept, but this explicitly excludes the possibility of strat...
Ian A. Kash, Eric J. Friedman, Joseph Y. Halpern
AMEC
2004
Springer
14 years 24 days ago
Revenue Failures and Collusion in Combinatorial Auctions and Exchanges with VCG Payments
Abstract. In a combinatorial auction, there are multiple items for sale, and bidders are allowed to place a bid on a bundle of these items rather than just on the individual items....
Vincent Conitzer, Tuomas Sandholm