<?xml version="1.0" encoding="UTF-8"?>
<TEI xml:space="preserve" xmlns="http://www.tei-c.org/ns/1.0" 
xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" 
xsi:schemaLocation="http://www.tei-c.org/ns/1.0 https://raw.githubusercontent.com/kermitt2/grobid/master/grobid-home/schemas/xsd/Grobid.xsd"
 xmlns:xlink="http://www.w3.org/1999/xlink">
	<teiHeader xml:lang="en">
		<fileDesc>
			<titleStmt>
				<title level="a" type="main">Dawn of LLM4Cyber: Current Solutions, Challenges, and New Perspectives in Harnessing LLMs for Cybersecurity</title>
			</titleStmt>
			<publicationStmt>
				<publisher/>
				<availability status="unknown"><licence/></availability>
			</publicationStmt>
			<sourceDesc>
				<biblStruct>
					<analytic>
						<author>
							<persName><forename type="first">Luca</forename><surname>Caviglione</surname></persName>
							<email>luca.caviglione@ge.imati.cnr.it</email>
							<affiliation key="aff0">
								<orgName type="department">Institute for Applied Mathematics and Information Technologies</orgName>
								<address>
									<addrLine>Via de Marini 6</addrLine>
									<postCode>16149</postCode>
									<settlement>Genova</settlement>
									<country key="IT">Italy</country>
								</address>
							</affiliation>
						</author>
						<author>
							<persName><forename type="first">Carmela</forename><surname>Comito</surname></persName>
							<email>carmela.comito@icar.cnr.it</email>
							<affiliation key="aff1">
								<orgName type="department">Institute for High Performance Computing and Networking</orgName>
								<address>
									<addrLine>via P. Bucci 8-9/C</addrLine>
									<postCode>87036</postCode>
									<settlement>Rende</settlement>
									<country key="IT">Italy</country>
								</address>
							</affiliation>
						</author>
						<author>
							<persName><forename type="first">Erica</forename><surname>Coppolillo</surname></persName>
							<email>erica.coppolillo@icar.cnr.it</email>
							<affiliation key="aff1">
								<orgName type="department">Institute for High Performance Computing and Networking</orgName>
								<address>
									<addrLine>via P. Bucci 8-9/C</addrLine>
									<postCode>87036</postCode>
									<settlement>Rende</settlement>
									<country key="IT">Italy</country>
								</address>
							</affiliation>
							<affiliation key="aff4">
								<orgName type="institution">University of Calabria</orgName>
								<address>
									<addrLine>via P. Bucci</addrLine>
									<postCode>87036</postCode>
									<settlement>Rende</settlement>
									<country key="IT">Italy</country>
								</address>
							</affiliation>
						</author>
						<author>
							<persName><forename type="first">Daniela</forename><surname>Gallo</surname></persName>
							<email>daniela.gallo@icar.cnr.it</email>
							<affiliation key="aff1">
								<orgName type="department">Institute for High Performance Computing and Networking</orgName>
								<address>
									<addrLine>via P. Bucci 8-9/C</addrLine>
									<postCode>87036</postCode>
									<settlement>Rende</settlement>
									<country key="IT">Italy</country>
								</address>
							</affiliation>
							<affiliation key="aff2">
								<orgName type="institution">University of Salento</orgName>
								<address>
									<addrLine>Piazza Tancredi, 7</addrLine>
									<postCode>73100</postCode>
									<settlement>Lecce</settlement>
									<country key="IT">Italy</country>
								</address>
							</affiliation>
						</author>
						<author>
							<persName><forename type="first">Massimo</forename><surname>Guarascio</surname></persName>
							<email>massimo.guarascio@icar.cnr.it</email>
							<affiliation key="aff1">
								<orgName type="department">Institute for High Performance Computing and Networking</orgName>
								<address>
									<addrLine>via P. Bucci 8-9/C</addrLine>
									<postCode>87036</postCode>
									<settlement>Rende</settlement>
									<country key="IT">Italy</country>
								</address>
							</affiliation>
						</author>
						<author>
							<persName><forename type="first">Angelica</forename><surname>Liguori</surname></persName>
							<email>angelica.liguori@icar.cnr.it</email>
							<affiliation key="aff1">
								<orgName type="department">Institute for High Performance Computing and Networking</orgName>
								<address>
									<addrLine>via P. Bucci 8-9/C</addrLine>
									<postCode>87036</postCode>
									<settlement>Rende</settlement>
									<country key="IT">Italy</country>
								</address>
							</affiliation>
						</author>
						<author>
							<persName><forename type="first">Giuseppe</forename><surname>Manco</surname></persName>
							<email>giuseppe.manco@icar.cnr.it</email>
							<affiliation key="aff1">
								<orgName type="department">Institute for High Performance Computing and Networking</orgName>
								<address>
									<addrLine>via P. Bucci 8-9/C</addrLine>
									<postCode>87036</postCode>
									<settlement>Rende</settlement>
									<country key="IT">Italy</country>
								</address>
							</affiliation>
						</author>
						<author>
							<persName><forename type="first">Marco</forename><surname>Minici</surname></persName>
							<email>marco.minici@icar.cnr.it</email>
							<affiliation key="aff1">
								<orgName type="department">Institute for High Performance Computing and Networking</orgName>
								<address>
									<addrLine>via P. Bucci 8-9/C</addrLine>
									<postCode>87036</postCode>
									<settlement>Rende</settlement>
									<country key="IT">Italy</country>
								</address>
							</affiliation>
							<affiliation key="aff5">
								<orgName type="institution">University of Pisa</orgName>
								<address>
									<addrLine>via Lungarno Pacinotti</addrLine>
									<postCode>56126</postCode>
									<settlement>Pisa</settlement>
									<country key="IT">Italy</country>
								</address>
							</affiliation>
						</author>
						<author>
							<persName><forename type="first">Simone</forename><surname>Mungari</surname></persName>
							<email>simone.mungari@icar.cnr.it</email>
							<affiliation key="aff1">
								<orgName type="department">Institute for High Performance Computing and Networking</orgName>
								<address>
									<addrLine>via P. Bucci 8-9/C</addrLine>
									<postCode>87036</postCode>
									<settlement>Rende</settlement>
									<country key="IT">Italy</country>
								</address>
							</affiliation>
							<affiliation key="aff4">
								<orgName type="institution">University of Calabria</orgName>
								<address>
									<addrLine>via P. Bucci</addrLine>
									<postCode>87036</postCode>
									<settlement>Rende</settlement>
									<country key="IT">Italy</country>
								</address>
							</affiliation>
							<affiliation key="aff6">
								<orgName type="institution">Revelis s.r.l</orgName>
								<address>
									<addrLine>Viale della Resistenza</addrLine>
									<postCode>87036</postCode>
									<settlement>Rende</settlement>
									<country key="IT">Italy</country>
								</address>
							</affiliation>
						</author>
						<author>
							<persName><forename type="first">Francesco</forename><forename type="middle">Sergio</forename><surname>Pisani</surname></persName>
							<email>francescosergio.pisani@icar.cnr.it</email>
							<affiliation key="aff1">
								<orgName type="department">Institute for High Performance Computing and Networking</orgName>
								<address>
									<addrLine>via P. Bucci 8-9/C</addrLine>
									<postCode>87036</postCode>
									<settlement>Rende</settlement>
									<country key="IT">Italy</country>
								</address>
							</affiliation>
						</author>
						<author>
							<persName><forename type="first">Ettore</forename><surname>Ritacco</surname></persName>
							<email>ettore.ritacco@uniud.it</email>
							<affiliation key="aff3">
								<orgName type="institution">University of Udine</orgName>
								<address>
									<addrLine>Via Palladio, 8</addrLine>
									<postCode>33100</postCode>
									<settlement>Udine</settlement>
									<country key="IT">Italy</country>
								</address>
							</affiliation>
						</author>
						<author>
							<persName><forename type="first">Antonino</forename><surname>Rullo</surname></persName>
							<email>antonino.rullo@icar.cnr.it</email>
							<affiliation key="aff1">
								<orgName type="department">Institute for High Performance Computing and Networking</orgName>
								<address>
									<addrLine>via P. Bucci 8-9/C</addrLine>
									<postCode>87036</postCode>
									<settlement>Rende</settlement>
									<country key="IT">Italy</country>
								</address>
							</affiliation>
						</author>
						<author>
							<persName><forename type="first">Paolo</forename><surname>Zicari</surname></persName>
							<email>paolo.zicari@icar.cnr.it</email>
							<affiliation key="aff1">
								<orgName type="department">Institute for High Performance Computing and Networking</orgName>
								<address>
									<addrLine>via P. Bucci 8-9/C</addrLine>
									<postCode>87036</postCode>
									<settlement>Rende</settlement>
									<country key="IT">Italy</country>
								</address>
							</affiliation>
						</author>
						<author>
							<persName><forename type="first">Marco</forename><surname>Zuppelli</surname></persName>
							<email>marco.zuppelli@ge.imati.cnr.it</email>
							<affiliation key="aff0">
								<orgName type="department">Institute for Applied Mathematics and Information Technologies</orgName>
								<address>
									<addrLine>Via de Marini 6</addrLine>
									<postCode>16149</postCode>
									<settlement>Genova</settlement>
									<country key="IT">Italy</country>
								</address>
							</affiliation>
						</author>
						<title level="a" type="main">Dawn of LLM4Cyber: Current Solutions, Challenges, and New Perspectives in Harnessing LLMs for Cybersecurity</title>
					</analytic>
					<monogr>
						<idno type="ISSN">1613-0073</idno>
					</monogr>
					<idno type="MD5">23687C7A6F75E0C785001F0BC2F7A306</idno>
				</biblStruct>
			</sourceDesc>
		</fileDesc>
		<encodingDesc>
			<appInfo>
				<application version="0.7.2" ident="GROBID" when="2025-04-23T16:54+0000">
					<desc>GROBID - A machine learning software for extracting information from scholarly documents</desc>
					<ref target="https://github.com/kermitt2/grobid"/>
				</application>
			</appInfo>
		</encodingDesc>
		<profileDesc>
			<textClass>
				<keywords>
					<term>Large Language Models, Watermarking, Cybersecurity, Fake news, Event log analysis (M. Zuppelli) 0000-0001-6466-3354 (L. Caviglione)</term>
					<term>0000-0001-9116-4323 (C. Comito)</term>
					<term>0000-0002-4670-8157 (E. Coppolillo)</term>
					<term>0009-0009-3245-7738 (D. Gallo)</term>
					<term>0000-0001-7711-9833 (M. Guarascio)</term>
					<term>0000-0001-9402-7375 (A. Liguori)</term>
					<term>0000-0001-9672-3833 (G. Manco)</term>
					<term>0000-0002-9641-8916 (M. Minici)</term>
					<term>0000-0002-0961-4151 (S. Mungari)</term>
					<term>0000-0003-2922-0835 (F. S. Pisani)</term>
					<term>0000-0003-3978-9291 (E. Ritacco)</term>
					<term>0000-0002-6030-0027 (A. Rullo)</term>
					<term>0000-0002-9119-9865 (P. Zicari)</term>
					<term>0000-0001-6932-3199 (M. Zuppelli)</term>
				</keywords>
			</textClass>
			<abstract>
