Case 5:18-cv-03463-BLF Document 28-5 Filed 10/04/18 Page 1 of 71
`Case 5:18-cv-03463-BLF Document 28-5 Filed 10/04/18 Page 1 of 71
`
`EXHIBIT 5
`
`

`

`Case 5:18-cv-03463-BLF Document 28-5 Filed 10/04/18 Page 2 of 71
`Case 5:18-cv-03463-BLF Document 28-5 Filed 10/04/18 Paile 2 of 71
`||Ill|||||||l||||||||l|||||l||||||l||l||||||||||||
`|l|||||||l||l|||i||l||l
`
`U S008099420B2
`
`(12) United States Patent
`US 8,099,420 B2
`(10) Patent No.:
`Farber et ai.
`*Jan. 17, 2012
`(45) Date of Patent:
`
`(54) ACCESSING DATA IN A DATA PROCESSING
`SYSTEM
`
`(56)
`
`(75)
`
`Inventors: David A. Farber, Ojai, CA (US);
`Ronald D. Lachman, Northbrook, 11,
`(US)
`
`(73) Assignees: PersonalWeb Technologies, LLC, Tyler,
`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
`
`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 etal.
`6/1978 Bennett etal
`7/1980 Mitchell
`9/1980 Chang etal.
`9/1981 Cichelli
`3/1983 Rivest
`9/1983 Rivest
`10/1983 Neches
`
`(Continued)
`
`FOREIGN PATENT DOCUMENTS
`0268 069 A2
`5/1988
`
`(Continued)
`
`OTHER PUBLICATIONS
`
`(21) Appl.N0.: 11/017,650
`
`(22) Filed:
`
`Dec. 22, 2004
`
`(65)
`
`Prior Publication Data
`
`US 2005/0114296Al
`
`May 26, 2005
`
`Affidavit of Timothy P. Walkcr in Support ofCWIS' Opening Mark-
`man Brief Construing the Terms at
`Issue in U.S. Patent No.
`6,415,280. dated Jul. 25, 2003. from Civil Action No. 02-11430
`RWZ.
`
`Related U.S. Application Data
`
`(Continued)
`
`(60) Continuation 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.
`
`(51)
`
`Int. Cl.
`(2006.01)
`G06F 17/30
`707/758; 707/781; 707/821
`(52) U.S. Cl.
`(58) Field of Classification Search .................. 707/758,
`707/781, 821
`See application file for complete search history.
`
`Primary Examiner — 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 ofa data item may be based, at least in part,
`on a function of some or all of the bits that comprise the data
`item. A data item may comprise an arbitrary sequence of bits.
`The function may include a hash function or a message digest
`function. The name of a data item may be compared to a list
`oi'names of other data items.
`
`178 Claims, 31 Drawing Sheets
`
`811141315
`
`DA TA ITEM
`
`COMPUTE MD FUNCTION ON
`DATA ITEM
`
`DATA lTEM
`
`5214
`APPEND LENGTH MODULD 32 OF
`
`TR UE NA fitE
`
`EXHIBIT 5 - 1
`
`

