Publius: A robust, tamper-evident, censorship-resistant web publishing system

Proceedings of the 9th USENIX Security Symposium

Volumn , Issue , 2000, Pages

  Waldman, Marc ^a   Rubin, Aviel D ^b   Cranor, Lorrie Faith ^b  

^a POLYTECHNIC UNIVERSITY   (United States)

^b AT AND T LABS RESEARCH   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

CENSORSHIP RESISTANTS; CLIENT SIDES; TAMPER-EVIDENT; WEBPUBLISHING;

EID: 85084163931     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (22)

1. A. V. Aho, J. E. Hopcroft, and J. D. Ullman. Data Structures And Algorithms. Addison-Wesley Publishing Company, 1983.
2. R. J. Anderson. The eternity service. In Pragocrypt 1996, 1996. http://www.cl.cam.ac.uk/users/rja14/eternity/eternity.html.
3. A. Back. The eternity service. Phrack Magazine, 7(51), 1997. http://www.cypherspace.org/adam/eternity/phrack.html.
4. T. Benes. The eternity service. 1998. http://www.kolej.mff.cuni.cz/eternity/.
5. D. Chaum. Untraceable electronic mail, return addresses, and digital pseudonyms. Communications of the ACM, 24(2):84-88, 1981.
6. Y. Chen, J. Edler, A. Goldberg, A. Gottlieb, S. Sobti, and P. N. Yianilos. A prototype implementation of archival intermemory. In Proc. ACM Digital Libraries. ACM, August 1999. http://www.intermemory.org/.
7. I. Clark. A distributed decentralised information storage and retrieval system. 1999. http://freenet.sourceforge.net/Freenet.ps.
8. C. Dwork and M. Naor. Pricing via processing or combatting junk mail. In Advances in Cryptology - CRYPTO '92, pages 139-147. Springer-Verlag, 1992.
9. E.G. Gabber, P.B. Gibbons, D.M. Kristol, Y. Matias, and A. Mayer. Consistent, yet anonymous web access with LPWA. Communications of the ACM, 42(2):42-47, 1999.
10. P. Gemmell and M. Sudan. Highly resilient correctors for polynomials. Information Processing Letters, 43:169-174, 1992.
11. A. V. Goldberg and P. N. Yianilos. Towards and archival intermemory. In Proc. IEEE International Forum on Research and Technology Advances in Digital Libraries (ADL'98), pages 147-156. IEEE Computer Society, April 1998. http://www.intermemory.org/.
12. I. Goldberg and D. Wagner. TAZ servers and the rewebber network: Enabling anonymous publishing on the world wide web. First Monday, 3, 1998. http://www.firstmonday.dk/issues/issue3-4/goldberg/index.html.
13. Wendy M. Grossman. Wired, 3(12):172-177 and 248-252, December 1995. http://www.wired.com/wired/archive/3.12/alt.scientology.war-pr.html.
14. H. Krawczyk. Secret sharing made short. In Advances in Cryptology - CRYPTO '93, pages 136-143. Springer-Verlag, 1993.
15. R. Motwani and P. Raghavan. Randomized Algorithms. Cambridge University Press, 1995.
16. Ron Newman. The church of scientology vs. the net. February 1998. http://www2.thecia.net/users/rnewman/scientology/home.html.
17. U.S. Library of Congress. About the federalist papers. http://lcweb2.loc.gov/const/fed/abt-fedpapers.html.
18. M. G. Reed, P. F. Syverson, and D. M. Goldschlag. Proxies for anonymous routing. In 12th Annual Computer Security Applications Conference, 1996. http://www.onion-router.net/Publications.html.
19. Michael K. Reiter and Aviel D. Rubin. Crowds: Anonymity for web transactions. ACM Transactions on Information System Security, 1(1), April 1998.
20. R. Rivest. The MD5 message digest algorithm. RFC 1321, April 1992.
21. B. Schneier. Applied Cryptography. John Wiley and Sons, 1996.
22. A. Shamir. How to share a secret. Communications of the ACM, 22:612-613, November 1979.