<div xmlns="http://www.tei-c.org/ns/1.0"><p>Large Language Models (LLMs) are now a relevant part of the daily experience of many individuals. For instance, they can be used to generate text or to support working duties, such as programming tasks. However, LLMs can also lead to a multifaceted array of security issues. This paper discusses the research activity on LLMs carried out by the ICAR-IMATI group. Specifically, within the framework of three funded projects, it addresses our ideas on how to understand whether data has been generated by a human or a machine, track the use of information ingested by models, combat misinformation and disinformation, and boost cybersecurity via LLM-capable tools.</p></div>
			</abstract>
		</profileDesc>
	</teiHeader>
	<text xml:lang="en">
		<body>
<div xmlns="http://www.tei-c.org/ns/1.0"><head n="1.">Introduction</head><p>Large Language Models (LLMs) allow to generate a wide array of contents. For instance, they can be used to create textual documents, pieces of music, as well as source code. A feature very relevant for their success is the ability of mimicking the human behavior. Unfortunately, this makes LLMs a double-edged sword since they can be exploited to generate realistic yet malicious content, such as fake news or text supporting misinformation campaigns. At the same time, LLMs have also proven to be effective in supporting various cyber-security duties, for instance, to analyze logs or network traffic <ref type="bibr" target="#b0">[1]</ref>.</p><p>In an attempt to fully understand the potential of LLMs in terms of offensive capabilities as well as the opportunities that should be seized to advance in the security of the Internet, researchers of the Institute for High Performance Computing and Networking -ICAR and of the Institute for Applied Mathematics and Information Technologies -IMATI of the National Research Council of Italy -CNR have intensified their efforts to investigate the pros and cons of LLMs. This research effort is established within the framework of three research projects. The first is funded by the Consortium named "SEcurity and RIghts In the CyberSpace -SERICS", and aims at using LLMs to increase the security posture of networking and computing systems. For instance, an LLM can be used to synthesize behaviors starting from logs of containerized microservices or to generate automatic textual replies to deceive e-mail scammers <ref type="bibr" target="#b1">[2]</ref>. The second research action is funded by the project "Watermarking Hazards and novel perspectives in Adversarial Machine learning -WHAM!", and is devoted to quantifying the limits and opportunities of watermarking schemes when applied to AI artifacts. As an example, data can be hidden to recognize deep fakes, to understand whether a model has been cloned, or to track usages in Machine-Learningas-a-Service deployments <ref type="bibr" target="#b2">[3]</ref>. Even worse, problem of exploiting unauthorized content during training or in deployment needs to be specifically addressed. The third research action is funded by the project "Limiting MIsinformation spRead in online environments through multimodal and cross-domain FAKe news detection -MIRFAK", which aims at developing an innovative content verification tool, delivering solutions for news verification on social media and online platforms. Within the project, we aim at exploring the potentials and risks of LLMs associated with misinformation.</p><p>In this work, we outline our research agenda on these topics, which is devised in three directions: i) we present mid-term challenges for using LLMs to solve securityrelated issues; ii) we discuss how watermarks can be applied to LLMs to mitigate attacks aiming at stealing information or disseminating fake news; iii) we showcase the gaps to be filled to make LLMs a real asset for the Internet.</p><p>The rest of the paper is structured as follows. Section 2 deals with the problems of understanding whether the output has been generated by an LLM and of tracking its provenance, while Section 3 considers usage violations, such as unauthorized harvesting of data for training models. Section 4 discusses challenges and opportunities relative to the adoption of LLMs in the context of online social platforms and debates. Section 5 discusses the adoption of LLMs in assessing cybersecurity risks related to systems and infrastructures in containerized environments. Lastly, Section 6 concludes the work and portrays some prospected action points.</p></div>
<div xmlns="http://www.tei-c.org/ns/1.0"><head n="2.">Are the Data Generated?</head><p>One of the main goals of our research is to investigate challenges and solutions for protecting the Intellectual Property (IP) of the Machine/Deep Learning (ML/DL) models as well as of the dataset used for the training phase <ref type="bibr" target="#b3">[4]</ref>. Moreover, we also aim at considering techniques to mark the output produced by ML/DL services, for instance, to understand whether an attacker "cloned" the model through multiple remote invocations. Specifically, we are interested in techniques that allow the cloaking of secret information within the contents we want to protect. In this respect, an emerging research line considers watermarking techniques, i.e., arbitrary pieces of data that are embedded within the item to deliver and that are difficult to recognize besides proprietary decryption schemes. Such mechanisms are common with images and multimedia objects <ref type="bibr" target="#b4">[5]</ref> and can be used to embed control data within ML/DL models.</p><p>Techniques used to prevent unwanted/unfair usages or to enforce IP can also be envisioned for generative models, with a particular focus on large language models. There are essentially two scenarios that are relevant in this respect. The first scenario is relative to the opportunity to mark generated text in a way that it can be easily recognized. Watermarking can be employed in this context to embed the watermark within the output of the LLM and, thus, distinguish between the data generated by a human and those produced by a machine. The objective here is to enforce IP protection as well as to claim ownership on the generated data. The second scenario is relative to the problem that such generative models can deliver malicious content. To mitigate potential harm caused by such generated data, it is crucial to develop methods to identify content generated by a machine, when a watermark is not embedded. It is worth noting that the generation of malicious content can be both unintentional or intentional. Unintentional generation may happen due to the stochastic nature of such generative models, which causes the phenomenon of hallucinations (i.e., unrealistic or imaginary content). By contrast, intentional generation is typically done by a malicious threat actor, who pushes the generative model to obtain mischievous data. In both cases, the generated data could be of high quality, infusing trust among readers eventually forcing them to fall into error or forward the content, e.g., through sharing functionalities of online social networks. Our research in this context aims at developing methods to identify contents generated by a machine through a language model. We are interested both in devising watermarking schemes and in the more general challenge relative to the problem of devising predictive methods for discriminating generated data. Besides, this research activity is aligned with the current requirements enforced by the recently released European AI Act<ref type="foot" target="#foot_0">1</ref> . The latter in fact introduces specific transparency obligations to ensure that humans are informed when necessary, to ensure trust, and in particular, that AI-generated content is identifiable.</p><p>The research approaches to this topic are quite recent. To the best of our knowledge, the first LLM watermarking technique for distinguishing human-generated from machine-generated texts was proposed by Kirchenbauer et al. <ref type="bibr" target="#b5">[6]</ref>. In text generation, language-based models produce a probability distribution over a vocabulary, i.e., the set of words or word fragments (i.e., tokens), used for predicting the most likely next word based on the previous ones. The authors propose to alter such distribution, in order to promote sampling of specific tokens. The occurrence within a given statistical significance of such tokens characterizes the watermark within the text. One of the main limitations of this approach is the gen-eration of low-quality texts in contexts characterized by relatively deterministic content, such as code snippets or structured text. Lee et al. <ref type="bibr" target="#b6">[7]</ref> refine the approach by ensuring that sampling is only focused on high-entropy tokens.</p><p>One of our research objectives is to generalize these approaches to other generative models, such as Diffusion Models or Generative Adversarial Networks (GANs). In addition, the analysis of the distribution of generated data, and its comparison with that of real (not synthetic) data can also be exploited for devising predictive models aimed at automatically detecting the reliability and authenticity of data.</p></div>
<div xmlns="http://www.tei-c.org/ns/1.0"><head n="3.">Have You Stolen My Data?</head><p>Membership Inference attacks (MIAs) <ref type="bibr" target="#b7">[8]</ref> aim to predict whether a data sample was included in the training dataset of a machine learning model. These attacks serve to evaluate the privacy vulnerabilities present in machine learning models, like in Neural Networks <ref type="bibr" target="#b8">[9]</ref>, GANs <ref type="bibr" target="#b9">[10]</ref> and Diffusion Models <ref type="bibr" target="#b10">[11]</ref>. Formally, the goal of a MIA is to infer whether a given data point 𝑥 was part of the training dataset 𝐷 for model 𝑀 by computing a membership score 𝑠(𝑥; 𝑀 ). This score is then thresholded to determine a target sample's membership.</p><p>Membership inference attacks exploit the tendency of the models to overfit their training data and hence exhibit lower loss values for these elements. A first and widely used attack is the LOSS attack <ref type="bibr" target="#b11">[12]</ref>, in which samples are classified as training members if their loss values are lower than a fixed threshold (that is, 𝑠(𝑥; 𝑀 ) is defined in terms of ℒ(𝑥; 𝑀 )).</p><p>Recent works aim to design and improve MIAs for LLMs. In this case, MIAs consider a target model 𝑀 which gives as output a probability distribution of the next token given a prefix as input, P(𝑥𝑡|𝑥0 . . . 𝑥𝑡−1; 𝑀 ). The goal of MIA is hence to infer whether the target sample 𝑥 = 𝑥1 . . . 𝑥𝑛 of 𝑛 tokens has been considered in the training set. Duan et al. <ref type="bibr" target="#b12">[13]</ref> consider several membership inference attacks and show that they just outperform random guessing for most settings across different LLM size and domains. They also argue that MIA is difficult on LLMs because of different key reasons. These include the difficulty of handling LLMs pre-trained over billions and trillions of tokens, or the overlap typically exhibited by the underlying token distributions that can be observed in natural language documents, irrespective of their training data membership.</p><p>Our research agenda is aimed at extending and leveraging the current membership inference games, by investigating adversarial approaches in order to force the LLM to generate copyrighted text. In this way, we define a framework that can demonstrate copyright violations and overcome MIA's issues related to large dataset and the intrinsic randomness of LLMs.</p></div>
<div xmlns="http://www.tei-c.org/ns/1.0"><head n="4.">Fighting Fire with Fire:</head><p>Generative AI to promote Online Safety</p><p>LLMs are showcasing remarkable abilities in various Natural Language Processing tasks, making them a highly potent and beneficial tool for everyday life. However, alongside their appealing strengths and widespread adoption, a significant concern is arising regarding their potential role in amplifying the generation and dissemination of misinformation and disinformation. Generative AI technology has significantly empowered malicious actors to produce fake content, which can be disseminated across online social networks and lead to detrimental phenomena, e.g., manipulating public discourse, disseminating hate speech, and sharing fake content. As a remarkable example, in 2016 Microsoft released the Tay chatbot, which triggered further controversy by posting inflammatory and offensive tweets via its Twitter account, leading Microsoft to shut down the service within just 16 hours<ref type="foot" target="#foot_1">2</ref> . More recently, other works assessed the role of bots and AI agents in conveying and amplifying online discourse about racism and hate speech <ref type="bibr" target="#b13">[14,</ref><ref type="bibr" target="#b14">15]</ref>, drawing further attention to this sensitive topic. Thus, as underscored by <ref type="bibr" target="#b15">[16]</ref>, the scale, velocity and accessibility of generative models present compelling challenges for online platforms, potentially inundating them with a massive amount of fraudulent material and unpredictable social consequences. While policy makers are actively engaged in regulating the use of GenAI tools, the efficacy of these measures remains uncertain. In response, our research group is working towards leveraging Generative AI to enhance online safety. Our objective is to reuse the same technology used to contaminate online discussions for a beneficial purpose in a controlled environment. For instance, <ref type="bibr" target="#b16">[17]</ref> demonstrated the potential of a GPT2-like model in crafting tailored responses to combat misinformation regarding the COVID-19 pandemic. Despite this first promising result, there are numerous overlooked opportunities for harnessing GenAI tools to aid online safety. One such opportunity involves the development of automated agents capable of serving as "peace-builders" within online discussions. We aim to train a large language model to generate textual content that, once injected within online social media platforms, can help mitigate polarization and disagreement.</p><p>This research line is interesting and open to novel and original developments, but it also faces considerable challenges. A trivial remark is to carefully consider the ethical implications of using GenAI tools for online safety to ensure responsible use. Second, there are considerable technical challenges regarding the training and/or finetuning of these large models due to scalability concerns. Third, evaluating the effectiveness of GenAI interventions in promoting online safety can be demanding and could require a multi-disciplinary approach involving experts from fields such as psychology and sociology.</p><p>Another compelling line in our research agenda is to define the aspects to take into account when analyzing the role of LLMs in this context. We are interested in exploring the role of LLMs in contrasting the phenomenon of false information spreading at different levels: detection, mitigation, intervention, and attribution. Our effort is to improve the fake detection models under the constraint of scarcely labeled data, which is a common condition in real scenarios when discovering fakes in new topics and domains. The generative capabilities can be harnessed for exploring innovative augmentation techniques. LLMs can help reduce the learning strategy costs associated with expert interaction (e.g., Active Learning), thereby saving human annotators' time. This can be achieved by effectively integrating LLMs into learning loops at various levels, such as tuple selection and label generation support.</p></div>
<div xmlns="http://www.tei-c.org/ns/1.0"><head n="5.">Boosting Cybersecurity</head><p>The last research line focuses on exploring various scenarios where LLMs can bolster cybersecurity operations. The concept involves utilizing AI-based tools to automate the analysis and processing of vast amounts of semi-structured data. This approach aims to evaluate security risks across systems and infrastructures more efficiently. While Machine and Deep Learning techniques have been widely used to discover deviant behaviors in event logs <ref type="bibr" target="#b17">[18,</ref><ref type="bibr" target="#b18">19,</ref><ref type="bibr" target="#b19">20]</ref>, the adoption of LLMs represents a novel and quite unexplored research line. For instance, in a recent work <ref type="bibr" target="#b20">[21]</ref>, the authors show how LLMs can be leveraged for analyzing huge volumes of information stored in logs.</p><p>A specific research objective is to support the automation of threat assessment. The intervention of the "expert" (i.e., the human operator) is still crucial to evaluate whether the anomalous event can be traced back to an actual attack or threat. Nevertheless, we believe that the adoption of tools based on LLM can support and facilitate this task. Thus, our mid-term research goals are twofold.</p><p>• Improving efficiency. To enhance response time to potential threats detected through logs, our strategy involves leveraging Active Learning techniques. These techniques enable human operators to actively participate in the model learning process, creating a human-in-the-loop sys-tem. Thus, our approach aims to expedite threat response when integrating human expertise into the learning loop of the model, by using post-hoc explanation tools to support the operator in validating the attack and guiding the learning of the model. • Data enrichment. Another critical aspect involves the potential use of LLMs to enhance the security of Internet-wide infrastructures. Numerous protocols and services rely heavily on textual information, such as URLs or configuration data. LLMs can be exploited in generating test cases, particularly for automating periodic assessments aimed at detecting potential deviations in the security posture of a deployment. For example, recent research showcased LLMs' capability to generate attacks against web destinations, particularly in crafting SQL injections <ref type="bibr" target="#b21">[22]</ref>.</p><p>We also foresee the adoption of LLMs as tools for analysing textual descriptions of system configurations, in order to detect potential risks and vulnerabilities relative to such configurations.</p><p>A further relevant application of LLMs is the creation of a new-wave of tools to perform fuzz testing, especially for handling network protocols <ref type="bibr" target="#b22">[23]</ref>. This is particularly relevant for a twofold reason. First, ubiquitous containerized/virtualized frameworks are progressively migrating to the intrinsically networked microservice paradigm. Second, the emerging plague of malwares exploiting information hiding is hard to mitigate, especially since it requires knowing in advance where the attacker will cloak the data <ref type="bibr" target="#b23">[24]</ref>.</p><p>In this perspective, LLMs could be used to discover in advance protocol fields, metadata, header information, or text segments in software that could be abused to conceal arbitrary/malicious content. For the case of networked (micro)services, fuzzers can be used to learn the grammar ruling a protocol starting from RFC documents <ref type="bibr" target="#b24">[25]</ref>. These testing tools can hence be guided to explore interactions among containers or to fuzz specific operations, e.g., the setup/teardown of a connection.</p><p>For the case of information-hiding-capable malware, detection and sanitization are tightly coupled with the abused resource (e.g., digital media vs network traffic), and the number of features and ambiguities that can be exploited is almost unbounded. Therefore, fuzzers can be built by starting from datasets of pre-existent information-hiding-capable-attacks or trained over wellknown clocking patterns <ref type="bibr" target="#b25">[26]</ref>. Thus, LLMs can lead to guided fuzzers, which demonstrated their ability to reveal corner cases or uncommon anomalous templates <ref type="bibr" target="#b22">[23]</ref>.</p><p>A midterm goal is then to tweak an LLM to evaluate the limits of protocols when containing arbitrary information for implementing a covert communication. The use of LLMs will be particularly efficient for protocols like HTML and MQTT, which are based on large portions of textual information, especially in the header <ref type="bibr" target="#b26">[27]</ref>. Moreover, we also plan to investigate if LLMs can be used to improve the performance of our pre-existent AI/ML mechanisms for the detection of covert communications <ref type="bibr" target="#b27">[28,</ref><ref type="bibr" target="#b28">29]</ref>.</p></div>
<div xmlns="http://www.tei-c.org/ns/1.0"><head n="6.">Conclusions</head><p>LLMs present a spectrum of opportunities and challenges within the cybersecurity domain. We've delved into four primary research avenues, each addressing distinct problems and proposing corresponding solutions. These areas include:</p><p>• Watermarking and Detection of Generative Content: Developing methods to embed unique identifiers into data for tracking and authentication purposes, alongside techniques for detecting generative content to combat potential trustworthiness and security risks. • Membership Inference and Data Provenance: Addressing concerns related to establishing the origin of training data, crucial for ensuring data integrity, privacy. • Misinformation Mitigation/Intervention: Implementing strategies to combat misinformation and ensure online safety, particularly in the context of rapidly evolving online information landscapes. • Log Analysis and Stress Testing in Infrastructure Protection: Analyzing system logs and subjecting infrastructures to stress tests to assess their resilience against cyber threats, essential for maintaining robust security measures.</p><p>We have devised specific solutions within the context of three research projects funded by the Italian Ministry of Research. These solutions aim to address various cybersecurity challenges and enhance overall digital security measures,</p></div>			<note xmlns="http://www.tei-c.org/ns/1.0" place="foot" n="1" xml:id="foot_0">https://digital-strategy.ec.europa.eu/en/policies/ regulatory-framework-ai</note>
			<note xmlns="http://www.tei-c.org/ns/1.0" place="foot" n="2" xml:id="foot_1">https://en.wikipedia.org/wiki/Tay_(chatbot)</note>
		</body>
		<back>

			<div type="acknowledgement">
