Fairness with an Honest Minority and a Rational Majority

DSpace/Manakin Repository

Fairness with an Honest Minority and a Rational Majority

Show simple item record

dc.contributor.author Ong, Shien Jin
dc.contributor.author Parkes, David C.
dc.contributor.author Rosen, Alon
dc.contributor.author Vadhan, Salil P.
dc.date.accessioned 2010-04-28T16:21:03Z
dc.date.issued 2009
dc.identifier.citation Ong, Shien Jin, David C. Parkes, Alon Rosen, and Salil Vadhan. 2009. Fairness with an honest minority and a rational majority. In Theory of Cryptography, ed. O. Reingold, 36-53. Berlin: Springer. Previously published in Lecture Notes in Computer Science, 5444: 36-53. en_US
dc.identifier.isbn 978-3-642-00456-8 en_US
dc.identifier.issn 0302-9743 en_US
dc.identifier.uri http://nrs.harvard.edu/urn-3:HUL.InstRepos:4000763
dc.description.abstract 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. en_US
dc.description.sponsorship Engineering and Applied Sciences en_US
dc.language.iso en_US en_US
dc.publisher Springer Verlag en_US
dc.relation.isversionof doi:10.1007/978-3-642-00457-5_3 en_US
dc.relation.hasversion http://www.eecs.harvard.edu/~alon/PAPERS/OPRV/OPRV09.pdf en_US
dash.license LAA
dc.subject game theory en_US
dc.subject fairness en_US
dc.subject secret sharing en_US
dc.title Fairness with an Honest Minority and a Rational Majority en_US
dc.type Monograph or Book en_US
dc.description.version Accepted Manuscript en_US
dc.relation.journal Lecture Notes in Computer Science en_US
dash.depositing.author Parkes, David C.
dc.date.available 2010-04-28T16:21:03Z

Files in this item

Files Size Format View
Ong_Fairness.pdf 282.8Kb PDF View/Open

This item appears in the following Collection(s)

  • FAS Scholarly Articles [7106]
    Peer reviewed scholarly articles from the Faculty of Arts and Sciences of Harvard University

Show simple item record

 
 

Search DASH


Advanced Search
 
 

Submitters