{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T18:16:36Z","timestamp":1725560196378},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540280057"},{"type":"electronic","value":"9783540318644"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/11532231_31","type":"book-chapter","created":{"date-parts":[[2010,7,21]],"date-time":"2010-07-21T14:56:52Z","timestamp":1279724212000},"page":"424-440","source":"Crossref","is-referenced-by-count":3,"title":["Proving Properties of Incremental Merkle Trees"],"prefix":"10.1007","author":[{"given":"Mizuhito","family":"Ogawa","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Eiichi","family":"Horita","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Satoshi","family":"Ono","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"31_CR1","unstructured":"MONA project, http:\/\/www.brics.dk\/mona\/"},{"key":"31_CR2","doi-asserted-by":"crossref","unstructured":"Adams, C., et\u00a0al.: RFC3161, internet X.509 public key infrastructure time-stamp protocol (TSP). Technical report, IETF (2001)","DOI":"10.17487\/rfc3161"},{"key":"31_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"293","DOI":"10.1007\/978-3-540-46588-1_20","volume-title":"Public Key Cryptography","author":"A. Buldas","year":"2000","unstructured":"Buldas, A., Lipmaa, H., Schoenmakers, B.: Optimally efficient accountable time-stamping. In: Imai, H., Zheng, Y. (eds.) PKC 2000. LNCS, vol.\u00a01751, pp. 293\u2013305. Springer, Heidelberg (2000)"},{"key":"#cr-split#-31_CR4.1","doi-asserted-by":"crossref","unstructured":"Comon, H.: Sequentiality, monadic second-order logic and tree automata. Information and Computation??157(1 & 2), 25???51 (2000);","DOI":"10.1006\/inco.1999.2838"},{"key":"#cr-split#-31_CR4.2","unstructured":"Previously presented. In: Proc. 10th IEEE Symposium on Logic in Computer Science, pp. 508???517 (1995)"},{"key":"31_CR5","unstructured":"Horita, E., Ono, S., Ishimoto, H.: Implementation mechanisms of scalable event-ordering system without single point of attack. Technical report, IEICE SIG-ISEC, 11, (in Japanese) (2004)"},{"key":"31_CR6","first-page":"395","volume-title":"Computational Logic: Essays in Honor of Alan Robinson","author":"G. Huet","year":"1991","unstructured":"Huet, G., L\u00e9vy, J.-J.: Computations in orthogonal rewriting systems I,II. In: Computational Logic: Essays in Honor of Alan Robinson, pp. 395\u2013443. MIT Press, Cambridge (1991); Previous version: Report 359, INRIA, (1979)"},{"key":"31_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"314","DOI":"10.1007\/3-540-36563-X_21","volume-title":"Topics in Cryptology - CT-RSA 2003","author":"M. Jakobsson","year":"2003","unstructured":"Jakobsson, M., Leighton, F.T., Micali, S., Szydlo, M.: Fractal merkle tree representation and traversal. In: Joye, M. (ed.) CT-RSA 2003. LNCS, vol.\u00a02612, pp. 314\u2013326. Springer, Heidelberg (2003)"},{"key":"31_CR8","unstructured":"Merkle, R.C.: Secrecy, Authentication, and Public Key Systems. UMI Research Press, 1982. also appears as Ph.D thesis at Stanford University (1979)"},{"key":"31_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"541","DOI":"10.1007\/978-3-540-24676-3_32","volume-title":"Advances in Cryptology - EUROCRYPT 2004","author":"S. Michael","year":"2004","unstructured":"Michael, S.: Merkle tree traversal in log space and time. In: Cachin, C., Camenisch, J.L. (eds.) EUROCRYPT 2004. LNCS, vol.\u00a03027, pp. 541\u2013554. Springer, Heidelberg (2004)"},{"key":"31_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-45949-9","volume-title":"Isabelle\/HOL","author":"T. Nipkow","year":"2002","unstructured":"Nipkow, T., Paulson, L.C., Wenzel, M.T.: Isabelle\/HOL. LNCS, vol.\u00a02283. Springer, Heidelberg (2002)"},{"key":"31_CR11","first-page":"133","volume-title":"Handbook of Theoretical Computer Science, ch.\u00a04","author":"W. Thomas","year":"1990","unstructured":"Thomas, W.: Automata on infinite objects. In: van Leeuwen, J. (ed.) Handbook of Theoretical Computer Science, ch.\u00a04, vol.\u00a0B, pp. 133\u2013192. Elsevier, Amsterdam (1990)"},{"key":"31_CR12","unstructured":"Villemson, J.: Size-efficient interval time stamps. PhD thesis, University of Tartu, Estonia (2002)"}],"container-title":["Lecture Notes in Computer Science","Automated Deduction \u2013 CADE-20"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11532231_31.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T15:09:14Z","timestamp":1605625754000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11532231_31"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540280057","9783540318644"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/11532231_31","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}