Tahoe - The least-authority filesystem

Proceedings of the ACM Conference on Computer and Communications Security

Volumn , Issue , 2008, Pages 21-26

  Wilcox O'Hearn, Zooko ^a   Warner, Brian ^a  

^a NONE   (United States)

Author keywords

Capabilities; Fault tolerance; Open source; Peer to peer

Indexed keywords

BACKUP SERVICE; CAPABILITIES; DESCRIPTORS; DISTRIBUTED STORAGE; ERASURE CODING; ERROR CONTROL CODE; FILESYSTEM; INFORMATION STORAGE AND RETRIEVAL; OPEN SOURCE; OPEN SOURCES; PEER-TO-PEER; PUBLIC KEY CRYPTOSYSTEMS; SECURITY AND PROTECTION;

DISTRIBUTED COMPUTER SYSTEMS; FAULT TOLERANCE; INFORMATION THEORY; PUBLIC KEY CRYPTOGRAPHY; QUALITY ASSURANCE; SECURITY SYSTEMS;

ACCESS CONTROL;

EID: 67650346359     PISSN: 15437221     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1456469.1456474     Document Type: Conference Paper

References (30)

1. allmydata.org web site, 2007.
2. R. Anderson. 'trusted computing' frequently asked questions, 2003. [Online; accessed 26-May-2008].
3. J. Black, P. Rogaway, and T. Shrimpton. Encryption-scheme security in the presence of key-dependent messages. In In Selected Areas in Cryptography, volume 2595 of LNCS, pages 62{75. Springer-Verlag, 2002.
4. D. R. L. Brown. One-up problem for (ec)dsa. Cryptology ePrint Archive, Report 2008/286, 2008.
5. J. W. Byers, M. Luby, M. Mitzenmacher, and A. Rege. A digital fountain approach to reliable distribution of bulk data. In SIGCOMM, pages 56{67, 1998.
6. J. B. Dennis and E. C. V. Horn. Programming semantics for multiprogrammed computations. Commun. ACM, 26(1):29{35, 1983.
7. J. R. Douceur, A. Adya, W. J. Bolosky, D. Simon, and M. Theimer. Reclaiming space from duplicate files in a serverless distributed file system. In ICDCS '02: Proceedings of the 22 nd International Conference on Distributed Computing Systems (ICDCS'02), page 617, Washington, DC, USA, 2002. IEEE Computer Society.
8. N. Ferguson and B. Schneier. Practical Cryptography. Wiley Publishing, Inc., 2003.
9. G. R. Goodson, J. J. Wylie, G. R. Ganger, and M. K. Reiter. Efficient byzantine-tolerant erasure-coded storage. pages 135{144, 2004.
10. C. Grothoff. Crisp advisory 2008-01: Uris do not refer to unique files in allmydata tahoe, July 2008.
11. I. Haitner and T. Holenstein. On the (im)possibility of key dependent encryption. Cryptology ePrint Archive, Report 2008/164, 2008.
12. S. Halevi and H. Krawczyk. Security under key-dependent inputs, 2007.
13. N. Hardy. Keykos architecture. SIGOPS Oper. Syst. Rev., 19(4):8{25, 1985.
14. A. Juels and J. Burton S. Kaliski. Pors: proofs of retrievability for large files. In CCS '07: Proceedings of the 14th ACM conference on Computer and communications security, pages 584{597, New York, NY, USA, 2007. ACM.
15. J. Kelsey, B. Schneier, and D. Wagner. Protocol interactions and the chosen protocol attack. In In Proc. 1997 Security Protocols Workshop, pages 91{104. Springer-Verlag, 1997.
16. A. Lenstra. Handbook of Information Security, chapter Key Lengths. Wiley, 2004.
17. J. Li and D. Mazifieres. Beyond one-third faulty replicas in byzantine fault tolerant systems. In NSDI. USENIX, 2007.
18. H. Lipmaa, P. Rogaway, and D. Wagner. Comments to NIST concerning AES-modes of operations: CTR-mode encryption. In Symmetric Key Block Cipher Modes of Operation Workshop, Baltimore, Maryland, USA, 2000.
19. A. J. Menezes, S. A. Vanstone, and P. C. V. Oorschot. Handbook of Applied Cryptography. CRC Press, Inc., Boca Raton, FL, USA, 1996.
20. R. C. Merkle. A digital signature based on a conventional encryption function. In CRYPTO '87: A Conference on the Theory and Applications of Cryptographic Techniques on Advances in Cryptology, pages 369{378, London, UK, 1988. Springer-Verlag.
21. M. S. Miller. Robust Composition: Towards a Unified Approach to Access Control and Concurrency Control. PhD thesis, Johns Hopkins University, Baltimore, Maryland, USA, May 2006.
22. M. S. Miller, K. P. Yee, and J. Shapiro. Capability myths demolished. Technical report, Combex, Inc., 2003.
23. R. Needham. Prudent engineering practice for cryptographic protocols. IEEE Transactions on Software Engineering, 22:122{136, 1996.
24. NIST. The digital signature standard. Commun. ACM, 35(7):36{40, 1992.
25. J. S. Plank, L. Xu, J. Luo, C. D. Schuman, and Z. Wilcox-O'Hearn. A performance evaluation and examination of open-source erasure coding libraries for storage. 2009.
26. B. Preneel and P. C. V. Oorschot. Mdx-mac and building fast macs from hash functions. pages 1{14. Springer-Verlag, 1995.
27. R. L. Rivest, A. Shamir, and L. M. Adelman. A method for obtaining digital signatures and public-key cryptosystems. Technical Report MIT/LCS/TM-82, MIT, 1977.
28. L. Rizzo. the feasibility of software fec. Technical Report LR-970131, DEIT, 1997.
29. Wikipedia. Hushmail | Wikipedia, the free encyclopedia, 2008. [Online; accessed 26-May-2008].
30. Z. Wilcox-O'Hearn. convergent encryption reconsidered, 2008. [Online; accessed 18-Aug-2008].