The complexity of online memory checking

Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS

Volumn 2005, Issue , 2005, Pages 573-582

  Naor, Moni ^a   Rothblum, Guy N ^a  

^a WEIZMANN INSTITUTE OF SCIENCE   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL METHODS; COMPUTER NETWORKS; COMPUTER SCIENCE; CRYPTOGRAPHY; INFORMATION RETRIEVAL; INFORMATION SCIENCE; PROBLEM SOLVING; SERVERS;

FINGERPRINT SIZE; LINEAR AUTHENTICATION SCHEMES; LOWER BOUNDS;

ONLINE SYSTEMS;

EID: 33748605569     PISSN: 02725428     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/SFCS.2005.71     Document Type: Conference Paper

References (28)

1. M. Ajtai. The Invasiveness of Off-line Memory Checking. STOC 2002: 504-513
2. L. Babai and P. G. Kimmel. Randomized Simultaneous Messages: Solution of a Problem of Yao in Communication Complexity. IEEE Conference on Computational Complexity 1997: 239-246
3. A. Beimel, Y. Ishai, E. Kushilevitz and T. Malkin. One-Way Functions Are Essential for Single-Server Private Information Retrieval. STOC 1999: 89-98
4. M. Bellare, O. Goldreich and S. Goldwasser. Incremental Cryptography: The Case of Hashing and Signing. CRYPTO 1994: 216-233
5. M. Bellare, O. Goldreich and S. Goldwasser. Incremental Cryptography and Application to Virus Protection. STOC 1995: 45-56
6. M. Bellare, R. Impagliazzo and M. Naor. Does Parallel Repetition Lower the Error in Computationally Sound Protocols? FOCS 1997: 374-383
7. E. Ben-Sasson, O. Goldreich, P. Harsha, M. Sudan and S. P. Vadhan. Robust PCPs of Proximity, Shorter PCPs and Applications to Coding. STOC 2004: 1-10
8. E. Ben-Sasson and M. Sudan. Simple PCPs with Poly-log Rate and Query Complexity STOC 2005: 266-275
9. M. Blum, W. S. Evans, P. Gemmell, S. Kannan and M. Naor. Checking the Correctness of Memories. Algorithmica 12(2/3): 225-244 (1994)
10. M. Blum and S. Kannan. Designing Programs that Check Their Work. Journal of the ACM 42(1): 269-291 (1995)
11. G. Di-Crescenzo, T. Malkin and R. Ostrovsky. Single Database Private Information Retrieval Implies Oblivious Transfer. EUROCRYPT 2000: 122-138
12. K. Friedl and M. Sudan. Some Improvements to Total Degree Tests. ISTCS 1995: 190-198
13. P. Gemmell and M. Naor. Codes for Interactive Authentication. CRYPTO 1993: 355-367
14. E. N. Gilbert, F. J. MacWilliams and N. J. A. Sloane. Codes which detect deception. Bell System Technical Journal 53(3): 405-424, (1974).
15. O. Goldreich. Towards a Theory of Software Protection and Simulation by Oblivious RAMs. STOC 1987: 182-194
16. O. Goldreich and R. Ostrovsky. Software Protection and Simulation on Oblivious RAMs. Journal of the ACM 43(3): 431-473 (1996)
17. O. Goldreich and M. Sudan. Locally Testable Codes and PCPs of Almost-Linear Length. FOCS 2002: 13-22
18. R. Impagliazzo. A Personal View of Average-Case Complexity. Structure in Complexity Theory Conference 1995: 134-147
19. R. Impagliazzo and M. Luby. One-way Functions are Essential for Complexity Based Cryptography. FOCS 1989: 230-235
20. J. Katz and L. Trevisan. On the Efficiency of Local Decoding Procedures for Error-Correcting Codes. STOC 2000: 80-86
21. I. Kremer, N. Nisan and D. Ron. On Randomized One-Round Communication Complexity. Computational Complexity 8(1): 21-49 (1999)
22. M. Naor and G. N. Rothblum. Simulating Secret Knowledge: the Learnability of Adaptively Changing Distributions. Manuscript at http://www.wisdom.weizmann. ac.il/~naor/PAPERS/acd.ps (2005)
23. M. Naor and M. Yung. Universal One-Way Hash Functions and their Cryptographic Applications. STOC 1989: 33-43
24. I. Newman and M. Szegedy. Public vs. Private Coin Flips in One Round Communication Games. STOC 1996: 561-570
25. R. Ostrovsky. Efficient Computation on Oblivious RAMs. STOC 1990: 514-523
26. R. Ostrovsky and A. Wigderson. One-Way Functions are Essential for Non-Trivial Zero-Knowledge. ISTCS 1993: 3-17
27. M. N. Wegman and L. Carter. New Hash Functions and Their Use in Authentication and Set Equality. JCSS 22(3): 265-279 (1981)
28. A. Chi-Chih Yao. Some Complexity Questions Related to Distributive Computing. STOC 1979: 209-213