|
[1] Google. A webmail system. http://mail.google.com.
[2] Sanjay Ghemawat, Howard Gobioff, and Shun-Tak Leung. The google
file system. In Proceedings of the 19th ACM Symposium on Operating
Systems Principles - SOSP 2003, pages 29–43. ACM, 2003.
[3] David R. Brownbridge, Lindsay F. Marshall, and Brian Randell. The
newcastle connection or unixes of the world unite! Software Practice
and Experience, 12(12):1147–1162, 1982.
[4] Russel Sandberg, David Goldberg, Steve Kleiman, Dan Walsh, and Bob
Lyon. Design and implementation of the sun network filesystem, 1985.
[5] Frank Gens. IT Cloud Services User Survey, pt.2: Top Benefits and
Challenges. http://blogs.idc.com/ie/?p=210, October 2008.
[6] Matt Blaze. A cryptographic file system for unix. In Proceedings of the
ACM Conference on Computer and Communications Security - CCS
1993, pages 9–16. ACM, 1993.
[7] Andrew D. McDonald and Markus G. Kuhn. Stegfs: A steganographic
file system for linux. In Proceedings of the 3rd International Workshop
on on Information Hiding - IH 1999, volume 1768 of Lecture Notes in
Computer Science, pages 462–477. Springer, 1999.
[8] Giuseppe Cattaneo, Luigi Catuogno, Aniello Del Sorbo, and Pino Persiano.
The design and implementation of a transparent cryptographic
file system for unix. In Proceedings of the FREENIX Track: 2001
USENIX Annual Technical Conference, pages 199–212. USENIX Association,
2001.
[9] Charles P. Wright, Michael C. Martino, and Erez Zadok. Ncryptfs: A
secure and convenient cryptographic file system. In Proceedings of the
General Track: 2003 USENIX Annual Technical Conference, pages 197–
210. USENIX, 2003.
[10] Atul Adya, William J. Bolosky, Miguel Castro, Gerald Cermak, Ronnie
Chaiken, John R. Douceur, Jon Howell, Jacob R. Lorch, Marvin
Theimer, and Roger Wattenhofer. Farsite: Federated, available, and
reliable storage for an incompletely trusted environment. In Proceedings
of the 5th Symposium on Operating Systems Design and Implementation
- OSDI 2002, pages 1–14, 2002.
[11] John H. Howard, Michael L. Kazar, Sherri G. Menees, David A. Nichols,
Mahadev Satyanarayanan, Robert N. Sidebotham, and Michael J. West.
Scale and performance in a distributed file system. ACM Transactions
on Computer Systems, 6(1):51–81, 1988.
[12] Mahadev Satyanarayanan, James J. Kistler, Puneet Kumar, Maria E.
Okasaki, Ellen H. Siegel, and David C. Steere. Coda: A highly available
file system for a distributed workstation environment. IEEE Transac-
tions on Computers, 39(4):447–459, 1990.
[13] David Mazi`eres, Michael Kaminsky, M. Frans Kaashoek, and Emmett
Witchel. Separating key management from file system security. In
Proceedings of the ACM Symposium on Operating Systems Principles
- SOSP 1999, pages 124–139. ACM, 1999.
[14] Mahesh Kallahalla, Erok Riedel, Ram Swaminathan, Qian Wang, and
Kevin Fu. Plutus: Scalable secure file sharing on untrusted storage.
In Proceeding of the 2nd Conference on File and Storage Technologies -
FAST 2003. USENIX, 2003.
[15] Joseph A. Cooley, Jeremy L. Mineweaser, Leslie D. Servi, and Eushiuan
T. Tsung. Software-based erasure codes for scalable distributed
storage. In IEEE Symposium on Mass Storage Systems, pages 157–164,
2003.
[16] Noga Alon, Haim Kaplan, Michael Krivelevich, Dahlia Malkhi, and
Julien P. Stern. Scalable secure storage when half the system is faulty.
Information and Computation., 174(2):203–213, 2002.
[17] Mario Blaum, Jim Brady, Jehoshua Bruck, and Jai Menon. Evenodd:
An efficient scheme for tolerating double disk failures in raid architectures.
IEEE Transactions on Computers, 44(2):192–202, 1995.
[18] Chih-Shing Tau and Tzone-I Wang. An alternative decoding algorithm
for evenodd code in raid architectures. In Proceedings of the 21st In-
ternational Multi-Conference on Applied Informatics - AI 2003, pages
887–892. IASTED/ACTA Press, 2003.
[19] Cheng Huang and Lihao Xu. Star : An efficient coding scheme for correcting
triple storage node failures. IEEE Transactions on Computers,
57:889–901, 2007.
[20] Michael G. Luby, Michael Mitzenmacher, M. Amin Shokrollahi,
Daniel A. Spielman, and Volker Stemann. Practical loss-resilient codes.
In Proceedings of the twenty-ninth annual ACM symposium on Theory
of computing - STOC 1997, pages 150–159. ACM, 1997.
[21] Michael Luby. Tornado codes: Practical erasure codes based on random
irregular graphs. In Proceedings of Randomization and Approxima-
tion Techniques in Computer Science, Second International Workshop
- RANDOM 1998, volume 1518 of Lecture Notes in Computer Science,
page 171. Springer, 1998.
[22] MatthewWoitaszek and Henry M. Tufo. Tornado codes for maid archival
storage. Mass Storage Systems and Technologies, IEEE / NASA God-
dard Conference on, 0:221–226, 2007.
[23] James S. Plank and Michael G. Thomason. A practical analysis of lowdensity
parity-check erasure codes for wide-area storage applications.
pages 115–124, 2004.
[24] Peter Druschel and Antony I. T. Rowstron. PAST: A large-scale, persistent
peer-to-peer storage utility. In Proceedings of the 8th Workshop
on Hot Topics in Operating Systems - HotOS-VIII 2001, pages 75–80.
IEEE Computer Society, 2001.
[25] Andreas Haeberlen, Alan Mislove, and Peter Druschel. Glacier: Highly
durable, decentralized storage despite massive correlated failures. In
Proceedings on the 2nd Symposium on Networked Systems Design and
Implementation - NSDI 2005. USENIX, 2005.
[26] Byung-Gon Chun, Frank Dabek, Andreas Haeberlen, Emil Sit, Hakim
Weatherspoon, M. Frans Kaashoek, John Kubiatowicz, and Robert Morris.
Efficient replica maintenance for distributed storage systems. In
Proceedings on the 3rd Symposium on Networked Systems Design and
Implementation - NSDI 2006. USENIX, 2006.
[27] Patrick R. Eaton, Hakim Weatherspoon, and John Kubiatowicz. Efficiently
binding data to owners in distributed content-addressable storage
systems. In Proceedings of the 3rd International IEEE Security in
Storage Workshop - SISW 2005, pages 40–51. IEEE Computer Society,
2005.
[28] Jeremy Stribling, Jinyang Li, Isaac G. Councill, M. Frans Kaashoek,
and Robert Morris. Overcite: A distributed, cooperative citeseer. In
Proceedings on the 3rd Symposium on Networked Systems Design and
Implementation - NSDI 2006. USENIX, 2006.
[29] Emil Sit, Robert Morris, and M. Frans Kaashoek. Usenetdht: A lowoverhead
design for usenet. pages 133–146, 2008.
[30] Emil Sit Andreas, Andreas Haeberlen, Frank Dabek, Byung gon Chun,
Hakim Weatherspoon, Robert Morris, M. Frans Kaashoek, and John
Kubiatowicz. Proactive replication for data durability. In Proceedings
of the 5th International Workshop on Peer-to-Peer Systems - IPTPS
2006, 2006.
[31] Alessandro Duminuco, Ernst Biersack, and Taoufik En-Najjary. Proactive
replication in distributed storage systems using machine availability
estimation. In Proceedings of the ACM Conference on Emerging Network
Experiment and Technology - CoNEXT 2007, page 27. ACM, 2007.
[32] Szymon Acedanski, Supratim Deb, Muriel Medard, and Ralf Koetter.
How good is random linear coding based distributed network storage.
In Proceeding of IEEE International Symposium on Network Coding -
NetCod 2005, 2005.
[33] Alexandros G. Dimakis, Vinod Prabhakaran, and Kannan Ramchandran.
Ubiquitous access to distributed data in large-scale sensor networks
through decentralized erasure codes. In Proceedings of the Fourth
International Symposium on Information Processing in Sensor Networks
- IPSN 2005, pages 111–117. IEEE Computer Society, 2005.
[34] Alexandros G. Dimakis, Vinod Prabhakaran, and Kannan Ramchandran.
Decentralized erasure codes for distributed networked storage.
IEEE/ACM Transactions on Networking, 14:2809–2816, 2006.
[35] Salah A. Aly, Zhenning Kong, and Emina Soljanin. Fountain codes
based distributed storage algorithms for large-scale wireless sensor net-
works. In Proceedings of the 7th International Conference on Informa-
tion Processing in Sensor Networks - IPSN 2008, pages 171–182. IEEE
Computer Society, 2008.
[36] Zooko Wilcox-O’Hearn and Brian Warner. Tahoe: the least-authority
filesystem. In Proceedings of the 4th ACM international workshop on
Storage security and survivability - StorageSS 2008, pages 21–26. ACM,
2008.
[37] Salah A. Aly, Zhenning Kong, and Emina Soljanin. Raptor codes based
distributed storage algorithms for wireless sensor networks. CoRR,
abs/0903.0445, 2009.
[38] Zhenning Kong, Salah A. Aly, and Emina Soljanin. Decentralized coding
algorithms for distributed storage in wireless sensor networks. IEEE
Journal on Selected Areas in Communications, 28(2):261–267, 2010.
[39] Amin Shokrollahi. Raptor codes. IEEE/ACM Transactions on Network-
ing, 14(SI):2551–2567, 2006.
[40] Dejan Vukobratovic, ˇ Cedomir Stefanovic, Miloˇs Stojakovic, and
Vladimir Stankovic. Raptor packets: a packet-centric approach to distributed
raptor code design. In Proceedings of the 2009 IEEE inter-
national conference on Symposium on Information Theory - ISIT’09,
pages 2336–2340. IEEE Press, 2009.
[41] John Kubiatowicz, David Bindel, Yan Chen, Patrick Eaton, Dennis
Geels, Ramakrishna Gummadi, Sean Rhea, Hakim Weatherspoon,
Westly Weimer, Christopher Wells, and Ben Zhao. Oceanstore: An architecture
for global-scale persistent storage. In Proceedings of the 9th in-
ternational Conference on Architectural Support for Programming Lan-
guages and Operating Systems - ASPLOS 2000, pages 190–201. ACM,
2000.
[42] Ranjita Bhagwan Kiran, Kiran Tati, Yu chung Cheng, Stefan Savage,
and Geoffrey M. Voelker. Total recall: System support for automated
availability management. In Proceedings on the 31st Symposium on Net-
worked Systems Design and Implementation - NSDI 2003, pages 337–
350, 2004.
[43] Charles Blake and Rodrigo Rodrigues. High availability, scalable storage,
dynamic peer networks: Pick two. In HotOS, pages 1–6. USENIX,
2003.
[44] Rodrigo Rodrigues and Barbara Liskov. High availability in dhts: Erasure
coding vs. replication. In Proceedings on the 4th International
Workshop on Peer-to-Peer Systems IV - IPTPS 2005, volume 3640 of
Lecture Notes in Computer Science, pages 226–239. Springer, 2005.
[45] Chris Williams, Philippe Huibonhoa, JoAnne Holliday, Andy Hospodor,
and Thomas Schwarz. Redundancy management for p2p storage. In Pro-
ceedings on the IEEE International Symposium on Cluster Computing
and the Grid, pages 15–22. IEEE Computer Society, 2007.
[46] Ranjita Bhagwan, Stefan Savage, and Geoffrey M. Voelker. Understanding
availability. In Proceedings of the 2nd International Workshop on
Peer-to-Peer Systems, volume 2735 of Lecture Notes in Computer Sci-
ence, pages 256–267. Springer Berlin / Heidelberg, 2003.
[47] Server Protectors LLC. Secure cloud storage.
http://serverprotectors.com/solutions/secs.
[48] Paulo S. L. M. Barreto, Ben Lynn, and Michael Scott. Efficient implementation
of pairing-based cryptosystems. Journal of Cryptology,
17(4):321–334, 2004.
[49] Victor S. Miller. The weil pairing, and its efficient calculation. Journal
of Cryptology, 17(4):235–261, 2004.
[50] Rajeev Motwani and Prabhakar Raghavan. Cambridge University Press,
1995.
[51] Piotr Szczechowiak, Anton Kargl, Michael Scott, and Martin Collier.
On the application of pairing based cryptography to wireless sensor networks.
In Proceedings of the Second ACM Conference on Wireless Net-
work Security - WISEC 2009, pages 1–12. ACM, 2009.
[52] Craig Gentry. Fully homomorphic encryption using ideal lattices. In
Proceedings of the 41st annual ACM symposium on Theory of computing
- STOC 2009, pages 169–178, 2009.
[53] Marten van Dijk, Craig Gentry, Shai Halevi, and Vinod Vaikuntanathan.
Fully homomorphic encryption over the integers. Cryptology ePrint
Archive, Report 2009/616, 2009.
[54] Brett Hemenway and Rafail Ostrovsky. Public-key locally-decodable
codes. In Proceedings of the 28th Annual International Cryptology Con-
ference on Advances in Cryptology - CRYPTO 2008, volume 5157 of
Lecture Notes in Computer Science, pages 126–143. Springer, 2008.
[55] Craig Gentry. Fully homomorphic encryption using ideal lattices. In
Proceedings of the 41st annual ACM symposium on Theory of computing
- STOC 2009, pages 169–178. ACM, 2009.
[56] N.P. Smart and F. Vercauteren. Fully homomorphic encryption with
relatively small key and ciphertext sizes. Cryptology ePrint Archive,
Report 2009/571, 2009.
[57] Ari Juels and Burton S. Kaliski Jr. Pors: Proofs of retrievability for
large files. pages 584–597, 2007.
[58] Giuseppe Ateniese, Randal Burns, Reza Curtmola, Joseph Herring, Lea
Kissner, Zachary Peterson, and Dawn Song. Provable data possession
at untrusted stores. In Proceedings of the 14th ACM Conference on
Computer and communications security - CCS 2007, pages 598–609.
ACM, 2007.
[59] Giuseppe Ateniese, Roberto Di Pietro, Luigi V. Mancini, and Gene
Tsudik. Scalable and efficient provable data possession. In Proceedings
of the 4th International Conference on Security and privacy in commu-
nication netowrks - SecureComm 2008, pages 1–10. ACM, 2008.
[60] Reza Curtmola, Osama Khan, and Randal Burns. Robust remote data
checking. In Proceedings of the 4th International Workshop on Storage
Security and Survivability - StorageSS 2008, 2008.
[61] Michael T. Goodrich, Charalampos Papamanthou, Roberto Tamassia,
and Nikos Triandopoulos. Athos: Efficient authentication of outsourced
file systems. In Proceedings on the 11th International Conference on
Information Security - ISC 2008, volume 5222 of Lecture Notes in Com-
puter Science, pages 80–96. Springer, 2008.
[62] C. Christopher Erway, Alptekin Kup??u, Charalampos Papamanthou,
and Roberto Tamassia. Dynamic provable data possession. In ACM
Conference on Computer and Communications Security, pages 213–222.
ACM, 2009.
[63] Qian Wang, Cong Wang, Jin Li, Kui Ren, and Wenjing Lou. Enabling
public verifiability and data dynamics for storage security in cloud computing.
In Proceedings of the 14th European Symposium on Research in
Computer Security - ESORICS 2009, volume 5789 of Lecture Notes in
Computer Science, pages 355–370. Springer, 2009.
[64] Reza Curtmola, Osama Khan, Randal Burns, and Giuseppe Ateniese.
Mr-pdp: Multiple-replica provable data possession. In Proceedings of
International Conference on Distributed Computing Systems, pages 411–
420. IEEE Computer Society, 2008.
[65] Hovav Shacham and Brent Waters. Compact proofs of retrievability.
In Proceedings of the 14th International Conference on the Theory
and Application of Cryptology and Information Security - ASIACRYPT
2008, volume 5350 of Lecture Notes in Computer Science, pages 90–107.
Springer, 2008.
[66] Yevgeniy Dodis, Salil P. Vadhan, and Daniel Wichs. Proofs of retrievability
via hardness amplification. In Proceeding of the 6th Theory
of Cryptography Conference on Theory of Cryptography - TCC 2009,
volume 5444 of Lecture Notes in Computer Science, pages 109–127.
Springer, 2009.
[67] Giuseppe Ateniese, Seny Kamara, and Jonathan Katz. Proofs of storage
from homomorphic identification protocols. In Proceedings of the 15th
International Conference on the Theory and Application of Cryptology
and Information Security- ASIACRYPT 2009,, volume 5912 of Lecture
Notes in Computer Science, pages 319–333. Springer, 2009.
[68] CongWang, QianWang, Kui Ren, andWenjing Lou. Privacy-preserving
public auditing for data storage security in cloud computing. In Pro-
ceedings of the 28th IEEE International Conference on Computer Com-
munications - INFOCOM 2009. IEEE, 2010.
[69] Kevin D. Bowers, Ari Juels, and Alina Oprea. Hail: a high-availability
and integrity layer for cloud storage. In Proceedings of the 2009 ACM
Conference on Computer and Communications Security - CCS 2009,
pages 187–198. ACM, 2009.
|