[GNUnet-SVN] r1765 - GNUnet-docs/papers/ecrs

[grothoff]

Author: grothoff
Date: 2005-08-19 15:36:21 -0700 (Fri, 19 Aug 2005)
New Revision: 1765

Modified:
   GNUnet-docs/papers/ecrs/main.aux
   GNUnet-docs/papers/ecrs/main.log
   GNUnet-docs/papers/ecrs/main.pdf
   GNUnet-docs/papers/ecrs/main.tex
Log:
fixing quotes

Modified: GNUnet-docs/papers/ecrs/main.aux
===================================================================
--- GNUnet-docs/papers/ecrs/main.aux    2005-08-19 22:22:04 UTC (rev 1764)
+++ GNUnet-docs/papers/ecrs/main.aux    2005-08-19 22:36:21 UTC (rev 1765)
@@ -88,7 +88,7 @@
 \newlabel{keywords}{{4.1}{16}{Keyword inference\relax }{subsection.4.1}{}}
 address@hidden {subsection}{\numberline {4.2}Directories}{16}{subsection.4.2}}
 \citation{bloom}
address@hidden {figure}{\numberline {5}{\ignorespaces  ECRS allows the 
formation of complicated network structures. In this example, the {\em  SBlock} 
of pseudonym \relax $\@@underline {\hbox {\it  {Alice}}}\mathsurround \z@ 
$\relax  eventually allows to retrieve two of the documents encoded in the 
system, as does {\em  Kblock} for keyword ``food. Boxes denote simple blocks 
that serve as entry-points. The directory and the documents consist of a tree 
of possibly many CHK-encoded blocks. Searching for keyword ``soda'' would 
return two results pointing to different resources. Note that all the encoded 
resources, including the one document with no pointers to it, can be retrieved 
by knowing the CHK keys of their root {\em  IBlock}s. }}{17}{figure.5}}
address@hidden {figure}{\numberline {5}{\ignorespaces  ECRS allows the 
formation of complicated network structures. In this example, the {\em  SBlock} 
of pseudonym \relax $\@@underline {\hbox {\it  {Alice}}}\mathsurround \z@ 
$\relax  eventually allows to retrieve two of the documents encoded in the 
system, as does {\em  Kblock} for keyword ``food". Boxes denote simple blocks 
that serve as entry-points. The directory and the documents consist of trees of 
possibly many CHK-encoded blocks. Searching for keyword ``soda" would return 
two results pointing to different resources. Note that all the encoded 
resources, including the one document with no pointers to it, can be retrieved 
by knowing the CHK keys of their root {\em  IBlock}s. }}{17}{figure.5}}
 \newlabel{fig:network}{{5}{17}{Directories\relax }{figure.5}{}}
 address@hidden {subsection}{\numberline {4.3}Efficient lookups with bloom 
filters}{17}{subsection.4.3}}
 \citation{freehaven-berk,mojotech}

