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

Fair Computation with Rational Players

Adam Groce, Jonathan I. Katz

Published Jan 1, 2012• 77 citations
Publisher
DOI
10.1007/978-3-642-29011-4_7

Related papers

Revisiting Secure Two-Party Computation with Rational Players

Arpita Maitra, Goutam Paul, Asim Kumar Pal

•Jan 1, 2015•1 citation

Research on Modularization of Fairness Rational Multi-party Computation

Li Tao, Yilei Wang

•Jan 1, 2016•0 citations

Quantum secure two-party computation for set intersection with rational players

Arpita Maitra

arXiv:1801.08319•Quantum Information Processing•Jun 26, 2018•20 citations

Achieving Correctness in Fair Rational Secret Sharing

Sourya Joyee De, Asim K. Pal

Lecture notes in computer science•Jan 1, 2013•6 citations

Rational Fair Secure Multiparty Computation Based on Chinese Remainder Theorem

Liu Rong-fe

Exciting rational secure multiparty computation goes less to discuss asynchronous channel,we realize it on asynchronous channel by using Chinese reminder theorem. Using the way of uncertain rounds,rational players don't which round is the last round. Through tit for tat mechanism and dynamical add / remove,rational players have not any motivation to deviate from the specified protocol,if someone deviate from it,then his utility yields less than follow it,so we realize any number of players' fair rational secure multiparty computation. Furthermore,we analyze the scheme's fairness from the perspective of game theory. Finally,some advantages of our scheme are demonstrated further by comparing the exiting schemes with the type of communication channel,consists of players,interactive round and other requests.

Journal of Guizhou University•Jan 1, 2014•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
Exciting rational secure multiparty computation goes less to discuss asynchronous channel,we realize it on asynchronous channel by using Chinese reminder theorem. Using the way of uncertain rounds,rational players don't which round is the last round. Through tit for tat mechanism and dynamical add / remove,rational players have not any motivation to deviate from the specified protocol,if someone deviate from it,then his utility yields less than follow it,so we realize any number of players' fair rational secure multiparty computation. Furthermore,we analyze the scheme's fairness from the perspective of game theory. Finally,some advantages of our scheme are demonstrated further by comparing the exiting schemes with the type of communication channel,consists of players,interactive round and other requests.