A randomized protocol for signing contracts
Communications of the ACM
Limits on the security of coin flips when half the processors are faulty
STOC '86 Proceedings of the eighteenth annual ACM symposium on Theory of computing
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
Multiparty unconditionally secure protocols
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
Communications of the ACM
Sharing the cost of multicast transmissions
Journal of Computer and System Sciences - Special issue on Internet algorithms
Distributed algorithmic mechanism design: recent results and future directions
DIALM '02 Proceedings of the 6th international workshop on Discrete algorithms and methods for mobile computing and communications
A BGP-based mechanism for lowest-cost routing
Proceedings of the twenty-first annual symposium on Principles of distributed computing
Truth revelation in approximately efficient combinatorial auctions
Journal of the ACM (JACM)
CRYPTO '00 Proceedings of the 20th Annual International Cryptology Conference on Advances in Cryptology
Towards a general theory of non-cooperative computation
Proceedings of the 9th conference on Theoretical aspects of rationality and knowledge
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
Specification faithfulness in networks with rational nodes
Proceedings of the twenty-third annual ACM symposium on Principles of distributed computing
Distributed Implementations of Vickrey-Clarke-Groves Mechanisms
AAMAS '04 Proceedings of the Third International Joint Conference on Autonomous Agents and Multiagent Systems - Volume 1
Proceedings of the thirty-seventh annual ACM symposium on Theory of computing
Online ascending auctions for gradually expiring items
SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
BAR fault tolerance for cooperative services
Proceedings of the twentieth ACM symposium on Operating systems principles
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
Proceedings of the twenty-fifth annual ACM symposium on Principles of distributed computing
MDPOP: faithful distributed implementation of efficient social choice problems
AAMAS '06 Proceedings of the fifth international joint conference on Autonomous agents and multiagent systems
Games for exchanging information
STOC '08 Proceedings of the fortieth annual ACM symposium on Theory of computing
Verifiable secret sharing and achieving simultaneity in the presence of faults
SFCS '85 Proceedings of the 26th Annual Symposium on Foundations of Computer Science
How to generate and exchange secrets
SFCS '86 Proceedings of the 27th Annual Symposium on Foundations of Computer Science
Fairness with an Honest Minority and a Rational Majority
TCC '09 Proceedings of the 6th Theory of Cryptography Conference on Theory of Cryptography
Mechanism design for single-value domains
AAAI'05 Proceedings of the 20th national conference on Artificial intelligence - Volume 1
Timed release of standard digital signatures
FC'02 Proceedings of the 6th international conference on Financial cryptography
Fair secure two-party computation
EUROCRYPT'03 Proceedings of the 22nd international conference on Theory and applications of cryptographic techniques
Bridging game theory and cryptography: recent results and future directions
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
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
Fairness with an Honest Minority and a Rational Majority
TCC '09 Proceedings of the 6th Theory of Cryptography Conference on Theory of Cryptography
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
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
Fair computation with rational players
EUROCRYPT'12 Proceedings of the 31st Annual international conference on Theory and Applications of Cryptographic Techniques
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
Sequential rationality in cryptographic protocols
ACM Transactions on Economics and Computation - Inaugural Issue
Public-Key encryption with lazy parties
SCN'12 Proceedings of the 8th international conference on Security and Cryptography for Networks
Fairness in the presence of semi-rational parties in rational two-party secure computation
International Journal of Grid and Utility Computing
| Hi-index | 0.00 |
We provide a simple protocol for secret reconstruction in any threshold secret sharing scheme, and prove that it is fair when executed with many rational parties together with a small minority of honest parties. That is, all parties will learn the secret with high probability when the honest parties follow the protocol and the rational parties act in their own self-interest (as captured by a set-Nash analogue of trembling hand perfect equilibrium). The protocol only requires a standard (synchronous) broadcast channel, tolerates both early stopping and incorrectly computed messages, and only requires 2 rounds of communication. Previous protocols for this problem in the cryptographic or economic models have either required an honest majority, used strong communication channels that enable simultaneous exchange of information, or settled for approximate notions of security/equilibria. They all also required a nonconstant number of rounds of communication.