EFFICIENT CHEATER IDENTIFICATION IN SEQUENTIAL SECRET SHARING SCHEMES

Abstract

In this paper we propose two efficient secret sharing schemes with cheater identification based on the sequential model. Our schemes greatly reduce the amount of data kept by the participants as well as the data transmitted by the dealer. In our schemes, the dealer only has to send O(n) data instead of O(n^2m) for the existing schemes in the literature, where n is the number of participants and m is the number of rounds of the sequential model. Moreover, onle one shadow is kept by each participant in our schemes without the need of any checking parameters while O(m) shadows and O(nm) checking parameters are needed for each participant in the previous schemes.