{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,10]],"date-time":"2026-01-10T01:36:25Z","timestamp":1768008985187,"version":"3.49.0"},"reference-count":12,"publisher":"Association for Computing Machinery (ACM)","issue":"5","license":[{"start":{"date-parts":[[2014,5,1]],"date-time":"2014-05-01T00:00:00Z","timestamp":1398902400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000005","name":"U.S. Department of Defense","doi-asserted-by":"publisher","id":[{"id":"10.13039\/100000005","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["Commun. ACM"],"published-print":{"date-parts":[[2014,5]]},"abstract":"<jats:p>\n            Cryptographic systems often rely on the secrecy of cryptographic keys given to users. Many schemes, however, cannot resist coercion attacks where the user is forcibly asked by an attacker to reveal the key. These attacks, known as\n            <jats:italic>rubber hose cryptanalysis<\/jats:italic>\n            , are often the easiest way to defeat cryptography. We present a defense against coercion attacks using the concept of\n            <jats:italic>implicit learning<\/jats:italic>\n            from cognitive psychology. Implicit learning refers to learning of patterns without any conscious knowledge of the learned pattern. We use a carefully crafted computer game to allow a user to implicitly learn a secret password without them having any explicit or conscious knowledge of the trained password. While the trained secret can be used for authentication, participants cannot be coerced into revealing it since they have no conscious knowledge of it. We performed a number of user studies using Amazon's Mechanical Turk to verify that participants can successfully re-authenticate over time and that they are unable to reconstruct or even robustly recognize the trained secret.\n          <\/jats:p>","DOI":"10.1145\/2594445","type":"journal-article","created":{"date-parts":[[2014,4,28]],"date-time":"2014-04-28T15:24:14Z","timestamp":1398698654000},"page":"110-118","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":13,"title":["Neuroscience meets cryptography"],"prefix":"10.1145","volume":"57","author":[{"given":"Hristo","family":"Bojinov","sequence":"first","affiliation":[{"name":"Stanford University, Stanford, CA"}]},{"given":"Daniel","family":"Sanchez","sequence":"additional","affiliation":[{"name":"Northwestern University, Evanston, IL"}]},{"given":"Paul","family":"Reber","sequence":"additional","affiliation":[{"name":"Northwestern University, Evanston, IL"}]},{"given":"Dan","family":"Boneh","sequence":"additional","affiliation":[{"name":"Stanford University, Stanford, CA"}]},{"given":"Patrick","family":"Lincoln","sequence":"additional","affiliation":[{"name":"SRI International, Menlo Park, CA"}]}],"member":"320","published-online":{"date-parts":[[2014,5]]},"reference":[{"key":"e_1_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/1978942.1979323"},{"key":"e_1_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.3758\/BF03196171"},{"key":"e_1_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1037\/a0032305"},{"key":"e_1_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1037\/a0022959"},{"key":"e_1_2_1_5_1","first-page":"123","article-title":"Cognitive neuroscience of declarative and non-declarative memory. Parallels in Learning and Memory. M. Guadagnoli, M.S. deBelle, B. Etnyre, T. Polk, and A. Benjamin, eds","volume":"113","author":"Reber P","year":"2008","unstructured":"Reber , P . Cognitive neuroscience of declarative and non-declarative memory. Parallels in Learning and Memory. M. Guadagnoli, M.S. deBelle, B. Etnyre, T. Polk, and A. Benjamin, eds . North-Holland , 2008 , 113 -- 123 . Reber, P. Cognitive neuroscience of declarative and non-declarative memory. Parallels in Learning and Memory. M. Guadagnoli, M.S. deBelle, B. Etnyre, T. Polk, and A. Benjamin, eds. North-Holland, 2008, 113--123.","journal-title":"North-Holland"},{"key":"e_1_2_1_6_1","volume-title":"Poster at the Meeting of the Society for Neuroscience","author":"Sanchez D.","year":"2012","unstructured":"Sanchez , D. , Bojinov , H. , Lincoln , P. , Boneh , D. , Reber , P. Statistical learning in perceptual-motor sequences and planning effects in performance . In Poster at the Meeting of the Society for Neuroscience ( 2012 ). Sanchez, D., Bojinov, H., Lincoln, P., Boneh, D., Reber, P. Statistical learning in perceptual-motor sequences and planning effects in performance. In Poster at the Meeting of the Society for Neuroscience (2012)."},{"key":"e_1_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.3758\/PBR.17.6.790"},{"key":"e_1_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1037\/a0026347"},{"key":"e_1_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.5709\/acp-0113-1"},{"key":"e_1_2_1_10_1","volume-title":"Turkish police may have beaten encryption key out of TJ Maxx suspect","author":"Soghoian C.","year":"2008","unstructured":"Soghoian , C. Turkish police may have beaten encryption key out of TJ Maxx suspect , 2008 . news.cnet.com\/8301-13739_3-10069776-46.html. Soghoian, C. Turkish police may have beaten encryption key out of TJ Maxx suspect, 2008. news.cnet.com\/8301-13739_3-10069776-46.html."},{"key":"e_1_2_1_11_1","first-page":"203","article-title":"Circuits and trees in oriented linear graphs","volume":"28","author":"van Aardenne-Ehrenfest T.","year":"1951","unstructured":"van Aardenne-Ehrenfest , T. , de Bruijn , N.G . Circuits and trees in oriented linear graphs . Simon Stevin 28 ( 1951 ), 203 -- 217 . van Aardenne-Ehrenfest, T., de Bruijn, N.G. Circuits and trees in oriented linear graphs. Simon Stevin 28 (1951), 203--217.","journal-title":"Simon Stevin"},{"key":"e_1_2_1_12_1","volume-title":"Rubber-hose cryptanalysis","author":"Wikipedia","year":"2011","unstructured":"Wikipedia . Rubber-hose cryptanalysis , 2011 . Wikipedia. Rubber-hose cryptanalysis, 2011."}],"container-title":["Communications of the ACM"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2594445","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2594445","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T07:00:52Z","timestamp":1750230052000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2594445"}},"subtitle":["crypto primitives secure against rubber hose attacks"],"short-title":[],"issued":{"date-parts":[[2014,5]]},"references-count":12,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2014,5]]}},"alternative-id":["10.1145\/2594445"],"URL":"https:\/\/doi.org\/10.1145\/2594445","relation":{},"ISSN":["0001-0782","1557-7317"],"issn-type":[{"value":"0001-0782","type":"print"},{"value":"1557-7317","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014,5]]},"assertion":[{"value":"2014-05-01","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}