{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T22:19:11Z","timestamp":1725488351600},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540629757"},{"type":"electronic","value":"9783540690535"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1997]]},"DOI":"10.1007\/3-540-69053-0_27","type":"book-chapter","created":{"date-parts":[[2007,8,5]],"date-time":"2007-08-05T21:24:05Z","timestamp":1186349045000},"page":"393-408","source":"Crossref","is-referenced-by-count":13,"title":["Incremental Cryptography and Memory Checkers"],"prefix":"10.1007","author":[{"given":"Marc","family":"Fischlin","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2001,7,13]]},"reference":[{"key":"27_CR1","unstructured":"A. Ahu, J. Hopcroft, J. Ullman: The Design and Analysis of Computer Algorithms, Addison Wesley, 1974."},{"key":"27_CR2","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"216","DOI":"10.1007\/3-540-48658-5_22","volume-title":"Crypto\u2019 94","author":"M. Bellare","year":"1994","unstructured":"M. Bellare, O. Goldreich, S. Goldwasser: Incremental Cryptography: The Case of Hashing and Signing, Crypto\u2019 94, Lecture Notes in Computer Science, Vol. 839, Springer-Verlag, pp. 216\u2013233, 1994."},{"key":"27_CR3","doi-asserted-by":"crossref","unstructured":"M. Bellare, O. Goldreich, S. Goldwasser: Incremental Cryptography and Application to Virus Protection, Proceedings of the 27th Annual ACM Symposium on the Theory of Computing, pp. 45\u201356, 1995.","DOI":"10.1145\/225058.225080"},{"key":"27_CR4","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"15","DOI":"10.1007\/3-540-44750-4_2","volume-title":"Crypto\u2019 95","author":"M. Bellare","year":"1995","unstructured":"M. Bellare, R. Gu\u00e9rin, P. Rogaway: XOR MACs: New Methods for Message Authentication Using Finite Pseudorandom Functions, Crypto\u2019 95, Lecture Notes in Computer Science, Vol. 963, Springer-Verlag, pp. 15\u201329, extended version available at http:\/\/www.cs.ucdavis.edu\/~rogaway\/ , 1995."},{"key":"27_CR5","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"341","DOI":"10.1007\/3-540-48658-5_32","volume-title":"Crypto\u2019 94","author":"M. Bellare","year":"1994","unstructured":"M. Bellare, J. Killian, P. Rogaway: On the Security of Cipher Block Chaining, Crypto\u2019 94, Lecture Notes in Computer Science, Vol. 839, pp. 341\u2013358, 1994."},{"key":"27_CR6","doi-asserted-by":"crossref","unstructured":"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\u201399, 1991.","DOI":"10.1109\/SFCS.1991.185352"},{"key":"27_CR7","doi-asserted-by":"publisher","first-page":"225","DOI":"10.1007\/BF01185212","volume":"12","author":"M. Blum","year":"1994","unstructured":"M. Blum, W. Evans, P. Gemmell, S. Kannan, M. Naor: Checking the Correctness of Memories, Algorithmica, Volume 12, pp. 225\u2013244, 1994.","journal-title":"Algorithmica"},{"key":"27_CR8","doi-asserted-by":"crossref","unstructured":"M. Blum, S. Kannan: Designing Programs that Check Their Work, Proceedings of the 21st Annual ACM Symposium on the Theory of Computing, pp. 86\u201397, 1989.","DOI":"10.1145\/73007.73015"},{"issue":"4","key":"27_CR9","doi-asserted-by":"publisher","first-page":"792","DOI":"10.1145\/6490.6503","volume":"33","author":"O. Goldreich","year":"1986","unstructured":"O. Goldreich, S. Goldwasser, S. Micali: How to Construct Random Funtions, Journal of ACM, Vol. 33(4), pp. 792\u2013807, 1986.","journal-title":"Journal of ACM"},{"key":"27_CR10","doi-asserted-by":"publisher","first-page":"186","DOI":"10.1137\/0218012","volume":"18","author":"S. Goldwasser","year":"1989","unstructured":"S. Goldwasser, S. Micali, C. Rackoff: The Knowledge Complexity of Interactive Proof Systems, SIAM Journal on Computation, Vol. 18, pp. 186\u2013208, 1989.","journal-title":"SIAM Journal on Computation"},{"issue":"2","key":"27_CR11","doi-asserted-by":"publisher","first-page":"281","DOI":"10.1137\/0217017","volume":"17","author":"S. Goldwasser","year":"1988","unstructured":"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\u2013308, 1988.","journal-title":"SIAM Journal on Computation"},{"issue":"3","key":"27_CR12","doi-asserted-by":"publisher","first-page":"431","DOI":"10.1145\/233551.233553","volume":"43","author":"O. Goldreich","year":"1996","unstructured":"O. Goldreich, R. Ostrovsky: Software Protection and Simulation on Oblivious RAM, Journal of ACM, Vol. 43(3), pp. 431\u2013473, 1996.","journal-title":"Journal of ACM"},{"key":"27_CR13","doi-asserted-by":"crossref","unstructured":"D. Micciancio: Oblivious Data Structures: Application to Cryptography, (to appear at) Proceedings of the 29th Annual Symposium on the Theory of Computing, 1997.","DOI":"10.1145\/258533.258638"}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology \u2014 EUROCRYPT \u201997"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-69053-0_27","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,1]],"date-time":"2019-05-01T15:31:57Z","timestamp":1556724717000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-69053-0_27"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1997]]},"ISBN":["9783540629757","9783540690535"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/3-540-69053-0_27","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[1997]]}}}