{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T05:37:33Z","timestamp":1725514653284},"publisher-location":"Berlin, Heidelberg","reference-count":23,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540681595"},{"type":"electronic","value":"9783540681649"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-68164-9_6","type":"book-chapter","created":{"date-parts":[[2008,5,30]],"date-time":"2008-05-30T10:48:34Z","timestamp":1212144514000},"page":"80-93","source":"Crossref","is-referenced-by-count":6,"title":["An (Almost) Constant-Effort Solution-Verification Proof-of-Work Protocol Based on Merkle Trees"],"prefix":"10.1007","author":[{"given":"Fabien","family":"Coelho","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"6_CR1","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)"},{"key":"6_CR2","doi-asserted-by":"crossref","unstructured":"Cai, J.-Y., Lipton, R.R., Sedgewick, R., Yao, A.C.C.: Towards uncheatable benchmarks. In: Eighth IEEE Annual Structure in Complexity Conference, San Diego, California, May 1993, pp. 2\u201311 (1993)","DOI":"10.1109\/SCT.1993.336546"},{"key":"6_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"151","DOI":"10.1007\/3-540-63594-7_75","volume-title":"Financial Cryptography","author":"M.K. Franklin","year":"1997","unstructured":"Franklin, M.K., Malkhi, D.: Auditable Metering with Lightweight Security. In: Luby, M., Rolim, J., Serna, M. (eds.) FC 1997. LNCS, vol.\u00a01318, pp. 151\u2013160. Springer, Heidelberg (1997)"},{"key":"6_CR4","doi-asserted-by":"crossref","unstructured":"Rivest, R., Shamir, A.: PayWord and MicroMint \u2013 Two Simple Micropayment Schemes. CryptoBytes\u00a02(1) (1996)","DOI":"10.1007\/3-540-62494-5_6"},{"key":"6_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"214","DOI":"10.1007\/BFb0055485","volume-title":"Financial Cryptography","author":"D.M. Goldschlag","year":"1998","unstructured":"Goldschlag, D.M., Stubblebine, S.G.: Publicly verifiable lotteries: Applications of delaying functions. In: Hirschfeld, R. (ed.) FC 1998. LNCS, vol.\u00a01465, pp. 214\u2013226. Springer, Heidelberg (1998)"},{"key":"6_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"198","DOI":"10.1007\/BFb0055484","volume-title":"Financial Cryptography","author":"E. Gabber","year":"1998","unstructured":"Gabber, E., Jakobsson, M., Matias, Y., Mayer, A.J.: Curbing junk e-mail via secure classification. In: Hirschfeld, R. (ed.) FC 1998. LNCS, vol.\u00a01465, pp. 198\u2013213. Springer, Heidelberg (1998)"},{"key":"6_CR7","unstructured":"Rosenthal, D.S.H., Roussopoulos, M., Maniatis, P., Baker, M.: Economic Measures to Resist Attacks on a Peer-to-Peer Network. In: Workshop on Economics of Peer-to-Peer Systems, Berkeley, CA, USA (June 2003)"},{"key":"6_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"364","DOI":"10.1007\/11496137_25","volume-title":"Applied Cryptography and Network Security","author":"F. Garcia","year":"2005","unstructured":"Garcia, F., Hoepman, J.-H.: Off-line Karma: A Decentralized Currency for Peer-to-peer and Grid Applications. In: Ioannidis, J., Keromytis, A.D., Yung, M. (eds.) ACNS 2005. LNCS, vol.\u00a03531, pp. 364\u2013377. Springer, Heidelberg (2005)"},{"key":"6_CR9","series-title":"Lecture Notes in Computer Science","first-page":"72","volume-title":"Programming Languages and Systems","author":"M. Abadi","year":"2004","unstructured":"Abadi, M., Birrell, A., Mike, B., Dabek, F., Wobber, T.: Bankable postage for network services. In: Schmidt, D. (ed.) ESOP 2004. LNCS, vol.\u00a02986, pp. 72\u201390. Springer, Heidelberg (2004)"},{"key":"6_CR10","doi-asserted-by":"crossref","unstructured":"Jakobsson, M., Juels, A.: Proofs of Work and Bread Pudding Protocols. Communications and Multimedia Security (September 1999)","DOI":"10.1007\/978-0-387-35568-9_18"},{"key":"6_CR11","unstructured":"Laurie, B., Clayton, R.: \u201dProof-of-Work\u201d Proves Not to Work. In: WEAS 2004 (May 2004)"},{"key":"6_CR12","unstructured":"Liu, D., Camp, L.J.: Proof of Work can Work. In: Fifth Workshop on the Economics of Information Security (June 2006)"},{"key":"6_CR13","unstructured":"Rivers, R.L., Shamir, A., Wagner, D.: Time-lock puzzles and timed-release crypto. Technical Report MIT\/LCS 684, MIT (1996)"},{"key":"6_CR14","unstructured":"Juels, A., Brainard, J.: Client Puzzles: A Cryptographic Defense Against Connection Depletion Attacks. In: Network and Distributed System Security (NDSS) (February 1999)"},{"key":"6_CR15","doi-asserted-by":"crossref","unstructured":"Waters, B., Juels, A., Halderman, J.A., Felten, E.W.: New client puzzle outsourcing techniques for DoS resistance. In: 11th ACM Conference on Computer and Communications Security (October 2004)","DOI":"10.1145\/1030083.1030117"},{"key":"6_CR16","unstructured":"Back, A.: Hashcash package announce (March 1997), http:\/\/hashcash.org\/papers\/announce.txt"},{"key":"6_CR17","unstructured":"Abadi, M., Burrows, M., Manasse, M., Wobber, T.: Moderately Hard, Memory-bound Functions. In: 10th Annual Network and Distributed System Security Symposium (NDSS), San Diego, CA, USA (February 2003)"},{"key":"6_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","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., 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":"#cr-split#-6_CR19.1","unstructured":"Coelho, F.: Exponential memory-bound functions for proof of work protocols. Research Report A-370, CRI, \u00c9cole des mines de Paris (September 2005);"},{"key":"#cr-split#-6_CR19.2","unstructured":"Also Cryptology ePrint Archive, Report (2005)\/356"},{"key":"6_CR20","unstructured":"Wang, X., Reiter, M.: Defending against denial-of-service attacks with puzzle auctions. In: IEEE Symposium on Security and Privacy 2003 (May 2003)"},{"key":"6_CR21","unstructured":"Merkle, R.C.: Secrecy, Authentification, and Public Key Systems. PhD thesis, Stanford University, Dpt of Electrical Engineering (June 1979)"},{"key":"6_CR22","unstructured":"Lamport, L.: Constructing digital signatures from a one-way function. Technical Report SRI-CSL-98, SRI International Computer Science Laboratory (October 1979)"}],"container-title":["Lecture Notes in Computer Science","Progress in Cryptology \u2013 AFRICACRYPT 2008"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-68164-9_6.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,3]],"date-time":"2021-05-03T04:38:59Z","timestamp":1620016739000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-68164-9_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540681595","9783540681649"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-68164-9_6","relation":{},"subject":[]}}