Skip to main content
SpringerLink
Log in

A Linear Algebraic Approach to Metering Schemes

  • Published:
Designs, Codes and Cryptography Aims and scope Submit manuscript

Abstract

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.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. A. Beimel, Secure Schemes for Secret Sharing Schemes and Key Distribution, Ph.D. Thesis, Dept. of Computer Science, Technion, 1996. Available at http://www.cs.bgu.ac.il/beimel/pub.html

  2. J. C. Benaloh and J. Leichter, Generalized secret sharing and monotone functions, In Proc. of CRYPTO '88, LNCS, Vol. 403 (1990) pp. 27–35.

  3. G. R. Blakley, Safeguarding cryptographic keys, In Proc. of AFIPS 1979 National Computer Conference, Vol. 48 (1979) pp. 313–317.

    Google Scholar 

  4. C. Blundo, A. De Bonis and B. Masucci, Metering schemes with pricing, In Proc. of DISC 2000, LNCS, Vol. 1914 (2000) pp. 194–208.

  5. C. Blundo, A. De Bonis and B. Masucci, Bounds and constructions for metering schemes, Communications in Information and Systems, Vol. 2, No. 1, June (2002) pp. 1–28.

    Google Scholar 

  6. C. Blundo, A. De Bonis, B. Masucci and D. R. Stinson, Dynamic multi-threshold metering schemes, In Proc. of SAC 2000, LNCS, Vol. 2012 (2001) pp. 130–144.

  7. C. Blundo, A. De Santis, R. De Simone and U. Vaccaro, Tight bounds on the information rate of secret sharing schemes, Design, Codes and Cryptography, Vol. 11 (1997) pp. 107–122.

    Google Scholar 

  8. C. Blundo, S. Martin, B. Masucci and C. Padró, New bounds on the communication complexity of metering schemes, In Proc. of ISIT 2002, IEEE International Symposium on Information Theory.

  9. C. Blundo, S. Cimato and B. Masucci, A note on optimal metering schemes, Information Processing Letters, Vol. 84, No. 6, November (2002) pp. 319–326.

    Google Scholar 

  10. E. F. Brickell, Some ideal secret sharing schemes, The Journal of Combinatorial Mathematics and Combinatorial Computing, Vol. 6 (1989) pp. 105–113.

    Google Scholar 

  11. E. F. Brickell and D. R. Stinson, Improved bounds on the information rate of perfect secret sharing schemes, Journal of Cryptology, Vol. 5, No. 3 (1992) pp. 153–166.

    Google Scholar 

  12. R. Capocelli, A. De Santis, L. Gargano and U. Vaccaro, On the size of the shares in secret sharing schemes, Journal of Cryptology, Vol. 6 (1993) pp. 57–167.

    Google Scholar 

  13. T. M. Cover and J. A. Thomas, Elements of Information Theory, John Wiley & Sons (1991).

  14. A. De Bonis and B. Masucci, An information theoretic approach to metering schemes, In Proc. of ISIT 2000, IEEE International Symposium on Information Theory.

  15. M. Franklin and D. Malkhi, Auditable metering with lightweight security, Journal of Computer Security, Vol. 6, No. 4 (1998) pp. 237–255.

    Google Scholar 

  16. M. Ito, A. Saito and T. Nishizeki, Secret sharing schemes realizing any access structure, In Proc. of IEEE Globecom'87, (1987) pp. 99–102.

  17. W. Jackson and K. Martin, Geometric secret sharing schemes and their duals, Design, Codes, and Cryptography, Vol. 4 (1994) pp. 83–95.

    Google Scholar 

  18. M. Jakobsson, P. D. MacKenzie and J. P. Stern, Secure and lightweight advertising on the web, 8th International World Wide Web Conference, (1999). Available at http://www8.org/w8-papers/ 1a-electronic-market/secure/secure.html

  19. M. Karchmer and A. Wigderson, On span programs, In Proc. of the 8th Annual IEEE Symposium on Structure in Complexity, (1993) pp. 102–111.

  20. B. Masucci and D. R. Stinson, Metering schemes for general access structures, In Proc. of ESORICS 2000, LNCS, Vol. 1895 (2000) pp. 72–87.

  21. B. Masucci and D. R. Stinson, Efficient metering schemes with pricing, IEEE Transactions on Information Theory, Vol. 47, No. 7, November (2001).

  22. M. Naor and B. Pinkas, Secure and efficient metering, In Proc. of EUROCRYPT '98, LNCS, Vol. 1403 (1998) pp. 576–590.

  23. M. Naor and B. Pinkas, Secure accounting and auditing on the web, Computer Networks and ISDN Systems, Vol. 40, Issues 1-7 (1998) pp. 541–550.

    Google Scholar 

  24. C. Padró and G. Sáez, Secret sharing schemes with bipartite access structures, IEEE Transactions on Information Theory, Vol. 46 (2000) pp. 2596–2605.

    Google Scholar 

  25. A. Shamir, How to share a secret, Comm. of ACM, Vol. 22, No. 11 (1979) pp. 612–613.

    Google Scholar 

  26. G. J. Simmons, How to (really) share a secret, In Proc. of CRYPTO '88, LNCS, Vol. 403 (1990) pp. 390–448.

  27. G. J. Simmons, W. Jackson and K. Martin, The geometry of secret sharing schemes, Bulletin of the ICA, Vol. 1 (1991) pp. 71–88.

    Google Scholar 

  28. D. R. Stinson, An explication of secret sharing schemes, Designs, Codes and Cryptography, Vol. 2 (1992) pp. 357–390.

    Google Scholar 

  29. D. R. Stinson, Decomposition constructions for secret-sharing schemes, IEEE Transactions on Information Theory, Vol. 40 (1994) pp. 118–125.

    Google Scholar 

Download references

Authors
  1. Carlo Blundo
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Sebastià Martín
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Barbara Masucci
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. CarlEs Padró
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Blundo, C., Martín, S., Masucci, B. et al. A Linear Algebraic Approach to Metering Schemes. Designs, Codes and Cryptography 33, 241–260 (2004). https://doi.org/10.1023/B:DESI.0000036249.86262.d5

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1023/B:DESI.0000036249.86262.d5

Search

Navigation