This file contains our current working outline for the paper. --------------------- I. Introduction "Hi, we're Free Haven, and we are doing this because..." - Explicitly flag the moral issue, but acknowledge that there isn't time to deal with it here. Refer to thesis. II. Requirements for an Anonymous Storage System II.1 Actors for the storage system : - Reader - Author - Publisher II.2 Storage System Requirements - integrity - confidentiality (do we actually get this? I don't think so) - retreival on demand - etc. - storage and publication - different II.3 Anonymous Storage - Reader anonymity - Publisher anonymity - all the other kinds II.4 Modifiers for Anonymity -Computational vs. info-theoretic - Perfect Forward II.5 Knowing What's "Good Enough" and the Ideal Model - Describe the 'ideal model' of TTP and anonymous channels - Show how this allows us to avoid caring about stoopid users. III. Related Work III.1 Anonymous Publication / Storage /Availability Systems - Freenet - Gnutella III.2 Communications Channels IV. Free Haven Design IV.0 we're a design proposal, not an implementation report. IV.1 Design Principles and Values - anonymity first - robustness IV.2 Overview of Free Haven - servnet - communications channel - fully connected graph - trading - etc. IV.3 Trading IV.4 Accountability and Trust IV ... and so on V. Comparison of Free Haven and related work Clarify here that related work is only those publication systems which make claims about anonymity. So not intermemory, because they don't claim to be anonymous. V.1 Gnutella V.2 Publius V.3 Freenet V.4 What this comparison shows VI. Future Questions To Ask and Ways To Ask Them VI.1 Definition Questions VI.2 Practical Questions - this is where we seriously consider questions like "is anon storage equivalent to anon communications channel?" - don't ask the questions. Ask "how would we ask these questions in the right way?" - point to areas for future research, try to get people interested. VII. Conclusion - Outline a GOAL or CHALLENGE for anonymous storage services.