Realistic versus Rational Secret Sharing

08/20/2019
by   Yvo Desmedt, et al.
0

The study of Rational Secret Sharing initiated by Halpern and Teague regards the reconstruction of the secret in secret sharing as a game. It was shown that participants (parties) may refuse to reveal their shares and so the reconstruction may fail. Moreover, a refusal to reveal the share may be a dominant strategy of a party. In this paper we consider secret sharing as a sub-action or subgame of a larger action/game where the secret opens a possibility of consumption of a certain common good. We claim that utilities of participants will be dependent on the nature of this common good. In particular, Halpern and Teague scenario corresponds to a rivalrous and excludable common good. We consider the case when this common good is non-rivalrous and non-excludable and find many natural Nash equilibria. We list several applications of secret sharing to demonstrate our claim and give corresponding scenarios. In such circumstances the secret sharing scheme facilitates a power sharing agreement in the society. We also state that non-reconstruction may be beneficial for this society and give several examples.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
01/29/2018

Communication Efficient Quantum Secret Sharing

Building upon the recent work in communication efficient classical secre...
research
01/04/2019

Rational Threshold Cryptosystems

We propose a framework for threshold cryptosystems under a permissionles...
research
12/01/2020

Wireless Secret Sharing Game between Two Legitimate Users and an Eavesdropper

Wireless secret sharing is crucial to information security in the era of...
research
07/06/2023

Pretty Good Strategies for Benaloh Challenge

Benaloh challenge allows the voter to audit the encryption of her vote, ...
research
02/21/2020

Quantum secret sharing using GHZ state qubit positioning and selective qubits strategy for secret reconstruction

The work presents a novel quantum secret sharing strategy based on GHZ p...
research
02/17/2019

Non-Malleable Secret Sharing against Affine Tampering

Non-malleable secret sharing was recently studied by Goyal and Kumar in ...
research
07/10/2018

Asynchronous Verifiable Secret-Sharing Protocols on a Good Day

Asynchronous verifiable secret sharing (AVSS) is a cornerstone primitive...

Please sign up or login with your details

Forgot password? Click here to reset