Fairness with an Honest Minority and a Rational Majority

[1]  Moni Naor,et al.  Games for exchanging information , 2008, STOC.

[2]  B. Faltings,et al.  M-DPOP: Faithful Distributed Implementation of Efficient Social Choice Problems , 2008, J. Artif. Intell. Res..

[3]  M. Naor,et al.  Cryptography and Game Theory: Designing Protocols for Exchanging Information , 2008, TCC.

[4]  Jonathan Katz,et al.  Bridging Game Theory and Cryptography: Recent Results and Future Directions , 2008, TCC.

[5]  Jonathan Katz,et al.  Rational Secret Sharing, Revisited , 2006, SCN.

[6]  Anna Lysyanskaya,et al.  Rationality and Adversarial Behavior in Multi-party Computation , 2006, CRYPTO.

[7]  David Zuckerman,et al.  Random Selection with an Adversarial Majority , 2006, CRYPTO.

[8]  Danny Dolev,et al.  Distributed computing meets game theory: robust mechanisms for rational secret sharing and multiparty computation , 2006, PODC '06.

[9]  Tuomas Sandholm,et al.  Algorithms for Rationalizability and CURB Sets , 2006, AAAI.

[10]  B. Faltings,et al.  MDPOP: faithful distributed implementation of efficient social choice problems , 2006, AAMAS '06.

[11]  Sergei Izmalkov,et al.  Rational secure computation and ideal mechanism design , 2005, 46th Annual IEEE Symposium on Foundations of Computer Science (FOCS'05).

[12]  Amitanand S. Aiyer,et al.  BAR fault tolerance for cooperative services , 2005, SOSP '05.

[13]  Moshe Tennenholtz,et al.  Non-cooperative computation: Boolean functions with correctness and exclusivity , 2005, Theor. Comput. Sci..

[14]  Moshe Babaioff,et al.  Mechanism Design for Single-Value Domains , 2005, AAAI.

[15]  Abhi Shelat,et al.  Collusion-free protocols , 2005, STOC '05.

[16]  Noam Nisan,et al.  Online ascending auctions for gradually expiring items , 2005, SODA '05.

[17]  D. Parkes,et al.  Specification faithfulness in networks with rational nodes , 2004, PODC '04.

[18]  Abhi Shelat,et al.  Completely fair SFE and coalition-safe cheap talk , 2004, PODC '04.

[19]  D.C. Parkes,et al.  Distributed implementations of Vickrey-Clarke-Groves mechanisms , 2004, Proceedings of the Third International Joint Conference on Autonomous Agents and Multiagent Systems, 2004. AAMAS 2004..

[20]  Joseph Y. Halpern,et al.  Rational secret sharing and multiparty computation: extended abstract , 2004, STOC '04.

[21]  E. Kalai.  Large Robust Games , 2004 .

[22]  Yoav Shoham,et al.  Towards a general theory of non-cooperative computation , 2003, TARK '03.

[23]  Benny Pinkas,et al.  Fair Secure Two-Party Computation , 2003, EUROCRYPT.

[24]  Joan Feigenbaum,et al.  Distributed algorithmic mechanism design: recent results and future directions , 2002, DIALM '02.

[25]  J. Feigenbaum,et al.  A BGP-based mechanism for lowest-cost routing , 2002, ACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing.

[26]  Markus Jakobsson,et al.  Timed Release of Standard Digital Signatures , 2002, Financial Cryptography.

[27]  Y. Shoham,et al.  Truth revelation in approximately efficient combinatorial auctions , 2002, JACM.

[28]  Joan Feigenbaum,et al.  Sharing the Cost of Multicast Transmissions , 2001, J. Comput. Syst. Sci..

[29]  Moni Naor,et al.  Timed Commitments , 2000, CRYPTO.

[30]  Ariel Rubinstein,et al.  A Course in Game Theory , 1995 .

[31]  J. Weibull,et al.  Strategy subsets closed under rational behavior , 1991 .

[32]  Tal Rabin,et al.  Verifiable secret sharing and multiparty protocols with honest majority , 1989, STOC '89.

[33]  M. Whinston,et al.  Coalition-Proof Nash Equilibria I. Concepts , 1987 .

[34]  Silvio Micali,et al.  How to play ANY mental game , 1987, STOC.

[35]  Richard Cleve,et al.  Limits on the security of coin flips when half the processors are faulty , 1986, STOC '86.

[36]  Andrew Chi-Chih Yao,et al.  How to Generate and Exchange Secrets (Extended Abstract) , 1986, FOCS.

[37]  Baruch Awerbuch,et al.  Verifiable secret sharing and achieving simultaneity in the presence of faults , 1985, 26th Annual Symposium on Foundations of Computer Science (sfcs 1985).

[38]  Oded Goldreich,et al.  A randomized protocol for signing contracts , 1985, CACM.

[39]  Larry Carter,et al.  New Hash Functions and Their Use in Authentication and Set Equality , 1981, J. Comput. Syst. Sci..

[40]  Adi Shamir,et al.  How to share a secret , 1979, CACM.

[41]  G. R. Blakley,et al.  Safeguarding cryptographic keys , 1899, 1979 International Workshop on Managing Requirements Knowledge (MARK).

[42]  Shien Jin Ong,et al.  Fairness with an Honest Minority and a , 2008 .

[43]  Ron Lavi,et al.  Algorithmic Mechanism Design , 2008, Encyclopedia of Algorithms.

[44]  José Luis Ferreira,et al.  A Communication-Proof Equilibrium Concept , 1996 .

[45]  David Chaum,et al.  Multiparty unconditionally secure protocols , 1988, STOC '88.

[46]  Avi Wigderson,et al.  Completeness theorems for non-cryptographic fault-tolerant distributed computation , 1988, STOC '88.

[47]  David Chaum,et al.  Multiparty Unconditionally Secure Protocols (Extended Abstract) , 1988, STOC.

[48]  Avi Wigderson,et al.  Completeness Theorems for Non-Cryptographic Fault-Tolerant Distributed Computation (Extended Abstract) , 1988, STOC.

[49]  J'anos Simon,et al.  Proceedings of the twentieth annual ACM symposium on Theory of computing , 1988, STOC 1988.