메뉴 건너뛰기




Volumn , Issue , 2009, Pages 43-53

Proofs of retrievability: Theory and implementation

Author keywords

Cloud storage; Data availability; Erasure codes; Proofs of retrievability

Indexed keywords

BUILDING BLOCKES; COMMUNICATION COMPLEXITY; DATA AVAILABILITY; ERASURE CODES; ERROR RATE; FILE SYSTEMS; MAIN MEMORY; PROTOTYPE IMPLEMENTATIONS; REMOTE STORAGE SYSTEM; THEORETICAL FRAMEWORK; THEORETICAL MODELS;

EID: 74049136395     PISSN: 15437221     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1655008.1655015     Document Type: Conference Paper
Times cited : (343)

References (23)
  • 3
    • 35048881545 scopus 로고    scopus 로고
    • The knowledge-of-exponent assumptions and 3-round zero-knowledge protocols
    • Proc. CRYPTO '04, Springer
    • M. Bellare and A. Palacio. The knowledge-of-exponent assumptions and 3-round zero-knowledge protocols. In Proc. CRYPTO '04, pages 273-289. Springer, 2004. LNCS vol. 3152.
    • (2004) LNCS , vol.3152 , pp. 273-289
    • Bellare, M.1    Palacio, A.2
  • 4
    • 84944886613 scopus 로고    scopus 로고
    • Ciphers with arbitrary finite domains
    • Proc. CT-RSA '02, Springer
    • J. Black and P. Rogaway. Ciphers with arbitrary finite domains. In Proc. CT-RSA '02, pages 114-130. Springer, 2002. LNCS vol. 2271.
    • (2002) LNCS , vol.2271 , pp. 114-130
    • Black, J.1    Rogaway, P.2
  • 8
    • 74049141588 scopus 로고    scopus 로고
    • Y. Dodis, S. Vadhan, and D. Wichs. Proofs of retrievability via hardness amplification. In TCC, 2009.
    • Y. Dodis, S. Vadhan, and D. Wichs. Proofs of retrievability via hardness amplification. In TCC, 2009.
  • 12
    • 84919877604 scopus 로고    scopus 로고
    • Cryptographic primitives enforcing communication and storage complexity
    • M. Blaze, editor, Proc. Financial Cryptography '02, Springer
    • P. Golle, S. Jarecki, and I. Mironov. Cryptographic primitives enforcing communication and storage complexity. In M. Blaze, editor, Proc. Financial Cryptography '02, pages 120-135. Springer, 2002. LNCS vol. 2357.
    • (2002) LNCS , vol.2357 , pp. 120-135
    • Golle, P.1    Jarecki, S.2    Mironov, I.3
  • 13
    • 74049103479 scopus 로고    scopus 로고
    • PORs: Proofs of retrievability for large files
    • A. Juels and B. Kaliski. PORs: Proofs of retrievability for large files. In Proc. ACM CCS, pages 584-597, 2007.
    • (2007) Proc. ACM CCS , pp. 584-597
    • Juels, A.1    Kaliski, B.2
  • 15
    • 0036953758 scopus 로고    scopus 로고
    • M. Luby. LT codes. In Proc. Symposium on Foundations of Computer Science (FOCS), pages 271-Ů282. IEEE, 2002.
    • M. Luby. LT codes. In Proc. Symposium on Foundations of Computer Science (FOCS), pages 271-Ů282. IEEE, 2002.
  • 16
    • 0030671783 scopus 로고    scopus 로고
    • M. Luby, M. Mitzenmacher, A. Shokrollahi, D. Spielman, and V. Stemann. Practical loss-resilient codes. In Proc. Symposium on Theory of Computation (STOC), page 150Ů159. ACM, 1997.
    • M. Luby, M. Mitzenmacher, A. Shokrollahi, D. Spielman, and V. Stemann. Practical loss-resilient codes. In Proc. Symposium on Theory of Computation (STOC), page 150Ů159. ACM, 1997.
  • 17
    • 74049096964 scopus 로고    scopus 로고
    • On-line codes. Technical Report TR2002-833, Computer Science Department at New York University
    • November
    • P. Maymounkov. On-line codes. Technical Report TR2002-833, Computer Science Department at New York University, November 2002.
    • (2002)
    • Maymounkov, P.1
  • 19
    • 0030673080 scopus 로고    scopus 로고
    • Improved security bounds for pseudorandom permutations
    • J. Patarin. Improved security bounds for pseudorandom permutations. In Proc. ACM CCS, pages 142-150, 1997.
    • (1997) Proc. ACM CCS , pp. 142-150
    • Patarin, J.1
  • 20
    • 74049163090 scopus 로고    scopus 로고
    • W. W. Peterson and E. J. Weldon, Jr. Error-Correcting Codes. MIT Press, 1972. Second Edition.
    • W. W. Peterson and E. J. Weldon, Jr. Error-Correcting Codes. MIT Press, 1972. Second Edition.
  • 21
    • 58349118819 scopus 로고    scopus 로고
    • Compact proofs of retrievability
    • Berlin, Heidelberg, Springer-Verlag
    • Hovav Shacham and Brent Waters. Compact proofs of retrievability. In Proc. ASIACRYPT '08, pages 90-107, Berlin, Heidelberg, 2008. Springer-Verlag.
    • (2008) Proc. ASIACRYPT '08 , pp. 90-107
    • Shacham, H.1    Waters, B.2
  • 22
    • 85016272824 scopus 로고    scopus 로고
    • Auditing to keep online storage services honest
    • Presented at, May
    • M.A. Shah, M. Baker, J.C. Mogul, and R. Swaminathan. Auditing to keep online storage services honest, 2007. Presented at HotOS XI, May 2007.
    • (2007) HotOS XI
    • Shah, M.A.1    Baker, M.2    Mogul, J.C.3    Swaminathan, R.4


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