A Rational Secret Sharing Relying on Reputation

Jin, Jianghao; Zhou, Xie; Ma, Chao; Wang, Xu An

doi:10.1109/incos.2016.40

Cited by 3 publications

(1 citation statement)

References 8 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Then, they studied the utility function of rational players, and presented a new rational secret sharing scheme [14] based on Bayesian game. Jin et al [15] proposed a rational secret sharing scheme based on the reputation mechanism, and their protocol only required one round. By introducing mechanism design [16] from the field of microeconomics, Liu et al [17] proposed a reasonable secret reconstruction protocol in rational secret sharing.…”

Section: Related Workmentioning

confidence: 99%

An incentive-compatible rational secret sharing scheme using blockchain and smart contract

Chen

Tian

Peng

2021

Sci. China Inf. Sci.

View full text Add to dashboard Cite

In the rational cryptographic protocol, the two rational players often fall into the prisoner's dilemma, which is also the case for the rational secret sharing we consider in this paper. First, it is proved that rational secret sharing has a sequential equilibrium in the natural state, so that rational participants will fall into the prisoner's dilemma, resulting in no participants being able to reconstruct the secret correctly. Next, to solve this problem, we propose an incentive-compatible rational secret scheme. Specifically, the game tree with imperfect information is constructed to facilitate our analysis and proof, and the strictly dominated strategies are directly eliminated to simplify the game tree. Further more, we describe the motivation of the verifier. Then, we prove that rational players have no motivation to deviate from honest behavior using sequential equilibrium so that rational players can reconstruct the secret correctly. Finally, we complete the simulation using the smart contract and analyze our entire scheme. In addition, the game of our scheme does not need to be repeated multiple times to reach sequential equilibrium, i.e., the game always follows the rational path.

show abstract

Section: Related Workmentioning

confidence: 99%

An incentive-compatible rational secret sharing scheme using blockchain and smart contract

Chen

Tian

Peng

2021

Sci. China Inf. Sci.

View full text Add to dashboard Cite

show abstract

The optimal attack-defense scheme for secret sharing

Chen

Lv³

et al. 2022

2022 IEEE International Conferences on Internet of Things (iThings) and IEEE Green Computing &Amp; Communications (GreenCom) An

View full text Add to dashboard Cite

ROMSS: a rational optional multi-secret sharing scheme based on reputation mechanism

Shi,

Chen,

Tan

et al. 2023

J Cloud Comp

View full text Add to dashboard Cite

The traditional threshold secret sharing scheme only allows the participants’ sub-secret shares to be used once in the reconstruction process. Several multi-secret sharing schemes have been proposed that are related to cloud computing, aiming to improve reconstruction efficiency. Rational secret sharing is a technique that combines secret sharing with game theory. In traditional rational multi-secret sharing, participants must reconstruct all secrets, resulting in unnecessary overhead. Rational participants will act dishonestly to maximize their own interests, leading to a prisoner’s dilemma and incomplete secret reconstruction. Additionally, when sharing multiple secrets, the Dealer must distribute the sub-secret shares of all secrets to the participants, increasing overhead. In this paper, we propose a rational optional multi-secret sharing scheme based on a reputation mechanism that selectively reconstructs secrets according to participants’ needs in the context of cloud computing. Our scheme introduces a reputation mechanism to evaluate participants’ reputation values to avoid their dishonest behaviors. Furthermore, we adopt a broadcast encryption matrix so that participants only need to receive a single sub-secret share to participate in multi-secret reconstruction. Our security analysis shows that the proposed scheme can effectively constrain the self-interested behavior of rational participants and reduce the overhead in the process, thus multi-secret sharing scheme can provide more efficient and secure solutions for secret sharing in key management and distributive storage for the cloud scenarios.

show abstract

A Rational Secret Sharing Relying on Reputation

Cited by 3 publications

References 8 publications

An incentive-compatible rational secret sharing scheme using blockchain and smart contract

An incentive-compatible rational secret sharing scheme using blockchain and smart contract

The optimal attack-defense scheme for secret sharing

ROMSS: a rational optional multi-secret sharing scheme based on reputation mechanism

Contact Info

Product

Resources

About