{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,22]],"date-time":"2026-07-22T16:08:07Z","timestamp":1784736487366,"version":"3.55.0"},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540573401","type":"print"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/3-540-48071-4_10","type":"book-chapter","created":{"date-parts":[[2007,8,6]],"date-time":"2007-08-06T01:23:49Z","timestamp":1186363429000},"page":"139-147","source":"Crossref","is-referenced-by-count":525,"title":["Pricing via Processing or Combatting Junk Mail"],"prefix":"10.1007","author":[{"given":"Cynthia","family":"Dwork","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Moni","family":"Naor","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"key":"10_CR1","unstructured":"M. Blum and S. Micali, personal communication."},{"key":"10_CR2","unstructured":"E. Biham and A. Shamir, Differential Cryptanalysis of Snefru, Khafre, REDOC-II, LOKI, and Lucifer, Crypto\u2019 91 abstracts."},{"key":"10_CR3","unstructured":"B. den Boer and A. Bosselaers, An attack on the last two rounds of MD4, Crypto\u2019 91 abstracts."},{"key":"10_CR4","doi-asserted-by":"publisher","first-page":"578","DOI":"10.1109\/5.4443","volume":"76","author":"E. F. Brickell","year":"1988","unstructured":"E. F. Brickell and A. M. Odlyzko, Cryptanalysis: A Survey of Recent Results, Proceedings of the IEEE, vol. 76, pp. 578\u2013593, May 1988.","journal-title":"Proceedings of the IEEE"},{"key":"10_CR5","series-title":"Lect Notes Comput Sci","first-page":"369","volume-title":"Proc. CRYPTO\u2019 85","author":"D. Coppersmith","year":"1985","unstructured":"D. Coppersmith, Another Birthday Attack, Proc. CRYPTO\u2019 85, Springer Verlag, LNCS, Vol. 218, pp. 369\u2013378."},{"key":"10_CR6","unstructured":"A. Fiat and A. Shamir, How to prove yourself, Proc. of Crypto 86, pp. 641\u2013654."},{"key":"10_CR7","series-title":"Studies in Computer Science and Artificial Intelligence","volume-title":"The Ecology of Computing","author":"B. A. Huberman","year":"1988","unstructured":"B. A. Huberman, The Ecology of Computing, Studies in Computer Science and Artificial Intelligence 2, North Holland, Amsterdam, 1988."},{"key":"10_CR8","doi-asserted-by":"crossref","unstructured":"R. Impagliazzo and M. Naor, Cryptographic schemes provably secure as subset sum, Proc. of the 30th FOCS, 1989.","DOI":"10.1109\/SFCS.1989.63484"},{"key":"10_CR9","doi-asserted-by":"crossref","unstructured":"K. McCurley, Odd and ends from cryptology and computational number theory, in Crypttoloy and computational number theory, edited by C. Pomerance, AMS short course, 1990, pp. 145\u2013166.","DOI":"10.1090\/psapm\/042\/1095555"},{"key":"10_CR10","doi-asserted-by":"crossref","unstructured":"R. C. Merkle, One Way Functions and DES, Proc. of Crypto\u201989, pp. 428\u2013446.","DOI":"10.1007\/0-387-34805-0_40"},{"issue":"1","key":"10_CR11","doi-asserted-by":"publisher","first-page":"43","DOI":"10.1007\/BF00203968","volume":"3","author":"R. C. Merkle","year":"1990","unstructured":"R. C. Merkle, Fast Software One-Way Hash Function, J. of Cryptology Vol 3, No. 1, pp. 43\u201358, 1990.","journal-title":"J. of Cryptology"},{"key":"10_CR12","doi-asserted-by":"crossref","unstructured":"H. Ong, C. P. Schnorr and A. Shamir, An efficient signature scheme based on quadratic equations, Proc 16th STOC, 1984, pp. 208\u2013216.","DOI":"10.1145\/800057.808683"},{"key":"10_CR13","doi-asserted-by":"crossref","unstructured":"H. Ong, C. P. Schnorr and A. Shamir, Efficient signature scheme based on polynomial equations, Proc of Crypto 84, pp. 37\u201346.","DOI":"10.1007\/3-540-39568-7_4"},{"key":"10_CR14","unstructured":"J. M. Pollard and C. P. Schnorr, Solution of X 2 + ky 2 = m mod n, IEEE Trans. on Information Theory., 1988."},{"key":"10_CR15","unstructured":"M. O. Rabin, Digital Signatures and Public Key Functions as Intractable as Factoring Technical Memo TM-212, Lab. for Computer Science, MIT, 1979."},{"key":"10_CR16","doi-asserted-by":"crossref","unstructured":"R._L. Rivest, The MD4 Message Digest Algorithm, Proc of Crypto\u201990, pp. 303\u2013311.","DOI":"10.1007\/3-540-38424-3_22"},{"key":"10_CR17","doi-asserted-by":"publisher","first-page":"456","DOI":"10.1137\/0210033","volume":"10","author":"R. Schroepel","year":"1981","unstructured":"R. Schroepel and A. Shamir, A T = O(2n\/2), S = O(2n\/4) algorithm for certain NP-complete problems. SIAM J. Computing, 10 (1981), pp. 456\u2013464.","journal-title":"SIAM J. Computing"}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology \u2014 CRYPTO\u2019 92"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-48071-4_10.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T21:15:09Z","timestamp":1605647709000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-48071-4_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540573401"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/3-540-48071-4_10","relation":{},"subject":[]}}