Electrical computers and digital processing systems: multicomput – Computer network managing – Computer network access regulating
Reexamination Certificate
2006-12-12
2006-12-12
Lin, Wen-Tai (Department: 2154)
Electrical computers and digital processing systems: multicomput
Computer network managing
Computer network access regulating
C713S152000, C380S028000
Reexamination Certificate
active
07149801
ABSTRACT:
A resource may be abused if its users incur little or no cost. For example, e-mail abuse is rampant because sending an e-mail has negligible cost for the sender. Such abuse may be discouraged by introducing an artificial cost in the form of a moderately expensive computation. Thus, the sender of an e-mail might be required to pay by computing for a few seconds before the e-mail is accepted. Unfortunately, because of sharp disparities across computer systems, this approach may be ineffective against malicious users with high-end systems, prohibitively slow for legitimate users with low-end systems, or both. Starting from this observation, we identify moderately hard, memory bound functions that most recent computer systems will evaluate at about the same speed, and we explain how to use them for protecting against abuses.
REFERENCES:
patent: 5432852 (1995-07-01), Leighton et al.
patent: 6161130 (2000-12-01), Horvitz et al.
patent: 6192114 (2001-02-01), Council
patent: 6662300 (2003-12-01), Peters
patent: 2002/0120853 (2002-08-01), Tyree
patent: 2003/0044003 (2003-03-01), Chari et al.
patent: 2003/0172159 (2003-09-01), Schuba et al.
patent: 2004/0003283 (2004-01-01), Goodman et al.
patent: 2004/0030932 (2004-02-01), Juels et al.
patent: 2004/0059951 (2004-03-01), Pinkas et al.
patent: 2004/0068668 (2004-04-01), Lor et al.
HashCash, http://cypherspace.org/˜adam/hashcash/, Aug. 13, 2002, 4 pages.
Camran, http://www.camram.org/, Aug. 13, 2002, 5 pages.
Juels, A. et al., “Client Puzzles: A Cryptographic Defense Against Connection Depletion Attacks,”Proceedings of NDSS '99(Networks and Distributed Security Systems), 1999, 151-165 and an abstract (1 page).
The CAPTCHA Project, “Telling Humans and Computers Apart (Automatically),” Aug. 13, 2002, 1 page.
Glassman, S. et al., “The Millicent Protocol for Inexpensive Electronic Commerce,”Fourth International World Wide Web Conference(“The Web Revolution”), Boston, Massachusetts, Dec. 11-14, 1995, 21 pages.
Abadi, M. et al., “Strengthening Passwords,”SRC Technical Note 1997-033, Digital Equipment Corporation, Systems, Research Center, Sep./Dec. 1997, 12 pages.
Aggarwal, A. et al., “A model for hierarchical memory,” InProceedings of the Nineteenth Annual ACM Symposium on Theory of Computing, 1987, 305-314.
Cranor, L. et al., “Spam!”,Communications of the ACM, 41(8):74-83, 1998.
Dwork, C. et al., “Pricing via Processing or Combatting Junk Mail,” InAdvances in Cryptology CRYPTO '92, 1999, 139-147.
Fiat, A. et al., “Rigorous time/space trade-offs for inverting functions,”SIAM Journal on Computing, 29(34):790-803, Jun. 2000.
Flajolet, P. et al., “Random Mapping Statistics,” In J-J. Quisquarter and J. Vandewalle, editors,Advances in Cryptology EURO-CRYPT '89, vol. 434 ofLecture Notes in Computer Science, 1990, 329-354.
Gabber, E. et al., “Curbing Junk E-Mail via Secure Classification,”Financial Cryptography, 1998, 198-213.
Hellman, M., “A Cryptanalytic Time-Memory Trade Off,”IEEE Transactions on Information Theory, IT-26(4):401-406, 1980.
Jakobsson, M. et al., “Proofs of Work and Bread Pudding Protocols,”Proceedings of the IFIP TC6 and TC11 Joint Working Conference on Communications and Multimedia Security(CMS '99), Kluwer, 1999, (15 pages).
Manber, U., “A Simple Scheme to Make Passwords Based on One-Way Functions Much Harder to Crack,”Computers&Security, 15(2):171-176, 1996.
Menezes, A. et al., “Hash Functions and Data Integrity,”Handbook of Applied Cryptography, Chapter 9, CRC Press, 1996, pp. 321-383.
Abadi Martin
Burrows Michael
Manasse Mark Steven
Simon Daniel Ron
Wobber Edward P.
Lin Wen-Tai
Microsoft Corporation
Woodcock & Washburn LLP
LandOfFree
Memory bound functions for spam deterrence and the like does not yet have a rating. At this time, there are no reviews or comments for this patent.
If you have personal experience with Memory bound functions for spam deterrence and the like, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Memory bound functions for spam deterrence and the like will most certainly appreciate the feedback.
Profile ID: LFUS-PAI-O-3678729