메뉴 건너뛰기




Volumn , Issue , 2015, Pages 111-124

CDStore: Toward reliable, secure, and cost-efficient cloud storage via convergent dispersal

Author keywords

[No Author keywords available]

Indexed keywords

DIGITAL STORAGE;

EID: 85077119766     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper
Times cited : (75)

References (62)
  • 1
    • 84933042449 scopus 로고    scopus 로고
    • Amazon EC2. http://aws.amazon.com/ec2/2014.
    • (2014) Amazon EC2
  • 2
    • 84954584357 scopus 로고    scopus 로고
    • Amazon S3. http://aws.amazon.com/s3/2014.
    • (2014) Amazon S3
  • 4
    • 85021347511 scopus 로고    scopus 로고
    • OpenSSL Project. http://www.openssl.org, 2014.
    • (2014) OpenSSL Project
  • 18
    • 0014814325 scopus 로고
    • Space/time trade-offs in hash coding with allowable errors
    • July
    • B. H. Bloom. Space/time trade-offs in hash coding with allowable errors. Communications of the ACM, 13 (7):422-426, July 1970.
    • (1970) Communications of the ACM , vol.13 , Issue.7 , pp. 422-426
    • Bloom, B.H.1
  • 28
    • 78650053109 scopus 로고    scopus 로고
    • Side channels in cloud services: Deduplication in cloud storage
    • Nov-Dec
    • D. Harnik, B. Pinkas, and A. Shulman-Peleg. Side channels in cloud services: Deduplication in cloud storage. IEEE Security & Privacy, 8(6):40-47, Nov-Dec 2010.
    • (2010) IEEE Security & Privacy , vol.8 , Issue.6 , pp. 40-47
    • Harnik, D.1    Pinkas, B.2    Shulman-Peleg, A.3
  • 44
    • 0030544249 scopus 로고    scopus 로고
    • The log-structured merge-tree (lsm-tree)
    • June
    • P. O'Neil, E. Cheng, D. Gawlick, and E. O'Neil. The log-structured merge-tree (LSM-tree). Acta Informatica, 33(4):351-385, June 1996.
    • (1996) Acta Informatica , vol.33 , Issue.4 , pp. 351-385
    • O'Neil, P.1    Cheng, E.2    Gawlick, D.3    O'Neil, E.4
  • 46
    • 0031223146 scopus 로고    scopus 로고
    • A tutorial on reed-solomon coding for fault-tolerance in RAID-like systems
    • Sept
    • J. S. Plank. A tutorial on Reed-Solomon coding for fault-tolerance in RAID-like systems. Software-Practice & Experience, 27(9):995-1012, Sept. 1997.
    • (1997) Software-Practice & Experience , vol.27 , Issue.9 , pp. 995-1012
    • Plank, J.S.1
  • 47
    • 13244269971 scopus 로고    scopus 로고
    • Note: Correction to the 1997 tutorial on reed-solomon coding
    • Feb
    • J. S. Plank and Y. Ding. Note: Correction to the 1997 tutorial on Reed-Solomon coding. Software-Practice & Experience, 35(2):189-194, Feb. 2005.
    • (2005) Software-Practice & Experience , vol.35 , Issue.2 , pp. 189-194
    • Plank, J.S.1    Ding, Y.2
  • 49
    • 0003676885 scopus 로고
    • Technical report, Technical Report TR-15-81, Center for Research in Computing Technology, Harvard University
    • M. Rabin. Fingerprint by random polynomials. Technical report, Technical Report TR-15-81, Center for Research in Computing Technology, Harvard University, 1981.
    • (1981) Fingerprint by Random Polynomials
    • Rabin, M.1
  • 50
    • 0024641589 scopus 로고
    • Efficient dispersal of information for security, load balancing, and fault tolerance
    • Apr
    • M. Rabin. Efficient dispersal of information for security, load balancing, and fault tolerance. Journal of the ACM, 36(2):335-348, Apr. 1989.
    • (1989) Journal of the ACM , vol.36 , Issue.2 , pp. 335-348
    • Rabin, M.1
  • 54
    • 0018545449 scopus 로고
    • How to share a secret
    • Nov
    • A. Shamir. How to share a secret. Communications of the ACM, 22(11):612-613, Nov. 1979.
    • (1979) Communications of the ACM , vol.22 , Issue.11 , pp. 612-613
    • Shamir, A.1


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