Advertisement

Secure Metering Schemes

  • Carlo Blundo
  • Stelvio Cimato
  • Barbara Masucci
Chapter

Abstract

The current trend on the Internet suggests that the majority of revenues of web sites come from the advertising potential of the World Wide Web. Advertising is arguably the type of commercial information exchange of the greatest economic importance in the real world. Indeed, advertising is what funds most other forms of information exchange, including radio stations, television stations, cable networks, magazines, and newspapers. According to the figures provided by the Internet Advertising Bureau [24] and Price Waterhouse Coopers [43], advertising revenue results for the first 9 months of 2004 totaled slightly over 7.0 billion dollars.

Keywords

Hash Function Private Information Communication Complexity Access Structure Secret Sharing Scheme 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

References

  1. 1.
    V. Anupam, A. Mayer, K. Nissim, B. Pinkas, and M. K. Reiter, On the Security of Pay-Per-Click and Other Web Advertising Schemes, in Proceedings of The 8th International World Wide Web Conference – WWW8, Toronto, Canada, (Elsevier 1999), pp. 1091–1100.Google Scholar
  2. 2.
    V. Anupam, A. Mayer, and M. K. Reiter, Detecting Hit Shaving in Click-through Payment Schemes, in Proceedings of The 3rd USENIX Workshop on Electronic Commerce, Boston, Massachusetts, USA, (Usenix Assoc. 1998), pp. 155–166.Google Scholar
  3. 3.
  4. 4.
    S. G. Barwick, W. Jackson, and K. Martin, A General Approach to Robust Web Metering, Designs, Codes, and Cryptography, Vol. 36, No. 1, (2005), pp. 5–27.Google Scholar
  5. 5.
    A. Beimel, Secure Schemes for Secret Sharing Schemes and Key Distribution, PhD Thesis, Dept. of Computer Science, Technion, 1996. Available at http://www.cs.bgu.ac.il/ ∼ beimel/pub.html.
  6. 6.
    F. Bergadano and P. De Mauro, Third-party Certification of HTTP Service Access Statistics, in Proceedings of Security Protocols Workshop, Lecture Notes in Computer Science, Vol. 1550, (Springer, Berlin 1998), pp. 94–99.Google Scholar
  7. 7.
    F. Bergadano and P. De Mauro, Method and Apparatus for the Verification of Server Access Logs and Statistics, US Patent 6.574.627, June 2003.Google Scholar
  8. 8.
    G. R. Blakley, Safeguarding Cryptographic Keys, in Proceedings of AFIPS 1979 National Computer Conference, 1979, pp. 313–317.Google Scholar
  9. 9.
    C. Blundo and S. Cimato, SAWM: A Tool for Secure and Authenticated Web Metering, in Proceedings of The 14th International Conference on Software Engineering and Knowledge Engineering – SEKE 2002, Ischia, Italy, (ACM 2002), pp. 641–648.Google Scholar
  10. 10.
    C. Blundo and S. Cimato, A Software Infrastructure for Authenticated Web Metering, IEEE Computer, Vol. 37, No. 664, (IEEE 2004), pp. 28–33.Google Scholar
  11. 11.
    C. Blundo, S. Cimato, and B. Masucci, A Note on Optimal Metering Schemes, Information Processing Letters, Vol. 84, No. 6, 2002, pp. 319–326.MathSciNetMATHCrossRefGoogle Scholar
  12. 12.
    C. Blundo, A. De Bonis, and B. Masucci, Metering Schemes with Pricing, in Proceedings of The 14th International Conference on Distributed Computing – DISC 2000, Toledo, Spain, M. Herlihy (Ed.), Lecture Notes in Computer Science, Vol. 1914, (Springer, Berlin 2000), pp. 194–208.Google Scholar
  13. 13.
    C. Blundo, A. De Bonis, and B. Masucci, Bounds and Constructions for Metering Schemes, Communications in Information and Systems, Vol. 2, No. 1, (2002), pp. 1–28.MathSciNetMATHGoogle Scholar
  14. 14.
    C. Blundo, A. De Bonis, B. Masucci, and D. R. Stinson, Dynamic Multi–Threshold Metering Schemes, in Proceedings of The 7th Annual Workshop on Selected Areas in Cryptography – SAC 2000, Waterloo, Canada, D. R. Stinson, S. Tavares (Eds.), Lecture Notes in Computer Science, Vol. 2012, (Springer, Berlin 2001), pp. 130–144.Google Scholar
  15. 15.
    C. Blundo, S. Martin, B. Masucci, and C. Padrò, A Linear Algebraic Approach to Metering Schemes, Designs, Codes, and Cryptography, Vol. 33, (2004), pp. 241–260.MATHGoogle Scholar
  16. 16.
    E. F. Brickell, Some Ideal Secret Sharing Schemes, The Journal of Combinatorial Mathematics and Combinatorial Computing, Vol. 6, (1989), pp. 105–113.MathSciNetMATHGoogle Scholar
  17. 17.
    Coalition for Advertising Supported Information and Entertainment, CASIE Guiding Principles of Interactive Media Audience Measurement. Available at http://www.commercepark.com/AAAA/casie/gp/guiding_principles.html.
  18. 18.
    T. M. Cover and J. A. Thomas, Elements of Information Theory, (Wiley, New York, 1991).MATHCrossRefGoogle Scholar
  19. 19.
    A. De Bonis and B. Masucci, An Information Theoretical Approach to Metering Schemes, in Proceedings of The 2000 IEEE International Symposium on Information Theory – ISIT 2000, Sorrento, Italy, (2000).Google Scholar
  20. 20.
    Y. Desmedt and Y. Frankel, Threshold Cryptosystems, in Proceedings of Advances in Cryptology – CRYPTO ’89, G. Brassard (Ed.), Lecture Notes in Computer Science, Vol. 435, (Springer, Berlin 1990), pp. 307–315.Google Scholar
  21. 21.
    C. Dwork and M. Naor, Pricing via Processing or Combatting Junk Mail, in Proceedings of Advances in Cryptology – CRYPTO ’95, E. F. Brickell (Ed.), Lecture Notes in Computer Science, Vol. 740, (Springer, Berlin 1993), pp. 139–147.Google Scholar
  22. 22.
    P. Feldman, A Practical Scheme for Non-Interactive Secret Sharing, in Proceedings of the 28-th IEEE Symposium on Foundations of Computer Science, pp. 427–437, 1987.Google Scholar
  23. 23.
    M. Franklin and D. Malkhi, Auditable Metering with Lightweight Security, Journal of Computer Security, Vol. 6, No. 4, (1998), pp. 237–225.Google Scholar
  24. 24.
    Internet Advertising Bureau, http://www.iab.net
  25. 25.
  26. 26.
    S. Jarecki and A. Odlyzko, An Efficient Micropayment System Based on Probabilistic Polling, in Proceedings of Financial Cryptography ’97, R. Hirschfeld (Ed.), Lecture Notes in Computer Science, Vol. 1318, (Springer, Berlin 1997), pp. 173–191.Google Scholar
  27. 27.
    M. Karchmer, A. Wigderson, On Span Programs, in Proceedings of the 8th Annual IEEE Symposium on Structure in Complexity, pp. 102–111, 1993.Google Scholar
  28. 28.
    L. Lamport, Password Authentication with Insecure Communication, In Communications of the ACM, Vol. 24, pp. 770–771, 1981.Google Scholar
  29. 29.
    B. Masucci and D. R. Stinson, Metering Schemes for General Access Structures, in Proceedings of The 6th European Symposium on Research in Computer Security – ESORICS 2000, Toulouse, France, F. Cuppens, Y. Deswarte, D. Gollmann, M. Waidner (Eds.), Lecture Notes in Computer Science, Vol. 1895, (Springer, Berlin 2000), pp. 72–87.Google Scholar
  30. 30.
    B. Masucci and D. R. Stinson, Efficient Metering Schemes with Pricing, IEEE Transactions on Information Theory, Vol. 47, No. 7, (IEEE 2001), pp. 2835–2844.Google Scholar
  31. 31.
  32. 32.
    A. Menezes, P. van Oorschot, and S. Vanstone, Handbook of Applied Cryptography, CRC, Boca Raton, 1996.CrossRefGoogle Scholar
  33. 33.
    R. Merkle, A Certified Digital Signature, in Proceedings of Advances in Cryptology – CRYPTO ’89, G. Brassard (Ed.), Lecture Notes in Computer Science, Vol. 435, (Springer, Berlin 1990), pp. 218–238.Google Scholar
  34. 34.
    M. Naor and B. Pinkas, Secure and Efficient Metering, in Proceedings of Advances in Cryptology – EUROCRYPT ’98, K. Nyberg (Ed.), Lecture Notes in Computer Science, Vol. 1403, (Springer, Berlin 1998), pp. 576–590.Google Scholar
  35. 35.
    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
  36. 36.
    M. Naor and B. Pinkas, Method for Secure Accounting and Auditing on a Communications Network, US Patent 6.055.508, June 1998.Google Scholar
  37. 37.
  38. 38.
    Nielsen Media Research, http://www.nielsenmedia.com
  39. 39.
    V. Nikov, S. Nikova, B. Preenel, and J. Vandewalle, Applying General Access Structure to Metering Scheme, Cryptology eprint Archive 2002/12.Google Scholar
  40. 40.
    V. Nikov, S. Nikova, and B. Preenel, Robust Metering Schemes for General Access Structures, in Proceedings of The 2004 International Conference on Information and Communications Security – ICICS 2004, Lecture Notes in Computer Science, Vol. 3269, (Springer, Berlin 2004), pp. 53–66.Google Scholar
  41. 41.
    T. Novak and D. Hoffman, New Metrics for New Media: Towards the Development of Web Measurement Standards, September 1996. Available at http://www2000.ogsm.vanderbilt.edu/novak/web.standards/webstands.html
  42. 42.
    W. Ogata and K. Kurosawa, Provably Secure Metering Scheme, in Proceedings of ASIACRYPT 2000, T. Okamoto (Ed.), Lecture Notes in Computer Science, Vol. 1976, (Springer, Berlin 2000), pp. 388–398.Google Scholar
  43. 43.
    PriceWaterhouseCoopers, http://www.pwcglobal.com
  44. 44.
    A. Shamir, How to Share a Secret, Communications of the ACM, Vol. 22, (1979), pp. 612–613.MathSciNetMATHGoogle Scholar
  45. 45.
    D. R. Stinson, An Explication of Secret Sharing Schemes, Design, Codes, and Cryptography, Vol. 2, (1992), pp. 357–390.MathSciNetMATHGoogle Scholar
  46. 46.
    D. R. Stinson, Cryptography Theory and Practice, (CRC, Boca Raton 1995).Google Scholar

Copyright information

© Springer Science+Business Media, LLC 2010

Authors and Affiliations

  1. 1.Dipartimento di Informatica ed ApplicazioniUniversità di SalernoBaronissiItaly

Personalised recommendations