STOC '87 Proceedings of the nineteenth annual ACM symposium on Theory of computing
Completeness theorems for non-cryptographic fault-tolerant distributed computation
STOC '88 Proceedings of the twentieth annual ACM symposium on Theory of computing
Verifiable secret sharing and multiparty protocols with honest majority
STOC '89 Proceedings of the twenty-first annual ACM symposium on Theory of computing
Automatically increasing the fault-tolerance of distributed algorithms
Journal of Algorithms
The Byzantine Generals Problem
ACM Transactions on Programming Languages and Systems (TOPLAS)
Communications of the ACM
Foundations of Cryptography: Volume 2, Basic Applications
Foundations of Cryptography: Volume 2, Basic Applications
Rational secret sharing and multiparty computation: extended abstract
STOC '04 Proceedings of the thirty-sixth annual ACM symposium on Theory of computing
Completely fair SFE and coalition-safe cheap talk
Proceedings of the twenty-third annual ACM symposium on Principles of distributed computing
Proceedings of the thirty-seventh annual ACM symposium on Theory of computing
Rational Secure Computation and Ideal Mechanism Design
FOCS '05 Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science
Non-cooperative computation: boolean functions with correctness and exclusivity
Theoretical Computer Science - Game theory meets theoretical computer science
Fairplay—a secure two-party computation system
SSYM'04 Proceedings of the 13th conference on USENIX Security Symposium - Volume 13
Optimizing scrip systems: efficiency, crashes, hoarders, and altruists
Proceedings of the 8th ACM conference on Electronic commerce
Proceedings of the twenty-sixth annual ACM symposium on Principles of distributed computing
Games for exchanging information
STOC '08 Proceedings of the fortieth annual ACM symposium on Theory of computing
Protocol completion incentive problems in cryptographic Vickrey auctions
Electronic Commerce Research
Fault tolerance in large games
Proceedings of the 9th ACM conference on Electronic commerce
Distributed computing in SOSP and OSDI
ACM SIGACT News
Beyond nash equilibrium: solution concepts for the 21st century
Proceedings of the twenty-seventh ACM symposium on Principles of distributed computing
Multi-party, Privacy-Preserving Distributed Data Mining Using a Game Theoretic Framework
PKDD 2007 Proceedings of the 11th European conference on Principles and Practice of Knowledge Discovery in Databases
SDM '08 Proceedings of the 5th VLDB workshop on Secure Data Management
Cloaking games in location based services
Proceedings of the 2008 ACM workshop on Secure web services
Artificial Intelligence
Autonomics '08 Proceedings of the 2nd International Conference on Autonomic Computing and Communication Systems
Equilibrium Points in Fear of Correlated Threats
WINE '08 Proceedings of the 4th International Workshop on Internet and Network Economics
Fault Tolerance in Distributed Mechanism Design
WINE '08 Proceedings of the 4th International Workshop on Internet and Network Economics
Fairness with an Honest Minority and a Rational Majority
TCC '09 Proceedings of the 6th Theory of Cryptography Conference on Theory of Cryptography
Purely Rational Secret Sharing (Extended Abstract)
TCC '09 Proceedings of the 6th Theory of Cryptography Conference on Theory of Cryptography
K-SNCC: group deviations in subsidized non-cooperative computing
Proceedings of the 12th Conference on Theoretical Aspects of Rationality and Knowledge
Nash Equilibria in Stabilizing Systems
SSS '09 Proceedings of the 11th International Symposium on Stabilization, Safety, and Security of Distributed Systems
WINE '09 Proceedings of the 5th International Workshop on Internet and Network Economics
Opportunistic sensing: security challenges for the new paradigm
COMSNETS'09 Proceedings of the First international conference on COMmunication Systems And NETworks
K-NCC: stability against group deviations in non-cooperative computation
WINE'07 Proceedings of the 3rd international conference on Internet and network economics
Rational secret sharing with repeated games
ISPEC'08 Proceedings of the 4th international conference on Information security practice and experience
Bridging game theory and cryptography: recent results and future directions
TCC'08 Proceedings of the 5th conference on Theory of cryptography
Lower bounds on implementing robust and resilient mediators
TCC'08 Proceedings of the 5th conference on Theory of cryptography
Cryptography and game theory: designing protocols for exchanging information
TCC'08 Proceedings of the 5th conference on Theory of cryptography
Breaking the O(n2) bit barrier: scalable byzantine agreement with an adaptive adversary
Proceedings of the 29th ACM SIGACT-SIGOPS symposium on Principles of distributed computing
Scalable byzantine computation
ACM SIGACT News
FlightPath: obedience vs. choice in cooperative services
OSDI'08 Proceedings of the 8th USENIX conference on Operating systems design and implementation
It's on me! the benefit of altruism in BAR environment
DISC'10 Proceedings of the 24th international conference on Distributed computing
RatFish: a file sharing protocol provably secure against rational users
ESORICS'10 Proceedings of the 15th European conference on Research in computer security
International Journal of Autonomous and Adaptive Communications Systems
Breaking the O(n2) bit barrier: Scalable byzantine agreement with an adaptive adversary
Journal of the ACM (JACM)
Scalable rational secret sharing
Proceedings of the 30th annual ACM SIGACT-SIGOPS symposium on Principles of distributed computing
Towards a game theoretic view of secure computation
EUROCRYPT'11 Proceedings of the 30th Annual international conference on Theory and applications of cryptographic techniques: advances in cryptology
An efficient rational secret sharing scheme based on the Chinese remainder theorem
ACISP'11 Proceedings of the 16th Australasian conference on Information security and privacy
Privacy-preserving data mining: a game-theoretic approach
DBSec'11 Proceedings of the 25th annual IFIP WG 11.3 conference on Data and applications security and privacy
N-party BAR Transfer: motivation, definition, and challenges
Proceedings of the 3rd International Workshop on Theoretical Aspects of Dynamic Distributed Systems
Unconditionally secure rational secret sharing in standard communication networks
ICISC'10 Proceedings of the 13th international conference on Information security and cryptology
Rationality in the full-information model
TCC'10 Proceedings of the 7th international conference on Theory of Cryptography
Efficient rational secret sharing in standard communication networks
TCC'10 Proceedings of the 7th international conference on Theory of Cryptography
Repeated rational secret sharing, revisited
International Journal of Grid and Utility Computing
Rational secret sharing with semi-rational players
International Journal of Grid and Utility Computing
Rational secret sharing, revisited
SCN'06 Proceedings of the 5th international conference on Security and Cryptography for Networks
Rationality and adversarial behavior in multi-party computation
CRYPTO'06 Proceedings of the 26th annual international conference on Advances in Cryptology
Beyond nash equilibrium: solution concepts for the 21st century
GameSec'11 Proceedings of the Second international conference on Decision and Game Theory for Security
OPODIS'11 Proceedings of the 15th international conference on Principles of Distributed Systems
OPODIS'11 Proceedings of the 15th international conference on Principles of Distributed Systems
Accurate byzantine agreement with feedback
OPODIS'11 Proceedings of the 15th international conference on Principles of Distributed Systems
Fair computation with rational players
EUROCRYPT'12 Proceedings of the 31st Annual international conference on Theory and Applications of Cryptographic Techniques
Survey: Robust and scalable middleware for selfish-computer systems
Computer Science Review
A game-theoretic perspective on oblivious transfer
ACISP'12 Proceedings of the 17th Australasian conference on Information Security and Privacy
Byzantine agreement with a rational adversary
ICALP'12 Proceedings of the 39th international colloquium conference on Automata, Languages, and Programming - Volume Part II
Asynchrony and collusion in the n-party BAR transfer problem
SIROCCO'12 Proceedings of the 19th international conference on Structural Information and Communication Complexity
Sequential rationality in cryptographic protocols
ACM Transactions on Economics and Computation - Inaugural Issue
Achieving reliability in master-worker computing via evolutionary dynamics
Euro-Par'12 Proceedings of the 18th international conference on Parallel Processing
On the (non-)equivalence of UC security notions
ProvSec'12 Proceedings of the 6th international conference on Provable Security
Public-Key encryption with lazy parties
SCN'12 Proceedings of the 8th international conference on Security and Cryptography for Networks
Bayesian mechanism design with efficiency, privacy, and approximate truthfulness
WINE'12 Proceedings of the 8th international conference on Internet and Network Economics
Game theory meets network security and privacy
ACM Computing Surveys (CSUR)
What's a little collusion between friends?
Proceedings of the 2013 ACM symposium on Principles of distributed computing
Reasoning with MAD distributed systems
CONCUR'13 Proceedings of the 24th international conference on Concurrency Theory
| Hi-index | 0.00 |
We study k-resilient Nash equilibria, joint strategies where no member of a coalition C of size up to k can do better, even if the whole coalition defects. We show that such k-resilient Nash equilibria exist for secret sharing and multiparty computation, provided that players prefer to get the information than not to get it. Our results hold even if there are only 2 players, so we can do multiparty computation with only two rational agents. We extend our results so that they hold even in the presence of up to t players with "unexpected" utilities. Finally, we show that our techniques can be used to simulate games with mediators by games without mediators.