Generalized secret sharing and monotone functions
CRYPTO '88 Proceedings on Advances in cryptology
How to (really) share a secret
CRYPTO '88 Proceedings on Advances in cryptology
Elements of information theory
Elements of information theory
Some improved bounds on the information rate of perfect secret sharing schemes
Journal of Cryptology
An explication of secret sharing schemes
Designs, Codes and Cryptography
Geometric secret sharing schemes and their duals
Designs, Codes and Cryptography
Tight Bounds on the Information Rate of Secret SharingSchemes
Designs, Codes and Cryptography
Secure accounting and auditing on the Web
WWW7 Proceedings of the seventh international conference on World Wide Web 7
Secure and lightweight advertising on the Web
WWW '99 Proceedings of the eighth international conference on World Wide Web
Auditable metering with lighweight security
Journal of Computer Security
Communications of the ACM
A note on optimal metering schemes
Information Processing Letters
DISC '00 Proceedings of the 14th International Conference on Distributed Computing
Metering Schemes for General Access Structures
ESORICS '00 Proceedings of the 6th European Symposium on Research in Computer Security
Secret sharing schemes with bipartite access structure
IEEE Transactions on Information Theory
Efficient metering schemes with pricing
IEEE Transactions on Information Theory
| Hi-index | 0.00 |
A metering scheme is a method by which an audit agency is able to measure the interaction between servers and clients during a certain number of time frames. Naor and Pinkas (Vol. 1403 of LNCS, pp. 576–590) proposed metering schemes where any server is able to compute a proof (i.e., a value to be shown to the audit agency at the end of each time frame), if and only if it has been visited by a number of clients larger than or equal to some threshold h during the time frame. Masucci and Stinson (Vol. 1895 of LNCS, pp. 72–87) showed how to construct a metering scheme realizing any access structure, where the access structure is the family of all subsets of clients which enable a server to compute its proof. They also provided lower bounds on the communication complexity of metering schemes. 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.