Verifiable Rational Secret Sharing Scheme in Mobile Networks

Abstract EN

With the development of mobile network, lots of people now have access to mobile phones and the mobile networks give users ubiquitous connectivity.

However, smart phones and tablets are poor in computational resources such as memory size, processor speed, and disk capacity.

So far, all existing rational secret sharing schemes cannot be suitable for mobile networks.

In this paper, we propose a verifiable rational secret sharing scheme in mobile networks.

The scheme provides a noninteractively verifiable proof for the correctness of participants’ share and handshake protocol is not necessary; there is no need for certificate generation, propagation, and storage in the scheme, which is more suitable for devices with limited size and processing power; in the scheme, every participant uses her encryption on number of each round as the secret share and the dealer does not have to distribute any secret share; every participant cannot gain more by deviating the protocol, so rational participant has an incentive to abide by the protocol; finally, every participant can obtain the secret fairly (means that either everyone receives the secret, or else no one does) in mobile networks.

The scheme is coalition-resilient and the security of our scheme relies on a computational assumption.