In this paper we describe a linear algebraic approach to design metering schemes realizing any access structure. Namely, given any access structure, we present a method to construct a metering scheme realizing it from any linear secret sharing scheme with the same access structure. Besides, we prove some properties about the relationship between metering schemes and secret sharing schemes. These properties provide some new bounds on the information distributed to clients and servers in a metering scheme. According to these bounds, the optimality of the metering schemes obtained by our method relies upon the optimality of the linear secret sharing schemes for the given access structure.
Category / Keywords: electronic commerce and payment, secret sharing, information theory Date: received 26 Oct 2001 Contact author: masucci at dia unisa it Available format(s): Postscript (PS) | Compressed Postscript (PS.GZ) | BibTeX Citation Version: 20011026:130526 (All versions of this report) Short URL: ia.cr/2001/087 Discussion forum: Show discussion | Start new discussion