{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,21]],"date-time":"2025-12-21T01:36:48Z","timestamp":1766281008892},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540281146"},{"type":"electronic","value":"9783540318705"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/11535218_3","type":"book-chapter","created":{"date-parts":[[2010,12,20]],"date-time":"2010-12-20T18:20:34Z","timestamp":1292869234000},"page":"37-54","source":"Crossref","is-referenced-by-count":59,"title":["Pebbling and Proofs of Work"],"prefix":"10.1007","author":[{"given":"Cynthia","family":"Dwork","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Moni","family":"Naor","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hoeteck","family":"Wee","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"3_CR1","unstructured":"Abadi, M., Burrows, M., Manasse, M., Wobber, T.: Moderately hard, memory-bound functions. In: Proc. 10th NDSS (2003)"},{"key":"3_CR2","doi-asserted-by":"crossref","unstructured":"Ajtai, M.: Determinism versus non-determinism for linear time RAMs. In: Proc. 31st STOC, pp. 632\u2013641 (1999)","DOI":"10.1145\/301250.301424"},{"key":"3_CR3","doi-asserted-by":"crossref","unstructured":"Ajtai, M.: A non-linear time lower bound for boolean branching programs. In: Proc. 40th FOCS, pp. 60\u201370 (1999)","DOI":"10.1109\/SFFCS.1999.814578"},{"issue":"2","key":"3_CR4","doi-asserted-by":"publisher","first-page":"151","DOI":"10.1080\/15427951.2004.10129083","volume":"1","author":"N. Alon","year":"2003","unstructured":"Alon, N., Capalbo, M.: Smaller explicit superconcentrators. Internet Mathematics\u00a01(2), 151\u2013163 (2003)","journal-title":"Internet Mathematics"},{"key":"3_CR5","doi-asserted-by":"publisher","first-page":"15","DOI":"10.1016\/0012-365X(88)90189-6","volume":"72","author":"N. Alon","year":"1988","unstructured":"Alon, N., Chung, F.: Explicit constructions of linear-sized tolerant networks. Discrete Math\u00a072, 15\u201320 (1988)","journal-title":"Discrete Math"},{"key":"3_CR6","unstructured":"Back, A.: Hashcash \u2013 a denial of servic counter-measure. Available at, http:\/\/www.cypherspace.org\/hashcash\/hashcash.pdf"},{"key":"3_CR7","doi-asserted-by":"crossref","unstructured":"Beame, P., Saks, M.E., Sun, X., Vee, E.: Super-linear time-space tradeoff lower bounds for randomized computation. In: Proc. 41st FOCS, pp. 169\u2013179 (2000)","DOI":"10.1109\/SFCS.2000.892078"},{"issue":"2","key":"3_CR8","doi-asserted-by":"publisher","first-page":"287","DOI":"10.1137\/0211022","volume":"11","author":"A. Borodin","year":"1982","unstructured":"Borodin, A., Cook, S.: A time-space tradeoff for sorting on a general sequential model of computation. SIAM J. Comput.\u00a011(2), 287\u2013297 (1982)","journal-title":"SIAM J. Comput."},{"issue":"3","key":"3_CR9","first-page":"308","volume":"9","author":"S. Cook","year":"1974","unstructured":"Cook, S.: An observation on time-storage trade off. JCSS\u00a09(3), 308\u2013316 (1974)","journal-title":"JCSS"},{"key":"3_CR10","doi-asserted-by":"crossref","unstructured":"Dolev, D., Dwork, C., Pippenger, N., Wigderson, A.: Superconcentrators, generalizers, and generalized connectors with limited depth. In: Proc. 15th STOC, pp. 42\u201351 (1983)","DOI":"10.1145\/800061.808731"},{"key":"3_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"426","DOI":"10.1007\/978-3-540-45146-4_25","volume-title":"Advances in Cryptology - CRYPTO 2003","author":"C. Dwork","year":"2003","unstructured":"Dwork, C., Goldberg, A.V., Naor, M.: On memory-bound functions for fighting spam. In: Boneh, D. (ed.) CRYPTO 2003. LNCS, vol.\u00a02729, pp. 426\u2013444. Springer, Heidelberg (2003)"},{"key":"3_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"139","DOI":"10.1007\/3-540-48071-4_10","volume-title":"Advances in Cryptology - CRYPTO \u201992","author":"C. Dwork","year":"1993","unstructured":"Dwork, C., Naor, M.: Pricing via processing or combatting junk mail. In: Brickell, E.F. (ed.) CRYPTO 1992. LNCS, vol.\u00a0740, pp. 139\u2013147. Springer, Heidelberg (1993)"},{"issue":"4","key":"3_CR13","doi-asserted-by":"publisher","first-page":"1087","DOI":"10.1145\/322344.322354","volume":"29","author":"T. Lengauer","year":"1982","unstructured":"Lengauer, T., Tarjan, R.E.: Asymptotically tight bounds on time-space trade-offs in a pebble game. JACM\u00a029(4), 1087\u20131130 (1982)","journal-title":"JACM"},{"key":"3_CR14","doi-asserted-by":"crossref","unstructured":"Paul, W., Tarjan, R.E., Celoni, J.R.: Space bounds for a game on graphs. In: Proc. 8th STOC, pp. 149\u2013160 (1976)","DOI":"10.1145\/800113.803643"},{"issue":"2","key":"3_CR15","doi-asserted-by":"publisher","first-page":"298","DOI":"10.1137\/0206022","volume":"6","author":"N. Pippenger","year":"1977","unstructured":"Pippenger, N.: Superconcentrators. SIAM J. Comput.\u00a06(2), 298\u2013304 (1977)","journal-title":"SIAM J. Comput."},{"issue":"2","key":"3_CR16","first-page":"118","volume":"20","author":"M. Tompa","year":"1980","unstructured":"Tompa, M.: Time-space tradeoffs for computing functions, using connectivity properties of their circuits. JCSS\u00a020(2), 118\u2013132 (1980)","journal-title":"JCSS"},{"key":"3_CR17","doi-asserted-by":"crossref","unstructured":"Upfal, E.: Tolerating linear number of faults in networks of bounded degree. In: Proc. 11th PODC, pp. 83\u201389 (1992)","DOI":"10.1145\/135419.135437"},{"key":"3_CR18","doi-asserted-by":"crossref","unstructured":"Valiant, L.G.: On non-linear lower bounds in computational complexity. In: Proc. 7th STOC, pp. 45\u201353 (1975)","DOI":"10.1145\/800116.803752"}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology \u2013 CRYPTO 2005"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11535218_3.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T20:11:00Z","timestamp":1605643860000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11535218_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540281146","9783540318705"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/11535218_3","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}