{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,19]],"date-time":"2026-02-19T02:17:50Z","timestamp":1771467470644,"version":"3.50.1"},"reference-count":51,"publisher":"Association for Computing Machinery (ACM)","issue":"2","license":[{"start":{"date-parts":[[2024,6,12]],"date-time":"2024-06-12T00:00:00Z","timestamp":1718150400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"ONR","award":["N00014-18-1-2670 and N00014-20-1-2407"],"award-info":[{"award-number":["N00014-18-1-2670 and N00014-20-1-2407"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["ACM Trans. Manage. Inf. Syst."],"published-print":{"date-parts":[[2024,6,30]]},"abstract":"<jats:p>\n            Intellectual property (IP) theft is a growing problem. We build on prior work to deter IP theft by generating\n            <jats:italic>n<\/jats:italic>\n            fake versions of a technical document so a thief has to expend time and effort in identifying the correct document. Our new\n            <jats:sans-serif>SbFAKE<\/jats:sans-serif>\n            framework proposes, for the first time, a novel combination of language processing, optimization, and the psycholinguistic concept of surprisal to generate a set of such fakes. We start by combining psycholinguistic-based surprisal scores and optimization to generate two bilevel surprisal optimization problems (an Explicit one and a simpler Implicit one) whose solutions correspond directly to the desired set of fakes. As bilevel problems are usually hard to solve, we then show that these two bilevel surprisal optimization problems can each be reduced to equivalent surprisal-based linear programs. We performed detailed parameter tuning experiments and identified the best parameters for each of these algorithms. We then tested these two variants of\n            <jats:sans-serif>SbFAKE<\/jats:sans-serif>\n            (with their best parameter settings) against the best performing prior work in the field. Our experiments show that\n            <jats:sans-serif>SbFAKE<\/jats:sans-serif>\n            is able to more effectively generate convincing fakes than past work. In addition, we show that replacing words in an original document with words having similar surprisal scores generates greater levels of deception.\n          <\/jats:p>","DOI":"10.1145\/3651313","type":"journal-article","created":{"date-parts":[[2024,3,6]],"date-time":"2024-03-06T12:06:09Z","timestamp":1709726769000},"page":"1-25","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":1,"title":["A Psycholinguistics-inspired Method to Counter IP Theft Using Fake Documents"],"prefix":"10.1145","volume":"15","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-9719-2461","authenticated-orcid":false,"given":"Natalia","family":"Denisenko","sequence":"first","affiliation":[{"name":"Department of Computer Science and Buffett Institute for Global Affairs, Northwestern University, Evanston, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2984-734X","authenticated-orcid":false,"given":"Youzhi","family":"Zhang","sequence":"additional","affiliation":[{"name":"Centre for Artificial Intelligence and Robotics, Hong Kong Institute of Science &amp; Innovation, Chinese Academy of Sciences, Hong Kong, Hong Kong"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0751-697X","authenticated-orcid":false,"given":"Chiara","family":"Pulice","sequence":"additional","affiliation":[{"name":"Department of Computer Science and Buffett Institute for Global Affairs, Northwestern University, Evanston, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6767-6529","authenticated-orcid":false,"given":"Shohini","family":"Bhattasali","sequence":"additional","affiliation":[{"name":"Department of Language Studies, University of Toronto Scarborough and Department of Linguistics, University of Toronto, Toronto, Canada"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3210-558X","authenticated-orcid":false,"given":"Sushil","family":"Jajodia","sequence":"additional","affiliation":[{"name":"Center for Secure Information Systems, George Mason University, Fairfax, United States"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6130-8602","authenticated-orcid":false,"given":"Philip","family":"Resnik","sequence":"additional","affiliation":[{"name":"Department of Linguistics\/UMIACS, University of Maryland, College Park, United States"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7191-0296","authenticated-orcid":false,"given":"V.S.","family":"Subrahmanian","sequence":"additional","affiliation":[{"name":"Department of Computer Science and Buffett Institute for Global Affairs, Northwestern University, Evanston, United States"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2024,6,12]]},"reference":[{"key":"e_1_3_2_2_2","doi-asserted-by":"publisher","DOI":"10.1145\/3418289"},{"key":"e_1_3_2_3_2","doi-asserted-by":"publisher","DOI":"10.3389\/fpsyg.2018.02387"},{"key":"e_1_3_2_4_2","first-page":"1","volume-title":"IEEE Asia-Pacific Conference on Computer Science and Data Engineering (CSDE\u201921)","author":"Aoike Yu","year":"2021","unstructured":"Yu Aoike, Masaki Kamizono, Masashi Eto, Noriko Matsumoto, and Norihiko Yoshida. 2021. Decoy-file-based deception without usability degradation. In IEEE Asia-Pacific Conference on Computer Science and Data Engineering (CSDE\u201921). IEEE, 1\u20137."},{"key":"e_1_3_2_5_2","doi-asserted-by":"publisher","DOI":"10.18653\/v1\/2021.findings-acl.332"},{"issue":"1","key":"e_1_3_2_6_2","article-title":"Parsing costs as predictors of reading difficulty: An evaluation using the Potsdam sentence corpus","volume":"2","author":"Boston Marisa Ferrara","year":"2008","unstructured":"Marisa Ferrara Boston, John Hale, Reinhold Kliegl, Umesh Patil, and Shravan Vasishth. 2008. Parsing costs as predictors of reading difficulty: An evaluation using the Potsdam sentence corpus. J. Eye Movem. Res. 2, 1 (2008).","journal-title":"J. Eye Movem. Res."},{"key":"e_1_3_2_7_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.bandl.2016.04.008"},{"key":"e_1_3_2_8_2","doi-asserted-by":"publisher","DOI":"10.7554\/eLife.72056"},{"issue":"2","key":"e_1_3_2_9_2","doi-asserted-by":"crossref","first-page":"518","DOI":"10.1109\/TDSC.2019.2898661","article-title":"A fake online repository generation engine for cyber deception","volume":"18","author":"Chakraborty Tanmoy","year":"2019","unstructured":"Tanmoy Chakraborty, Sushil Jajodia, Jonathan Katz, Antonio Picariello, Giancarlo Sperli, and V. S. Subrahmanian. 2019. A fake online repository generation engine for cyber deception. IEEE Trans. Depend. Sec. Comput. 18, 2 (2019), 518\u2013533.","journal-title":"IEEE Trans. Depend. Sec. Comput."},{"key":"e_1_3_2_10_2","doi-asserted-by":"publisher","DOI":"10.1145\/3190619.3190639"},{"key":"e_1_3_2_11_2","first-page":"2074","volume-title":"International Joint Conference on Artificial Intelligence","author":"Chen Haipeng","year":"2019","unstructured":"Haipeng Chen, Sushil Jajodia, Jing Liu, Noseong Park, Vadim Sokolov, and VS Subrahmanian. 2019. FakeTables: Using GANs to generate functional dependency preserving tables with bounded real data. In International Joint Conference on Artificial Intelligence. 2074\u20132080."},{"key":"e_1_3_2_12_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.cognition.2008.07.008"},{"key":"e_1_3_2_13_2","first-page":"356","volume-title":"Joint Conference on Empirical Methods in Natural Language Processing and Computational Natural Language Learning","author":"Demberg Vera","year":"2012","unstructured":"Vera Demberg, Asad Sayeed, Philip Gorinski, and Nikolaos Engonopoulos. 2012. Syntactic surprisal affects spoken word duration in conversational contexts. In Joint Conference on Empirical Methods in Natural Language Processing and Computational Natural Language Learning. 356\u2013367."},{"issue":"2","key":"e_1_3_2_14_2","doi-asserted-by":"crossref","first-page":"385","DOI":"10.1016\/j.neuron.2019.10.019","article-title":"Two distinct neural timescales for predictive speech processing","volume":"105","author":"Donhauser Peter W.","year":"2020","unstructured":"Peter W. Donhauser and Sylvain Baillet. 2020. Two distinct neural timescales for predictive speech processing. Neuron 105, 2 (2020), 385\u2013393.","journal-title":"Neuron"},{"issue":"4","key":"e_1_3_2_15_2","doi-asserted-by":"crossref","first-page":"357","DOI":"10.1080\/23273798.2014.980750","article-title":"Towards a computational (ist) neurobiology of language: Correlational, integrated and explanatory neurolinguistics","volume":"30","author":"Embick David","year":"2015","unstructured":"David Embick and David Poeppel. 2015. Towards a computational (ist) neurobiology of language: Correlational, integrated and explanatory neurolinguistics. Lang., Cogn. Neurosci. 30, 4 (2015), 357\u2013366.","journal-title":"Lang., Cogn. Neurosci."},{"key":"e_1_3_2_16_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.patrec.2022.05.023"},{"key":"e_1_3_2_17_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.engappai.2022.104743"},{"key":"e_1_3_2_18_2","doi-asserted-by":"crossref","first-page":"20","DOI":"10.1007\/978-3-030-86137-7_3","volume-title":"16th International Conference on Wireless Algorithms, Systems, and Applications (WASA\u201921)","author":"Feng Yun","year":"2021","unstructured":"Yun Feng, Baoxu Liu, Yue Zhang, Jinli Zhang, Chaoge Liu, and Qixu Liu. 2021. Automated honey document generation using genetic algorithm. In 16th International Conference on Wireless Algorithms, Systems, and Applications (WASA\u201921). Springer, 20\u201328."},{"key":"e_1_3_2_19_2","first-page":"10","volume-title":"8th Workshop on Cognitive Modeling and Computational Linguistics (CMCL\u201918)","author":"Goodkind Adam","year":"2018","unstructured":"Adam Goodkind and Klinton Bicknell. 2018. Predictive power of word surprisal for reading times is a linear function of language model quality. In 8th Workshop on Cognitive Modeling and Computational Linguistics (CMCL\u201918). 10\u201318."},{"key":"e_1_3_2_20_2","volume-title":"2nd Meeting of the North American Chapter of the Association for Computational Linguistics","author":"Hale John","year":"2001","unstructured":"John Hale. 2001. A probabilistic Earley parser as a psycholinguistic model. In 2nd Meeting of the North American Chapter of the Association for Computational Linguistics."},{"key":"e_1_3_2_21_2","doi-asserted-by":"publisher","DOI":"10.1111\/lnc3.12196"},{"issue":"4","key":"e_1_3_2_22_2","doi-asserted-by":"crossref","first-page":"2428","DOI":"10.1109\/TDSC.2021.3058994","article-title":"Generating fake documents using probabilistic logic graphs","volume":"19","author":"Han Qian","year":"2021","unstructured":"Qian Han, Cristian Molinaro, Antonio Picariello, Giancarlo Sperli, Venkatramanan S. Subrahmanian, and Yanhai Xiong. 2021. Generating fake documents using probabilistic logic graphs. IEEE Trans. Depend. Sec. Comput. 19, 4 (2021), 2428\u20132441.","journal-title":"IEEE Trans. Depend. Sec. Comput."},{"key":"e_1_3_2_23_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.neuroimage.2016.02.050"},{"key":"e_1_3_2_24_2","unstructured":"Thomas Himmler. U.S. Patent US7629476B2 Dec. 2009. Method for producing 2 5-dimethylphenyl acetic acid. (U.S. Patent US7629476B2 Dec. 2009)."},{"key":"e_1_3_2_25_2","article-title":"Controllable fake document infilling for cyber deception","author":"Hu Yibo","year":"2022","unstructured":"Yibo Hu, Yu Lin, Erick Skorupa Parolin, Latifur Khan, and Kevin Hamlen. 2022. Controllable fake document infilling for cyber deception. arXiv preprint arXiv:2210.09917 (2022).","journal-title":"arXiv preprint arXiv:2210.09917"},{"key":"e_1_3_2_26_2","volume-title":"Attention and Effort","author":"Kahneman Daniel","year":"1973","unstructured":"Daniel Kahneman. 1973. Attention and Effort. Prentice-Hall."},{"key":"e_1_3_2_27_2","first-page":"4155","volume-title":"AAAI Conference on Artificial Intelligence","volume":"35","author":"Kang Snow","year":"2021","unstructured":"Snow Kang, Cristian Molinaro, Andrea Pugliese, and V. S. Subrahmanian. 2021. Randomized generation of adversary-aware fake knowledge graphs to combat intellectual property theft. In AAAI Conference on Artificial Intelligence, Vol. 35. 4155\u20134163."},{"issue":"6","key":"e_1_3_2_28_2","article-title":"Analysis of network traffic and security through log aggregation","volume":"16","author":"Kumar Arun","year":"2018","unstructured":"Arun Kumar, Ananya Bandyopadhyay, H. Bhoomika, Ishan Singhania, and Krupal Shah. 2018. Analysis of network traffic and security through log aggregation. Int. J. Comput. Sci. Inf. Secur. 16, 6 (2018).","journal-title":"Int. J. Comput. Sci. Inf. Secur."},{"key":"e_1_3_2_29_2","doi-asserted-by":"publisher","DOI":"10.1109\/MIS.2016.45"},{"key":"e_1_3_2_30_2","first-page":"142","article-title":"Memory and surprisal in human sentence comprehension","volume":"78","author":"Levy Roger","year":"2013","unstructured":"Roger Levy. 2013. Memory and surprisal in human sentence comprehension. Sent. Process. 78 (2013), 142\u2013195.","journal-title":"Sent. Process."},{"key":"e_1_3_2_31_2","doi-asserted-by":"publisher","DOI":"10.1049\/ise2.12050"},{"key":"e_1_3_2_32_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.cognition.2022.105359"},{"key":"e_1_3_2_33_2","article-title":"A survey on contextual embeddings","author":"Liu Qi","year":"2020","unstructured":"Qi Liu, Matt J. Kusner, and Phil Blunsom. 2020. A survey on contextual embeddings. arXiv preprint arXiv:2003.07278 (2020).","journal-title":"arXiv preprint arXiv:2003.07278"},{"key":"e_1_3_2_34_2","first-page":"1","article-title":"Tabular data synthesis with generative adversarial networks: Design space and optimizations","author":"Liu Tongyu","year":"2023","unstructured":"Tongyu Liu, Ju Fan, Guoliang Li, Nan Tang, and Xiaoyong Du. 2023. Tabular data synthesis with generative adversarial networks: Design space and optimizations. VLDB J. (2023), 1\u201326.","journal-title":"VLDB J."},{"key":"e_1_3_2_35_2","first-page":"1","article-title":"Strong prediction: Language model surprisal explains multiple N400 effects","author":"Michaelov James A.","year":"2023","unstructured":"James A. Michaelov, Megan D. Bardolph, Cyma K. Van Petten, Benjamin K. Bergen, and Seana Coulson. 2023. Strong prediction: Language model surprisal explains multiple N400 effects. Cognitive Computational Neuroscience of Language (2023), 1\u201371.","journal-title":"Cognitive Computational Neuroscience of Language"},{"key":"e_1_3_2_36_2","article-title":"A survey on honeypot software and data analysis","author":"Nawrocki Marcin","year":"2016","unstructured":"Marcin Nawrocki, Matthias W\u00e4hlisch, Thomas C. Schmidt, Christian Keil, and Jochen Sch\u00f6nfelder. 2016. A survey on honeypot software and data analysis. arXiv preprint arXiv:1608.06249 (2016).","journal-title":"arXiv preprint arXiv:1608.06249"},{"key":"e_1_3_2_37_2","first-page":"1906","volume-title":"IEEE International Conference on Big Data (Big Data\u201922)","author":"Parolin Erick Skorupa","year":"2022","unstructured":"Erick Skorupa Parolin, Yibo Hu, Latifur Khan, Patrick T. Brandt, Javier Osorio, and Vito D\u2019Orazio. 2022. Confli-T5: An AutoPrompt pipeline for conflict related text augmentation. In IEEE International Conference on Big Data (Big Data\u201922). IEEE, 1906\u20131913."},{"key":"e_1_3_2_38_2","doi-asserted-by":"publisher","DOI":"10.1038\/s41562-018-0406-4"},{"key":"e_1_3_2_39_2","first-page":"324","volume-title":"Conference on Empirical Methods in Natural Language Processing","author":"Roark Brian","year":"2009","unstructured":"Brian Roark, Asaf Bachrach, Carlos Cardenas, and Christophe Pallier. 2009. Deriving lexical and syntactic expectation-based measures for psycholinguistic modeling via incremental top-down parsing. In Conference on Empirical Methods in Natural Language Processing. 324\u2013333."},{"key":"e_1_3_2_40_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.neuropsychologia.2019.107307"},{"key":"e_1_3_2_41_2","doi-asserted-by":"publisher","unstructured":"Cory Shain Clara Meister Tiago Pimentel Ryan Cotterell and Roger Philip Levy. 2024. Large-scale evidence for logarithmic effects of word predictability on reading time. In Proceedings of the National Academy of Sciences 121 10 (2024). 10.1073\/pnas.2307876121","DOI":"10.1073\/pnas.2307876121"},{"key":"e_1_3_2_42_2","volume-title":"Annual Meeting of the Cognitive Science Society","author":"Smith Nathaniel J.","year":"2008","unstructured":"Nathaniel J. Smith and Roger Levy. 2008. Optimal processing times in reading: A formal model and empirical investigation. In Annual Meeting of the Cognitive Science Society, Vol. 30."},{"key":"e_1_3_2_43_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.cognition.2013.02.013"},{"key":"e_1_3_2_44_2","doi-asserted-by":"publisher","DOI":"10.1109\/CSAC.2003.1254322"},{"key":"e_1_3_2_45_2","first-page":"371","volume-title":"The On-line Study of Sentence Comprehension","author":"Tanenhaus Michael K.","year":"2004","unstructured":"Michael K. Tanenhaus. 2004. On-line sentence processing: Past, present, and future. In The On-line Study of Sentence Comprehension. Psychology Press, 371\u2013394."},{"key":"e_1_3_2_46_2","first-page":"1597","volume-title":"Conference of the North American Chapter of the Association for Computational Linguistics: Human Language Technologies","author":"Schijndel Marten Van","year":"2015","unstructured":"Marten Van Schijndel and William Schuler. 2015. Hierarchic syntax improves reading time prediction. In Conference of the North American Chapter of the Association for Computational Linguistics: Human Language Technologies. 1597\u20131605."},{"key":"e_1_3_2_47_2","first-page":"87","volume-title":"6th International Conference On Cyber Conflict (CyCon\u201914)","author":"Virvilis Nikos","year":"2014","unstructured":"Nikos Virvilis, Bart Vanautgaerden, and Oscar Serrano Serrano. 2014. Changing the game: The art of deceiving sophisticated attackers. In 6th International Conference On Cyber Conflict (CyCon\u201914). IEEE, 87\u201397."},{"key":"e_1_3_2_48_2","doi-asserted-by":"publisher","DOI":"10.1109\/TIFS.2018.2825952"},{"key":"e_1_3_2_49_2","article-title":"On the predictive power of neural language models for human real-time comprehension behavior","author":"Wilcox Ethan Gotlieb","year":"2020","unstructured":"Ethan Gotlieb Wilcox, Jon Gauthier, Jennifer Hu, Peng Qian, and Roger Levy. 2020. On the predictive power of neural language models for human real-time comprehension behavior. arXiv preprint arXiv:2006.01912 (2020).","journal-title":"arXiv preprint arXiv:2006.01912"},{"issue":"3","key":"e_1_3_2_50_2","doi-asserted-by":"crossref","first-page":"1434","DOI":"10.1109\/TDSC.2020.3038132","article-title":"Generating realistic fake equations in order to reduce intellectual property theft","volume":"19","author":"Xiong Yanhai","year":"2020","unstructured":"Yanhai Xiong, Giridhar Kaushik Ramachandran, Rajesh Ganesan, Sushil Jajodia, and V. S. Subrahmanian. 2020. Generating realistic fake equations in order to reduce intellectual property theft. IEEE Trans. Depend. Sec. Comput. 19, 3 (2020), 1434\u20131445.","journal-title":"IEEE Trans. Depend. Sec. Comput."},{"key":"e_1_3_2_51_2","doi-asserted-by":"publisher","DOI":"10.1109\/TNN.2005.845141"},{"key":"e_1_3_2_52_2","first-page":"116","volume-title":"5th Annual IEEE SMC Information Assurance Workshop.","author":"Yuill Jim","year":"2004","unstructured":"Jim Yuill, Mike Zappe, Dorothy Denning, and Fred Feer. 2004. Honeyfiles: Deceptive files for intrusion detection. In 5th Annual IEEE SMC Information Assurance Workshop. IEEE, 116\u2013122."}],"container-title":["ACM Transactions on Management Information Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3651313","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3651313","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T22:49:54Z","timestamp":1750286994000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3651313"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,6,12]]},"references-count":51,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2024,6,30]]}},"alternative-id":["10.1145\/3651313"],"URL":"https:\/\/doi.org\/10.1145\/3651313","relation":{},"ISSN":["2158-656X","2158-6578"],"issn-type":[{"value":"2158-656X","type":"print"},{"value":"2158-6578","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,6,12]]},"assertion":[{"value":"2023-10-19","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2024-03-02","order":1,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2024-06-12","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}