Modified: GNUnet-docs/papers/ecrs/main.log
===================================================================
--- GNUnet-docs/papers/ecrs/main.log    2005-08-19 22:22:04 UTC (rev 1764)
+++ GNUnet-docs/papers/ecrs/main.log    2005-08-19 22:36:21 UTC (rev 1765)
@@ -1,4 +1,4 @@
-This is pdfeTeX, Version 3.14159-1.10b-2.1 (Web2C 7.4.5) (format=pdflatex 
2005.8.6)  19 AUG 2005 15:08
+This is pdfeTeX, Version 3.14159-1.10b-2.1 (Web2C 7.4.5) (format=pdflatex 
2005.8.6)  19 AUG 2005 15:42
 entering extended mode
 **main.tex
 (./main.tex{/usr/share/texmf/pdftex/config/pdftex.cfg}
@@ -523,7 +523,7 @@
  []
 
 [15] <xymatrix 4x3 438> [16]
-Underfull \vbox (badness 3078) has occurred while \output is active []
+Underfull \vbox (badness 3354) has occurred while \output is active []
 
  [17]
 [18] [19] [20] (./main.bbl [21]
@@ -535,12 +535,12 @@
 Here is how much of TeX's memory you used:
  6630 strings out of 94960
  81007 string characters out of 1182471
- 239056 words of memory out of 1000001
+ 239055 words of memory out of 1000001
  9533 multiletter control sequences out of 10000+50000
  12713 words of font info for 52 fonts, out of 500000 for 1000
  198 hyphenation exceptions out of 1000
- 32i,14n,36p,806b,896s stack positions out of 1500i,500n,5000p,200000b,5000s
- 354 PDF objects out of 300000
+ 32i,14n,36p,805b,939s stack positions out of 1500i,500n,5000p,200000b,5000s
+ 351 PDF objects out of 300000
  99 named destinations out of 131072
  58 words of extra memory for PDF output out of 65536
 {/usr/share/texmf/dvips/tetex/0ef0afca.enc}</usr/share
@@ -548,21 +548,20 @@
 f.enc}</usr/share/texmf/fonts/type1/bluesky/cm/cmsy10.pfb></usr/share/texmf/fon
 ts/type1/bluesky/cm/cmsy7.pfb>{/usr/share/texmf/dvips/tetex/09fbbfac.enc}</usr/
 share/texmf/fonts/type1/bluesky/cm/cmtt10.pfb></usr/share/texmf/fonts/type1/blu
-esky/cm/cmsy5.pfb></usr/share/texmf/fonts/type1/bluesky/cm/cmsy9.pfb></usr/shar
-e/texmf/fonts/type1/bluesky/cm/cmr5.pfb></usr/share/texmf/fonts/type1/bluesky/c
-m/cmtt8.pfb>{/usr/share/texmf/dvips/tetex/aae443f0.enc}</usr/share/texmf/fonts/
-type1/bluesky/cm/cmmi5.pfb></usr/share/texmf/fonts/type1/bluesky/cm/cmmi7.pfb>{
-/usr/share/texmf/dvips/tetex/f7b6d320.enc}</usr/share/texmf/fonts/type1/bluesky
-/cm/cmbx9.pfb></usr/share/texmf/fonts/type1/bluesky/cm/cmmi6.pfb></usr/share/te
-xmf/fonts/type1/public/xypic/xydash10.pfb></usr/share/texmf/fonts/type1/bluesky
-/cm/cmsy6.pfb></usr/share/texmf/fonts/type1/public/xypic/xybtip10.pfb></usr/sha
-re/texmf/fonts/type1/public/xypic/xyatip10.pfb></usr/share/texmf/fonts/type1/bl
-uesky/cm/cmmi9.pfb>{/usr/share/texmf/dvips/tetex/74afc74c.enc}</usr/share/texmf
-/fonts/type1/bluesky/cm/cmti9.pfb></usr/share/texmf/fonts/type1/bluesky/cm/cmmi
-10.pfb></usr/share/texmf/fonts/type1/bluesky/cm/cmti10.pfb></usr/share/texmf/fo
-nts/type1/bluesky/cm/cmtt9.pfb></usr/share/texmf/fonts/type1/bluesky/cm/cmr9.pf
-b></usr/share/texmf/fonts/type1/bluesky/cm/cmr6.pfb></usr/share/texmf/fonts/typ
-e1/bluesky/cm/cmr7.pfb></usr/share/texmf/fonts/type1/bluesky/cm/cmbx12.pfb></us
-r/share/texmf/fonts/type1/bluesky/cm/cmr10.pfb></usr/share/texmf/fonts/type1/bl
-uesky/cm/cmbx10.pfb>
-Output written on main.pdf (23 pages, 295202 bytes).
+esky/cm/cmsy9.pfb></usr/share/texmf/fonts/type1/bluesky/cm/cmr5.pfb></usr/share
+/texmf/fonts/type1/bluesky/cm/cmtt8.pfb>{/usr/share/texmf/dvips/tetex/aae443f0.
+enc}</usr/share/texmf/fonts/type1/bluesky/cm/cmmi5.pfb></usr/share/texmf/fonts/
+type1/bluesky/cm/cmmi7.pfb>{/usr/share/texmf/dvips/tetex/f7b6d320.enc}</usr/sha
+re/texmf/fonts/type1/bluesky/cm/cmbx9.pfb></usr/share/texmf/fonts/type1/bluesky
+/cm/cmmi6.pfb></usr/share/texmf/fonts/type1/public/xypic/xydash10.pfb></usr/sha
+re/texmf/fonts/type1/bluesky/cm/cmsy6.pfb></usr/share/texmf/fonts/type1/public/
+xypic/xybtip10.pfb></usr/share/texmf/fonts/type1/public/xypic/xyatip10.pfb></us
+r/share/texmf/fonts/type1/bluesky/cm/cmmi9.pfb>{/usr/share/texmf/dvips/tetex/74
+afc74c.enc}</usr/share/texmf/fonts/type1/bluesky/cm/cmti9.pfb></usr/share/texmf
+/fonts/type1/bluesky/cm/cmmi10.pfb></usr/share/texmf/fonts/type1/bluesky/cm/cmt
+i10.pfb></usr/share/texmf/fonts/type1/bluesky/cm/cmtt9.pfb></usr/share/texmf/fo
+nts/type1/bluesky/cm/cmr9.pfb></usr/share/texmf/fonts/type1/bluesky/cm/cmr6.pfb
+></usr/share/texmf/fonts/type1/bluesky/cm/cmr7.pfb></usr/share/texmf/fonts/type
+1/bluesky/cm/cmbx12.pfb></usr/share/texmf/fonts/type1/bluesky/cm/cmr10.pfb></us
+r/share/texmf/fonts/type1/bluesky/cm/cmbx10.pfb>
+Output written on main.pdf (23 pages, 293693 bytes).

Modified: GNUnet-docs/papers/ecrs/main.pdf
===================================================================
(Binary files differ)

Modified: GNUnet-docs/papers/ecrs/main.tex
===================================================================
--- GNUnet-docs/papers/ecrs/main.tex    2005-08-19 22:22:04 UTC (rev 1764)
+++ GNUnet-docs/papers/ecrs/main.tex    2005-08-19 22:36:21 UTC (rev 1765)
@@ -19,8 +19,8 @@
 \begin{document}
 
 % Annoying grammar/style notes:
-% - try to avoid the use of ``encoding'' as a noun on its own. ``encoding
-%   scheme'' or ``encoding mechanism'' is better.
+% - try to avoid the use of ``encoding" as a noun on its own. ``encoding
+%   scheme" or ``encoding mechanism" is better.
 %
 % Notes by JTL (06.jun.05): 
 % - word 'convergent' is used in the end of the doc 'out of the blue'
@@ -322,7 +322,7 @@
 the keyword, users can obtain the CHK key.  The form of the keywords
 can be freely chosen, allowing for conventions such as dates in the
 keyword to be used for updates (in Freenet's terminology, these are
-called ``date based redirects'').
+called {\em date based redirects}).
 
 In addition to CHK and SSK keys, Freenet supports KSK keys.  A KSK key
 is essentially a CHK key stored in plaintext (!) under a keyword.  The
