`Case 5:18—md-02834-BLF Document 235-5 Filed 10/04/18 Page 1 of 71
`
`EXHIBIT 5
`
`
`
`Case 5:18-md-02834-BLF Document 235-5 Filed 10/04/18 Page 2 of 71
`Case 5:18—md-02834-BLF Document 235-5 Filed 10/04/18 Page 2 of 71
`
`(12) United States Patent
`(10) Patent N0.:
`Farber et al.
`(45) Date of Patent:
`
`US 8,099,420 B2
`*Jan. 17, 2012
`
`118008099420B2
`
`(54)
`
`(75)
`
`(73)
`
`ACCESSING DATA IN A DATA PROCESSING
`SYSTEM
`
`Inventors: David A. Farber. Ojai. CA (US):
`Ronald D. Lachman. Northbrook. IL
`(US)
`
`Assignees: l’ersonalWel) Technologies, LLC. 'l'yler.
`TX (US); Level 3 Communications,
`LLC. Broomfield. CO (US)
`
`(*)
`
`Notice:
`
`Subject to any disclaimer, the term of this
`patent is extended or adjusted under 35
`U.S.C. 154(b) by 1312 days.
`
`This patent is subject to a terminal dis-
`claimer.
`
`EP
`
`(56)
`
`References Cited
`
`U.S. PATENT DOCUMENTS
`
`3.668.647 A
`3.835.260 A
`4.096.568 A
`4.215.402 A
`4.221.003 A
`4.290.105 A
`4.376.299 A
`4.405.829 A
`4.412.285 A
`
`6/1972 Evangelisti
`9/1974 Prescher et a1.
`6/1978 Bennett et a1.
`7/1980 Mitchell
`9/1980 Chang et a1.
`9/1981 Cichelli
`3/1983 ijcst
`9/1983 Rivest
`10/1983 Neehes
`
`(Continued)
`
`FOREIGN PATENT DOCUMENTS
`0 268 069 A2
`5/1988
`
`(Continued)
`
`OTHER PUBLICATIONS
`
`Affidavit of Timothy P. Walker in Support of CWIS’ Opening Mark-
`man Brief Construing the Terms at
`Issue in US Patent No.
`6.415.280. dated Jul. 25. 2003. from Civil Action No 02-11430
`RWZ.
`
`(Continued)
`
`Primar}y Eraminer — Khanh B Pham
`(74) Attorney, Agent.
`or Firm — Davidson
`Jackson & Gowdey. LLP; Brian Siritzky
`
`Berquist
`
`ABSTRACT
`(57)
`Access to data items uses names based on the data in the data
`items: the name of a data item may be based. at least in part.
`on a function oi'some or all oi'the bits that comprise the data
`item. A data item may comprise an arbitrary sequence ofbits.
`The function may include a hash function or a message digest
`function. The name of a data item may be compared to a list
`ol‘names of other data items.
`
`178 Claims. 31 Drawing Sheets
`
`(21)
`
`(22)
`
`(65)
`
`(60)
`
`(51)
`
`(52)
`(58)
`
`Appl. No.: 11/017.650
`
`Filed:
`
`Dec. 22, 2004
`
`Prior Publication Data
`
`US 2005/0114296 A1
`
`May 26, 2005
`
`Related U.S. Application Data
`
`Confirmation of application No. 09/987,723. filed on
`Nov. 15. 2001. now Pat. No. 6.928.442. which is a
`continuation of application No. 09/283,160. filed on
`Apr. 1. 1999. now Pat. No. 6.415.280. which is a
`division of application No. 08/960.079. filed on Oct.
`24. 1997. now Pat. No. 5.978.791. which is a
`continuation of application No. 08/425.160. filed on
`Apr. 11. 1995, now abandoned.
`Int. Cl.
`(2006.01)
`G06F 17/30
`707/758; 707/781; 707/821
`US. Cl.
`Field of Classtfication Search .................. 707/758.
`707/781. 821
`See application file for complete search history.
`
`
`
`SIMPiE
`
`DA TA ITEM
`
`1
`
`:
`1
`
`3212
`COMPUTE MD FUNCTION ON
`DATA ITEM
`
`DATA ITEM
`
`3214
`AFFEND LENGTH MODULO 32 OF
`
`EXHIBIT 5 - 1
`
`
`
`Case 5:18-md-02834-BLF Document 235-5 Filed 10/04/18 Page 3 of 71
`Case 5:18—md-02834-BLF Document 235-5 Filed 10/04/18 Page 3 of 71
`
`US 8,099,420 B2
`
`lege2
`
`-
`
`'
`
`..
`
`-
`
`--------
`
`U.S. PATENT DOCUMENTS
`,
`'1ng E'm'fnh-
`8",1984 Be‘; er
`1711984 D?“ 3“
`13/1985 812mm 141
`391986 Efng‘Tr" ‘
`:1
`.
`.
`.3‘
`Jam“ Mm“
`21987 Auslandcr
`2/1987 Meaden
`4.1987 Hellman
`(/1987 C
`9219;” 1511::
`.1988 Km“ ladt
`31988 Zamosra
`/
`‘
`11133 $11212:va 31-
`13319;” 1321-1122”
`3',
`31333 gafifl‘7he‘ufhal
`-’
`‘
`591990 11:12:95 “
`5/1990 Churm et 11].
`61990 Robert ct £11
`8’1990 A1-
`1d 1
`1
`811990 8210 Sam
`1131990 13211: “e “-
`'
`51991 Mansfield 61111
`6/1991 C110
`7/1991 Hear/61.11.
`,
`91991 Schwartzetal.
`9/1991 Maren
`9,1991 D
`1031991 Cylsonll
`1231991
`13° ”3°“
`191994 M292-
`531992 MELAM'O
`~7’.199§ K'ber
`11'
`71.1992 Tpfflzfi’
`93.1992 1,”va
`“3199.
`0955:1‘e-
`r-
`131995 6‘1“)“
`131993 firm/161211
`1
`‘
`'
`3/1993 Soon
`4/1993 Gramlich etal.
`4,1993 W
`431993 02211311141
`‘
`’,
`.‘nge ‘
`41993 W1tlenbergetal
`5/1993 V011e11
`6,199} W‘t
`”A
`73199;
`‘1'”
`8/1993 3312121
`,
`8’,1993 Reed “a"
`91993 Fukumwa el :11.
`116533. gym“? 1
`1
`131994 H°”°5ne a-
`231994 NOW
`2/1994 63:1?“
`51,1994 B'Lnnonel'll
`41,1994 R:1'
`.
`‘~
`431994 H'zdilfilton
`',
`.
`2133: 3:111:33? ‘11-
`',
`‘
`-
`391994 Wk.“
`8/1994 Pltkm e181.
`3:33: gmret 1
`9x1994 Lima“ ”I 1
`101994 T315 “Mila-
`[0;]994 151162) Acme“
`10:,1994 Opisgle't al
`10,1994 '1'11bolt etalV
`C
`‘
`'
`3:233: $35121a].
`[2/1994 Hunter et a1.
`1/1995 Cannon
`2/1995 Hunter 61 n1
`4/1995 Belsan 6151
`4/1995 Konrad
`
`21222112225: A
`4464713 A
`4190-78; A
`4-“8-41: A
`4571703 A
`'
`'
`5
`45771293 A
`4.642.764 A
`4.642.793 .A
`465A, 09; A
`4‘(7S.810 A
`4691999 A
`43,534; A
`47752039 A
`‘ "'
`.
`231:2 A
`48882601 A
`~
`1
`5
`22125;; A
`~ ‘3‘
`4~9.,'414 A
`4.922.417 A
`4.937.863 A
`4949302 A
`4553309 A
`462,337 A
`‘
`‘
`5013121292 A
`5.025.421 A
`5032979 A
`’
`‘
`5.047.918 A
`5050074 A
`{050317 A
`"5057}? A
`5077658 A
`‘5‘034‘815 A
`52117351 A
`5129081 A
`5139082 A
`“346% A
`5.161.147 A
`3'17-9~680 A
`51821799 A
`-
`5
`5.199.073 A
`5.202.982 A
`5204 897 A
`'5‘2041958 A
`-~
`~
`5.204.966 A
`5208 858 A
`5.7.1134 A
`52330051 A
`5322392648 A
`"“ ‘
`5341-671 A
`5.247.620 A
`2332983 A
`55276561 A
`5287499 A
`$87314 A
`5‘297‘279 A
`5501386 A
`25301316 A
`-
`1
`'
`2-3123? A
`/ ~ 1
`”39/403 A
`5.341.477 A
`222222: A
`5351202 A
`{352240 A
`5357623 A
`5,357,630 A
`5‘359’573 A
`’
`‘7
`222%:232 2
`5.375.206 A
`5.384.565 A
`5.394.555 A
`5.403.639 A
`5.404.508 A
`
`5.438.508 A
`5.442.343 A
`5.448.668 A
`5.448.718 A
`5.452.447 A
`5.454.000 A
`5.454.039 A
`5.459.860 A
`5.465.365 A
`5467471 A
`“*
`‘
`5.475.826 A
`5.479.654 A
`5.491.817 A
`5.499.294 A
`$23-$32
`._
`.
`.
`5.537.585 A
`5.542.087 A
`5.548.724 A
`5.553.143 A
`5 581615 A
`5.568.181 A
`'
`1
`'
`5'551'758 A
`5.581.764 A
`5.583.995 A
`5.588.147 A
`2
`223333 A
`‘
`‘
`5604303 A
`5.604.892 A
`“.0067 A
`"" ’
`‘
`5.632.031 A
`5.638.443 A
`5.640.564 A
`5.649.196 A
`5.677.952 A
`5.678.038 A
`5.678.046 A
`5.694.472 A
`5.694.596 A
`5.701.316 A
`5.710.922 A
`5.724.425 A
`,
`5'72455‘ A
`5.742.807 A
`5.745.879 A
`5.757.913 A
`57579” A
`" ’
`‘
`‘
`5.781.629 A
`5.802.291 A
`523220391 A
`.
`.
`5.835.087 A
`5864 683 A
`5.907.619 A
`5.907.704 A
`5.940.504 A
`5.978.791 A
`5.991.414 A
`6.006.018 A
`6.134.603 A
`6.135.646 A
`6.415.280 131
`6.732.180 B1
`6.816.872 Bl
`69.8 442 132
`2002/0052884 A1
`2002/0082999 A1
`2003/0078888 A1
`2003/0078889 A1
`2003/0095660 A1
`2004/0139097 A1
`2005/0010792 A1
`2005/0114296 A1
`2007/0185848 A1
`2008/0065635 A1
`2008/0066191 A1
`2008/0071855 A1
`2008/0082551 A1
`
`707/1
`
`707/2
`
`707/2
`2
`
`709/226
`
`707/205
`
`.
`
`707/10
`
`725/92
`
`...... 709/219
`
`.. 705/54
`. 709/303
`
`8/1995 Wyman
`8/1995 Cato e161.
`91995 Perelson Bl 111.
`91995 Cohnel :11.
`__________
`9/1995 Nelson 61211.
`9/1995 Dorfman
`9/1995 Coppersmith eta].
`10/1995 Bumen
`11/1995 Winterborlom
`“/1995 Bqder
`,
`.‘
`121995 F1sc_her
`12/1995 Sqlubb
`2/1996 601311161111.
`3/1996 Frledmnn
`2/1333 Eisenberie‘al
`/
`"awczy
`7/1996 Blickenstaflet n1.
`7/1996 Neimal el :11.
`8/1996 Akizawa 61:11
`9/1996 Rossel 211.
`12/1996 Stern
`10/1996 Greenwood ct :11.
`,
`1
`.
`””96 3.11““
`12/1996 Fuzgeraldelal.
`12/1996 Gardneretnl
`12/1996 Neemzmelal.
`2/
`-owar
`3,133; 3“” e‘ 31‘
`.
`2/1997 Am
`2/1997 Nullallelal.
`“997 K. d 11
`1
`7
`f“. c C”
`5/1997 Vellssaxopoulosetal.
`6/1997 Stefiketal
`.............
`6/1997 Hamilton 6181
`.
`7/1997 Woodhillelal.
`10/1997 31510691116161.
`10/1997 Dockleretal.
`10/1997 Cahillctal.
`12/1997 Johnson e1a1
`12/1997 Campbell
`12/1997 Alferness et {11
`1/1998 Alleyet 61
`3/1998 Changer/11.
`,
`,
`“998 “”1“
`4/1998 Masmtcr
`4/1998 Wyrmn
`5/1998 Baum-e et a1.
`1
`“998 A
`.th
`'
`"”5"“ “8
`7/1998 Haber .713/177
`
`9/1998 Balickelal.
`.. 709/202
`13:33: ggl'ye" 1...“...
`' 707”
`/
`gataeta.
`11/1998 Hem ........................ 346/810
`1/1999 Boeberl el '11
`5/1999 Davis
`5/1999 Gudmundsonetal.
`8/1999 Griswold
`11/1999 Farberel n1.
`11/1999 Gumyetal.
`12/1999 Burned/61:11
`10/2000 Jones 61.41.
`.........
`10/2000 Kalm 0181.
`7/2002 Farber et a1.
`5/2004 Hale eta].
`11/2004 Squibb
`8/7005 Fmbereml
`5/2002 Faner el al.
`6/2002 Ieeetal.
`4/2003 Lee/61:11.
`4/2003 Lee/8161.
`5/2003 Leeetnl.
`7/2004 Ferber at 111.
`1/2005 c
`entieret a1
`5/2005 Fail-15361511.
`3/2007 FaIber et 211.
`3/2008 qu'bcr 61 al.
`3/2008 Faner et a1.
`3/2008 Farbor 61 al.
`3/2008 quber 61 al.
`
`.395/20049
`709/330
`
`EXHIBIT 5 - 2
`
`
`
`Case 5:18-md-02834-BLF Document 235-5 Filed 10/04/18 Page 4 of 71
`Case 5:18—md-02834-BLF Document 235-5 Filed 10/04/18 Page 4 of 71
`
`US 8,099,420 B2
`Page 3
`
`EP
`EP
`EP
`EP
`EP
`EP
`EP
`GB
`JP
`JP
`JP
`JP
`JP
`JP
`JP
`W0
`W0
`W0
`W0
`W0
`
`FOREIGN PATENT DOCUMENTS
`0 315 425
`5/1989
`0 558 945 A2
`9/1993
`0 566 967 A2
`10/ 1993
`0592045
`4/1994
`0631 226 A1
`12/1994
`0 654 920 A2
`5/1995
`0 658 022 A2
`6/1995
`2294132 A
`4/1996
`59058564
`4/1984
`63-106048
`5/1988
`63-273961
`11/1988
`2-127755
`5/1990
`05162529
`6/1993
`06187384 A2
`7/1994
`06348558 A
`12/1994
`WO 92/20021
`11/1992
`WO 94060247
`3/1994
`WO 94/20913
`9/1994
`WO 95.01599
`1/ 1995
`WO 97/43717
`11/1997
`
`OTHER PUBLICATIONS
`
`Akautai and M1 1 ‘s Memorandum in Support of'l'heir Claim Con-
`struction of IISPAT 5.978.791. dated Aug. 31. 2001. from Civil
`Action No. 00-cv-11851RWZ.
`Akamai’s Answer. Affirmative Defenses and C ounterclaims to
`Amended Complaint. filed Dec 6. 2002. in Civil Action No. 02-CV-
`11430RWZ
`Akamai’s Brief on Claim Construction. dated Aug. 8. 2003. from
`Civil Action No. 02-11430 RWZ
`Answer of Defendant RIAA to First Amended Complaint and Coun-
`terclaim. dated Feb 8. 2005. from Civil Action No. CV04—7456 JFW
`(C'I'x).
`Berners-Lee. T et al.. “Hypertext Transfer ProtocolilITTP/lfl.”
`May 1996. pp. 1-54.
`Berners-Lee.
`'1‘. “Universal Resource Identifiers in WWW.” .Iun.
`1994.pp 1-25.
`Bowman. C. Mic. et al.. "Harvest: A Scalable, Customizable Discov—
`ery and Access System.” Aug. 4. 1994. pp. 1—27.
`Bowman. C Mic. et a1 . “Harvest: A Scalable. Customizable Discov-
`ery and Access System.” Mar. 12. 1995. pp. l-29.
`Brisco. T.. “DNS Support for Load Balancing.” Apr. 1995. pp. 1-7.
`Browne. Shirley et al.. "Location-Independent Naming for Virtual
`Distributed Software Repositories.” 1995. 7 pages.
`Browne. Shirley et al.. “Location-Independent Naming for Virtual
`Distributed Software Repositories," 1995. printed from http:/www.
`netlib org/ullo'papers/lifn/main.html on Mar 22. 2006, 18 pages
`Civil Minutes General dated Jan. 25. 2005. fi'om Civil Action No. CV
`04-7456-JFW (C'lx).
`Complaint for Patent Infringement. Permanent Injunction. and Darn-
`ages. dated Sep. 8. 2004. from Civil Action No. CV 04-7456 JFW
`(AJWx).
`CWIS' Opening Markman Brief Construing the Terms at Issue in
`11.8 Patent No. 6.41 5.280. dated Jill. 25. 2003. from Civil Action No.
`02-11430 RWZ.
`CWIS‘ Reply Markman Brief Construing the Terms at Issue in US.
`Patent No. 6.415.280. dated Aug. 15. 2003. from Civil Action No.
`02—11430 RWZ.
`Davis. James R.. "A Server for a Distributed Digital Technical Report
`library.” Jan. 15. 1994. pp l-‘t.
`Declaration ofRobert B.K. Dewar in Support ofCWIS' Construction
`of the Terms at Issue in US Patent No. 6.415.280. dated Jul. 25.
`2003. from Civil Action No. 02-cv-1 1430RWZ
`Defendant Digital Island‘s Opening Brief on Claim Construction
`Issues dated Aug. 17. 2001. from Civil Action No. 00—cv-11851-
`RWZ.
`Defendant Media Sentry. Inc.‘s Reply Memorandum of Points zmd
`Authorities in Further Support of Its Motion to Dismiss. dated Nov.
`15. 2004. from Civil Action No. CV04-7456 JFW (CTx).
`Defendant MediaSentry Inc’s Notice ofMotion and Motion to Dis-
`miss First Amended Complaint; Memorandum of Points and
`Authorities in Support Thereof. dated Dec 13. 2004. from Civil
`Action No. CV04—7456 JFW .
`
`Defendant MediaSentry. Inc’s Answer to Plaintiffs’ First Amended
`Complaint and Counterclaims. dated Feb 8. 2005. from Civil Action
`No. CV04-7456 JFW (CTx).
`Defendant RIAA’s Notice of Motion and Motion to Dismiss First
`Amended Complaint: Memorandum of Points and Authorities in
`Support Thereof. dated Dec. 13. 2004. from Civil Action No. CV04—
`7456 JFW (CTx).
`Defendants Loudeye Corp.’s and Overpeer. Inc.’s Answer to Plain-
`tiffs’ Firsl Amended Complaint and Counterclaim. dated Feb. 8.
`2005. from Civil Action No. 04-7456 JFW (AJWx).
`Defendants’ Preliminary Invalidity Contentions dated Dec. 14. 2006.
`from Civil Action No. CV 06—5086 SJO (Ex)
`European Search Report
`issued Dec. 23. 2004 in correpsonding
`European Application No. 969107622-2201.
`Expert Report of Professor Ellis Horowitz. dated Mar 6. 2006. from
`Civil Action No. 04-7456 JFW (CTx).
`Expert Report of the Honorable Gerald J. Mossinghofl'. dated Mar.
`13, 2006. from Civil Action No 04-7456 JFW (CTx).
`Faltstrom. P. et aI . “How to Interact with a Whois++ Mesh." Feb
`1996. pp. 1-9.
`Fielding. R. ct al.. “Hypertext Transfer Protocol—HTTP/l.1." Jan.
`1997. pp. 1-163.
`Fielding. R et al.. “Hypertext Transfer ProtocoliHTTP/ 1.1.” Jun.
`1999. pp 1-157.
`Infringement. Permanent
`for Patent
`First Amended Complaint
`Injunction and Damages. dated Nov. 24. 2004. fi om Civil Action No.
`CV 04-7456 JFW (CTX).
`International Search Report dated .Iun. 24. 1996 in corresponding
`international application PCf/USI996/004733.
`Khare. R. and Lawrence. S.. “Upgrading to TLS Within IITTP/I 1.”
`May 2000. pp. [-12
`Kim et al. “The Design and Implementation of Tripwire: A Iile
`System Integrity Checker". COAST Labs Dept. of Computer Sci-
`ences Purdue University. Feb. 23. 1995. pp.
`[—18
`Knuth. Donald E.. “The Art ofComputer Progrtunming.” 1973. vol.
`3. Ch. 6.4. pp. 506-549.
`Memorandum ofPoints and Authorities in Support ofLoudeye’s and
`Overpeer’s Motion to Dismiss the First Amended Complaint for
`Failure to State a Claim or. in the Alternative. for a More Definitive
`Statement. dated Dec. 13. 2004. from Civil Action No CV—04-7456
`.IFW (AJWX).
`Moats. R.. “URN Syntax." May 1997. pp. 1-8.
`Myers. J and Rose. M. “The Content-MDS Header Field.” Oct
`1995. pp. [-4.
`Office Action in corresponding Japanese Application No. 531.073!
`1996 mailed on Apr. 25. 2006.
`Office Communication in corresponding European Application No.
`96910762.2-1225 dated Jan. 17.2007.
`Order Re Claim Construction dated Nov. 8. 2001. from Civil Action
`No.00—11851-RWZ.
`Patent Aberacls of Japan. “Device for Generating Database and
`Method for the Same." Application No. 03-080504. Sun Microsyst.
`Inc.. published Jun. 1993. 38 pages.
`Patent Abstracts of Japan. “Method for Registering and Retrieving
`Data Base." Application No 03-187303. Nippon Telegr. & Teleph.
`Corp.. published Feb. 1993. 11 pages
`PlaintilI's’ Memorandum of Points and Authorities in Opposition to
`Loudeye Defendants' Motion to Dismiss. dated Nov. 8. 2004. from
`Civil Action No. CV—04-7456 JFW (AJWX).
`Plaintitl‘s’ Opposition to Media Sentry’s Motion to Dismiss; Memo-
`randum of Points and Authorities in Support Thereof. dated Nov. 8.
`2004. from Civil Action No CV 04-7456 JFW (CTx)
`Plaintiff’s Opposition to Recording Industry Association of Ameri-
`ca‘s Motion to Dismiss; Memorandlun of Points and Authorities in
`Support Thereof. dated Nov 8. 2004. from Civil Action No CV-04-
`7456 .IFW (CTx).
`Plaintiff‘s Reply to Defendant Loudeye Corp.’s and Overpeer. Inc.’s
`Counterclaims. dated Mar. 3. 2005. from Civil Action No. CV
`04—7456 JFW (C Tx)
`I’laintifi‘s Reply to Defendant MediaSentry's Counterclairns. dated
`Mar. 3. 2005. from Civil Action No CV 04-7456 JFW (CTx).
`Plaintiff's Reply to Defendant RIAA’s Counterclaims. dated Mar. 3.
`2005. from Civil Action No. 04-7456 JFW (CTX).
`
`EXHIBIT 5 - 3
`
`
`
`Case 5:18-md-02834-BLF Document 235-5 Filed 10/04/18 Page 5 of 71
`Case 5:18—md-02834-BLF Document 235-5 Filed 10/04/18 Page 5 of 71
`
`US 8,099,420 32
`Page 4
`
`Reed Wade (wade@cs utk edu). “re: Dienst and BFD/LIFN docu-
`ment.” Aug 8. 1994. printed from http:/M'ww wcbhisloryorgv'www
`lists/\va-lalkl994q3/O4l6.htrn1 on Mar. 22. 2006. (.7 pages).
`Rivest. R.. “The MD5 Message—Digest Algorithm.” Apr. 1992. pp.
`1-19 and errata sheet (1 page)
`Rose. M.. “The Content—MD5 Header Field.” Nov. 1993. pp. 1-3.
`Schneier. Brtlce. “One-Why Hash Functions. Using Crypographic
`Algorithms for Hashing.” 1991. printed from http://202 179135.4/
`data/DDJ/articles/IO91/9109/9l909g/9109g.htm on Mar. 22. 2006.
`Sun Microsystems. Inc .“NFS: Network File System Protocol Speci-
`fication.” Mar. 1989. pp 1-25.
`Vincenzerti. David and Cotrro7.7.i. Massimo. “Anti Tampering Pro-
`gram." Proceedings of the Fourth {USENIX} Security Symposium.
`Santa Clara. CA. 1993. 11 pages.
`Vincenzetti. David and Cotrrozzi. Massimo. “Anti Tampering Pro-
`gram." Proceedings ofthe Fourth {USENIX} Security Symposium.
`Santa Clara. CA. undated. printed from http://wwxvjanet/CERI/
`VincanettiiandACotrozzi/ATP_Anti,Tzunp on Mar. 22. 2006. 8
`pages
`Berners-Lee. T. el a1.. "Uniform Resource Locator 5 (URL).” pp. 1-25.
`Dec. 1994
`Danzig. RB. et al.. "“Distributed Indexing: A Scalable Mechanism
`for Distributed Information Retrieval.“ Proceedings of the 14th
`Annual International ACM SIGIR Conference on Research and
`Development
`in Information Retrieval. pp. 220-229. Oct. 13-16.
`199 I .
`IIauzeur. B. M.. “A Model for Naming. Addressing. and Routing.”
`ACM Trans. Inf. Syst. 4. Oct. 4. 1986). 293-311.
`Khoshafian. S. N. et a1. 1986. Object identity. In Conf. Proc. on
`Object-Oriented Programming Systems. Languages and Applica-
`tions (Portland. Oregon. United States. Sep 29-Oct. 2. 1986). N.
`Meyrowitz. Ed. OOPLSA ’86. ACM Press. New York. NY. 406-416.
`Lantz. K. A.. et a1.. “Towards a universal directory service” In Proc.
`4th Annual ACM Syrnp. on Principles of Distributed Computing
`(Minaki. Ontario. Canada). PODC ’85. ACM Press. New York. NY.
`250-260.
`Leach. P. J.. et al. The file system ofan integrated local network In
`Proc. 1985 ACM 13th Annual Conf. on Comp. Sci CSC ’85. ACM
`Press. NY. NY. 309-324.
`Leach. P.J.. et a1. “UIDs as Internal Names in a Distributed File
`System.” In Proc. lst ACM SIGACT—SIGOPS Symp. on Principles of
`Distributed Computing (Ottawa. Canada. Aug. 18-20. 1982). PODC
`’82 ACM Press. New York. NY. 34-41.
`Ma. C. 1992. On building very large naming systems. In Proc. 5th
`Workshop on ACM SIGOPS European Workshop: Models and Para-
`digms for Distributed Systems Structuring (France. Sep. 21—23.
`1992). EW 5. ACM Press. New York. NY. 1-5
`Peterson. L. L. 1988. A yellow-pages service for a local-area net-
`work. In Proc. ACM Workshop on Frontiers in Computer Commu-
`nications Technology (Vermont. 1987). J. J. Garcia—Luna-Aceves.
`Ed. SIGCOMM ’87. ACM Press. New York. NY. 235-242.
`Ravindran. K. and Ramakrishnan. K. K 1991. A naming system for
`feature—based service specification in distributed operating systems.
`SIGSMALL/PC Notes 17. 3-4 (Sep. 1991). 12-21.
`Ross. K.. “Hash-Routing for Collections of Shared Web Caches.”
`IEEE Network Magazine. pp. 37-44. Nov.-Dcc. 1997
`Schwartz. M.. et a1. 1987. Anarne service for evolving heterogeneous
`systems. In Proc. 11th ACM Symp on OS Principles (Texas. Nov.
`8-11. 1987). SOSP ‘87. ACM Press. NY. NY. 52-62.
`Shaheen-Gouda. A. and Loucks. L 1992. Name borders. In Proc. 5th
`Workshop on ACM SIGOPS Europezm Workshop: Models and Para—
`digms for Distributed Systems Structuring (Mont Saint-Michel.
`France. Sep. 21-23. 1992)_ EW 5 ACM Press. NY. NY. 1—6.
`Terry. D. B. 1984. An analysis ofaaming conventions for distributed
`computer systems In Proc. AC M SIGCOMM Symp. on Communi-
`cations Architectures and Protocols: Tulorials & Syrnp SIGCOMM
`’84. ACM Press. NY. NY. 218-224.
`Cheriton. David R. and Mann. Timothy P.. "Decentralizing a global
`naming service for improved performance and fault tolerance". ACM
`'l'ransactions on Computer Systems. vol. 7. No. 2. May 1989. pp.
`147-1 83.
`Request for Reexamination ofU.S. Patent No 6.928.442: Reexam
`Control U.S.App1. No. 90/010260. Iiled Aug. 29. 2008
`
`Kim et a1.. “Experiences with Tripwire: Using Intergrity Checker s for
`Intrusion Detection". COAST Labs Dept. of Computer Sciences
`Purdue University. Feb. 22. 1995. pp. 1-12.
`Kim et al. "The Design and Implementation of Tripwire: A file
`System Intergr'ity Checkcr". COAST Labs. Dept. of Computer Sci-
`ences Purdue University. Nov. 19. 1993. pp. 1-21.
`Zhiyu Tian et a1.. A New Hashing Function: Statistical Behaviour and
`Algorithm. pp. 3-13.
`G. I._ Friedman. Digital Camera with Apparatu for Authentication of
`lrnages Produced from an Image File. NASA Case No NPO-19108-
`I—CU. U.S. Appl No.08/159.980.fi1ed Nov. 24. 1993.
`1-1. Goodman. Ada. Object -Oriented Techniques. and Concurrency in
`Teaching Data Structures and File Management Report Documenta-
`tion p AD-A275 385-94-04277.
`Advances
`in Cryptology-EUROCRYPT’93: Workshop on the
`Theory and Application of Cryptographic Techniques Lol'thus. Nor—
`way. May 23-27. 1993 Proceedings.
`Proceedings ofthe 1993 ACM SIGMOD International Conference on
`Management 01. Data. vol. 22. Issue 2. Jim. 1993.
`Advances
`in Cryptology-AUSCRYPT '927Workshop on the
`Theory and Application of Cryptographic Techniques Gold Coast.
`Queensland. Australia. Dec. 13—16. 1992 Proceedings.
`Witold Litwin et a1.. Linear Hashing for Distributed Files. ACM
`SIGMOD. May 1993. pp 327-336.
`Ming-Ling Lo et a1 . On Optima] Processor Allocation to Support
`I’ipclinetl Hash Joins. ACM SIGMt )1). pp. 69-78. May 1993.
`Thomas A. Berson. Differential t'.‘r)1'rtanaly.~is Mod 25‘ with Appli-
`cations lo MDS. pp. 69-81
`William Perrizo et a1.. Distributed .loin Processing Performance
`Evaluation. Twenty-Seventh Hawaii International Conference on
`System Sciences. vol. II. pp. 236-244.
`Vijay Kumar. A Concurrency Control Mechanism Based on Extend—
`ible Hashing for Main Memory Database Systems. ACM. vol 3.
`1989. pp. 109-113.
`Birgit PIitzman. Sorting Out Signature Schemes. Nov. 1993. 1"Con1'.
`Computer & Corrun. Security '93. p. 74-85.
`Bert dcrn Boer et a1.. Collisions for the compression function ofMDS.
`pp. 292-304.
`Sakti Pramanik et a1.. Multi—Directory Hasing. 1993. Info Sys.. vol
`18. No 1.pp. 63-74.
`Murlidhar Koushik. Dynamic Hashing with Distributed Overllow
`Space: A File Organization with Good Insertion Performance. 1993.
`Info Sys.. vol. 18. No 5. pp. 299-317.
`Witold Litwin et a1.. I.H*-I.inear Hashing for Distributed Files. HP
`Labs Tech. Report No. HPL-93-21. .ltin. 1993; pp l—22
`Yuliang Zheng et a1.. HAVAL—A One-Way Hashing Algorithm with
`Variable Length of Output (Extended Abstract). pp 83-105.
`Chris Charnes and Josef Pieprzky. Linear Nonequivalence versus
`Nonlinearity. Pieprzky. pp. 156-164.
`Gwertzman. James. et al. “The Case for Geographical Push-Cach-
`ing.” Technical Report I-IU TR 34-94 (excerpt). Harvard University.
`DAS. Cambridge. MA 02138. 1994. 2 pgs.
`Grigni. Michelangelo. et a1. “Tight Bounds on Minimum Broadcasts
`Networks.” SIAM Journal of Discrete Mathematics. vol. 4. No. 2.
`May 1991. pp. 207-222.
`Devine. Robert “Design and Implementation of DDI-I: A Distributed
`Dynamic Hashing Algorithm." In Proceedings of 4th International
`Conference on Foundations of Data Organizations and Algorithms.
`1993. pp. 101-114.
`in Datagram
`“Multicast Routing
`al.
`el
`Deering. Stephen.
`Internetworks and Extended LANs.” ACM Transactions on Corn-
`puter Systems. vol 8. No 2. May 1990. pp. 85-110.
`Cormen. Thomas H.. et a1. Introduction 70 Algor'r'lhms. The MIT
`Press. Cambridge. Massachusetts. 1994. pp 219-243. 991-993
`Naor. Moni. et al. “The Lead. Capacity and Availability of Quortun
`Systems.” In Proceedings of the 35th IEEE Symposium on Founda-
`tions of Computer Science. Nov. 1994. pp. 214-225.
`Nisan. Noam. “Psuedorandom Generators for Space-Bounded C orn-
`putation.” In Proceedings ofthe Twenty-Second Annual ACM Sym-
`posium on Theory of Computing. May 1990. pp. 204-212
`Palmer. Mark. et a1. “Fido: A Cache that Learns to Fetch.” In Pro-
`ceedings of the 17th International Conference on Very Large Data
`Bases. Sep. 1991. pp. 255-264.
`
`EXHIBIT 5 - 4
`
`
`
`Case 5:18-md-02834-BLF Document 235-5 Filed 10/04/18 Page 6 of 71
`Case 5:18—md-02834-BLF Document 235-5 Filed 10/04/18 Page 6 of 71
`
`US 8,099,420 B2
`Page 5
`—————————————
`
`Peleg. David. et al. “The Availabiltiy of Quorum Systems.” Informa-
`tion and Computation 123. 1995. 210—223.
`Rabin. Michael. "Eflicicnt Dispersal of Information for Security.
`Load Balancing. and Fault Tolerance.” Joumal of the ACM. vol. 36.
`No. 2. Apr. 1989. pp. 335-348.
`Ravi. R . “Rapid Rumor Rarnification: Approximating the Minimum
`Broadcast Time” In Proceedings of the 35th IEEE Symposium on
`Foundation ofComputer Science. Nov. 1994. pp. 202-213.
`Schmidt. Jeanette. et a1. “Chernoff—Hoeffding Bounds for Applica-
`tions with Limited Independence.” In Proceedings 01‘ the 4th ACS-
`SIAM Symposium on Discrete Algorifluns. 1993. pp. 331-340.
`Tarjan. Robert Endre. et a1. “Storing a Sparse Table.” Communica-
`tions ofthe ACM. vol. 22. No. 11. Nov. 1979. pp. 606-611.
`Wegman. Mark. et al. “New Hash Functions and Their Use in Authen-
`tication and Set Equality.” Journal of Computer and System Sciences
`vol. 22. Jun. 1981. pp. 265-279.
`Vittcr. Jeffrey Scott. et a1. “Optimal Prefetching via Data Compres-
`sion," In Proceedings of 32nd IEEE Symposium on Foundations of
`Computer Science. Nov 1991. pp. 121-130.
`Fredman. Michael. cl a1. “Storing a Sparse Table with 0(1) Worst
`Case Access Time." Journal of the Association for Computing
`Machinery. vol. 31. No 3. Jul. 1984. pp. 538-544.
`Yao. Andrew Chi-Chih. “Should Tables be Sorted?" Journal of the
`Association for Computing Machinery. v01. 28. No. 3. Jul. 1981. pp.
`615 -628.
`Floyd. Sally. et al. “A reliable Multicast Framework for Light-Weight
`Sessions and Application Level Framing.” In Proceedings of ACM
`SIGCOMM ’95. pp. 342-356.
`Feeley. Michael. et a1. “Implementing Global Memory Management
`in aWorkstation Cluster.” In Proceedings of the 15th ACM Sympo-
`sium on Operating Systems Principles. 1995. pp. 201-212.
`Carter. J. Lawrence. et a1. “Universal Classes of Hash Functions”
`Journal ofCompuler and System Sciences. vol. 18. No. 2. Apr. 1979.
`pp. 143-154.
`Patent Abstracts ofJapan. “Electronic Mail Multiplexing System and
`Communication Control Method in The System." 06/30/1999.“). JP
`05162529.
`Kim el al.. "Experiencess with Tripwire: Using Intergrity Checkers
`for Intrusion Detection”. COAST Labs. Dept. ofComputer Sciences
`Purdue University. Feb. 22. 1995. pp. 1-12.
`Kim et al.. "The Design and Implementation of Tripwire: A file
`System Intergrit‘y Checkcr”. COAST Labs. Dept. of Computer Sci-
`ences PurdueUniversity. Nov. 19. 1993. pp_ 1-21.
`Bert Dem Boer et al.. Collisions for the compression function of
`M05. pp. 292—304
`Sakti Pramanik cl al.. Multi-Directory Hashing. 1993. Info Sys.. vol.
`18. No. 1. pp. 63-74
`Murlidhar Koushik. Dynamic Hashing with Distrubuted Overflow
`Space: A File Organi7ation with Good Insertion Performance. 1993.
`Info. Sys.. vol. 18. No. 5. pp 299-317.
`Witold Litwin et al.. LIV-Linear Hashing for Distributed Files. 11?
`Labs Tech. Report No HPI.—93—2l. Jun 1993. pp. 1-22.
`Yuliang Zheng et al.. HAVAL-A One—Way Hashing Algorithm with
`Variable Length of Output (Extended Abstract). 1993. pp. 83-105.
`Chris Charncs and Josef Picprzky. Linear Noncquivalcncc versus
`Nonlinearity. Pieprzky. 1993. pp. 156-164.
`Withold Litwin et al.. Linear Hashing for Distributed Files. ACM
`SIGMOD. May 1993. pp. 327-336.
`Ming-Ling Lo et al.. On Optimal Processor Allocation to Support
`Pipelined Hash Joins. ACM SIGMOD. pp. 69-78. May 1993.
`Thomas A. Berson. Dil‘fcrential Cryptanalysis Mod 253 with Appli-
`cations to MD5. pp. 69-81.
`William Perrizo et al.. Distributed Join Processing Performance
`Evaluation. Twenty-Seventh Hawaii International Conference on
`System Sciences. vol. 11. pp. ass-344.
`V'Ijay Kumar. A Conctu'reuq- (‘unlrol Mechanism Based on Extend-
`ible Hashing for Main Memory Database Systems. ACM. vol. 3.
`1989. pp. 109-1 13.
`Birgit Pfitzman. Sorting Out Signature Schemes. Nov. 1993. 1" Conf.
`Compuler S: Comm. Securityr ’93. p. 74-85.
`7.hiyu Tian et al.. A New Hashing Function: Statistical Behaviour and
`Algorithm. Spring 1993. pp. 3—13.
`
`G.L. Friedman. Digital Camera with Apparatus for Authentication of
`Images Produced from an Image File. NASA Case No. NPO-19108-
`1-CU. U S Appl No 08/159.980.1\'ov 24. 1993.
`H. Goodman. Ada. Object—Oriented Techniques. and Concurrency in
`Teaching Data Structures and File Management Report Documenta—
`tion p. AD-A275 385-94-04277.
`Advances in Cryptology-EUROCRYPT '93. Workshop on the
`Theory and Application of Cryptographic Techniques Lofihus. Nor—
`way. May 23—27. 1993. Proceedings.
`Proceedings on the 1993 ACM SIGMOD International Conference
`on Management 01' Data vol. 22. Issue 2. Jun. 1993
`Advances of Cryptology-AUSC RYP’I'
`’927Workshop 0n the
`Theory and Application of Cryptographic Techniques Gold Coast.
`Queensland. Australia. Dec. 13-16. 1992 Proceedings.
`Tarj an. Robert Endre. et al.. "Storing a Sparse Table”. Communica-
`tions ofthe ACM. v01. 22. No. 11. Nov. 1979. pp. 606-611.
`Wegman. Mark et al.. "New Hash Functions and Their Use in Authen-
`tication and Set Equality”. Journal of Computer and System Sci-
`ences. vol 22. Jun 1981. pp. 265-279.
`Vittcr. Jeffrey Scott ct al.. “Optimal Prefetching via Data Compres-
`sion”. In Proceedings of 32nd IEEE Symposium on Fundations of
`Computer Science. Nov. 1991. p 121-130.
`Friedman. Michael et al.. “Storing a Sparse Table with 0(1) Worst
`Case Access Time”. Journal of the Association for Cornputing
`Machinery. vol. 31. No. 3. Jul. 1984. pp. 538544.
`Yao. Andrew Chi —Chih. “Should Tables be Sorted?". Journal of the
`Association for Computing Machinery. vol. 28.510. 3. Jul. 1981. pp.
`615-628.
`Floyd. Sally et al.. “A Reliable Multicast Framework for Light-
`Weighl Sessions and Application Level Framing”. In Proceedings of
`ACM SIGCOMM ’95. pp 342-356
`Feeley. Michael. et al.. “Implementing Global Memory Management
`in a Workstation Cluster”. In Proceedings of the 15111 ACM Sympo-
`sitlm on Operating Systems Principles. 1995. pp. 201-212.
`Carter. J Lawrence. et al.. “Universal Classes of Hash Functions”.
`Journal ofComputer and System Sciences. vol. 18. No. 2. Apr, 1979.
`pp. 143-154.
`Patent Abstracts ofJapan. “Electronic Mail Multiplexing System and
`Communication Control Method in the System”. Jun. 30. 1993. JP
`05162529.
`Kim et al.. “Experiences wiflt Tripwire: Using Integrity Checkers for
`Intrusion Detection”. COAST Labs. Dept. of Computer Sciences
`Purdue University. Feb. 22. 1995. pp. 1-12.
`Kim et al.. “The Design and Implementation of Tripwire: A File
`System Integrity Checker”. COAST Labs. Dept. 01‘ Computer Sci-
`ences Purdue University. Nov. 19. 1993. pp. 1—21.
`Peter Deutsch (peterd@bunyip.com). "Re: MD5 and LIFNS (was:
`Misc Comments)”. wrawacllanl.gov/UlU/archivefuri-94q2.mes-
`sages/0106.11tm1. Apr. 26. 1994
`Alexander Dupuy (dupuy@sma.rts.com). “RE: MD5 and LIFNs
`(was: Misc Comments)”. wwwacl 1anl.gov/URI/archive/uri-94q2.
`messages/01 13.htm1. Apr. 26. 1994.
`Alexander Dupuy (dupuy@sma.rts com). “MD5 and LIFNs (was:
`Misc Comments)”. wwwacllanl gov/URI/archive/uri-94q2.mes-
`sages/0081.hlml. Apr. 17. 1994
`Albert Langcr
`(cmeS1@anu 02 all). http://gt'oups googlc com/
`groups?selrn:1991Aug7.225159.7869040newshoslimu.edu.au&
`oe=UTF-8&outpul=gplain. Aug. 7. 1991.
`Clifford Lynch ('Calur@uccmvsa.bitnet). “ietfurlluri overview drafl
`paper Gong)”. wwwacl 1anl.gov/IIRl/archive/uri-93qlmessages!
`0015.html. Mar. 25. 1993.
`K Sollins and L Masinter. “Functional Requirements for Uniform
`Resource Names”. www.w3.org/Addressing/rfc l 737.txt. Dec 1994.
`pp. 1-7.
`W3C:ID. HTTP: A protocol for networked information. “Basic
`HTTP as defined in 1992”. vtwww3.orgr’Protocols/I—ITTPthml.
`1992.
`Defendant Lime Wire. LLC's Answer. Affirmative Defenses and
`Counterclaims dated Nov. 15. 2007. from Civil Action No. 07-06 161
`VBF (PLAX)
`
`EXHIBIT 5 - 5
`
`
`
`Case 5:18-md-02834-BLF Document 235-5 Filed 10/04/18 Page 7 of 71
`Case 5:18-md-02834-BLF Document 235-5 Filed 10/04/18 Page 7 of 71
`
`US 8,099,420 B2
`Page 6
`
`Kim. Gene H . and Spafford. Eugene H . “Writing. Supporting, and
`Evaluating Tripwire: A Publicly Available Secrrrity Tool." COAST
`Labs. Dept. ofComputer Sciences Purdrrc University. Mar 12. 1994.
`pp. 1-23.
`US Appl No I 1/9806797May 6. 2009 PTO Office Action.
`USPTO. Non—Final Office action mailed Jun. 15. 2009 in US. App].
`No. 11/980.687.
`USPTO. Non—Final Office action mailed Jun 18. 2009 in Reexam
`U.S. Appl. No. 90’010.260.
`Communication from EPO in Europezm Application No. 96 910
`762.2—1225 dated May 8. 2009 [4 pgs.].
`McGregor D. R. and Mariani. J .A “Fingerprinting—Atechnique for
`file identification and maintenance.” Softhue: Practice and Experi-
`ence. vol. 12. N0.12.Dec. 1982. pp. 1165-1166.
`[Proposed] Order Regarding Construction of Terms. filed Mar. 29.
`2007 in CD Cal. case No. CV 06-5086 SJO (Ex) [9 pgs.].
`Analysis of Plaintiffs’ Claim Chart for the ’280 Patent As Against
`Defendant Media Sentry, Inc 11 pages.
`Analysis of Plaintiffs’ Claim Chart for the ’791 Patent As Against
`Defendant Media Sentry. Inc (11916.001 0150 a) pp. 1-48
`Analysis of Plaintiffs’ Claim Chart for the ’791 Patent As Against
`Defendant Overpeer pp. 1-40.
`Barbara, D.. ct a1.. “Exploiting symmetries for low-cost comparison
`of file copies.” 8th Int’l Conf. on Distributed Computing Systems.
`Jun. 1988. pp. 471-479. San Jose. CA
`(Tarrrpbell. M.. “The Design of Text Signatures for Test Retrieval
`Systems.” Tech. Report. Sep. 5. 1994. Deakin University. School of
`Computing 8: Math.. Geeiong. Australia.
`Chang. W. W. et al.. “A signature access method for the Starburst
`dat