Verifiable rational secret sharing scheme based on Chinese remainder theorem

2013 ◽  
Vol 32 (11) ◽  
pp. 3143-3146
Author(s):  
Li-yuan ZHANG ◽  
En ZHANG
Keyword(s):  
Secret Sharing ◽  
Chinese Remainder Theorem ◽  
Secret Sharing Scheme ◽  
Sharing Scheme ◽  
Rational Secret Sharing

A new threshold changeable secret sharing scheme based on the Chinese Remainder Theorem

2019 ◽  
Vol 473 ◽  
pp. 13-30 ◽  
Author(s):  
Xingxing Jia ◽  
Daoshun Wang ◽  
Daxin Nie ◽  
Xiangyang Luo ◽  
Jonathan Zheng Sun
Keyword(s):  
Secret Sharing ◽  
Chinese Remainder Theorem ◽  
Secret Sharing Scheme ◽  
Sharing Scheme

RATIONAL MULTI-SECRET SHARING SCHEME IN STANDARD POINT-TO-POINT COMMUNICATION NETWORKS

2013 ◽  
Vol 24 (06) ◽  
pp. 879-897 ◽  
Author(s):  
EN ZHANG ◽  
YONGQUAN CAI
Keyword(s):  
Communication Networks ◽  
Secret Sharing ◽  
Broadcast Channel ◽  
Secret Sharing Scheme ◽  
Multiple Secrets ◽  
Sharing Scheme ◽  
Rational Secret Sharing ◽  
Point To Point ◽  
Multi Secret Sharing ◽  
Rational Players

Rational secret sharing was first introduced by Halpern and Teague (STOC, 2004). Since then, a series of works have focused on designing rational secret sharing protocols. However, most existing solutions can share only one secret at one secret sharing process. To share multiple secrets such as m secrets, the dealer must redistribute shares for m times. In addition, previous works assume existence of broadcast channel which is not realistic. Motivated by those problems, this paper proposes a rational multi-secret sharing scheme, which combines the secret sharing scheme with game theory. In the protocol, the problem of sharing multiple secrets is addressed, and there are multiple secrets to be shared during one secret sharing process. Furthermore, this work starts off by constructing a protocol in simultaneous broadcast networks, and then we emulate the broadcast channel over point-to-point networks. Based on a computational assumption, we show that rational players have no incentive to deviate from the protocol and every player can obtain multi-secret fairly.

A new socio-rational secret sharing scheme

2017 ◽  
Vol 8 (1) ◽  
pp. 21
Author(s):  
Jianghao Jin ◽  
Xie Zhou ◽  
Chuangui Ma ◽  
N.A. Xu' ◽  
an Wang
Keyword(s):  
Secret Sharing ◽  
Secret Sharing Scheme ◽  
Sharing Scheme ◽  
Rational Secret Sharing

scholarly journals Reusable Multi-Stage Multi-Secret Sharing Schemes Based on CRT

2015 ◽  
Vol 11 (1) ◽  
pp. 15 ◽  
Author(s):  
Anjaneyulu Endurthi ◽  
Oinam B. Chanu ◽  
Appala N. Tentu ◽  
V. Ch. Venkaiah
Keyword(s):  
Secret Sharing ◽  
Chinese Remainder Theorem ◽  
Secret Sharing Schemes ◽  
Secret Sharing Scheme ◽  
The Third ◽  
Sharing Scheme ◽  
Multi Stage ◽  
Multi Secret Sharing

Three secret sharing schemes that use the Mignotte’ssequence and two secret sharing schemes that use the Asmuth-Bloom sequence are proposed in this paper. All these five secret sharing schemes are based on Chinese Remainder Theorem (CRT) [8]. The first scheme that uses the Mignotte’s sequence is a single secret scheme; the second one is an extension of the first one to Multi-secret sharing scheme. The third scheme is again for the case of multi-secrets but it is an improvement over the second scheme in the sense that it reduces the number of publicvalues. The first scheme that uses the Asmuth-Bloom sequence is designed for the case of a single secret and the second one is an extension of the first scheme to the case of multi-secrets. Novelty of the proposed schemes is that the shares of the participants are reusable i.e. same shares are applicable even with a new secret. Also only one share needs to be kept by each participant even for the muslti-secret sharing scheme. Further, the schemes are capable of verifying the honesty of the participants including the dealer. Correctness of the proposed schemes is discussed and show that the proposed schemes are computationally secure.

AN EFFICIENT AND INFORMATION THEORETICALLY SECURE RATIONAL SECRET SHARING SCHEME BASED ON SYMMETRIC BIVARIATE POLYNOMIALS

2011 ◽  
Vol 22 (06) ◽  
pp. 1395-1416 ◽  
Author(s):  
CHRISTOPHE TARTARY ◽  
HUAXIONG WANG ◽  
YUN ZHANG
Keyword(s):  
Secret Sharing ◽  
Research Area ◽  
Broadcast Channels ◽  
Secret Sharing Scheme ◽  
Bivariate Polynomials ◽  
Sharing Scheme ◽  
Rational Secret Sharing ◽  
Dominated Strategies ◽  
Cryptographic Primitive ◽  
First Time

The design of rational cryptographic protocols is a recently created research area at the intersection of cryptography and game theory. In this paper, we propose a new m-out-of-n rational secret sharing scheme requiring neither the involvement of the dealer (except during the initial share distribution) nor a trusted mediator. Our protocol leads to a Nash equilibrium surviving the iterated deletion of weakly dominated strategies for m ≥ 4. Our construction is information theoretically secure and it is immune against backward induction attacks. Contrary to Kol and Naor who used a specific cryptographic primitive in their TCC'08 paper (namely, meaningful/meaningless encryption), the immunity of our scheme is based on the use of bivariate polynomials and one-time pads. To the best of our knowledge, it is the first time that such polynomials have been used for rational secret sharing. Our scheme is efficient and does not require any physical assumptions such as envelopes or ballot boxes. As most of existing rational protocols, our construction requires simultaneous broadcast channels. However, our proposed scheme does not require any computational assumption and it provides information theoretical security.

Sign in / Sign up

Export Citation Format

Share Document