add presenter notes for "hard problems" section

1 files changed, 85 insertions, 0 deletions

diff --git a/overview/en.html b/overview/en.html
index cda9e27..3270855 100644
--- a/overview/en.html
+++ b/overview/en.html
@@ -66,6 +66,9 @@
             <h2>Authenticity problem</h2>
             <blockquote style="margin-bottom:2em;">Public key validation is very difficult for users to manage, but without it you cannot have confidentiality</blockquote>
             <li class="fragment"><span style="font-weight:bold;">Nicknym</span> - auto discovery and validation of public keys, transparently!</li>
+<aside class="notes" data-markdown>
+If proper key validation is a precondition for secure communication, but it is too difficult for most users, what hope do we have? We have developed a unique federated system called Nicknym that automatically discovers and validates public keys allowing the user to take advantage of public key cryptography without knowing anything about keys or signatures.
+</aside>
           </section>
           <section>
             <h2>Meta-data problem</h2>
@@ -82,6 +85,36 @@
                 <li><strong>Mixmaster</strong> with signatures</li>
 	      </ul>
             </div>
+<aside class="notes" data-markdown>
+- DNSSEC:
+
+	Short term.  
+	Opportunistic TLS for email and chat among servers/providers  
+	Effective external observers, no protection of user from provider  
+	By itself, potential weaknesses to advanced attacks ( timing, traffic analysis )  
+
+In the long term, we plan to adopt one of several different schemes for securely routing meta-data. These include:
+
+- Auto alias pairs
+
+	auto negotiate aliases  
+	Advantage: backwards compatible  
+	Disadvantage: server stores list of aliases  
+
+- Onion-routing-headers
+
+    A message from user A to user B is encoded so that the “to” routing information only contains the name of B’s server. When B’s server receives the message, it unwraps (unencrypts) a supplementary header that contains the actual user “B”. Like aliases, this provides no benefit if both users are on the same server. As an improvement, the message could be routed through intermediary servers.
+
+- Third party dropbox
+
+	To exchange messages, user A and user B negotiate a unique “dropbox” URL for depositing messages, potentially using a third party. To send a message, user A would post the message to the “dropbox”. To receive a message, user B would regularly polls this URL to see if there are new messages.
+
+- Mixmaster with signatures
+
+	Messages are bounced through a mixmaster-like set of anonymization relays and then finally delivered to the recipient’s server. The user’s client only displays the message if it is encrypted, has a valid signature, and the user has previously added the sender to a ‘allow list’ (perhaps automatically generated from the list of validated public keys).
+
+For a great discussion comparing mix networks and onion routing, see Tom Ritter’s blog post on the topic.
+</aside>
           </section>
           <section>
             <h2>Asynchronous problem</h2>
@@ -93,6 +126,20 @@
 	        <li>Long term: Collaborate with others to create new encryption protocol standards</li>
 	      </ul>
 	    </div>
+<aside class="notes" data-markdown>
+With the pace of growth in digital storage and decryption, forward secrecy is increasingly important. Otherwise, any encrypted communication you engage in today is likely to become cleartext communication in the near future.
+
+In the example of email and chat, we have OpenPGP with email and OTR with chat: the former provides asynchronous capabilities, and the latter forward secrecy, but neither one supports both abilities. We need both better security for email and the ability to send/receive offline chat messages.
+
+In the short term, we are layering forward secret transport for email and chat relay on top of traditional object encryption (OpenPGP). This approach is identical to our stop-gap approach for the meta-data problem, with the one addition that relaying servers need the ability to not simply negotiate TLS transport, but to also negotiate forward secret ciphers and to prevent a cipher downgrade.
+
+This approach is potentially effective against external network observers, but does not achieve forward secrecy from the service providers themselves.
+
+In the long term, we plan to work with other groups to create new encryption protocol standards that can be both asynchronous and forward secret. :
+
+    Forward Secrecy Extensions for OpenPGP
+    Triple elliptical curve Diffie-Hellman handshake
+</aside>
           </section>
           <section>
             <h2>Group problem</h2>
@@ -103,6 +150,23 @@
 	      <li class="fragment" data-fragment-index="3">Proxy re-encryption</li>
 	      <li class="fragment" data-fragment-index="3">Ring signatures</li>
 	    </ul>
