Incremental cryptography and memory checkers

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

Volumn 1233, Issue , 1997, Pages 393-408

  Fischlin, Marc ^a  

^a GOETHE UNIVERSITY   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

AUTHENTICATION; VIRUSES;

AUTHENTICATION CODES; BLOCK OPERATIONS; LOWER BOUNDS; MESSAGE AUTHENTICATION; MESSAGE LENGTH; PSEUDO-RANDOM FUNCTIONS; SUBSTITUTION ATTACK; VIRUS PROTECTION;

CRYPTOGRAPHY;

EID: 84957374034     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-69053-0_27     Document Type: Conference Paper

References (13)

1. A. Aho, J. Hopcroft, J. Ullman: The Design and Analysis of Computer Algorithms, Addison Wesley, 1974.
2. M. Bellare, O. Goldreich, S. Goldwasser: Incremental Cryptography: The Case of Hashing and Signing, Crypto’94, Lecture Notes in Computer Science, Vol. 839, Springer-Verlag, pp. 216-233, 1994.
3. M. Bellare, O. Goldreich, S. Goldwasser: Incremental Cryptography and Application to Virus Protection, Proceedings of the 27th Annual A CM Symposium on the Theory of Computing, pp. 45-56, 1995.
4. M. Bellare, R. Guerin, P. Rogaway: XOR MACs: New Methods for Message Authentication Using Finite Pseudorandom Functions, Crypto’95, Lecture Notes in Computer Science, Vol. 963, Springer-Verlag, pp. 15-29, extended version available at http://www.es.ucdavis.edu/'rogaway/, 1995.
5. M. Bellare, J. Killian, P. Rogaway: On the Security of Cipher Block Chaining, Crypto’94, Lecture Notes in Computer Science, Vol. 839, pp. 341-358, 1994.
6. M. Blum, W. Evans, P. Gemmell, S. Kannan, M. Naor: Checking the Correctness of Memories, Proceedings of the 32nd IEEE Symposium on Foundations of Computer Science, pp. 90-99, 1991.
7. M. Blum, W. Evans, P. Gemmell, S. Kannan, M. Naor: Checking the Correctness of Memories, Algorithmica, Volume 12, pp. 225-244, 1994.
8. M. Blum, S. Kannan: Designing Programs that Check Their Work, Proceedings of the 21st Annual ACM Symposium on the Theory of Computing, pp. 86-97, 1989.
9. O. Goldreich, S. Goldwasser, S. Micali: How to Construct Random Fun-tions, Journal of ACM, Vol. 33(4), VP-792-807, 1986.
10. S. Goldwasser, S. Micali, C. Rackoff: The Knowledge Complexity of Interactive Proof Systems, SIAM Journal on Computation, Vol. 18, pp. 186-208, 1989.
11. S. Goldwasser, S. Micali, R.L. Rivest: A Digital Signature Scheme Secure Against Adaptive Chosen Message Attacks, SIAM Journal on Computation, Vol. 17(2), pp. 281-308, 1988.
12. O. Goldreich, R. Ostrovsky: Software Protection and Simulation on Oblivious RAM, Journal of ACM, Vol. 43(3), pp. 431-473, 1996.
13. D. Micciancio: Oblivious Data Structures: Application to Cryptography, (to appear at) Proceedings of the 29th Annual Symposium on the Theory of Computing, 1997.