<div xmlns="http://www.tei-c.org/ns/1.0"><head>Acknowledgments</head><p>This work was partially supported by the following projects: 1) WHAM! -Watermarking Hazards and novel perspectives in Adversarial Machine learning (B53D23013340006); 2) SERICS -SEcurity and RIghts in the CyberSpace (PE00000014); 3) MIRFAK -Limiting MIsinformation spRead in online environments through multi-modal and cross-domain FAKe news detection (P2022C23K9), funded under the NRRP MUR program funded by the EU -NGEU. A part of the work was also supported by: Project RAISE (ECS00000035); MUR on D.M. 351/2022, PNRR Ricerca, CUP H23C22000550005; MUR on D.M. 352/2022, PNRR Ricerca, CUP H23C22000440007.</p></div>
			</div>

			<div type="references">

				<listBibl>

<biblStruct xml:id="b0">
	<monogr>
		<author>
			<persName><forename type="first">Y</forename><surname>Yao</surname></persName>
		</author>
		<author>
			<persName><forename type="first">J</forename><surname>Duan</surname></persName>
		</author>
		<author>
			<persName><forename type="first">K</forename><surname>Xu</surname></persName>
		</author>
		<author>
			<persName><forename type="first">Y</forename><surname>Cai</surname></persName>
		</author>
		<author>
			<persName><forename type="first">Z</forename><surname>Sun</surname></persName>
		</author>
		<author>
			<persName><forename type="first">Y</forename><surname>Zhang</surname></persName>
		</author>
		<title level="m">A Survey on Large Language Model (LLM) Security and Privacy: The Good, the Bad, and the Ugly, High-Confidence Computing</title>
				<imprint>
			<date type="published" when="2024">2024</date>
			<biblScope unit="page">100211</biblScope>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b1">
	<monogr>
		<author>
			<persName><forename type="first">E</forename><surname>Cambiaso</surname></persName>
		</author>
		<author>
			<persName><forename type="first">L</forename><surname>Caviglione</surname></persName>
		</author>
		<idno type="arXiv">arXiv:2303.13521</idno>
		<title level="m">Scamming the Scammers: Using ChatGPT to Reply Mails for Wasting Time and Resources</title>
				<imprint>
			<date type="published" when="2023">2023</date>
		</imprint>
	</monogr>
	<note type="report_type">arXiv preprint</note>
