JigDFS: A secure distributed file system
Authors:
- 1 March 2009
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 76-82
Abstract
Ubiquitous connectivity and availability of P2P resources creates opportunities for building new services. This paper describes Jigsaw Distributed File System (JigDFS) which can be used to securely store and retrieve files on a P2P network anonymously. JigDFS is designed to provide strong encryption and a certain level of plausible deniability. Files in JigDFS are sliced into small segments using an information dispersal algorithm (IDA) and distributed onto different nodes recursively to increase fault tolerance against node failures. Moreover, layered encryption is applied to each file with keys produced by a hashed-key chain algorithm, so that data (file segments) and keys reside on different hosts. In such a scheme, if an attacker compromises a host and retrieves the data, the attacker will still need the correct key to decipher the data. Furthermore, recursive IDA and layered encryption ensure users' anonymity. It is difficult for an adversary to identify who owns a file, even who has retrieved a file in JigDFS. Often, a strong adversary may have the power to monitor the network or even force a user to give up the password. Design of JigDFS provides users with plausible deniability which enhances privacy. When being questioned, a JigDFS user can simply argue that he/she is merely a relaying node, rather than the file owner. Moreover, a user, when forced, can give up a valid, however, incorrect encryption key. There is no way for an adversary to verify either correctness of a key or the identity of file owner. JigDFS is developed using platform independent Java technologies and is envisioned to utilize mobile computing elements such as PDAs and smart phones.Keywords
This publication has 20 references indexed in Scilit:
- Off-the-record communication, or, why not to use PGP2004
- Steganographic schemes for file system and B-treeIEEE Transactions on Knowledge and Data Engineering, 2004
- LT codes2003
- SKEME: a versatile secure key exchange mechanism for Internet2002
- Efficient erasure correcting codesIEEE Transactions on Information Theory, 2001
- A mathematical theory of communicationACM SIGMOBILE Mobile Computing and Communications Review, 2001
- Deniable Encryption1997
- CMU's Andrew projectCommunications of the ACM, 1996
- Efficient dispersal of information for security, load balancing, and fault toleranceJournal of the ACM, 1989
- Polynomial Codes Over Certain Finite FieldsJournal of the Society for Industrial and Applied Mathematics, 1960