{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:39:29Z","timestamp":1750307969681,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":21,"publisher":"ACM","license":[{"start":{"date-parts":[[2007,8,19]],"date-time":"2007-08-19T00:00:00Z","timestamp":1187481600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2007,8,19]]},"DOI":"10.1145\/1282100.1282105","type":"proceedings-article","created":{"date-parts":[[2012,10,11]],"date-time":"2012-10-11T15:35:23Z","timestamp":1349969723000},"page":"7-14","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":7,"title":["Security when people matter"],"prefix":"10.1145","author":[{"given":"Rick","family":"Wash","sequence":"first","affiliation":[{"name":"University of Michigan, Ann Arbor, MI"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jeffrey K.","family":"MacKie-Mason","sequence":"additional","affiliation":[{"name":"University of Michigan, Ann Arbor, MI"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2007,8,19]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/1064340.1064341"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/168588.168615"},{"key":"e_1_3_2_1_3_1","volume-title":"Conference on Email and Anti-Spam","author":"Chellapilla K.","year":"2005","unstructured":"K. Chellapilla , K. Larson , P. Simard , and M. Czerwinski . Computers beat humans at single character recognition in reading based human interaction proofs (hips) . In Conference on Email and Anti-Spam , 2005 . K. Chellapilla, K. Larson, P. Simard, and M. Czerwinski. Computers beat humans at single character recognition in reading based human interaction proofs (hips). In Conference on Email and Anti-Spam, 2005."},{"key":"e_1_3_2_1_4_1","volume-title":"Online fund-raising mechanisms: A field experiment. Contributions to Economic Analysis and Policy, 5(2)","author":"Chen Y.","year":"2006","unstructured":"Y. Chen , X. Li , and J. K. MacKie-Mason . Online fund-raising mechanisms: A field experiment. Contributions to Economic Analysis and Policy, 5(2) , 2006 . Y. Chen, X. Li, and J. K. MacKie-Mason. Online fund-raising mechanisms: A field experiment. Contributions to Economic Analysis and Policy, 5(2), 2006."},{"key":"e_1_3_2_1_5_1","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","author":"Dwork C.","year":"2003","unstructured":"C. Dwork , A. Goldberg , and M. Naor . On memory bound functions for fighting spam . In G. Goos, J. Hartmanis, and J. van Leeuwan, editors, Advances in Cryptology - CRYPTO 2003 , number 2729 in Lecture Notes in Computer Science , pages 426 -- 444 . Springer-Verlag , 2003. C. Dwork, A. Goldberg, and M. Naor. On memory bound functions for fighting spam. In G. Goos, J. Hartmanis, and J. van Leeuwan, editors, Advances in Cryptology - CRYPTO 2003, number 2729 in Lecture Notes in Computer Science, pages 426--444. Springer-Verlag, 2003."},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.5555\/646757.705669"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.5555\/647502.728317"},{"key":"e_1_3_2_1_9_1","volume-title":"The Theory of Incentives","author":"Laffont J.-J.","year":"2001","unstructured":"J.-J. Laffont and D. Martimort . The Theory of Incentives . Princeton University Press , 2001 . J.-J. Laffont and D. Martimort. The Theory of Incentives. Princeton University Press, 2001."},{"key":"e_1_3_2_1_10_1","volume-title":"Workshop on the Economics of Information Security","author":"Laurie B.","year":"2004","unstructured":"B. Laurie and R. Clayton . Proof of work proves not to work . In Workshop on the Economics of Information Security , 2004 . B. Laurie and R. Clayton. Proof of work proves not to work. In Workshop on the Economics of Information Security, 2004."},{"key":"e_1_3_2_1_11_1","volume-title":"Proof of work can work. Technical report","author":"Liu D.","year":"2006","unstructured":"D. Liu and L. J. Camp . Proof of work can work. Technical report , NET Institute , October 2006 . Working Paper No. 06-18. D. Liu and L. J. Camp. Proof of work can work. Technical report, NET Institute, October 2006. Working Paper No. 06-18."},{"key":"e_1_3_2_1_12_1","volume-title":"An economic response to unsolicited communication. Advances in Economic Analysis and Policy, 6(1)","author":"Loder T.","year":"2006","unstructured":"T. Loder , M. van Alstyne , and R. Wash . An economic response to unsolicited communication. Advances in Economic Analysis and Policy, 6(1) , 2006 . T. Loder, M. van Alstyne, and R. Wash. An economic response to unsolicited communication. Advances in Economic Analysis and Policy, 6(1), 2006."},{"key":"e_1_3_2_1_13_1","volume-title":"Service architecture and content provision: The network provider as editor","author":"MacKie-Mason J.","year":"1996","unstructured":"J. MacKie-Mason , S. Shenker , and H. Varian . Service architecture and content provision: The network provider as editor . Telecommunications Policy , 20(3), April 1996 . J. MacKie-Mason, S. Shenker, and H. Varian. Service architecture and content provision: The network provider as editor. Telecommunications Policy, 20(3), April 1996."},{"key":"e_1_3_2_1_14_1","volume-title":"Microeconomic Theory","author":"Mas-Colell A.","year":"1995","unstructured":"A. Mas-Colell , M. D. Whinston , and J. R. Green . Microeconomic Theory . Oxford University Press , 1995 . A. Mas-Colell, M. D. Whinston, and J. R. Green. Microeconomic Theory. Oxford University Press, 1995."},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.2307\/1912346"},{"key":"e_1_3_2_1_16_1","volume-title":"June 26","author":"Naraine R.","year":"2006","unstructured":"R. Naraine . ' detailed exploit' published for critial windows flaw. eWeek.com , June 26 2006 . R. Naraine. 'detailed exploit' published for critial windows flaw. eWeek.com, June 26 2006."},{"key":"e_1_3_2_1_17_1","volume-title":"April 13","author":"Naraine R.","year":"2006","unstructured":"R. Naraine . Microsoft's security disclosures come under fire. eWeek.com , April 13 2006 . R. Naraine. Microsoft's security disclosures come under fire. eWeek.com, April 13 2006."},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/1105664.1105677"},{"key":"e_1_3_2_1_19_1","unstructured":"The Honeynet Project. Know your enemy: Tracking botnets. Published on the Web.  The Honeynet Project. Know your enemy: Tracking botnets. Published on the Web."},{"key":"e_1_3_2_1_20_1","first-page":"285","volume-title":"Proceedings of the 12th USENIX Security Symposium","author":"Twycross J.","year":"2003","unstructured":"J. Twycross and M. Williamson . Implementing and testing a virus throttle . In Proceedings of the 12th USENIX Security Symposium , pages 285 -- 294 . USENIX, 2003 . J. Twycross and M. Williamson. Implementing and testing a virus throttle. In Proceedings of the 12th USENIX Security Symposium, pages 285--294. USENIX, 2003."},{"key":"e_1_3_2_1_21_1","series-title":"Lecture Notes in Computer Science","volume-title":"Proceedings of EUROCRYPT 03","author":"von Ahn L.","year":"2003","unstructured":"L. von Ahn , M. Blum , N. Hopper , and J. Langford . Captcha: Using hard AI problems for security . In Proceedings of EUROCRYPT 03 , Lecture Notes in Computer Science , 2003 . L. von Ahn, M. Blum, N. Hopper, and J. Langford. Captcha: Using hard AI problems for security. In Proceedings of EUROCRYPT 03, Lecture Notes in Computer Science, 2003."},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/985692.985733"}],"event":{"name":"ICEC07: Ninth International Conference on Electronic Commerce","sponsor":["SIGAI ACM Special Interest Group on Artificial Intelligence","ACM Association for Computing Machinery","SIGecom Special Interest Group on Economics and Computation"],"location":"Minneapolis MN USA","acronym":"ICEC07"},"container-title":["Proceedings of the ninth international conference on Electronic commerce"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1282100.1282105","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1282100.1282105","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T14:58:18Z","timestamp":1750258698000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1282100.1282105"}},"subtitle":["structuring incentives for user behavior"],"short-title":[],"issued":{"date-parts":[[2007,8,19]]},"references-count":21,"alternative-id":["10.1145\/1282100.1282105","10.1145\/1282100"],"URL":"https:\/\/doi.org\/10.1145\/1282100.1282105","relation":{},"subject":[],"published":{"date-parts":[[2007,8,19]]},"assertion":[{"value":"2007-08-19","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}