</biblStruct>

<biblStruct xml:id="b2">
	<analytic>
		<title level="a" type="main">Protecting Language Generation Models via Invisible Watermarking</title>
		<author>
			<persName><forename type="first">X</forename><surname>Zhao</surname></persName>
		</author>
		<author>
			<persName><forename type="first">Y.-X</forename><surname>Wang</surname></persName>
		</author>
		<author>
			<persName><forename type="first">L</forename><surname>Li</surname></persName>
		</author>
	</analytic>
	<monogr>
		<title level="m">International Conference on Machine Learning</title>
				<imprint>
			<date type="published" when="2023">2023</date>
			<biblScope unit="page" from="42187" to="42199" />
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b3">
	<analytic>
		<title level="a" type="main">Emerging Challenges and Perspectives in Deep Learning Model Security: A Brief Survey</title>
		<author>
			<persName><forename type="first">L</forename><surname>Caviglione</surname></persName>
		</author>
		<author>
			<persName><forename type="first">C</forename><surname>Comito</surname></persName>
		</author>
		<author>
			<persName><forename type="first">M</forename><surname>Guarascio</surname></persName>
		</author>
		<author>
			<persName><forename type="first">G</forename><surname>Manco</surname></persName>
		</author>
	</analytic>
	<monogr>
		<title level="j">Systems and Soft Computing</title>
		<imprint>
			<biblScope unit="volume">5</biblScope>
			<biblScope unit="page">200050</biblScope>
			<date type="published" when="2023">2023</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b4">
	<analytic>
		<title level="a" type="main">Survey of Robust and Imperceptible Watermarking</title>
		<author>
			<persName><forename type="first">N</forename><surname>Agarwal</surname></persName>
		</author>
		<author>
			<persName><forename type="first">A</forename><forename type="middle">K</forename><surname>Singh</surname></persName>
		</author>
		<author>
			<persName><forename type="first">P</forename><forename type="middle">K</forename><surname>Singh</surname></persName>
		</author>
	</analytic>
	<monogr>
		<title level="j">Multimedia Tools and Applications</title>
		<imprint>
			<biblScope unit="volume">78</biblScope>
			<biblScope unit="page" from="8603" to="8633" />
			<date type="published" when="2019">2019</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b5">
	<analytic>
		<title level="a" type="main">A watermark for large language models</title>
		<author>
			<persName><forename type="first">J</forename><surname>Kirchenbauer</surname></persName>
		</author>
		<author>
			<persName><forename type="first">J</forename><surname>Geiping</surname></persName>
		</author>
		<author>
			<persName><forename type="first">Y</forename><surname>Wen</surname></persName>
		</author>
		<author>
			<persName><forename type="first">J</forename><surname>Katz</surname></persName>
		</author>
		<author>
			<persName><forename type="first">I</forename><surname>Miers</surname></persName>
		</author>
		<author>
			<persName><forename type="first">T</forename><surname>Goldstein</surname></persName>
		</author>
	</analytic>
	<monogr>
		<title level="m">Proceedings of Machine Learning Research</title>
				<meeting>Machine Learning Research</meeting>
		<imprint>
			<date type="published" when="2023">2023</date>
			<biblScope unit="volume">202</biblScope>
			<biblScope unit="page" from="17061" to="17084" />
		</imprint>
	</monogr>
	<note>ICML</note>
