메뉴 건너뛰기




Volumn , Issue , 2012, Pages 693-701

LT codes-based secure and reliable cloud storage service

Author keywords

[No Author keywords available]

Indexed keywords

COMMUNICATION COST; COMPUTATIONAL COSTS; DATA INTEGRITY; DATA OUTSOURCING; DATA REPAIRS; DATA RETRIEVAL; DATA SERVICES; DATA STORAGE; DATA USERS; DISTRIBUTED STORAGE SYSTEM; ERASURE CODES; ON THE FLIES; PERFORMANCE ANALYSIS; REPAIR SOLUTION; STORAGE COSTS; STORAGE SERVICES; STORAGE SOLUTIONS; THIRD PARTIES;

EID: 84861630520     PISSN: 0743166X     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/INFCOM.2012.6195814     Document Type: Conference Paper
Times cited : (114)

References (29)
  • 1
    • 80051911576 scopus 로고    scopus 로고
    • Cryptographic cloud storage
    • S. Kamara and K. Lauter, "Cryptographic cloud storage," in RLCPS, 2010.
    • (2010) RLCPS
    • Kamara, S.1    Lauter, K.2
  • 3
    • 84861635618 scopus 로고    scopus 로고
    • http://www.dropbox.com/.
  • 6
    • 79958862079 scopus 로고    scopus 로고
    • Robustore: A distributed storage architecture with robust and high performance
    • H. Xia and A. A. Chien, "Robustore: a distributed storage architecture with robust and high performance," in Proc. of Supercomputing, 2007.
    • Proc. of Supercomputing, 2007
    • Xia, H.1    Chien, A.A.2
  • 7
    • 18344385312 scopus 로고    scopus 로고
    • Erasure coding vs. replication: A quantitative comparison
    • H. Weatherspoon and J. D. Kubiatowicz, "Erasure coding vs. replication: A quantitative comparison," in IPTPS, 2002.
    • (2002) IPTPS
    • Weatherspoon, H.1    Kubiatowicz, J.D.2
  • 8
    • 0034440650 scopus 로고    scopus 로고
    • OceanStore: An architecture for global-scale persistent storage
    • New York, NY, USA: ACM
    • J. Kubiatowicz, D. Bindel, Y. Chen, and et al, "OceanStore: an architecture for global-scale persistent storage," in ASPLOS. New York, NY, USA: ACM, 2000.
    • (2000) ASPLOS
    • Kubiatowicz, J.1    Bindel, D.2    Chen, Y.3
  • 11
    • 0001174154 scopus 로고
    • Polynomial codes over certain finite fields
    • I. Reed and G. Solomon, "Polynomial codes over certain finite fields,"Journal of the SIAM, 1960.
    • (1960) Journal of the SIAM
    • Reed, I.1    Solomon, G.2
  • 13
    • 79951954266 scopus 로고    scopus 로고
    • A construction of systematic mds codes with minimum repair bandwidth
    • Y. Wu, "A construction of systematic mds codes with minimum repair bandwidth," in IEEE Trans. Inf. Theory, 2009.
    • (2009) IEEE Trans. Inf. Theory
    • Wu, Y.1
  • 20
    • 77953310709 scopus 로고    scopus 로고
    • Achieving secure, scalable, and fine-grained data access control in cloud computing
    • S. Yu, C. Wang, K. Ren, and W. Lou, "Achieving secure, scalable, and fine-grained data access control in cloud computing," in Proc. of INFOCOM, 2010.
    • Proc. of INFOCOM, 2010
    • Yu, S.1    Wang, C.2    Ren, K.3    Lou, W.4
  • 22
    • 0037703307 scopus 로고    scopus 로고
    • Polynomial time algorithms for network information flow
    • P. Sanders, S. Egner, and L. Tolhuizen, "Polynomial time algorithms for network information flow," in Proc. of SPAA, 2003, pp. 286-294.
    • Proc. of SPAA, 2003 , pp. 286-294
    • Sanders, P.1    Egner, S.2    Tolhuizen, L.3
  • 23
    • 84861602283 scopus 로고    scopus 로고
    • Tree-structured data regeneration in distributed storage systems with regenerating codes
    • J. Li, S. Yang, X. Wang, X. Xue, and B. Li, "Tree-structured data regeneration in distributed storage systems with regenerating codes," in Proc. of IWQoS, July 2009.
    • Proc. of IWQoS, July 2009
    • Li, J.1    Yang, S.2    Wang, X.3    Xue, X.4    Li, B.5
  • 24
    • 70350241664 scopus 로고    scopus 로고
    • A practical study of regenerating codes for peer-to-peer backup systems
    • A. Duminuco and E. Biersack, "A practical study of regenerating codes for peer-to-peer backup systems," in Proc. of ICDCS, June 2009.
    • Proc. of ICDCS, June 2009
    • Duminuco, A.1    Biersack, E.2
  • 25
    • 74049103479 scopus 로고    scopus 로고
    • Pors: Proofs of retrievability for large files
    • New York, NY, USA: ACM
    • A. Juels and B. S. Kaliski, Jr., "Pors: proofs of retrievability for large files," in Pro. of CCS. New York, NY, USA: ACM, 2007, pp. 584-597.
    • (2007) Pro. of CCS , pp. 584-597
    • Juels, A.1    Kaliski Jr., B.S.2
  • 27
    • 74049144464 scopus 로고    scopus 로고
    • Hail: A high-availability and integrity layer for cloud storage
    • K. D. Bowers, A. Juels, and A. Oprea, "Hail: a high-availability and integrity layer for cloud storage," in Proc. of CCS, 2009.
    • Proc. of CCS, 2009
    • Bowers, K.D.1    Juels, A.2    Oprea, A.3


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.