+<aside class="notes" data-markdown>
+We have a lot of ideas, but we don’t have any solutions yet to fix this. Essentially, the question is how to use existing public key primitives to create strong cryptographic groups, where membership and permissions are based on keys and not arbitrary server-maintained access control lists.
+
+Most of the interesting work in this area has been done by companies working on secure file backup/sync/sharing, such as Wuala and Spideroak. Unfortunately, there are not yet any good open protocols or free software packages that can handle group cryptography.
+
+### There is some free software work on some of interesting building blocks that could be useful in building group cryptography. For example: ###
+
+- Proxy re-encryption:
+
+	See Wikipedia  
+	This allows the server to re-encrypt to new recipients without gaining access to the cleartext. The SELS mailing list manager (Secure Email List Services) uses OpenPGP to implement a clever scheme for proxy re-encryption.
+
+- Ring signatures:
+
+	See Wikipedia  
+	This allows any member of a group to sign, without anyone knowing which member.
+</aside>
           </section>
           <section>
             <h2>Resource problem</h2>
@@ -112,16 +176,37 @@
 	      <li class="fragment" data-fragment-index="2">"Read-write-web", meet ["Group problem" solution here]
 	      <li class="fragment" data-fragment-index="2">Again, possibilities from file sync (Lazy Revocation and Key Regression)
 	    </ul>
+<aside class="notes" data-markdown>
+For example, when using secure chat or secure federated social networking, you need some way to link to external media, such as an image, video or file, that has the same security guarantees as the message itself. Embedding this type of resource in the messages themselves is prohibitively inefficient.
+
+We don’t have a proposal for how to address this problem. There are a lot of great initiatives working under the banner of read-write-web, but these do not take encryption into account. In many ways, solutions to the resource problem are dependent on solutions to the the group problem.
+
+As with the group problem, most of the progress in this area has been by people working on encrypted file sync (e.g. strategies like Lazy Revocation and Key Regression).
+</aside>
           </section>
           <section>
             <h2>Availability problem</h2>
             <blockquote style="margin-bottom:2em;">People want to smoothly switch devices, and restore their data if they lose a device, but this very difficult to do securely</blockquote>
 	    <li class="fragment">Soledad - Synchronization of Locally Encrypted Documents Among Devices<br /><em class="fragment">phew! we weren't out of ideas!</em></li>
+<aside class="notes" data-markdown>
+Users today demand the ability to access their data on multiple devices and to have piece of mind that there data will not be lost forever if they lose a device. In the free software world, only Firefox has addressed this problem adequately and in a secure way (with Firefox Sync).
+
+At LEAP, we have worked to solve the availability problem with a system we call Soledad (for Synchronization of Locally Encrypted Documents Among Devices). Soledad gives the client application an encrypted, synchronized, searchable document database. All data is client encrypted, both when it is stored on the local device and synced with the cloud. As far as we know, there is nothing else like it, either in the free software or commercial world.
+</aside>
           </section>
           <section>
             <h2>Update problem</h2>
             <blockquote style="margin-bottom:2em;">Almost universally, software updates are done in ways that invite attacks and device compromises</blockquote>
 	    <li class="fragment">Thandy (thanks, Tor!)</li>
+<aside class="notes" data-markdown>
+The sad state of update security is especially troublesome because update attacks can now be purchased off the shelf by repressive regimes. The problem of software update is particular bad on desktop platforms. In the case of mobile and HTML5 apps, the vulnerabilities are not as dire, but the issues are also harder to fix.
+
+To address the update problem, LEAP is adopting a unique update system called Thandy from the Tor project. Thandy is complex to manage, but is very effective at preventing known update attacks.
+
+Thandy, and the related TUF, are designed to address the many security vulnerabilities in existing software update systems. In one example, other update systems suffer from an inability of the client to confirm that they have the most up-to-date copy, thus opening a huge vulnerability where the attacker simply waits for a security upgrade, prevents the upgrade, and launches an attack exploiting the vulnerability that should have just been fixed. Thandy/TUF provides a unique mechanism for distributing and verifying updates so that no client device will install the wrong update or miss an update without knowing it.
+
+Related to the update problem is the backdoor problem: how do you know that an update does not have a backdoor added by the software developers themselves? Probably the best approach is that taken by Gitian, which provides a “deterministic build process to allow multiple builders to create identical binaries”. We hope to adopt Gitian in the future.
+</aside>
           </section>
         </section>