Proofs of storage from homomorphic identification protocols

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

Volumn 5912 LNCS, Issue , 2009, Pages 319-333

  Ateniese, Giuseppe ^a   Kamara, Seny ^b   Katz, Jonathan ^c  

^a JOHNS HOPKINS UNIVERSITY   (United States)

^b MICROSOFT RESEARCH   (United States)

^c UNIVERSITY OF MARYLAND   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

AUTHENTICATION SCHEME; COMMUNICATION COMPLEXITY; HOMOMORPHIC PROPERTY; IDENTIFICATION PROTOCOL; INTERACTIVE PROTOCOLS; LINEAR COMBINATIONS; MULTIPLE MESSAGES; PUBLIC KEYS; RANDOM ORACLE MODEL;

IMAGE QUALITY; NETWORK SECURITY;

CRYPTOGRAPHY;

EID: 72449185582     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-10366-7_19     Document Type: Conference Paper

References (15)

1. Ateniese, G., Burns, R., Curtmola, R., Herring, J., Kissner, L., Peterson, Z., Song, D.: Provable data possession at untrusted stores. In: ACMConference on Computer and Communications Security. ACM, New York (2007)
2. Ateniese, G., Di Pietro, R., Mancini, L.V., Tsudik, G.: Scalable and efficient provable data possession. In: Proc. 4th Intl. Conf. on Security and Privacy in Communication Netowrks (SecureComm 2008), pp. 1-10. ACM, New York (2008)
3. Bellare, M., Goldreich, O.: On defining proofs of knowledge. In: Brickell, E.F. (ed.) CRYPTO 1992. LNCS, vol. 740, pp. 390-420. Springer, Heidelberg (1993)
4. Bowers, K., Juels, A., Oprea, A.: Proofs of retrievability: Theory and implementation. Technical Report 2008/175, Cryptology ePrint Archive (2008)
5. Dodis, Y., Vadhan, S., Wichs, D.: Proofs of retrievability via hardness amplification. In: Reingold, O. (ed.) TCC 2009. LNCS, vol. 5444, pp. 109-127. Springer, Heidelberg (2009)
6. Erway, C., Papamanthou, C., Kupcu, A., Tamassia, R.: Dynamic provable data possession. In: ACM Conf. on Computer and Communications Security (to appear, 2009). Available as Cryptology ePrint Archive, Report 2008/432
7. Feige, U., Fiat, A., Shamir, A.: Zero knowledge proofs of identity. J. Cryptology 1(2), 77-94 (1988)
8. Goldreich, O., Kahan, A.: How to construct constant-round zero-knowledge proof systems for NP. J. Cryptology 9(3), 167-190 (1996)
9. Groth, J.: A verifiable secret shuffle of homomorphic encryptions. Technical Report 2005/246, IACR ePrint Cryptography Archive (2005)
10. Guillou, L., Quisquater, J.-J.: A practical zero-knowledge protocol fitted to security microprocessor minimizing both transmission and memory. In: Günther, C.G. (ed.) EUROCRYPT 1988. LNCS, vol. 330, pp. 123-128. Springer, Heidelberg (1988)
11. Juels, A., Kaliski, B.: PORs: Proofs of retrievability for large files. In: ACM Conference on Computer and Communications Security. ACM, New York (2007)
12. Lindell, Y.: Parallel coin-tossing and constant-round secure two-party computation. J. Cryptology 16(3), 143-184 (2003)
13. Naor, M., Rothblum, G.: The complexity of online memory checking. In: IEEE Symposium on Foundations of Computer Science, pp. 573-584. IEEE Computer Society, Los Alamitos (2005)
14. Shacham, H., Waters, B.: Compact proofs of retrievability. In: Pieprzyk, J. (ed.) ASIACRYPT 2008. LNCS, vol. 5350, pp. 90-107. Springer, Heidelberg (2008), Full version http://eprint.iacr.org
15. Shoup, V.: On the security of a practical identification scheme. J. Cryptology 12(4), 247-260 (1999)