A NEW VERIFIABLE MULTI-SECRET SHARING SCHEME BASED ON ELLIPTIC CURVES AND PAIRINGS

Abstract

In 2008, Liu, Huang, Luo and Dai, proposed a (t, n) multi-point sharing scheme by using self-pairings on the elliptic curves.  The Liu’s scheme is not verifiable, needs a secure channel and also there exists some restrictions in the number of secrets to be shared.  In this paper we propose a new verifiable multi-secret sharing scheme which is based on that of Liu.  In our scheme, there is no need to a secure channel and also there is no limit on the number of secrets.  Furthermore, to identify the cheaters, the combiner can verify the secrets which have been sent by other participants during the reconstruction phase.