@@ -430,7 +430,7 @@
 (as well as Freenet) use cryptographically signed data,
 which Tangler calls collections.  
 ECRS has analogous constructions to Tangler's collections, referred to
-in this paper as ``directories'' and ``namespaces''; however, unlike
+in this paper as {\em directories} and {\em namespaces}; however, unlike
 ECRS, a Tangler collection has a versioned root which explicitly lists
 all of the contents in the collection, resulting in one of Tangler's
 global synchronization problems. %  [FIXME: better w/ CITE].  
@@ -447,8 +447,8 @@
 %problem/attack applies to a whole range of systems and is a good
 % motivation for the merkle tree.  Also, the decentralization of
 % gnutella was one of the reasons why it was heralded as the 
-% ``censorship resistant'' successor of napster... -- cg
-% I agree... they're ``related work'' in that sense, brief mention
+% ``censorship resistant" successor of napster... -- cg
+% I agree... they're ``related work" in that sense, brief mention
 % is fine as long as we keep it brief -- klb
 
 The FastTrack network\footnote{Protocol description from the giFT-FastTrack
@@ -591,7 +591,7 @@
 deterministically generated public keys.  
 Additionally, by using {\em KBlock}s, documents can
 be inserted under multiple keys at a minimal cost in terms of space.
-Users can perform boolean searches of the form ``a AND b'' which then
+Users can perform boolean searches of the form ``a AND b" which then
 return the documents which were inserted under a matching set of
 keywords.  Before the download, the user can refine the search results
 using the metadata associated with the file.
@@ -946,10 +946,10 @@
 \small
 \hrule
 \vspace{3mm}
-$B$ shares file which is encoded as $B_1, B_2$ and one {\em IBlock} under 
keyword ``test''.
+$B$ shares file which is encoded as $B_1, B_2$ and one {\em IBlock} under 
keyword ``test".
 \begin{description}
- \item[$A \to B$:]{Query: $H(Pub_{H(``test'')})$}
- \item[$B \to A$:]{Response: 
$([E_{H(``test'')}(Q_0,K_0,size)]_{Prv_{H(``test``)}},Pub_{H(``test'')})$
+ \item[$A \to B$:]{Query: $H(Pub_{H(``test")})$}
+ \item[$B \to A$:]{Response: 
$([E_{H(``test")}(Q_0,K_0,size)]_{Prv_{H(``test")}},Pub_{H(``test")})$
 %%%%\\
                    (one {\em KBlock})}
 %: the encrypted and signed data, and the public key)}
@@ -982,7 +982,7 @@
 
 One problem with ECRS is that the content must often be associated
 with keywords.  Although this is vastly better than forcing the user
-to rely on ``meaningless'' bitstrings as the only identifier, the keys
+to rely on ``meaningless" bitstrings as the only identifier, the keys
 must still be chosen so that the target audience can guess them.  The
 simplest non-technical solution for this problem is for a group of
 users to agree on an informal standard for keywords.  If content
@@ -1033,22 +1033,22 @@
 \begin{center}
 \small
 address@hidden
-  *+[F]{SBlock(\underline{Alice})}  {\ar@/_/[rr]} & & Directory_1 
{\ar@/_/[ll]}  address@hidden>}[dll]} address@hidden>}[dl]} 
address@hidden>}[d]}  & *+[F]{KBlock(``food)} address@hidden>}[l]} \\ 
-  *+[F]{SBlock(\underline{Bob})}  address@hidden>}[dr]} & 
*+[F]{KBlock(``soda'')} address@hidden>}[d]} & *+[F]{KBlock(``soda'')} 
address@hidden>}[d]}  & *+[F]{KBlock(``cola'')} address@hidden>}[dl]} \\
-  *+[F]{KBlock(``bob'')} address@hidden>}[u]} & Document_1  & Document_2 & 
Document_3 \\
+  *+[F]{SBlock(\underline{Alice})}  {\ar@/_/[rr]} & & Directory_1 
{\ar@/_/[ll]}  address@hidden>}[dll]} address@hidden>}[dl]} 
address@hidden>}[d]}  & *+[F]{KBlock(``food")} address@hidden>}[l]} \\ 
+  *+[F]{SBlock(\underline{Bob})}  address@hidden>}[dr]} & 
*+[F]{KBlock(``soda")} address@hidden>}[d]} & *+[F]{KBlock(``soda")} 
address@hidden>}[d]}  & *+[F]{KBlock(``cola")} address@hidden>}[dl]} \\
+  *+[F]{KBlock(``bob")} address@hidden>}[u]} & Document_1  & Document_2 & 
Document_3 \\
 } 
 \caption{
 ECRS allows the formation of complicated network structures.  In this
 example, the {\em SBlock} of pseudonym \underline{\it {Alice}}
 eventually allows to retrieve two of the documents encoded in the
-system, as does {\em Kblock} for keyword ``food.  Boxes
+system, as does {\em Kblock} for keyword ``food".  Boxes
 denote simple blocks that serve as entry-points.  The directory and
-the documents consist of a tree of possibly many CHK-encoded blocks.
-Searching for keyword ``soda'' would return two results pointing
+the documents consist of trees of possibly many CHK-encoded blocks.
+Searching for keyword ``soda" would return two results pointing
 to different resources.  Note that all the encoded resources,
 including the one document with no pointers to it, can be retrieved by
 knowing the CHK keys of their root {\em IBlock}s. }
-\label{fig:network}
+\label{fig:network} 
 \end{center}
 \end{figure*}
 
@@ -1132,7 +1132,7 @@
 queries.  Since the same content can be available under many keywords,
 this technique is not necessary successful.  However, this guessing
 attack does provide the opportunity for limited forms of censorship.
-An adversary could create a ``blacklist'' of keywords and attempt to
+An adversary could create a ``blacklist" of keywords and attempt to
 legally force operators to filter matching queries or replies.
 
 Instead of predicting keywords, the attacker can also try to obtain
@@ -1210,7 +1210,7 @@
 %   what I'm saying that something similar, if possible impossible, 
 %   would belong to the encoding domain. -jtl
 % : Ok, so maybe we should tackle this together with the point of
-%   many other systems using erasure codes to ``heal'' lost portions
+%   many other systems using erasure codes to ``heal" lost portions
 %   of files.  We say, replication is the solution, but obviously
 %   replication requires control over what gets replicated when;
 %   measuring availability is one thing that can help control
@@ -1241,7 +1241,7 @@
 problem is that the intuitive choice for a query hash, $H(H(k))$ does not
 give intermediaries a way to verify that the (encrypted) response is
 correct.  Instead of using $H(H(k))$, the initiator sends the
-so-called ``triple-hash'' query $H(H(H(k)))$.  A peer that has stored
+so-called {\em triple-hash} query $H(H(H(k)))$.  A peer that has stored
 $E_{H(k)}(R)$ under $H(H(k))$ can match the query hash with the response
 and send back the pair $\{H(H(k)), E_{H(k)}(R)\}$.  Intermediaries can
 verify that the proof of authenticity, $H(H(k))$, hashes to the query