RSA Verifiable Signature Sharing Scheme for General Mixed Access Structures
Kewei Lv · Xinxi wangluo anquan · 2011
In this paper, we make use a very simple approach to verifiable secret sharing, which is based on essentially no mathematical structure or sophisticated sub-protocols except for intersections of sets and additions and multiplications of numbers, to construct a new RSA VΣS scheme against the mixed (both active and passive) corruption on general (as opposed to threshold) adversary structures. VΣS was introduced by Franklin and Reiter in 1995, enables the recipient of a digital signature who is not necessarily the original signer, to share that signature among n players so that a subset of them can later reconstruct it. Our protocol is well-suited for didactic purposes more since it is efficient and practical only for a small number of players.