The invasiveness of off-line memory checking

Conference Proceedings of the Annual ACM Symposium on Theory of Computing

Volumn , Issue , 2002, Pages 504-513

  Ajtai, Miklós ^a  

^a IBM ALMADEN RESEARCH CENTER   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

BOUNDARY CONDITIONS; CRYPTOGRAPHY; POLYNOMIALS; PROBABILITY; SHIFT REGISTERS;

BRANCHING PROGRAM; OFF-LINE MEMORY CHECKING;

RANDOM ACCESS STORAGE;

EID: 0036039958     PISSN: 07349025     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/509907.509981     Document Type: Conference Paper

References (9)

1. Determinism versus non-determinism for linear time rams with memory restrictions
2. Proof verification and intractability of approximation problems
3. Probabilistic checking of proofs. A new characterization of np.
4. Super-linear time-space tradeoff lower bounds for randomized computation
5. Checking the correctness of memories
6. Incremental cryptography and memory checkers
7. Lower bounds for the signature size of incremental schemes
8. Towards a theory of software protection and simulation by oblivious rams
9. Efficient computation on oblivious rams