Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

Lecture notes in computer science

Fairness with an Honest Minority and a Rational Majority

Shien Jin Ong, David C. Parkes, Alon Rosen, Salil Vadhan

Published Jan 1, 2009• 99 citations
Publisher
DOI
10.1007/978-3-642-00457-5_3

Related papers

Complete Fairness in Multi-Party Computation Without an Honest Majority.

Steven Gordon, Jonathan I. Katz

•Jan 1, 2008•0 citations

Complete Fairness in Multi-party Computation without an Honest Majority

Steven Gordon, Jonathan I. Katz

Lecture notes in computer science•Jan 1, 2009•53 citations

Information-Theoretic Security Without an Honest Majority

Anne Broadbent, Alain Tapp

arXiv:0706.2010•Springer eBooks•Nov 4, 2007•74 citations

Identifying Cheaters without an Honest Majority

Yuval Ishai, Rafail Ostrovsky, Hakan Seyalioglu

Lecture notes in computer science•Jan 1, 2012•50 citations

Fair Computation with Rational Players

Adam Groce, Jonathan I. Katz

Lecture notes in computer science•Jan 1, 2012•77 citations

Achieve Fairness in Rational Secret Sharing Protocol

Jie Wang

In the setting of ( , ) mn rational secret sharing, n rational players wish to share a secret s , arbitrarily m players can reconstruct it, they always choose the strategies which can bring them more utilities.The security requirement includes privacy, correctness and fairness.Fairness is a central objective of the rational secret sharing scheme, complete fair means either all players get the secret s or none of them get it, but most existing schemes do not meet this nature.In this work, a rational secret sharing protocol is proposed, which neither need particular communication channel, nor assume the existence of honest minority, in addition, the scheme can resist the collusion attack with () k k m  players, and can achieve sequential equilibrium.Theoretical analysis shows that the proposed protocol is complete fair.

International Journal of Security and Its Applications•Nov 30, 2015•0 citations
In the setting of ( , ) mn rational secret sharing, n rational players wish to share a secret s , arbitrarily m players can reconstruct it, they always choose the strategies which can bring them more utilities.The security requirement includes privacy, correctness and fairness.Fairness is a central objective of the rational secret sharing scheme, complete fair means either all players get the secret s or none of them get it, but most existing schemes do not meet this nature.In this work, a rational secret sharing protocol is proposed, which neither need particular communication channel, nor assume the existence of honest minority, in addition, the scheme can resist the collusion attack with () k k m  players, and can achieve sequential equilibrium.Theoretical analysis shows that the proposed protocol is complete fair.