</biblStruct>

<biblStruct xml:id="b6">
	<monogr>
		<author>
			<persName><forename type="first">T</forename><surname>Lee</surname></persName>
		</author>
		<author>
			<persName><forename type="first">S</forename><surname>Hong</surname></persName>
		</author>
		<author>
			<persName><forename type="first">J</forename><surname>Ahn</surname></persName>
		</author>
		<author>
			<persName><forename type="first">I</forename><surname>Hong</surname></persName>
		</author>
		<author>
			<persName><forename type="first">H</forename><surname>Lee</surname></persName>
		</author>
		<author>
			<persName><forename type="first">S</forename><surname>Yun</surname></persName>
		</author>
		<author>
			<persName><forename type="first">J</forename><surname>Shin</surname></persName>
		</author>
		<author>
			<persName><forename type="first">G</forename><surname>Kim</surname></persName>
		</author>
		<idno>arXiv abs/2305.15060</idno>
		<title level="m">Who Wrote this Code? Watermarking for Code Generation</title>
				<imprint>
			<date type="published" when="2023">2023</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b7">
	<analytic>
		<title level="a" type="main">Membership inference attacks on machine learning: A survey</title>
		<author>
			<persName><forename type="first">H</forename><surname>Hu</surname></persName>
		</author>
		<author>
			<persName><forename type="first">Z</forename><surname>Salcic</surname></persName>
		</author>
		<author>
			<persName><forename type="first">L</forename><surname>Sun</surname></persName>
		</author>
		<author>
			<persName><forename type="first">G</forename><surname>Dobbie</surname></persName>
		</author>
		<author>
			<persName><forename type="first">P</forename><forename type="middle">S</forename><surname>Yu</surname></persName>
		</author>
		<author>
			<persName><forename type="first">X</forename><surname>Zhang</surname></persName>
		</author>
		<idno type="DOI">10.1145/3523273</idno>
	</analytic>
	<monogr>
		<title level="j">ACM Comput. Surv</title>
		<imprint>
			<biblScope unit="volume">54</biblScope>
			<date type="published" when="2022">2022</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b8">
	<monogr>
		<title level="m" type="main">Membership Inference Attacks From First Principles</title>
		<author>
			<persName><forename type="first">N</forename><surname>Carlini</surname></persName>
		</author>
		<author>
			<persName><forename type="first">S</forename><surname>Chien</surname></persName>
		</author>
		<author>
			<persName><forename type="first">M</forename><surname>Nasr</surname></persName>
		</author>
		<author>
			<persName><forename type="first">S</forename><surname>Song</surname></persName>
		</author>
		<author>
			<persName><forename type="first">A</forename><surname>Terzis</surname></persName>
		</author>
		<author>
			<persName><forename type="first">F</forename><surname>Tramer</surname></persName>
		</author>
		<idno type="arXiv">arXiv:2112.03570</idno>
		<imprint>
			<date type="published" when="2022">2022</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b9">
	<analytic>
		<title level="a" type="main">GAN-Leaks: A Taxonomy of Membership Inference Attacks against Generative Models</title>
		<author>
			<persName><forename type="first">D</forename><surname>Chen</surname></persName>
		</author>
		<author>
			<persName><forename type="first">N</forename><surname>Yu</surname></persName>
		</author>
		<author>
			<persName><forename type="first">Y</forename><surname>Zhang</surname></persName>
		</author>
		<author>
			<persName><forename type="first">M</forename><surname>Fritz</surname></persName>
		</author>
	</analytic>
	<monogr>
		<title level="m">Proceedings of the 2020 ACM SIGSAC Conference on Computer and Communications Security, CCS &apos;20</title>
				<meeting>the 2020 ACM SIGSAC Conference on Computer and Communications Security, CCS &apos;20</meeting>
		<imprint>
			<publisher>ACM</publisher>
			<date type="published" when="2020">2020</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b10">
	<monogr>
		<author>
			<persName><forename type="first">J</forename><surname>Dubiński</surname></persName>
		</author>
		<author>
			<persName><forename type="first">A</forename><surname>Kowalczuk</surname></persName>
		</author>
		<author>
			<persName><forename type="first">S</forename><surname>Pawlak</surname></persName>
		</author>
		<author>
			<persName><forename type="first">P</forename><surname>Rokita</surname></persName>
		</author>
		<author>
			<persName><forename type="first">T</forename><surname>Trzciński</surname></persName>
		</author>
		<author>
			<persName><forename type="first">P</forename><surname>Morawiecki</surname></persName>
		</author>
		<idno type="arXiv">arXiv:2306.12983</idno>
		<title level="m">Towards More Realistic Membership Inference Attacks on Large Diffusion Models</title>
				<imprint>
			<date type="published" when="2023">2023</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b11">
	<analytic>
		<title level="a" type="main">Privacy Risk in Machine Learning: Analyzing the Connection to Overfitting</title>
		<author>
			<persName><forename type="first">S</forename><surname>Yeom</surname></persName>
		</author>
		<author>
			<persName><forename type="first">I</forename><surname>Giacomelli</surname></persName>
		</author>
		<author>
			<persName><forename type="first">M</forename><surname>Fredrikson</surname></persName>
		</author>
		<author>
			<persName><forename type="first">S</forename><surname>Jha</surname></persName>
		</author>
	</analytic>
	<monogr>
		<title level="m">IEEE 31st Computer Security Foundations Symposium</title>
				<imprint>
			<date type="published" when="2018">2018. 2018</date>
			<biblScope unit="page" from="268" to="282" />
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b12">
	<monogr>
		<title level="m" type="main">Do Membership Inference Attacks Work on Large Language Models?</title>
		<author>
			<persName><forename type="first">M</forename><surname>Duan</surname></persName>
		</author>
		<author>
			<persName><forename type="first">A</forename><surname>Suri</surname></persName>
		</author>
		<author>
			<persName><forename type="first">N</forename><surname>Mireshghallah</surname></persName>
		</author>
		<author>
			<persName><forename type="first">S</forename><surname>Min</surname></persName>
		</author>
		<author>
			<persName><forename type="first">W</forename><surname>Shi</surname></persName>
		</author>
		<author>
			<persName><forename type="first">L</forename><surname>Zettlemoyer</surname></persName>
		</author>
		<author>
			<persName><forename type="first">Y</forename><surname>Tsvetkov</surname></persName>
		</author>
		<author>
			<persName><forename type="first">Y</forename><surname>Choi</surname></persName>
		</author>
		<author>
			<persName><forename type="first">D</forename><surname>Evans</surname></persName>
		</author>
		<author>
			<persName><forename type="first">H</forename><surname>Hajishirzi</surname></persName>
		</author>
		<idno type="arXiv">arXiv:2402.07841</idno>
		<imprint>
			<date type="published" when="2024">2024</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b13">
	<analytic>
		<title level="a" type="main">Bots amplify and redirect hate speech in online discourse about racism during the covid-19 pandemic</title>
		<author>
			<persName><forename type="first">J</forename><surname>Uyheng</surname></persName>
		</author>
		<author>
			<persName><forename type="first">D</forename><surname>Bellutta</surname></persName>
		</author>
		<author>
			<persName><forename type="first">K</forename><surname>Carley</surname></persName>
		</author>
		<idno type="DOI">10.1177/20563051221104749</idno>
	</analytic>
	<monogr>
		<title level="j">Social Media + Society</title>
		<imprint>
			<biblScope unit="volume">8</biblScope>
			<biblScope unit="page">205630512211047</biblScope>
			<date type="published" when="2022">2022</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b14">
	<analytic>
		<title level="a" type="main">Bots and online hate during the covid-19 pandemic: case studies in the united states and the philippines</title>
		<author>
			<persName><forename type="first">J</forename><surname>Uyheng</surname></persName>
		</author>
		<author>
			<persName><forename type="first">K</forename><forename type="middle">M</forename><surname>Carley</surname></persName>
		</author>
		<ptr target="https://api.semanticscholar.org/CorpusID:224818205" />
	</analytic>
	<monogr>
		<title level="j">Journal of Computational Social Science</title>
		<imprint>
			<biblScope unit="volume">3</biblScope>
			<biblScope unit="page" from="445" to="468" />
			<date type="published" when="2020">2020</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b15">
	<analytic>
		<title level="a" type="main">Research can help to tackle ai-generated disinformation</title>
		<author>
			<persName><forename type="first">S</forename><surname>Feuerriegel</surname></persName>
		</author>
		<author>
			<persName><forename type="first">R</forename><surname>Diresta</surname></persName>
		</author>
		<author>
			<persName><forename type="first">J</forename><forename type="middle">A</forename><surname>Goldstein</surname></persName>
		</author>
		<author>
			<persName><forename type="first">S</forename><surname>Kumar</surname></persName>
		</author>
		<author>
			<persName><forename type="first">P</forename><surname>Lorenz-Spreen</surname></persName>
		</author>
		<author>
			<persName><forename type="first">M</forename><surname>Tomz</surname></persName>
		</author>
		<author>
			<persName><forename type="first">N</forename><surname>Pröllochs</surname></persName>
		</author>
	</analytic>
	<monogr>
		<title level="j">Nature Human Behaviour</title>
		<imprint>
			<biblScope unit="volume">7</biblScope>
			<biblScope unit="page" from="1818" to="1821" />
			<date type="published" when="2023">2023</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b16">
	<analytic>
		<title level="a" type="main">Reinforcement learning-based counter-misinformation response generation: a case study of covid-19 vaccine misinformation</title>
		<author>
			<persName><forename type="first">B</forename><surname>He</surname></persName>
		</author>
		<author>
			<persName><forename type="first">M</forename><surname>Ahamad</surname></persName>
		</author>
		<author>
			<persName><forename type="first">S</forename><surname>Kumar</surname></persName>
		</author>
	</analytic>
	<monogr>
		<title level="m">Proceedings of the ACM Web Conference 2023</title>
				<meeting>the ACM Web Conference 2023</meeting>
		<imprint>
			<date type="published" when="2023">2023</date>
			<biblScope unit="page" from="2698" to="2709" />
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b17">
	<analytic>
		<title level="a" type="main">A Multi-view Learning Approach to the Discovery of Deviant Process Instances</title>
		<author>
			<persName><forename type="first">A</forename><surname>Cuzzocrea</surname></persName>
		</author>
		<author>
			<persName><forename type="first">F</forename><surname>Folino</surname></persName>
		</author>
		<author>
			<persName><forename type="first">M</forename><surname>Guarascio</surname></persName>
		</author>
		<author>
			<persName><forename type="first">L</forename><surname>Pontieri</surname></persName>
		</author>
	</analytic>
	<monogr>
		<title level="m">On the Move to Meaningful Internet Systems: OTM 2015 Conferences -Confederated International Conferences: CoopIS, ODBASE, and C&amp;TC 2015</title>
		<title level="s">Lecture Notes in Computer Science</title>
		<imprint>
			<publisher>Springer</publisher>
			<date type="published" when="2015">2015</date>
			<biblScope unit="volume">9415</biblScope>
			<biblScope unit="page" from="146" to="165" />
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b18">
	<analytic>
		<title level="a" type="main">Semi-Supervised Discovery of DNN-Based Outcome Predictors from Scarcely-Labeled Process Logs</title>
		<author>
			<persName><forename type="first">F</forename><surname>Folino</surname></persName>
		</author>
		<author>
			<persName><forename type="first">G</forename><surname>Folino</surname></persName>
		</author>
		<author>
			<persName><forename type="first">M</forename><surname>Guarascio</surname></persName>
		</author>
		<author>
			<persName><forename type="first">L</forename><surname>Pontieri</surname></persName>
		</author>
	</analytic>
	<monogr>
		<title level="j">Business &amp; Information Systems Engineering</title>
		<imprint>
			<biblScope unit="volume">64</biblScope>
			<biblScope unit="page" from="729" to="749" />
			<date type="published" when="2022">2022</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b19">
	<analytic>
		<title level="a" type="main">Data-&amp; Compute-efficient Deviance Mining via Active Learning and Fast Ensembles</title>
		<author>
			<persName><forename type="first">F</forename><surname>Folino</surname></persName>
		</author>
		<author>
			<persName><forename type="first">G</forename><surname>Folino</surname></persName>
		</author>
		<author>
			<persName><forename type="first">M</forename><surname>Guarascio</surname></persName>
		</author>
		<author>
			<persName><forename type="first">L</forename><surname>Pontieri</surname></persName>
		</author>
	</analytic>
	<monogr>
		<title level="j">Journal of Intelligent Information Systems</title>
		<imprint>
			<date type="published" when="2024">2024</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b20">
	<analytic>
		<title level="a" type="main">LLMParser: An Exploratory Study on Using Large Language Models for Log Parsing</title>
		<author>
			<persName><forename type="first">Z</forename><surname>Ma</surname></persName>
		</author>
		<author>
			<persName><forename type="first">A</forename><forename type="middle">R</forename><surname>Chen</surname></persName>
		</author>
		<author>
			<persName><forename type="first">D</forename><forename type="middle">J</forename><surname>Kim</surname></persName>
		</author>
		<author>
			<persName><forename type="first">T.-H</forename><surname>Chen</surname></persName>
		</author>
		<author>
			<persName><forename type="first">S</forename><surname>Wang</surname></persName>
		</author>
	</analytic>
	<monogr>
		<title level="m">IEEE/ACM 46th International Conference on Software Engineering</title>
				<imprint>
			<publisher>IEEE Computer Society</publisher>
			<date type="published" when="2024">2024. 2024</date>
			<biblScope unit="page" from="883" to="883" />
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b21">
	<monogr>
		<author>
			<persName><forename type="first">R</forename><surname>Fang</surname></persName>
		</author>
		<author>
			<persName><forename type="first">R</forename><surname>Bindu</surname></persName>
		</author>
		<author>
			<persName><forename type="first">A</forename><surname>Gupta</surname></persName>
		</author>
		<author>
			<persName><forename type="first">Q</forename><surname>Zhan</surname></persName>
		</author>
		<author>
			<persName><forename type="first">D</forename><surname>Kang</surname></persName>
		</author>
		<idno type="arXiv">arXiv:2402.06664</idno>
		<title level="m">LLM Agents can Autonomously Hack Websites</title>
				<imprint>
			<date type="published" when="2024">2024</date>
		</imprint>
	</monogr>
	<note type="report_type">arXiv preprint</note>
