Robust Metering Schemes for General Access Structures
- 693 Downloads
In order to decide on advertisement fees for web servers, Naor and Pinkas introduced (threshold) metering schemes secure against coalitions of corrupt servers and clients. They show that one should be able to detect illegal behavior of clients, i.e., one needs to verify the shares received from clients. Most metering schemes do not offer this feature. But Ogata and Kurosawa pointed out a minor flaw in the extension protocol by Naor and Pinkas providing detection of such illegal behavior and propose a correction. In this paper we extend the linear algebra approach from Nikov et al. in order to build robust unconditionally secure general metering schemes. As a tool to achieve this goal we introduce doubly-labelled matrices and an operation on such matrices. Certain properties of this operation are proven.
KeywordsAccess Structure Secret Share Scheme Illegal Behavior Regular Operation Cryptology ePrint Archive
Unable to display preview. Download preview PDF.
- 3.Blundo, C., Martin, S., Masucci, B., Padro, C.: A Linear Algebraic Approach to Metering Schemes, Cryptology ePrint Archive: Report 2001/087Google Scholar
- 9.Nikov, V., Nikova, S., Preneel, B., Vandewalle, J.: Applying General Access Structure to Metering Schemes. In: WCC 2003, Cryptology ePrint Archive: Report 2002/102 (2003)Google Scholar
- 10.Nikov, V., Nikova, S., Preneel, B.: Multi-Party Computation from any Linear Secret Sharing Scheme Secure against Adaptive Adversary: The Zero-Error Case, Cryptology ePrint Archive: Report 2003/006Google Scholar
- 11.Nikov, V., Nikova, S.: On a relation between Verifiable Secret Sharing Schemes and a class of Error-Correcting Codes, Cryptology ePrint Archive: Report 2003/210Google Scholar
- 14.Pudlak, P., Sgall, J.: Algebraic models of computation and interpolation for algebraic proof systems. In: Proc. Feasible Arithmetic and Proof Complexity. LNCS, pp. 279–295 (1998)Google Scholar