Methods, apparatus, and program products for inferring...

Electrical computers and digital processing systems: support – Multiple computer communication using cryptography – Particular communication authentication technique

Reexamination Certificate

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

C713S163000, C380S278000, C705S071000

Reexamination Certificate

active

10291310

ABSTRACT:
Given the recent changes in the policy governing Internet content distribution, such as the institution of per listener royalties for Internet radio broadcasters, content distributors now have an incentive to under-report the size of their audience. Previous audience measurement schemes only protect against inflation of audience size. We present the first protocols for audience measurement that protect against both inflation and deflation attempts by content distributors. The protocols trade-off the amount of additional information the service providers must distribute to facilitate audience inference with the amount of infrastructure required and are applicable to Internet radio, web plagiarism, and software license enforcement. The protocols can be applied to other situations, such as auditing website screen scrapers and per-seat licensed software installations.

REFERENCES:
patent: 5592552 (1997-01-01), Fiat
patent: 6055508 (2000-04-01), Naor et al.
patent: 6195751 (2001-02-01), Caronni et al.
patent: 6389538 (2002-05-01), Gruse et al.
patent: 6418467 (2002-07-01), Schweitzer et al.
patent: 6629243 (2003-09-01), Kleinman et al.
patent: 6782475 (2004-08-01), Sumner
patent: 6832314 (2004-12-01), Irvin
patent: 6839436 (2005-01-01), Garay et al.
patent: 6911974 (2005-06-01), Asano et al.
patent: 7088822 (2006-08-01), Asano
patent: 7167564 (2007-01-01), Asano et al.
patent: 7203968 (2007-04-01), Asano et al.
patent: 7224804 (2007-05-01), Ishiguro et al.
patent: 2003/0005285 (2003-01-01), Graunke
patent: 2005/0111668 (2005-05-01), Raikar
Johnson, Rob and Jessica Staddon. FAIR: Fair Audience InfeRence. Oct. 15, 2002.
Franklin, Matthew K. and Malkhi, Dahlia “Auditable Metering with Lightweight Security,”Financial Cryptology, Proceedings First International Conference, FC'97, Feb. 24-28, 1997, pp. 151-160.
Masucci, Barbara and Stinson, Douglas R. “Efficient Metering Schemes with Pricing,”IEEE Transactions on Information Theory, vol. 47, No. 7, Nov. 2001, pp. 2835-2844.
Naor, Moni and Pinkas, Benny “Secure and Efficient Metering,”Lecture Notes in Computer Science, vol. 1403, Proceedings from Advances in Cryptology—EUROCRYPT '98, Espoo, Finland, May 31-Jun. 4, 1998, pp. 576-590.
Fan, Li et al. “Summary Cache: A Scalable Wide-Area Web Cache Sharing Protocol,” 1998, section on Bloom Filters—the Math, printed from http://www.cs.wisc.edu/˜cao/papers/summary-cache
ode8.html.
Hardy, Norman “A Little Bloom Filter Theory (anda Bag of Filter Tricks),” 1999, printed from http://cap-lore.com/code/BloomTheory.html.
Ripeanu, Matei and Adriana Iamnitchi, “Bloom Filters—Short Tutorial,” Sep. 2001, printed from http://people.cs.uchicago.edu/˜matei/PAPERS/.
“Web Caching with Dynamic content Seminar,” 2000, printed from http://www.beachsoftware.com/bloom/index.html.
“Web Caching with Dynamic Content Seminar—White Paper,” 2000, printed from http://www.beachsoftware.com/bloom/white—paper.html.

LandOfFree

Say what you really think

Search LandOfFree.com for the USA inventors and patents. Rate them and share your experience with other people.

Rating

Methods, apparatus, and program products for inferring... does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Methods, apparatus, and program products for inferring..., we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Methods, apparatus, and program products for inferring... will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFUS-PAI-O-3825733

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.