Secure publicly verifiable and proactive secret sharing schemes with general access structure

A publicly verifiable secret sharing allows anyone to detect the cheating of dealer or participants only from the public information. In this paper, by using bilinear pairings and monotone span programs we propose two practical publicly verifiable secret sharing schemes with general access structure. The first scheme has provable security in the standard model. The other scheme is proactive, robust and secure against mobile attack. These schemes tolerate active and adaptive adversaries and provide great capabilities for many applications.

[1]  Svetla Nikova,et al.  On Proactive Secret Sharing Schemes , 2004, Selected Areas in Cryptography.

[2]  Lein Harn,et al.  An Ideal Multi-secret Sharing Scheme Based on Connectivity of Graphs , 2014, Wirel. Pers. Commun..

[3]  Rafail Ostrovsky,et al.  Communication-Optimal Proactive Secret Sharing for Dynamic Groups , 2015, ACNS.

[4]  Qiong Huang,et al.  A Joint Random Secret Sharing Scheme with Public Verifiability , 2016, Int. J. Netw. Secur..

[5]  Josh Benaloh,et al.  Generalized Secret Sharing and Monotone Functions , 1990, CRYPTO.

[6]  Yixian Yang,et al.  Publicly Verifiable Secret Sharing Scheme with Provable Security against Chosen Secret Attacks , 2013, Int. J. Distributed Sens. Networks.

[7]  Yuh-Min Tseng,et al.  A pairing-based publicly verifiable secret sharing scheme , 2011, J. Syst. Sci. Complex..

[8]  Samaneh Mashhadi.  Share secrets stage by stage with homogeneous linear feedback shift register in the standard model , 2016, Secur. Commun. Networks.

[9]  Huawang Qin,et al.  A secret sharing scheme based on (t, n) threshold and adversary structure , 2009, International Journal of Information Security.

[10]  Ueli Maurer,et al.  General Secure Multi-party Computation from any Linear Secret-Sharing Scheme , 2000, EUROCRYPT.

[11]  Hugo Krawczyk,et al.  Secure Distributed Key Generation for Discrete-Log Based Cryptosystems , 1999, EUROCRYPT.

[12]  Mahabir Prasad Jhanwar,et al.  A Practical (Non-interactive) Publicly Verifiable Secret Sharing Scheme , 2011, ISPEC.

[13]  Jorge Luis Villar,et al.  Publicly Verfiable Secret Sharing from Paillier's Cryptosystem , 2005, WEWoRC.

[14]  Hugo Krawczyk,et al.  Proactive Secret Sharing Or: How to Cope With Perpetual Leakage , 1995, CRYPTO.

[15]  Jorge Luis Villar Santos,et al.  Public verifiability from pairings in secret sharing schemes , 2009 .

[16]  Samaneh Mashhadi,et al.  Computationally secure multiple secret sharing: models, schemes, and formal security analysis , 2016, ISC Int. J. Inf. Secur..

[17]  Jorge Luis Villar,et al.  Public Verifiability from Pairings in Secret Sharing Schemes , 2009, Selected Areas in Cryptography.

[18]  Markus Stadler,et al.  Publicly Verifiable Secret Sharing , 1996, EUROCRYPT.

[19]  Rafail Ostrovsky,et al.  How to withstand mobile virus attacks (extended abstract) , 1991, PODC '91.

[20]  Avi Wigderson,et al.  On span programs , 1993, [1993] Proceedings of the Eigth Annual Structure in Complexity Theory Conference.