How efficient can memory checking be?

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

Volumn 5444 LNCS, Issue , 2009, Pages 503-520

  Dwork, Cynthia ^a   Naor, Moni ^b   Rothblum, Guy N ^c   Vaikuntanathan, Vinod ^d  

^a MICROSOFT RESEARCH   (United States)

^b WEIZMANN INSTITUTE OF SCIENCE   (Israel)

^c MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

^d IBM RESEARCH   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

DATABASE SIZE; LARGE DATABASE; LOCAL MEMORIES; LOWER BOUNDS; OFFLINE; QUERY COMPLEXITY; REMOTE SERVERS; REMOTE STORAGE; SPACE COMPLEXITY; TRADE OFF;

ALGEBRA; CONTROL THEORY; CRYPTOGRAPHY;

DATABASE SYSTEMS;

EID: 70350630627     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-00457-5_30     Document Type: Conference Paper

References (17)

1. Aho, A.V., Hopcroft, J.E., Ullman, J.D.: The Design and Analysis of Computer Algorithms. Addison-Wesley Series in Computer Science and Information Processing. Addison Wesley, Reading (1974)
2. Ajtai, M.: The invasiveness of off-line memory checking. In: STOC, pp. 504-513 (2002)
3. Amato, N.M., Loui, M.C.: Checking linked data structures. In: Proceedings of the 24th Annual International Symposium on Fault-Tolerant Computing (FTCS), pp. 164-173 (1994)
4. Ateniese, G., Burns, R., Curtmola, R., Herring, J., Kissner, L., Peterson, Z., Song, D.: Provable data possession at untrusted stores. Cryptology ePrint Archive, Report 2007/202 (2007)
5. Bentley, J.: Programming Pearls. ACM, New York (1986)
6. Blum, M., Evans, W.S., Gemmell, P., Kannan, S., Naor, M.: Checking the correctness of memories. Algorithmica 12(2/3), 225-244 (1994)
7. Briggs, P., Torczon, L.: An efficient representation for sparse sets. ACM Letters on Programming Languages and Systems 2, 59-69 (1993)
8. Clarke, D.E., Suh, G.E., Gassend, B., Sudan, A., van Dijk, M., Devadas, S.: Towards constant bandwidth overhead integrity checking of untrusted data. In: IEEE Symposium on Security and Privacy, pp. 139-153 (2005)
9. Cox, R.: http://research.swtch.com/2008/03/ using-uninitialized-memory- for-fun-and.html
10. Goldreich, O.: The Foundations of Cryptography, vol. 1. Cambridge University Press, Cambridge (2001)
11. Goldreich, O.: The Foundations of Cryptography, vol. 2. Cambridge University Press, Cambridge (2004)
12. Goldreich, O., Goldwasser, S., Micali, S.: How to construct pseudorandom functions. Journal of the ACM 33(2), 792-807 (1986)
13. Juels, A., Kaliski, B.: Pors: proofs of retrievability for large files. In: CCS 2007: Proceedings of the 14th ACM conference on Computer and communications security, pp. 584-597. ACM, New York (2007)
14. Naor, J., Naor, M.: Small-bias probability spaces: Efficient constructions and applications. SIAM J. Comput. 22(4), 838-856 (1993)
15. Naor, M., Rothblum, G.N.: The complexity of online memory checking. In: FOCS, pp. 573-584 (2005)
16. Oprea, A., Reiter, M.K.: Integrity checking in cryptographic file systems with constant trusted storage. In: USENIX Security Symposium (2007)
17. Shacham, H., Waters, B.: Compact proofs of retrievability. In: Pieprzyk, J. (ed.) ASIACRYPT 2008. LNCS, vol. 5350, pp. 90-107. Springer, Heidelberg (2008)