`

`Case 5:18-cv-03463-BLF Document 28-5 Filed 10/04/18 Page 3 of 71
`Case 5:18-cv-03463-BLF Document 28-5 Filed 10/04/18 Page 3 of 71
`
`US 8,099,420 B2
`
`PageZ
`
`U.S. PATENT DOCUMENTS
`4,414,624 A
`11/1983 Summer, Jr
`4441155 A
`4/1984 Fletcher
`4,464,713 A
`8,1984 B h“
`4’490‘782 A
`120,984 1330;“
`4:558:413 A
`12/1985 Schmidt e1 ni
`4571700 A
`2/1986 Emry Jr,
`4577293 A
`3,1986 Mmc’k
`d _
`41642764 A
`221987 A‘l
`4'642'793 A
`231987 Mmg“ 6‘
`4‘658’093 A
`431987 11:11 6“"
`46758104
`631987 G "m
`41691599 A
`931987 RIF)“:
`4'725’945 A
`23mg Kl?“ 1541
`4’773’039 ‘A
`921988 21:21:;
`4,821,184 A
`4/1989 Clancy e1 n1
`4887 235 A
`12/1989 Hoiiowny
`4’888’681 A
`12,1989 Bum
`4’914‘571 A
`421990 Barulzet '11
`~
`-
`-
`',
`,‘ r
`'
`23:3ij f;
`2338 $12,113:; “”1
`4,922,417 A
`5/1990 Churm etal
`4,937,863 A
`6/1990 Robon e1 :11
`4949 302 A
`8/1990 Arnold e1 n1
`1
`1
`4’953‘209 A
`8’1990 R d
`S
`5
`5-
`1
`r e ‘1-
`43972367 A
`”3'990 BL}:
`5,014,192 A
`51991 Mzmsficldel 111.
`5,025,421 A
`6/1991 Cho
`5,032,979 A
`7/1991 Hechl e1 111.
`5047918 A
`9/1991 Schwmtzctnl
`5'050-074 A
`9,199] MAM
`5‘050'212 'A
`921991 D‘
`‘
`{057/837 A
`1031991 Cyfmj“
`510771658 A
`1231991
`130 “f”
`5’084'815 A
`13,992 Me“ 6,
`5'117'351 A
`531992 Mi‘lzlzm'o
`51129108, A
`7,1992 K‘b” h.
`5129082 A
`731992 TPfi-‘Yfls'
`5'144*667 A
`93,992 P” "3,
`5'163'147 A
`“3,992 O°§"ev'-
`51793680 A
`1:,1993 C2130“
`5,182,799 A
`1/1993 Tamum el :11
`5,199,073 A
`3/1993 Scott
`5.202.982 A
`4/1993 Gmmlich e1 n1.
`5,204,897 A
`4/1993 Wymnn
`5,204,958 A
`4/1993 Chengel n1.
`5,204,966 A
`4/1993 Witlenberg e1 01
`5208 858 A
`5,1993 Vollen
`1
`{2221134 A
`631993 w '1)
`3,230,051 A
`731993
`‘1'” "
`{239'648 A
`82,99, 33%
`5:241:67! A
`8/1993 Reed e1 n1
`5,247,620 A
`9/1993 Fukmwn er a"
`5260 999 A
`11/1993 Wymnn
`i
`i
`-
`1
`‘
`.
`:‘gzg‘gg? 2
`:Ciggj E13031“ M
`{2871499 A
`2/1994 Nemes ........ .
`5287514 A
`2/1994 Gun]
`_—'
`'
`'
`1
`‘
`,
`2333;: '2
`3133:“ KW?" “‘"l-
`3301316 A
`411994 H‘m‘i‘l‘mn
`5,317,693 A
`5/1994 Cuenod e1 :11
`5321841 A
`6/1994 Ens1e1n1
`{339‘403 A
`8’1994 P’u‘ker
`€341,477 A
`8/1994 Pitkin cl n1.
`5343 527 A
`8/1994 Moo1e
`5‘347’653 A
`9,1994 F1
`.1
`1
`“51,302 A
`931994 LYnfltc "i
`33571140 A
`1031994 Tegolfnlel“
`$357523 A
`103,994 N; 01 1.2mm
`$357330 A
`10;,994 oprgesgn e“ 11
`{359323 A
`10,1994 '1'n1boltela1
`5:361:356 A
`11/1994 c1nrke1n1.
`5,371,897 A
`12,4994 Brown 6101
`5,375,206 A
`12/1994 Humor e101
`5,384,565 A
`1/1995 Cannon
`5,394,555 A
`2/1995 Hunterei n1
`5,403,639 A
`4/1995 Bcisnn 01 a1.
`5,404,508 A
`4/1995 Konrad
`
`.
`
`1
`
`1
`
`5,438,508 A
`g'jfié‘gg‘g ’2
`’
`'
`’
`5,448,718 A
`5.452447 A
`3222833:
`'
`’
`5,459,860 A
`5,465,365 A
`5,467,471 A
`5,475,826 A
`5,479,654 A
`5,491,817 A
`5,499,294 A
`5,504,879 A
`23%;; 2
`-’ 5
`'
`5,542,087 A
`5,548,724 A
`5,553,143 A
`5,568,181 A
`22:12:; ’2
`358,564 A
`"
`'
`5,583,995 A
`1;
`5,588,147 A
`5233342:
`’2
`5,604,003 A
`5604892 A
`"
`’
`5,630,067 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
`2,7223%;
`:2
`5724552 A
`5‘742‘807 A
`5'745'879 A
`5'757‘913 A
`" '
`'
`’
`5,757,915 A
`5,781,629 A
`5,802,291 A
`5,809,494 A
`5326949 A
`5,835,087 A
`2‘33?“ng A
`_
`,
`5,907,704 A
`5940304 A
`2333', :2:
`,
`.
`6,006,018 A
`6,134,603 A
`221112222116) Q,
`’
`5‘
`6,732,180 B1
`23%ng g;
`‘ 7 '
`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
`
`709/226
`
`707/10
`
`725/92
`
`709/219
`
`8/1995 Wymnn
`1
`$133; 1C,“‘°1"’“"[
`“”0“ 3'
`9/1995 Cohnetal.
`................. 707/205
`9/1995 Nelson cl n1.
`1
`,
`3:33; Emma“ '01
`”Pam e "'
`10/1995 Burnett
`11/1995 Winterbottom
`11/1995 Bnder
`12/1995 Fischer
`12/1995 Squibb
`2/1996 Gopal e1 n1.
`3/1996 Friedmnn
`4/1996 Eisenberg et :11.
`1
`$1133: £311”ny 1
`. en“ 6 “-
`7/1996 Neimatetal.
`8/1996 Akizawaetnl.
`9/1996 Rossetal.
`10/1996 Greenwood et n1.
`3332 3:38“
`1
`M t
`12,1996 F't
`”gm 6 '1‘
`12/1996 Gardneretal
`12/1996 Neemnn e101.
`5:33;
`131“" 3‘3"
`21997 71:"an
`1
`2/1997 \I l1:11
`1
`11‘ a
`c 3'
`5/1997 Kmdell e141.
`
`5/1997 Vclisszu'opoulosclal.
`6/1997 Stefiketal.
`6/1997 Hamilton etal.
`7/1997 Woodhilletal.
`10/1997 Blaklcy,IIIctz11.
`10/1997 Dockteretal.
`10/1997 Cahilletal.
`12/1997 Johnson etnl.
`12/1997 Campbell
`12/1997 Alfemess et n1.
`£133: alley err/11.1
`“998 T “5‘“ “'
`“998 611091
`4/1998 *Wfls‘“ 6’
`1
`“998 Bydmnt
`5
`e m? ""
`5/1998 Aucsmith 01:11.
`713/177
`7/1998 Haber
`. 709/202
`9/1998 Balicketal.
`
`9/1998 Nguyen
`707/1
`““998 03““ em"
`11/1998 Hcrz .......[ml................. 346/810
`51333 3061*" e‘ "'
`av1s
`5/1999 Gu_dmundson el 111.
`8m” Gr‘SWOId
`”/1333 21"“ e‘ “'1'
`/
`may eta.
`12/1999 Burnell e161.
`10/2000 Joncsctal.
`13/238121 Stain,
`*
`M ‘e “'
`5/2004 Halgetal.
`1
`lgjfigg‘; Eq‘gfbt
`7
`“I
`re “‘
`5/2002 Farberetal.
`6/2002 Lee et n1.
`4/2003 Lee et n1.
`4/2003 Lee e1 n1.
`5/2003 Lee 61:11.
`7/2004 Fnrber et 01.
`1/2005 Ciupenlier e1 111.
`5/2005 1"arberetal
`3/2007 Fmber eta].
`3/2008 Farber eta].
`3/2008 Farber e1 :11
`3/2008 Farberetal.
`3/2008 Farber et :11,
`
`705/54
`709/303
`
`395/200 49
`709/330
`
`EXHIBIT 5 - 2
`
`

`

`Case 5:18-cv-03463-BLF Document 28-5 Filed 10/04/18 Page 4 of 71
`Case 5:18-cv-03463-BLF Document 28-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
`0315425
`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
`05 162529
`6/1993
`06187384 A2
`7/1994
`06348558 A
`12/1994
`WO 92/20021
`11/1992
`W0 94/06087
`3/1994
`WO 94/20913
`9/1994
`W0 95/01 599
`1/1995
`W0 97/43717
`11/1997
`
`OTHER PUBLICATIONS
`
`Akamai and MIT’s Memorandum in Support ofTheir Claim Con-
`stnrction of USPAT 5,978,791, dated Aug 31, 2001, from Civil
`Action No. 00-cv-11851RWZ
`Akamai‘s Answer, AIfirmative Defenses and Counterclaims 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-1 1430 RWZ.
`Answer of Defendant RIAA to First Amended Complaint and Coun-
`tercIaim, dated Feb 8, 2005, from Civil Action No. CV04-7456J1’W
`((th)
`Berners-Lec, T et al., “Hypertext Transfer Protocol—HTTP/Ifl,"
`May 1996, pp. 1-54.
`Berners-Lee, T., “Universal Resource Identifiers in WWW," Jun.
`r994, pp r-25
`Bowman, C. Mic. ct al., “Harvest: A Scalable, Customizable Discov-
`ery and Access System,” Aug. 4, 1994. pp. 1-27.
`Bowman, C. Mic, ct al., “Harvest: A Scalable, Customizable Discov-
`ery and Access System," Mar. 12, 1995, pp. 1-29.
`IIr'isco, '1 , “DNS Support for Load Balancing," Apr. 1995, pp. 1-7.
`Browne, Shirley cl al., “Location-Independent Naming for Virtual
`Distributed Software Repositories," 1995, 7 pages.
`Browne, Shirley el al., “Location-Independent Naming for Virtual
`Distributed Soltware Repositories,” 1995, printed from http:/www.
`netlib org/utk/papers/lifn/main.html on Mar. 22, 2006, 18 pages.
`Civil Minutes General dated Jan. 25, 2005, from Civil Action No. CV
`04-7456-JFW (CTX)
`Complaint for Patent Infringement, Permanent Injunction, and Dam-
`ages, dated Sep 8, 2004, from Civil Action No. CV 04-7456 JFW
`(AJWx).
`CWIS' Opening Markman Brief Construing the Terms at Issue in
`U S Patent No. 6,4 1 5,280, dated Jul. 25, 2003, from Civil Action No
`02-11430 RWZ.
`CWIS' Reply Markman BriefConstruing 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 aDistributed Digital Technical Report
`Library," Jan 15, 1994, pp. 1-8.
`Declaration ofRobert B K Dewar in Support ofCWIS' Construction
`of the Terms at Issue in US Patent No (7,415,280, dated Jul. 25,
`2003, from Civil Action No 02-cv-I 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 ’5 Reply Memorandum of Points and
`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 of Motion 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 .
`
`HTTP/1.1," Jun.
`
`Defendant MediaSentry, Inc ’s Answer to Plainlit‘fs’ 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’ First 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. 9691076222201.
`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 al., “How to Interact with a Whois++ Mesh," Feb.
`1996, pp. 1-9.
`Fielding, R. et a1., "Hypertext Transfer Protocolill'l'l'P/I 1," Jan
`1997, pp. 1-163.
`Fielding, R. et al., “Hypertext Transfer Protocol
`1999, pp. 1-157.
`Infringement, Permanent
`for Patent
`First Amended Complaint
`Injunction and Damages, dated Nov. 24, 2004, from Civil Action No.
`CV 04-7456 JFW (CTx).
`International Search Report dated Jun. 24, 1996 in corresponding
`international application PCT/USI996/004733.
`Khare, R. and Lawrence, S., “Upgrading to TLS Within HTTP/I I,"
`May 2000, pp. 1.12.
`Kim ct al., "The Design and Implementation of Tripwire: A file
`System Integrity Checker", COAST Labs. Dept. of Computer Sci-
`ences Purdue University. Feb. 23, 1995, pp. 1-18.
`Knuth, Donald E., “The Ad of Computer Progranuning,” 1973, vol.
`3, Ch. 6.4, pp. 506-549,
`Memorandum of Points and Authorities in Support ofI,oudcyc‘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
`JFW (AJWX)
`Meats, R., “URN Syntax,” May 1997, pp. 1-8.
`Myers, J. and Rose, M., “The Content-MDS Header Field," Oct
`1995, pp. 1-4.
`Ofiice Action in corresponding Japanese Application No. 531,073/
`1996 mailed on Apr. 25, 2006.
`Office Corrununication 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 Abstracts 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
`Plaintiffs' Memorandum of Points and Authorities in Opposition to
`Loudeye Defendants’ Motion to Dismiss, dated Nov. 8, 2004, from
`Civil Action No. CV-04-74 56 JFW (AJWX)
`Plaintit’fs’ Opposition to Media Sentry’s Motion to Dismiss, Memo-
`randum of Points and Authorities in Support 'Ihereof. dated Nov 8,
`2004, from Civil Action No. CV 04—7456 JFW (CTx).
`Plaintiffs Opposition to Recording Industry Association ofAmeri-
`ca’s Motion to Dismiss; Memorandum of Points and Authorities in
`Support Thereof, dated Nov 8, 2004, from Civil Action No CV-04-
`7456 W (CTx).
`Plaintill‘s Reply to Defendant Loudeye Corp. '5 and Overpeer, Inc.'s
`Counterclaims, dated Mar. 3, 2005, from Civil Action No CV
`04-7456 JFW ('CTX)
`Plaintiff‘s Reply to Defendant MediaSentry's Counterclairns, dated
`Mar. 3, 2005, from Civil Action No. CV 04-7456 .IFVV (CTX)
`Plaintiffs Reply to Defendant RIAA’s Counterclairns, dated Mar. 3,
`2005, from Civil Action No. 04-7456 JFW (CTx)
`
`EXHIBIT 5 - 3
`
`

`

`Case 5:18-cv-03463-BLF Document 28-5 Filed 10/04/18 Page 5 of 71
`Case 5:18-cv-03463-BLF Document 28-5 Filed 10/04/18 Page 5 of 71
`
`US 8,099,420 B2
`Page 4
`
`Reed Wade (wade@cs.utk edu), “re: Dienst and RFD/LIFN docu-
`ment," Aug 8, 1994, printed from http://www webhistoryorg/www
`lists/www—talkl994q3/0416.html on Mm: 22. 2006, (7 pages).
`Rivest, R, “The MDS Message-Digest Algorithm,” Apr. 1992, pp
`1-19 and errata sheet (1 page).
`Rose, M.. “'Ihe Content-MDS Header Field,” Nov 1993, pp 1-3
`Schncier, Bruce, “One-Way Hash Functions, Using Crypographic
`Algorithms for Hashing," 1991, printed from http://202.179135.4/
`data/DDJ/articles/l991/9109/91909g/9109g htrn on Mar. 22, 2006.
`Sun Microsystems, Inc., “NFS: Network File Systerrr Protocol Speci-
`fication," Mar. 1989, pp. 1-25.
`Vincenzelti, David and Cotrrozzi. Massimo, “Anti Tampering Pro-
`gram," Proceedings ofthe Fourth {USENIX} Security Symposium,
`Santa Clara, CA, 1993, 11 pages.
`Vinccnzetli, David turd Cotrrozzi. Massimo, “Anti Trunpering Pro-
`gram," Proceedings of the Fourth {USENIX} Security Symposium,
`Santa Clara, CA, undated, printed from http://vrmw.ja.net/CERI/
`VincenZetti_and_Cotrozzi/ATP_Anti__Tamp on Mar. 22, 2006, 8
`pages.
`Berners-Lee, T. et al., “Uniform Resource Locators (URL),"pp. 1-25,
`Dec. 1994
`Danzig, P.B., ct al., ““Distributcd 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,
`1991
`Hauzcur, B. M., “A Model for Naming, Addressing, and Routing,”
`ACM Trans. Inf. Syst. 4, Oct. 4, 1986), 293-311.
`Khoshaiian, S. N. et al. 1986. Object identity. In Conf. Proc. on
`Object-Oriented Prograrrrming Systems, Languages and Applica-
`tions (Portland, Oregon, United States, Sep. 29-Oct. 2, 1986). N
`Meyrowitz, Ed. OOPLSA ’86. ACM Press, NewYork, NY, 406-416.
`Lantz, K. A., et al., “Towards a universal directory service." In Proc
`4th Annual ACM Symp. 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 of an 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 al., “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, NewYor'k, NY, 34-41.
`Ma, C. 1992. On building very large naming systems. In Proc. Sth
`Workshop on ACM SIGOPS European Workshop: Models and Par. -
`digrns for Distributed Systems Stnrctrrring (France, Sep. 2 | -23,
`1992). EW 5. ACM Press, New York, NY, [-5.
`Peterson, L. L. 1988. A yellow-pages service for a local-area net-
`work In Proc. ACM Workshop on Frontiers in Computer Cormnu-
`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,"
`IUEE Network Magazine, pp. 37-44, Nov.-1)ec 1997.
`Schwartz, M., ct al. 1987. Anamc 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 European Workshop: Models and Par. -
`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 ofnruning conventions for distributed
`computer systems In Proc. ACM SIGCOMM Symp on Communi-
`cations Architectures and Protocols: Tutorials & Symp SIGCOMM
`'84 ACM Press, NY, NY, 218-224.
`Cheriton, David R and Mann, Timothy P., “Decentralizing a global
`nruning service for improved performance and fault tolerance", ACM
`'1‘ransactions on Computer Systems, vol 7, No 2, May 1989, pp
`147-183
`Request for Reexamination of US Patent No. 6.928.442: Reexam
`Control US Appl No 90/010,260,filed Aug 29, 2008.
`
`Kim ct al ,“Fxperiences with 'l r ipwire: Using Intergrity 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 Intergrity Checker”, COAST Labs. Dept. of Computer Sci-
`ences Purdue University, Nov 19, 1993, pp 1-21.
`Zhiyu Tian et al , A New Hashing Function: Statistical Behaviour and
`Algorithm. pp 3—13.
`G. L. Friedman. Digital Camera with Apparatu for Authentication of
`Images Produced from an Image File. NASA Case No. NFC-19108-
`l-CLI. U S. Appl No 08/159,980, filed Nov 24, 1993.
`H. Goodman, Ada, (')bject-(’)riented 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 Lofthus, Nor-
`way, May 23-27, 1993 Proceedings.
`Proceedings of the 1993 ACM SIGMOD International Conference on
`Management of Data. vol. 22. Issue 2, Jun. 1993.
`Advances
`in (Iryplology-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 al., On Optimal Processor Allocation to Support
`l’ipclined llash Joins, ACM SIGMOD, pp. 69-78, May 1993.
`'i Immas A. Berson, Differential Cryptanalysis Mod 232 with Appli-
`cations to MDS, pp 69-81
`Williiun Perrizo et al., Distributed Join Processing Performance
`Evalualion. Twenty-Seventh Hawaii International Conference on
`System Sciences, vol
`II. pp 236-244.
`Vijay Kurnar, A Concurrency Control Mechanism Based on Extend-
`ible Hashing for Main Memory Database Systems, ACM, vol. 3,
`1989, pp. 109.113.
`Birgit Pfit‘zrrran, Sorting Out Signature Schemes, Nov. 1993, ls’Conf.
`Computer & Comm Security ’93, p 74-85
`Bert dern Boer et al , Collisions for the compression function ofMDs,
`pp 292-304.
`Sakti Pramanik etal.,.\/1ulti—Directory Hasing, 1993, Info. Sys, vol.
`18, N0. 1, pp. 63-74.
`Murlidhar Koushik, Dynamic Hashing with Distributed Overflow
`Space: A File Organization with Good Insertion Performance, 1993,
`Info Sys., vol. 18, No. 5, pp. 299-317.
`Witold Litwin el al., LI‘I"‘-Linear Hashing for Distributed Files, HP
`Labs Tech Report No. HPL-93-21, Jun. 1993; pp. 1-22.
`Yuliang7.heng el al ,l-IAVAI.—A One-Way I-IashingAlgorithm with
`Variable Length of Output (Extendcd Abstract), pp. 83-105.
`Chris Charnes and Josef Pieprzky, Linear Nonequivalence versus
`Nonlinearily, Pieprzky, pp. 156-164.
`Gwertzman, James, at al “The Case for Geographical Push-Cach-
`ing” Technical Report IIU TR 34-94 (excerpt), Harvard University,
`DAS, Cambridge, MA 02138, 1994, 2 pgs.
`Grigni, Michelangelo, et al. “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 ofDDII: A Distributed
`Dynamic Hashing Algorithm." In Proceedings of 4th International
`Conference on Foundations of Data Organizations and Algorithms,
`1993, pp 101-114
`in Datagram
`“Mullicast Routing
`a1.
`et
`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 al. [Ir/roduclion to Algorilhms, The MIT
`Press, Cambridge, Massachusetts, 1994. pp. 219-243. 991-993.
`Naor, Moni, et al "The Load, Capacity and Availability of Quorum
`Systems" In Proceedings of the 35lh IEEF. Symposium on Founda-
`tions of Computer Science, Nov. 1994, pp. 214-225.
`Nisan, Noam. “Psuedorandom Generators for Space-Bounded Corn-
`pulation." In Proceedings ofthe Twenty-Second Annual ACM Syrn-
`posirrm on Theory ofComputing, May 1990, pp. 204-212.
`Palmer, Mark, et al. “Fido: A Cache that Leams 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-cv-03463-BLF Document 28-5 Filed 10/04/18 Page 6 of 71
`Case 5:18-cv-03463-BLF Document 28-5 Filed 10/04/18 Page 6 of 71
`
`US 8,099,420 B2
`
`Page 5
`
`Peleg, David, et al “The Availabiltiy ot‘Quorum Systems ” Inforrna-
`tion and Computation 123, 1995, 210-223
`Rabin, Michael. "Efficient Dispersal of Information for Security,
`Load Balancing, and Fault Tolerance” Journal ofthe ACM, vol. 36,
`No. 2, Apr. 1989, pp. 335-348
`Ravi. R., “Rapid Rumor Ramification: Approximating the Minimum
`Broadcast Time.” In Proceedings of the 35th IEEE Symposium on
`Foundation ofComputer Science, Nov. 1994, pp. 202-2 l3
`Schmidt, Jeanette, et al. “Chemoff-Hoeffding Bounds for Applica-
`tions with Limited Independence." In Proceedings of the 4th ACS-
`SIAM Symposium on Discrete Algorithms, 1993, pp 331-340
`'1'arjan, Robert L-‘ndre, et al “Storing a Sparse 'l'able." Cornmunica-
`tions ofthe ACM, vol 22, No 11. Nov 1979, pp. 606-611.
`Wegman, Mark, et al “New 1 lash Functions and Their Use inAuthen-
`tication and Set Equality” Journal ofComputer and System Sciences
`vol. 22, Jlln. 1981, pp. 265-279
`Vitter, Jeffrey Scott, et a1 “Optimal Pretetching via Data Cornpres—
`sion ” In Proceedings of32nd ILi'L’Li Symposium on Foundations of
`Computer Science, Nov 1991, pp 121-130.
`Fredman, Michael, et al. “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, vol. 28, No. 3, Jul. 1981, pp.
`615-628
`Floyd, Sally, ct 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 al. “Implementing Global Memory Management
`in a Workstation Cluster.” In Proceedings ofthe 15th ACM Sympo-
`sium on Operating Systems Principles, 1995, pp. 201-212.
`Carter, J. Lawrence, et a1. “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" 06/30/19993, JP
`05162529.
`Kim et al., “Experiencess with Tripwire: Using Intergrity Checkers
`for Intrusion Detection”, COAST Labs. Dept. ofComputer Sciences
`Purdue University, Feb 22, 1995, pp. 1-12
`Kim ct al., “The Design and Implementation of Tripwire: A file
`System Intergrity Checker”. COAST Labs. Dept. of Computer Sci-
`ences Purdue University, Nov. 19, 1993, pp. 1-21.
`Bert Dem Boer et al., Collisions for the compression function of
`MD5, pp. 292-304.
`Sakti Pramanik et al., Multi-Directory Hashing, 1993, Info Sys., vol.
`18, No. 1, pp. 63-74.
`Murlidhar Koushik, Dyniunic Hashing with Distrubuled Overflow
`Space: A File Organization with Good Insertion Performance, 1993,
`Info Sys., vol. 18, No 5, pp. 299-317
`Witold Litwin et al., LIP-Linear Hashing for Distributed Files, HP
`Labs Tech. Report No. HPL—93-21, Jun. 1993, pp. 1-22.
`Yuliang Zheng et :Ll
`, HAVAL-A One-Way Hashing Algorithm with
`Variable Length of Output (Extended Abstract), 1993, pp. 83-105
`Chris Charnes and Josef Piepnky. Linear Nonequivalence 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 llash Joins, ACM SIGMOD, pp 69-78, May 1993.
`Thomas A. Berson, Difl'erential Cryptanalysis Mod 232 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. 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.
`BirgitPfitzman,SortingOutSignature Schemes, Nov. 1993. 1”Conf.
`Computer& Comm Security ’93. p 74-85
`Zhiyu Tian et al., A New Hashing Function: Statistical Behaviourand
`Algorithm, Spring 1993, pp 3-13
`
`G.I.. Friedman, Digital Cameiawith Apparatus for Authentication of
`Images Produced from an Image File. NASA Case No NPO- 1 9108-
`l-CU, U S. Appl. No. 08/159,980, Nov 24, [993
`H. Goodman, Ada, Object-Oriented Techniques, and Concurrency in
`Teaching Data Structures and File Management Report Docurnenta-
`tion p. AD-A275 385-94-04277.
`Advances
`in Cryptology-El IROCRYPT ’93, Workshop on the
`Theory and Application of Cryptographic Techniques I.oflht1s, Nor-
`way, May 23-27, 1993, Proceedings.
`Proceedings on the 1993 ACM SIGMOD International Conference
`on Management of Data, vol 22, Issue 2, Jun. 1993
`Advances of Cryptology-AUSCRYPI'
`'927Workshop on the
`Theory and Application of Cryptographic Techniques Gold Coast,
`Queensland, Australia, Dec. 13-16, 1992 Proceedings.
`'1'a.rjan, Robert Endre, eta1., “Storing a Sparse Table”, Communica-
`tions ofthe ACM, vol. 22, No. 11, Nov. 1979, pp. 606-611.
`Wegman, Market a1 , “New Hash Functions andTheirUse in Authen-
`tication and Set Equality”, Journal of Computer and System Sci-
`ences, vol. 22, Jun. 1981, pp. 265-279.
`Vitter, Jeffrey Scott et 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 Computing
`Machinery, vol 31, No.3, Jul. 1984, pp. 538-544.
`Yao, Andrew Chi-Chih, “Should Tables be Sorted‘?”, Journal ofthe
`Association for Computing Machinery, vol. 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 al., “Implementing Global Memory Management
`in a Workstation Cluster", In Proceedings of the 15th ACM Sympo-
`sium on Operating Systems Principles, 1995, pp. 201-212.
`Carter, J Lawrence, et al., “Universal Classes of Hash Functions",
`Jotunal ofComputer and System Sciences, vol. 18, No. 2, Apr. 1979,
`pp. 143-154.
`Patent Abstracts ofJapan, “Electronic Mail Multiplexing System and
`Cormntmication Control Method in the System”, Jun. 30, 1993, JP
`05162529.
`Kim et al., “Experiences with 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 Irnpleruentation of Tripwire: A File
`System Integrity Checker", COAST Labs. Dept. of Computer Sci-
`ences Purdue University, Nov. 19, 1993, pp. 1-21.
`Peter Deutsch (peter'd@bunyip.com), “Re: MD5 and LIFNs (was:
`Misc Comments)”, www.ac1.lanl.gov/URI/archive/uri-94q2.mes—
`sages/0106.html, Apr. 26, 1994.
`Alexander Dupuy (dupuy@smarts.com), “RE: MD5 and LIFNs
`(was: Misc Comments)", wwwacl.lanl.gov/URI/archive/uri-94q2.
`messages/01 13.html. Apr. 26, 1994.
`Alexander Dupuy (dupuy@smarts.com), “MD5 and LIFNs (was:
`Misc Cormnents)”, www.acl.la.nl.gov/URI/archive/uri-94q2.mes-
`sages/008Lhtml, Apr. 17, 1994.
`Albert Langer
`(cmf851@anu.oz.au). http://groupsgoogle com/
`groups?selm=l991Aug7 2251 59.786‘1/040newshostanu.edu au&
`oe=U'1'F-8&0utput=gplain, Aug. 7, 1991.
`Clifford Lynch (Calur@uccmvsa.bitnet), “ietfurl/uri overview draft
`paper
`(long)”, www.acl.lan[gov/URI/archive/uri-93q1 messages/
`0015 htrnl, Mar. 25, 1993.
`K. Sollins and L Masinter, “Functional Requirements for Uniform
`Resource Names", www.w3.org/Addressing/rfc | 737 txt, Dec. 1994,
`pp. 1-7.
`W3C:ID, HTTP: A protocol for networked information, “Basic
`HTTP as defined in 1992", wwww3.org/Protocols/HTTPZ.hlml,
`1992
`Defendant Lime Wire, LLC’s Answer, Affirmative Defenses and
`Counterclaims dated Nov. 15, 2007, from Civil Action No. 07-06161
`VBF (PLAX).
`
`EXHIBIT 5 - 5
`
`

`

`Case 5:18-cv-03463-BLF Document 28-5 Filed 10/04/18 Page 7 of 71
`Case 5:18-cv-03463-BLF Document 28-5 Filed 10/04/18 Page 7 of 71
`
`US 8,099,420 B2
`
`Page 6
`
`Kim, (iene H , and Spafford, Eugene H . “Writing, Supporting, and
`Evaluating Tripwire: A Publicly Available Security 'fool.” COAST
`Labs Dept. ofComputer Sciences Purdue University, Mar. 12, 1994,
`pp 1-23
`l l/980,679—May 6, 2009 PTO Office Action.
`11 S. Appl No.
`USPTO, Non-Final Office action mailed .Iun. 15, 2009 in 11.8. Appl
`No.
`l ”980.687.
`USPTO, Non-Final Office action mailed Jun. 18, 2009 in Reexam
`11S. Appl. No. 90/010,260.
`Communication from EPO in European Application No. 96 910
`762 2-1225 dated May 8,2009 [4 pgs]
`McGregor l) R. and Mariani. J. A.“1"ingerprinting~Atechnique for
`file identification and maintenance," Software: Practice and Experi-
`ence, vol 12, No 12, Dec 1982, pp 11654166
`[Proposed] Order Regarding Construction of’l'erms, filed Mar 29,
`2007 in C D Cal case No CV 06-5086 SJO (Ex) [9 pgs J
`Analysis of Plaintiffs’ Claim Chart for the ’280 Patent As Against
`Defendant Media Sentry, Inc. 11 pages.
`Analysis of Plaintiffs' Claim Chart for the '79] 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. [-40
`Barbara D , et al., “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.
`Campbell. M , “T he Design of Text Signatures for Text Retrieval
`Systems." Tech. Report, Sep. 5, 1994, Deakin University. School of
`Computing & Math, Geelong, Australia.
`Chang, W W et al . “A signature access method for the Starburst
`database system,” in Proc. 15th Int'l Conf. on Very Large Data Bases
`(Amsterdzun, The Netherlands), pp. 145-153.
`Changes to Mar. 23,2007 Deposition ofRobert B. K. Dewar, in CD
`Cal. case