</biblStruct>

<biblStruct xml:id="b22">
	<analytic>
		<title level="a" type="main">Demystify the Fuzzing Methods: A Comprehensive Survey</title>
		<author>
			<persName><forename type="first">S</forename><surname>Mallissery</surname></persName>
		</author>
		<author>
			<persName><forename type="first">Y.-S</forename><surname>Wu</surname></persName>
		</author>
	</analytic>
	<monogr>
		<title level="j">ACM Computing Surveys</title>
		<imprint>
			<biblScope unit="volume">56</biblScope>
			<biblScope unit="page" from="1" to="38" />
			<date type="published" when="2023">2023</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b23">
	<analytic>
		<title level="a" type="main">Never Mind the Malware, Here&apos;s The Stegomalware</title>
		<author>
			<persName><forename type="first">L</forename><surname>Caviglione</surname></persName>
		</author>
		<author>
			<persName><forename type="first">W</forename><surname>Mazurczyk</surname></persName>
		</author>
	</analytic>
	<monogr>
		<title level="j">IEEE Security &amp; Privacy</title>
		<imprint>
			<biblScope unit="volume">20</biblScope>
			<biblScope unit="page" from="101" to="106" />
			<date type="published" when="2022">2022</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b24">
	<analytic>
		<title level="a" type="main">Fuzz4all: Universal Fuzzing with Large Language Models</title>
		<author>
			<persName><forename type="first">C</forename><forename type="middle">S</forename><surname>Xia</surname></persName>
		</author>
		<author>
			<persName><forename type="first">M</forename><surname>Paltenghi</surname></persName>
		</author>
		<author>
			<persName><forename type="first">J</forename><surname>Le Tian</surname></persName>
		</author>
		<author>
			<persName><forename type="first">M</forename><surname>Pradel</surname></persName>
		</author>
		<author>
			<persName><forename type="first">L</forename><surname>Zhang</surname></persName>
		</author>
	</analytic>
	<monogr>
		<title level="m">Proc. IEEE/ACM ICSE</title>
				<meeting>IEEE/ACM ICSE</meeting>
		<imprint>
			<date type="published" when="2024">2024</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b25">
	<analytic>
		<title level="a" type="main">Pattern-based Survey and Categorization of Network Covert Channel Techniques</title>
		<author>
			<persName><forename type="first">S</forename><surname>Wendzel</surname></persName>
		</author>
		<author>
			<persName><forename type="first">S</forename><surname>Zander</surname></persName>
		</author>
		<author>
			<persName><forename type="first">B</forename><surname>Fechner</surname></persName>
		</author>
		<author>
			<persName><forename type="first">C</forename><surname>Herdin</surname></persName>
		</author>
	</analytic>
	<monogr>
		<title level="j">ACM Computing Surveys</title>
		<imprint>
			<biblScope unit="volume">47</biblScope>
			<biblScope unit="page" from="1" to="26" />
			<date type="published" when="2015">2015</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b26">
	<analytic>
		<title level="a" type="main">SoK: A Survey of Indirect Network-level Covert Channels</title>
		<author>
			<persName><forename type="first">T</forename><surname>Schmidbauer</surname></persName>
		</author>
		<author>
			<persName><forename type="first">S</forename><surname>Wendzel</surname></persName>
		</author>
	</analytic>
	<monogr>
		<title level="m">Proceedings of the 2022 ACM on Asia Conference on Computer and Communications Security</title>
				<meeting>the 2022 ACM on Asia Conference on Computer and Communications Security</meeting>
		<imprint>
			<date type="published" when="2022">2022</date>
			<biblScope unit="page" from="546" to="560" />
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b27">
	<analytic>
		<title level="a" type="main">Ensembling Sparse Autoencoders for Network Covert Channel Detection in IoT Ecosystems</title>
		<author>
			<persName><forename type="first">N</forename><surname>Cassavia</surname></persName>
		</author>
		<author>
			<persName><forename type="first">L</forename><surname>Caviglione</surname></persName>
		</author>
		<author>
			<persName><forename type="first">M</forename><surname>Guarascio</surname></persName>
		</author>
		<author>
			<persName><forename type="first">A</forename><surname>Liguori</surname></persName>
		</author>
		<author>
			<persName><forename type="first">M</forename><surname>Zuppelli</surname></persName>
		</author>
	</analytic>
	<monogr>
		<title level="m">International Symposium on Methodologies for Intelligent Systems</title>
				<imprint>
			<date type="published" when="2022">2022</date>
			<biblScope unit="page" from="209" to="218" />
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b28">
	<analytic>
		<title level="a" type="main">Learning Autoencoder Ensembles for Detecting Malware Hidden Communications in IoT Ecosystems</title>
		<author>
			<persName><forename type="first">N</forename><surname>Cassavia</surname></persName>
		</author>
		<author>
			<persName><forename type="first">L</forename><surname>Caviglione</surname></persName>
		</author>
		<author>
			<persName><forename type="first">M</forename><surname>Guarascio</surname></persName>
		</author>
		<author>
			<persName><forename type="first">A</forename><surname>Liguori</surname></persName>
		</author>
		<author>
			<persName><forename type="first">M</forename><surname>Zuppelli</surname></persName>
		</author>
	</analytic>
	<monogr>
		<title level="j">Journal of Intelligent Information Systems</title>
		<imprint>
			<biblScope unit="page" from="1" to="25" />
			<date type="published" when="2023">2023</date>
		</imprint>
	</monogr>
</biblStruct>

				</listBibl>
			</div>
		</back>
	</text>
</TEI>
