{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,12]],"date-time":"2026-06-12T15:44:26Z","timestamp":1781279066581,"version":"3.54.1"},"reference-count":54,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"5","license":[{"start":{"date-parts":[[2024,9,1]],"date-time":"2024-09-01T00:00:00Z","timestamp":1725148800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2024,9,1]],"date-time":"2024-09-01T00:00:00Z","timestamp":1725148800000},"content-version":"am","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2024,9,1]],"date-time":"2024-09-01T00:00:00Z","timestamp":1725148800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2024,9,1]],"date-time":"2024-09-01T00:00:00Z","timestamp":1725148800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["2413654"],"award-info":[{"award-number":["2413654"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["2054968"],"award-info":[{"award-number":["2054968"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Microsoft Faculty Fellowship Program"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Dependable and Secure Comput."],"published-print":{"date-parts":[[2024,9]]},"DOI":"10.1109\/tdsc.2024.3359817","type":"journal-article","created":{"date-parts":[[2024,1,29]],"date-time":"2024-01-29T18:53:46Z","timestamp":1706554426000},"page":"4754-4769","source":"Crossref","is-referenced-by-count":7,"title":["A Semantic, Syntactic, and Context-Aware Natural Language Adversarial Example Generator"],"prefix":"10.1109","volume":"21","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-6154-1068","authenticated-orcid":false,"given":"Javad Rafiei","family":"Asl","sequence":"first","affiliation":[{"name":"Department of Computer Science, Georgia State University, Atlanta, GA, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4923-9584","authenticated-orcid":false,"given":"Mohammad H.","family":"Rafiei","sequence":"additional","affiliation":[{"name":"Department of Computer Science, Georgia State University, Atlanta, GA, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7460-2635","authenticated-orcid":false,"given":"Manar","family":"Alohaly","sequence":"additional","affiliation":[{"name":"Department of Information Systems, College of Computer and Information Sciences, Princess Nourah Bint Abdulrahman University, Riyadh, Saudi Arabia"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-0447-3641","authenticated-orcid":false,"given":"Daniel","family":"Takabi","sequence":"additional","affiliation":[{"name":"School of Cybersecurity, Old Dominion University, Norfolk, VA, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"263","reference":[{"key":"ref1","article-title":"Explaining and harnessing adversarial examples","volume-title":"Proc. 3rd Int. Conf. Learn. Representations","author":"Goodfellow"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1201\/9781351251389-8"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1145\/3374217"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v34i04.6017"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1007\/s11633-019-1211-x"},{"key":"ref6","first-page":"6586","article-title":"On the convergence and robustness of adversarial training","volume-title":"Proc. 36th Int. Conf. Mach. Learn.","author":"Wang"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1145\/3052973.3053009"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1049\/cit2.12028"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v34i05.6311"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.18653\/v1\/2020.emnlp-main.500"},{"key":"ref11","first-page":"3724","article-title":"Universal adversarial attacks with natural triggers for text classification","volume-title":"Proc. Conf. North Amer. Chapter Assoc. Computat. Linguistics: Hum. Lang. Technol.","author":"Song"},{"key":"ref12","first-page":"6174","article-title":"BAE: BERT-based adversarial examples for text classification","volume-title":"Proc. Conf. Empirical Methods Natural Lang. Process.","author":"Garg"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.48550\/arXiv.1810.04805"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.18653\/v1\/D18-2029"},{"issue":"8","key":"ref15","article-title":"Language models are unsupervised multitask learners","volume":"1","author":"Radford","year":"2019","journal-title":"OpenAI Blog"},{"key":"ref16","doi-asserted-by":"crossref","DOI":"10.14722\/ndss.2019.23138","article-title":"TextBugger: Generating adversarial text against real-world applications","volume-title":"Proc. Netw. Distrib. Syst. Secur. Symp. Internet Soc.","author":"Li"},{"key":"ref17","first-page":"2021","article-title":"Adversarial examples for evaluating reading comprehension systems","volume-title":"Proc. Conf. Empirical Methods Natural Lang. Process.","author":"Jia"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v35i15.17595"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2022.119110"},{"key":"ref20","first-page":"12478","article-title":"Query-efficient and scalable black-box adversarial attacks on discrete sequential data via Bayesian optimization","volume-title":"Proc. Int. Conf. Mach. Learn.","author":"Lee"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1145\/3576923"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2022.3148413"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1145\/3548606.3560683"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2022.11.007"},{"key":"ref25","first-page":"31","article-title":"HotFlip: White-box adversarial examples for text classification","volume-title":"Proc. 56th Annu. Meeting Assoc. Comput. Linguistics","author":"Ebrahimi"},{"key":"ref26","first-page":"5902","article-title":"Adversarially regularized autoencoders","volume-title":"Proc. Int. Conf. Mach. Learn.","author":"Zhao"},{"key":"ref27","first-page":"5747","article-title":"Gradient-based adversarial attacks against text transformers","volume-title":"Proc. Conf. Empirical Methods Natural Lang. Process.","author":"Guo"},{"key":"ref28","article-title":"Categorical reparameterization with gumbel-softmax","volume-title":"Proc. Int. Conf. Learn. Representations","author":"Jang"},{"key":"ref29","article-title":"BERTScore: Evaluating text generation with bert","volume-title":"Proc. Int. Conf. Learn. Representations","author":"Zhang"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v36i10.21290"},{"key":"ref31","first-page":"3619","article-title":"Towards holistic and automatic evaluation of open-domain dialogue generation","volume-title":"Proc. 58th Annu. Meeting Assoc. Comput. Linguistics","author":"Pang"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1109\/SPW.2018.00016"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1126\/science.aaa8415"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1038\/nature14539"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.21275\/ART20203995"},{"key":"ref36","article-title":"RoBERTa: A robustly optimized bert pretraining approach","author":"Liu","year":"2020"},{"key":"ref37","article-title":"ALBERT: A lite BERT for self-supervised learning of language representations","volume-title":"Proc. Int. Conf. Learn. Representations","author":"Lan"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.5555\/3454287.3455008"},{"key":"ref39","article-title":"spaCy 2: Natural language understanding with Bloom embeddings, convolutional neural networks and incremental parsing","author":"Honnibal"},{"issue":"2","key":"ref40","first-page":"45","article-title":"Gensim\u2013python framework for vector space modelling","volume":"3","author":"Rehurek","year":"2011","journal-title":"NLP Centre, Fac. Inform., Masaryk Univ., Brno, Czech Republic"},{"key":"ref41","first-page":"38","article-title":"Transformers: State-of-the-art natural language processing","volume-title":"Proc. Conf. Empirical Methods Natural Lang. Process.: Syst. Demonstrations","author":"Wolf"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.18653\/v1\/2020.emnlp-demos.16"},{"key":"ref43","first-page":"649","article-title":"Character-level convolutional networks for text classification","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","author":"Zhang"},{"key":"ref44","first-page":"142","article-title":"Learning word vectors for sentiment analysis","volume-title":"Proc. 49th Annu. Meeting Assoc. Comput. Linguistics: Hum. Lang. Technol.","author":"Maas"},{"key":"ref45","first-page":"115","article-title":"Seeing stars: Exploiting class relationships for sentiment categorization with respect to rating scales","volume-title":"Proc. 43rd Annu. Meeting Assoc. Comput. Linguistics","author":"Pang"},{"key":"ref46","first-page":"1631","article-title":"Recursive deep models for semantic compositionality over a sentiment treebank","volume-title":"Proc. Conf. Empirical Methods Natural Lang. Process.","author":"Socher"},{"key":"ref47","first-page":"632","article-title":"A large annotated corpus for learning natural language inference","volume-title":"Proc. Conf. Empirical Methods Natural Lang. Process.","author":"Bowman"},{"key":"ref48","first-page":"1112","article-title":"A broad-coverage challenge corpus for sentence understanding through inference","volume-title":"Proc. Conf. North Amer. Chapter Assoc. Comput. Linguistics: Hum. Lang. Technol.","author":"Williams"},{"key":"ref49","article-title":"Google BERT","year":"2019"},{"key":"ref50","first-page":"2383","article-title":"SQuAD: 100,000 questions for machine comprehension of text","volume-title":"Proc. Conf. Empirical Methods Natural Lang. Process.","author":"Rajpurkar"},{"key":"ref51","doi-asserted-by":"publisher","DOI":"10.1162\/neco.1997.9.8.1735"},{"key":"ref52","first-page":"1657","article-title":"Enhanced LSTM for natural language inference","volume-title":"Proc. 55th Annu. Meeting Assoc. Comput. Linguistics","author":"Chen"},{"key":"ref53","doi-asserted-by":"publisher","DOI":"10.18653\/v1\/D19-1410"},{"key":"ref54","doi-asserted-by":"publisher","DOI":"10.18653\/v1\/2020.acl-main.703"}],"container-title":["IEEE Transactions on Dependable and Secure Computing"],"original-title":[],"link":[{"URL":"https:\/\/ieeexplore.ieee.org\/ielam\/8858\/10663874\/10416371-aam.pdf","content-type":"application\/pdf","content-version":"am","intended-application":"syndication"},{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/8858\/10663874\/10416371.pdf?arnumber=10416371","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T21:07:57Z","timestamp":1725484077000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/10416371\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,9]]},"references-count":54,"journal-issue":{"issue":"5"},"URL":"https:\/\/doi.org\/10.1109\/tdsc.2024.3359817","relation":{},"ISSN":["1545-5971","1941-0018","2160-9209"],"issn-type":[{"value":"1545-5971","type":"print"},{"value":"1941-0018","type":"electronic"},{"value":"2160-9209","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,9]]}}}