Proof of possession for cloud storage via Lagrangian interpolation techniques

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 7645 LNCS, Issue , 2012, Pages 305-319

  Krzywiecki, Łukasz ^a   Kutyłowski, Mirosław ^a  

^a WROCLAW UNIVERSITY OF TECHNOLOGY   (Poland)

Author keywords

broadcast encryption; cloud computing; Lagrangian interpolation in the exponent; proof of retrievability; provable data possession

Indexed keywords

BROADCAST ENCRYPTION; BROADCAST ENCRYPTION SYSTEMS; DISCRETE LOGARITHM PROBLEMS; LAGRANGIAN INTERPOLATION; PROOF OF RETRIEVABILITY; PROVABLE DATA POSSESSION;

CLOUD COMPUTING; CRYPTOGRAPHY; INTERPOLATION; LAGRANGE MULTIPLIERS; NETWORK SECURITY;

DIGITAL STORAGE;

EID: 84871533728     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-34601-9_23     Document Type: Conference Paper

References (18)

1. Ateniese, G., Burns, R.C., Curtmola, R., Herring, J.,Kissner, L., Peterson, Z.N.J., Song, D.X.: Provable data possession at untrusted stores. In: ACM Conference on Computer and Communications Security, pp. 598-609 (2007)
2. Curtmola, R., Khan, O., Burns, R.C., Ateniese, G.: Mr-pdp: Multiple-replica provable data possession. In: ICDCS, pp. 411-420. IEEE Computer Society (2008)
3. Chang, E.-C., Xu, J.: Remote Integrity Check with Dishonest Storage Server. In: Jajodia, S., Lopez, J. (eds.) ESORICS 2008. LNCS, vol. 5283, pp. 223-237. Springer, Heidelberg (2008)
4. Ateniese, G., Kamara, S., Katz, J.: Proofs of Storage from Homomorphic Identification Protocols. In: Matsui, M. (ed.) ASIACRYPT 2009. LNCS, vol. 5912, pp. 319-333. Springer, Heidelberg (2009)
5. Dodis, Y., Vadhan, S.P., Wichs, D.: Proofs of Retrievability via Hardness Amplification. In: Reingold, O. (ed.) TCC 2009. LNCS, vol. 5444, pp. 109-127. Springer, Heidelberg (2009)
6. Wang, Q., Wang, C., Li, J., Ren,K., Lou, W.: Enabling PublicVerifiability and DataDynamics for Storage Security in Cloud Computing. In: Backes, M., Ning, P. (eds.) ESORICS 2009. LNCS, vol. 5789, pp. 355-370. Springer, Heidelberg (2009)
7. Erway, C.C., Küpçü, A., Papamanthou, C., Tamassia, R.: Dynamic provable data possession. In: ACM Conference on Computer and Communications Security, pp. 213-222 (2009)
8. Zhu, Y., Wang, H., Hu, Z., Ahn, G.J., Hu, H., Yau, S.S.: Efficient provable data possession for hybrid clouds. In: Proceedings of the 17th ACM Conference on Computer and Communications Security, CCS 2010, pp. 756-758. ACM, New York (2010)
9. Ateniese, G., Burns, R., Curtmola, R., Herring, J., Khan, O., Kissner, L., Peterson, Z., Song, D.: Remote data checking using provable data possession. ACM Trans. Inf. Syst. Secur. 14(1), 12:1-12:34 (2011)
10. Yang, J., Wang, H., Wang, J., Tan, C., Yu, D.: Provable data possession of resourceconstrained mobile devices in cloud computing. JNW 6(7), 1033-1040 (2011)
11. Xu, J., Chang, E.C.: Towards efficient provable data possession. IACR Cryptology ePrint Archive 2011, 574 (2011)
12. Shen, S.T., Tzeng, W.G.: Delegable Provable Data Possession for Remote Data in the Clouds. In: Qing, S., Susilo, W., Wang, G., Liu, D. (eds.) ICICS 2011. LNCS, vol. 7043, pp. 93-111. Springer, Heidelberg (2011)
13. Juels, A., Kaliski Jr., B.S.: Pors: proofs of retrievability for large files. In: Proceedings of the 14th ACMConference on Computer and Communications Security, CCS 2007, pp. 584-597. ACM, New York (2007)
14. Shacham, H., Waters, B.: Compact Proofs of Retrievability. In: Pieprzyk, J. (ed.) ASIACRYPT 2008. LNCS, vol. 5350, pp. 90-107. Springer, Heidelberg (2008)
15. Boneh, D., Shen, E., Waters, B.: Strongly Unforgeable Signatures Based on Computational Diffie-Hellman. In: Yung, M., Dodis, Y., Kiayias, A., Malkin, T. (eds.) PKC 2006. LNCS, vol. 3958, pp. 229-240. Springer, Heidelberg (2006)
16. Kate, A., Zaverucha, G.M., Goldberg, I.: Constant-Size Commitments to Polynomials and Their Applications. In: Abe, M. (ed.) ASIACRYPT 2010. LNCS, vol. 6477, pp. 177-194. Springer, Heidelberg (2010)
17. Naor, M., Pinkas, B.: Efficient Trace and Revoke Schemes. In: Frankel, Y. (ed.) FC 2000. LNCS, vol. 1962, pp. 1-20. Springer, Heidelberg (2001)
18. Shoup, V.: Sequences of games: a tool for taming complexity in security proofs (2006), http://www.shoup.net/papers/games.pdf