A randomized protocol for signing contracts
Communications of the ACM
STOC '87 Proceedings of the nineteenth 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
Fair distribution protocols or how the players replace fortune
Mathematics of Operations Research
Communications of the ACM
Efficient oblivious transfer protocols
SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
A complete problem for statistical zero knowledge
Journal of the ACM (JACM)
Non-Interactive Oblivious Transfer and Spplications
CRYPTO '89 Proceedings of the 9th Annual International Cryptology Conference on Advances in Cryptology
Foundations of Cryptography: Volume 2, Basic Applications
Foundations of Cryptography: Volume 2, Basic Applications
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
Proceedings of the thirty-seventh annual ACM symposium on Theory of computing
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
How to generate and exchange secrets
SFCS '86 Proceedings of the 27th Annual Symposium on Foundations of Computer Science
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
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
Oblivious transfer is symmetric
EUROCRYPT'06 Proceedings of the 24th annual international conference on The Theory and Applications of Cryptographic Techniques
Games for exchanging information
STOC '08 Proceedings of the fortieth annual ACM symposium on Theory of computing
Beyond nash equilibrium: solution concepts for the 21st century
Proceedings of the twenty-seventh ACM symposium on Principles of distributed computing
A Framework for Efficient and Composable Oblivious Transfer
CRYPTO 2008 Proceedings of the 28th Annual conference on Cryptology: Advances in Cryptology
Adaptive search engines as discovery games: an evolutionary approach
Proceedings of the 6th International Conference on Advances in Mobile Computing and Multimedia
TCC '09 Proceedings of the 6th Theory of Cryptography Conference on Theory of Cryptography
Fairness with an Honest Minority and a Rational Majority
TCC '09 Proceedings of the 6th Theory of Cryptography Conference on Theory of Cryptography
Purely Rational Secret Sharing (Extended Abstract)
TCC '09 Proceedings of the 6th Theory of Cryptography Conference on Theory of Cryptography
Possibility and Impossibility Results for Encryption and Commitment Secure under Selective Opening
EUROCRYPT '09 Proceedings of the 28th Annual International Conference on Advances in Cryptology: the Theory and Applications of Cryptographic Techniques
Community Adaptive Search Engines
International Journal of Advanced Intelligence Paradigms
Brief announcement: collusion free protocol for rational secret sharing
Proceedings of the 29th ACM SIGACT-SIGOPS symposium on Principles of distributed computing
RatFish: a file sharing protocol provably secure against rational users
ESORICS'10 Proceedings of the 15th European conference on Research in computer security
Identity-based encryption secure against selective opening attack
TCC'11 Proceedings of the 8th 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
Highly-efficient universally-composable commitments based on the DDH assumption
EUROCRYPT'11 Proceedings of the 30th Annual international conference on Theory and applications of cryptographic techniques: advances in cryptology
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
Unconditionally secure rational secret sharing in standard communication networks
ICISC'10 Proceedings of the 13th international conference on Information security and cryptology
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
Rational secret sharing with semi-rational players
International Journal of Grid and Utility Computing
ASIACRYPT'11 Proceedings of the 17th international conference on The Theory and Application of Cryptology and Information Security
New Techniques for Noninteractive Zero-Knowledge
Journal of the ACM (JACM)
Fair computation with rational players
EUROCRYPT'12 Proceedings of the 31st Annual international conference on Theory and Applications of Cryptographic Techniques
Standard security does not imply security against selective-opening
EUROCRYPT'12 Proceedings of the 31st Annual international conference on Theory and Applications of Cryptographic Techniques
Lossy Trapdoor Functions and Their Applications
SIAM Journal on Computing
A game-theoretic perspective on oblivious transfer
ACISP'12 Proceedings of the 17th Australasian conference on Information Security and Privacy
Sequential rationality in cryptographic protocols
ACM Transactions on Economics and Computation - Inaugural Issue
On the (non-)equivalence of UC security notions
ProvSec'12 Proceedings of the 6th international conference on Provable Security
Public-Key encryption with lazy parties
SCN'12 Proceedings of the 8th international conference on Security and Cryptography for Networks
Game theory meets network security and privacy
ACM Computing Surveys (CSUR)
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 |
The goal of this paper is finding fair protocols for the secret sharing and secure multiparty computation (SMPC) problems, when players are assumed to be rational. It was observed by Halpern and Teague (STOC 2004) that protocols with bounded number of iterations are susceptible to backward induction and cannot be considered rational. Previously suggested cryptographic solutions all share the property of having an essential exponential upper bound on their running time, and hence they are also susceptible to backward induction. Although it seems that this bound is an inherent property of every cryptography based solution, we show that this is not the case. We suggest coalition-resilient secret sharing and SMPC protocols with the property that after any sequence of iterations it is still a computational best response to follow them. Therefore, the protocols can be run any number of iterations, and are immune to backward induction. The mean of communication assumed is a broadcast channel, and we consider both the simultaneous and non-simultaneous cases.