Cryptology ePrint Archive: Report 2002/102

Applying General Access Structure to Metering Schemes

Ventzislav Nikov and Svetla Nikova and Bart Preneel and Joos Vandewalle

Abstract: In order to decide on advertisement fees for web servers, Naor and Pinkas introduced metering schemes secure against coalition of corrupt servers and clients. In their schemes any server is able to construct a proof to be sent to an audit agency if and only if it has been visited by at least a certain number of clients. Several researchers have generalized the idea of Naor and Pinkas: first metering scheme with pricing and dynamic multi-threshold metering schemes have been proposed; later the solution has been extended to allow for general access structures and an approach on linear algebra has been introduced. In this paper we are interested in the efficiency of applying general access structures and linear algebra techniques to metering schemes. We propose a new model considering general access structures for clients, corrupted clients and servers. Then we bind the access structures for clients and corrupted clients into one. We propose a new metering scheme, which is more efficient w.r.t.\ communication complexity and memory requirements than the scheme of Blundo \textit{et al.}

Category / Keywords: secret sharing schemes, metering schemes, access structure

Publication Info: to appear at WCC 2003, March 24-28, 2003, Versailles (France).

Date: received 25 Jul 2002, last revised 2 Mar 2003

Contact author: svetla nikova at esat kuleuven ac be

Available format(s): Postscript (PS) | Compressed Postscript (PS.GZ) | PDF | BibTeX Citation

Note: revised version

Version: 20030302:145113 (All versions of this report)

Discussion forum: Show discussion | Start new discussion


[ Cryptology ePrint archive ]