首页 > 最新文献

International Journal of Network Management最新文献

英文 中文
A Fast Cross-Chain Protocol Based on Trusted Notary Group for Metaverse 基于可信公证组的快速跨链协议
IF 1.5 4区 计算机科学 Q3 COMPUTER SCIENCE, INFORMATION SYSTEMS Pub Date : 2024-10-09 DOI: 10.1002/nem.2302
Yong Ding, Weiguo Huang, Hai Liang, Yujue Wang, Changsong Yang, Huiyong Wang

The metaverse is a virtual environment that combines the real and digital worlds through technological and social structures. It heralds a novel paradigm in internet applications and societal engagement by weaving together diverse cutting-edge technologies to facilitate a virtual representation of the tangible world. Within the metaverse, the facets of economy, culture, and other dimensions are fully documentable, trackable, and quantifiable, largely owing to the capabilities of blockchain technology. Nonetheless, the transactional volume within the metaverse is typically substantial, posing challenges for a singular blockchain platform in terms of efficiency and support capacity. Consequently, a multi-blockchain infrastructure becomes essential to underpin the economic fabric of the metaverse. Enabling the collaborative operation of multiple blockchain platforms, specifically achieving the seamless transfer of value across different blockchain ecosystems, has emerged as a critical challenge. To address this challenge, this paper introduces a cross-chain protocol predicated on a multi-role notary system designed to facilitate inter-blockchain value transfers. The protocol specifies the functions of different entities within the notary framework, allocating specific duties to notaries, committees, and a leader. It also promotes mutual oversight among notaries to sustain a dynamic and equitable group structure. Furthermore, an incentive mechanism is proposed to motivate committee members toward prompt and judicious decision-making regarding votes. Based on experiments conducted on the Ethereum platform, our proposed solution exhibits a 75% reduction in transaction time compared to Ethereum's transaction confirmation time.

虚拟世界是一个虚拟环境,通过技术和社会结构将现实世界和数字世界结合在一起。它通过将各种尖端技术结合在一起,促进有形世界的虚拟表现,预示着互联网应用和社会参与的新范式。在虚拟世界中,经济、文化和其他维度的各个方面都是完全可记录、可跟踪和可量化的,这在很大程度上要归功于区块链技术的能力。尽管如此,元空间中的事务量通常很大,这在效率和支持能力方面给单一区块链平台带来了挑战。因此,多区块链基础设施对于支撑虚拟世界的经济结构至关重要。实现多个区块链平台的协同运营,特别是在不同区块链生态系统之间实现价值的无缝转移,已成为一项关键挑战。为了解决这一挑战,本文介绍了一种基于多角色公证系统的跨链协议,旨在促进区块链间的价值转移。该协议规定了公证框架内不同主体的职能,为公证员、委员会和负责人分配了具体职责。它还促进公证员之间的相互监督,以维持一个充满活力和公平的团体结构。此外,还提出了一种激励机制,以激励委员会成员在投票时做出迅速和明智的决策。根据在以太坊平台上进行的实验,我们提出的解决方案与以太坊的交易确认时间相比,交易时间减少了75%。
{"title":"A Fast Cross-Chain Protocol Based on Trusted Notary Group for Metaverse","authors":"Yong Ding,&nbsp;Weiguo Huang,&nbsp;Hai Liang,&nbsp;Yujue Wang,&nbsp;Changsong Yang,&nbsp;Huiyong Wang","doi":"10.1002/nem.2302","DOIUrl":"https://doi.org/10.1002/nem.2302","url":null,"abstract":"<div>\u0000 \u0000 <p>The metaverse is a virtual environment that combines the real and digital worlds through technological and social structures. It heralds a novel paradigm in internet applications and societal engagement by weaving together diverse cutting-edge technologies to facilitate a virtual representation of the tangible world. Within the metaverse, the facets of economy, culture, and other dimensions are fully documentable, trackable, and quantifiable, largely owing to the capabilities of blockchain technology. Nonetheless, the transactional volume within the metaverse is typically substantial, posing challenges for a singular blockchain platform in terms of efficiency and support capacity. Consequently, a multi-blockchain infrastructure becomes essential to underpin the economic fabric of the metaverse. Enabling the collaborative operation of multiple blockchain platforms, specifically achieving the seamless transfer of value across different blockchain ecosystems, has emerged as a critical challenge. To address this challenge, this paper introduces a cross-chain protocol predicated on a multi-role notary system designed to facilitate inter-blockchain value transfers. The protocol specifies the functions of different entities within the notary framework, allocating specific duties to notaries, committees, and a leader. It also promotes mutual oversight among notaries to sustain a dynamic and equitable group structure. Furthermore, an incentive mechanism is proposed to motivate committee members toward prompt and judicious decision-making regarding votes. Based on experiments conducted on the Ethereum platform, our proposed solution exhibits a 75% reduction in transaction time compared to Ethereum's transaction confirmation time.</p>\u0000 </div>","PeriodicalId":14154,"journal":{"name":"International Journal of Network Management","volume":"35 1","pages":""},"PeriodicalIF":1.5,"publicationDate":"2024-10-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142763947","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Construction of Metaphorical Maps of Cyberspace Resources Based on Point-Cluster Feature Generalization 基于点-群特征泛化的网络空间资源隐喻图构建
IF 1.5 4区 计算机科学 Q3 COMPUTER SCIENCE, INFORMATION SYSTEMS Pub Date : 2024-10-07 DOI: 10.1002/nem.2306
Yifan Liu, Heng Zhang, Yang Zhou, Kai Qi, Qingxiang Li

In the digital age, the expansion of cyberspace has resulted in increasing complexity, making clear cyberspace visualization crucial for effective analysis and decision-making. Current cyberspace visualizations are overly complex and fail to accurately reflect node importance. To address the challenge of complex cyberspace visualization, this study introduces the integrated centrality metric (ICM) for constructing a metaphorical map that accurately reflects node importance. The ICM, a novel node centrality measure, demonstrates superior accuracy in identifying key nodes compared to degree centrality (DC), k-shell centrality (KC), and PageRank values. Through community partitioning and point-cluster feature generalization, we extract a network's hierarchical structure to intuitively represent its community and backbone topology, and we construct a metaphorical map that offers a clear visualization of cyberspace. Experiments were conducted on four original networks and their extracted backbone networks to identify core nodes. The Jaccard coefficient was calculated considering the results of the three aforementioned centrality measures, ICM, and the SIR model. The results indicate that ICM achieved the best performance in both the original networks and all extracted backbone networks. This demonstrates that ICM can more precisely evaluate node importance, thereby facilitating the construction of metaphorical maps. Moreover, the proposed metaphorical map is more convenient than traditional topological maps for quickly comprehending the complex characteristics of networks.

在数字时代,网络空间的扩展导致复杂性不断增加,因此清晰的网络空间可视化对于有效的分析和决策至关重要。目前的网络空间可视化过于复杂,无法准确反映节点的重要性。为应对复杂的网络空间可视化挑战,本研究引入了综合中心度量(ICM),用于构建能准确反映节点重要性的隐喻地图。ICM 是一种新型节点中心度量,与度中心度 (DC)、k-shell 中心度 (KC) 和 PageRank 值相比,在识别关键节点方面具有更高的准确性。通过社区划分和点簇特征泛化,我们提取了网络的层次结构,直观地表示了其社区和骨干拓扑结构,并构建了一个隐喻地图,提供了网络空间的清晰可视化。我们在四个原始网络及其提取的骨干网络上进行了实验,以识别核心节点。根据上述三种中心性度量、ICM 和 SIR 模型的结果,计算了 Jaccard 系数。结果表明,ICM 在原始网络和所有提取的骨干网络中都取得了最佳性能。这表明 ICM 可以更精确地评估节点的重要性,从而促进隐喻图的构建。此外,与传统拓扑图相比,所提出的隐喻图更便于快速理解网络的复杂特性。
{"title":"Construction of Metaphorical Maps of Cyberspace Resources Based on Point-Cluster Feature Generalization","authors":"Yifan Liu,&nbsp;Heng Zhang,&nbsp;Yang Zhou,&nbsp;Kai Qi,&nbsp;Qingxiang Li","doi":"10.1002/nem.2306","DOIUrl":"https://doi.org/10.1002/nem.2306","url":null,"abstract":"<div>\u0000 \u0000 <p>In the digital age, the expansion of cyberspace has resulted in increasing complexity, making clear cyberspace visualization crucial for effective analysis and decision-making. Current cyberspace visualizations are overly complex and fail to accurately reflect node importance. To address the challenge of complex cyberspace visualization, this study introduces the integrated centrality metric (ICM) for constructing a metaphorical map that accurately reflects node importance. The ICM, a novel node centrality measure, demonstrates superior accuracy in identifying key nodes compared to degree centrality (DC), k-shell centrality (KC), and PageRank values. Through community partitioning and point-cluster feature generalization, we extract a network's hierarchical structure to intuitively represent its community and backbone topology, and we construct a metaphorical map that offers a clear visualization of cyberspace. Experiments were conducted on four original networks and their extracted backbone networks to identify core nodes. The Jaccard coefficient was calculated considering the results of the three aforementioned centrality measures, ICM, and the SIR model. The results indicate that ICM achieved the best performance in both the original networks and all extracted backbone networks. This demonstrates that ICM can more precisely evaluate node importance, thereby facilitating the construction of metaphorical maps. Moreover, the proposed metaphorical map is more convenient than traditional topological maps for quickly comprehending the complex characteristics of networks.</p>\u0000 </div>","PeriodicalId":14154,"journal":{"name":"International Journal of Network Management","volume":"34 6","pages":""},"PeriodicalIF":1.5,"publicationDate":"2024-10-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142641654","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
A Blockchain-Based Proxy Re-Encryption Scheme With Cryptographic Reverse Firewall for IoV 基于区块链的代理重加密方案与物联网加密反向防火墙
IF 1.5 4区 计算机科学 Q3 COMPUTER SCIENCE, INFORMATION SYSTEMS Pub Date : 2024-10-07 DOI: 10.1002/nem.2305
Chunhua Jin, Zhiwei Chen, Wenyu Qin, Kaijun Sun, Guanhua Chen, Liqing Chen

As the internet of vehicles (IoV) technology develops, it promotes the intelligent interaction among vehicles, roadside units, and the environment. Nevertheless, it also brings vehicle information security challenges. In recent years, vehicle data sharing is suffering to algorithm substitution attacks (ASA), which means backdoor adversaries can carry out filtering attacks through data sharing. Therefore, this paper designs a blockchain-based proxy re-encryption (PRE) scheme with cryptographic reverse firewall (BIBPR-CRF) for IoV. In our proposal, CRF can promise the internal safety of vehicle units. More specifically, it can prevent ASA attacks while ensuring chosen plaintext attack (CPA)-security. Meanwhile, the PRE algorithm can provide the confidential sharing and secure operation of data. Moreover, we use a consortium blockchain service center (CBSC) to store the first ciphertext and re-encrypt it with smart contracts on the blockchain, which can avoid single point of failure and achieve higher efficiency compared to proxy servers. Finally, we evaluate the performance of BIBPR-CRF with regard to communication cost, computational cost, and energy consumption. Our proposal is the most fitting for IoV application, in contrast with the other three schemes.

随着车联网(IoV)技术的发展,它促进了车辆、路边装置和环境之间的智能互动。然而,它也带来了车辆信息安全方面的挑战。近年来,车辆数据共享受到算法替换攻击(ASA)的影响,即后门对手可以通过数据共享进行过滤攻击。因此,本文为物联网设计了一种基于区块链的代理重加密(PRE)方案和加密反向防火墙(BIBPR-CRF)。在我们的建议中,CRF 可以保证车辆的内部安全。更具体地说,它可以防止 ASA 攻击,同时确保选择明文攻击(CPA)的安全性。同时,PRE 算法可以提供数据的保密共享和安全操作。此外,我们使用联盟区块链服务中心(CBSC)来存储第一份密文,并通过区块链上的智能合约进行重新加密,这样可以避免单点故障,与代理服务器相比效率更高。最后,我们评估了 BIBPR-CRF 在通信成本、计算成本和能耗方面的性能。与其他三种方案相比,我们的建议最适合物联网应用。
{"title":"A Blockchain-Based Proxy Re-Encryption Scheme With Cryptographic Reverse Firewall for IoV","authors":"Chunhua Jin,&nbsp;Zhiwei Chen,&nbsp;Wenyu Qin,&nbsp;Kaijun Sun,&nbsp;Guanhua Chen,&nbsp;Liqing Chen","doi":"10.1002/nem.2305","DOIUrl":"https://doi.org/10.1002/nem.2305","url":null,"abstract":"<div>\u0000 \u0000 <p>As the internet of vehicles (IoV) technology develops, it promotes the intelligent interaction among vehicles, roadside units, and the environment. Nevertheless, it also brings vehicle information security challenges. In recent years, vehicle data sharing is suffering to algorithm substitution attacks (ASA), which means backdoor adversaries can carry out filtering attacks through data sharing. Therefore, this paper designs a blockchain-based proxy re-encryption (PRE) scheme with cryptographic reverse firewall (BIBPR-CRF) for IoV. In our proposal, CRF can promise the internal safety of vehicle units. More specifically, it can prevent ASA attacks while ensuring chosen plaintext attack (CPA)-security. Meanwhile, the PRE algorithm can provide the confidential sharing and secure operation of data. Moreover, we use a consortium blockchain service center (CBSC) to store the first ciphertext and re-encrypt it with smart contracts on the blockchain, which can avoid single point of failure and achieve higher efficiency compared to proxy servers. Finally, we evaluate the performance of BIBPR-CRF with regard to communication cost, computational cost, and energy consumption. Our proposal is the most fitting for IoV application, in contrast with the other three schemes.</p>\u0000 </div>","PeriodicalId":14154,"journal":{"name":"International Journal of Network Management","volume":"34 6","pages":""},"PeriodicalIF":1.5,"publicationDate":"2024-10-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142641653","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Updatable Signature Scheme With Weakened Token and No-Directional Key Update 具有弱化令牌和非定向密钥更新功能的可更新签名方案
IF 1.5 4区 计算机科学 Q3 COMPUTER SCIENCE, INFORMATION SYSTEMS Pub Date : 2024-09-23 DOI: 10.1002/nem.2304
Jiacheng Zhou, Zhenhua Liu, Baocang Wang

Updatable signature (US) resists key compromise attacks and is integral in numerous fields that require authentication. However, previous US schemes granted excessive power to update token, which cannot achieve no-directional key update. In this paper, we improve Cini et al.'s US scheme by weakening update token. The improvement lies in changing the mode of generating an update token, from the signer alone to the signer and the server cooperatively. Specifically, they first negotiate a secret value, which is then used by the signer to generate an update token. This mode ensures that only the entity who owns the secret value can use the update token to update a signature. Furthermore, we employ indistinguishability obfuscation to minimize information leakage through update token. These advancements make the improved updatable signature scheme achieve no-directional key update and unidirectional signature update. Finally, we present an enhanced security model, where an adversary is permitted to freely corrupt update tokens and signing keys, except the signing key at challenge epoch, and then prove the improved scheme to be unforgeable based on CDH hardness.

可更新签名(US)可抵御密钥泄露攻击,在众多需要验证的领域中不可或缺。然而,以前的 US 方案赋予了更新令牌过大的权力,无法实现密钥的无定向更新。在本文中,我们通过弱化更新令牌来改进 Cini 等人的 US 方案。改进之处在于改变了生成更新令牌的模式,从签名者单独生成更新令牌改为签名者和服务器合作生成更新令牌。具体来说,他们首先协商一个秘密值,然后由签名者使用该值生成更新令牌。这种模式确保了只有拥有秘密值的实体才能使用更新令牌更新签名。此外,我们还采用了无差别混淆技术,以最大限度地减少通过更新令牌泄露的信息。这些进步使改进后的可更新签名方案实现了无方向密钥更新和单向签名更新。最后,我们提出了一个增强的安全模型,允许对手随意破坏更新令牌和签名密钥(除了在挑战时间的签名密钥),然后基于 CDH 硬度证明了改进方案的不可伪造性。
{"title":"Updatable Signature Scheme With Weakened Token and No-Directional Key Update","authors":"Jiacheng Zhou,&nbsp;Zhenhua Liu,&nbsp;Baocang Wang","doi":"10.1002/nem.2304","DOIUrl":"https://doi.org/10.1002/nem.2304","url":null,"abstract":"<div>\u0000 \u0000 <p>Updatable signature (US) resists key compromise attacks and is integral in numerous fields that require authentication. However, previous US schemes granted excessive power to update token, which cannot achieve no-directional key update. In this paper, we improve Cini et al.'s US scheme by weakening update token. The improvement lies in changing the mode of generating an update token, from the signer alone to the signer and the server cooperatively. Specifically, they first negotiate a secret value, which is then used by the signer to generate an update token. This mode ensures that only the entity who owns the secret value can use the update token to update a signature. Furthermore, we employ indistinguishability obfuscation to minimize information leakage through update token. These advancements make the improved updatable signature scheme achieve no-directional key update and unidirectional signature update. Finally, we present an enhanced security model, where an adversary is permitted to freely corrupt update tokens and signing keys, except the signing key at challenge epoch, and then prove the improved scheme to be unforgeable based on CDH hardness.</p>\u0000 </div>","PeriodicalId":14154,"journal":{"name":"International Journal of Network Management","volume":"35 1","pages":""},"PeriodicalIF":1.5,"publicationDate":"2024-09-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142724230","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Homomorphic Witness Encryption and Its Applications 同态见证加密及其应用
IF 1.5 4区 计算机科学 Q3 COMPUTER SCIENCE, INFORMATION SYSTEMS Pub Date : 2024-09-20 DOI: 10.1002/nem.2303
Yuzhu Wang, Xingbo Wang, Mingwu Zhang
<div> <p>In witness encryption (<span>WE</span>), an instance <span></span><math> <semantics> <mrow> <mi>x</mi> </mrow> <annotation>$$ x $$</annotation> </semantics></math> of an <span>NP</span> problem is allowed to be used to encrypt a message, and who holding a witness of the problem can efficiently decrypt the ciphertext. In this work, we put forth the concept of homomorphic witness encryption (<span>HWE</span>), where one can evaluate functions over ciphertexts of the same instance without decrypting them, that is, one can manipulate a set of ciphertexts with messages <span></span><math> <semantics> <mrow> <mo>(</mo> <msub> <mrow> <mi>M</mi> </mrow> <mrow> <mn>1</mn> </mrow> </msub> <mo>,</mo> <mo>⋯</mo> <mspace></mspace> <mo>,</mo> <msub> <mrow> <mi>M</mi> </mrow> <mrow> <mi>n</mi> </mrow> </msub> <mo>)</mo> </mrow> <annotation>$$ left({M}_1,cdots, {M}_nright) $$</annotation> </semantics></math> to obtain the evaluation of <span></span><math> <semantics> <mrow> <mi>f</mi> <mo>(</mo> <msub> <mrow> <mi>M</mi> </mrow> <mrow> <mn>1</mn> </mrow> </msub> <mo>,</mo> <mo>⋯</mo> <mspace></mspace> <mo>,</mo> <msub> <mrow> <mi>M</mi> </mrow> <mrow> <mi>n</mi> </mrow> </msub> <mo>)</mo> </mrow> <annotation>$$ fleft({M}_1,cdots, {M}_nright) $$</annotation> </semantics></math>, for any function <span></span><math> <semantics> <mrow> <mi>f</mi> </mrow> <annotation>$$ f $$</annotation> </semantics></math>. We declare that such homomorphic witness encryption schemes can be generically constructed from indistinguishable obfuscation (<span></span><math> <semantics> <mrow> <mi>i</mi> <mi>O</mi> </mrow> <annotation>$$ imathcal{O} $$</annotation>
在见证加密(WE)中,允许使用NP问题的实例x $$ x $$对消息进行加密,并且持有该问题的见证的人可以有效地解密密文。在这项工作中,我们提出了同态见证加密(HWE)的概念,其中可以在不解密的情况下对同一实例的密文进行函数评估,即可以操作一组具有消息(m1,⋯,M n) $$ left({M}_1,cdots, {M}_nright) $$得到f (m1)的取值,,⋯,M n) $$ fleft({M}_1,cdots, {M}_nright) $$,对于任何函数f $$ f $$。我们声明,这种同态见证加密方案可以从不可区分的混淆(i O $$ imathcal{O} $$)中构造,适用于任何函数类。然后,我们提出了乘性同态见证加密(MHWE)和线性同态见证加密(LHWE)的实例化,使用i O $$ imathcal{O} $$,子集和等NP问题的同态加密和批处理的gs证明系统,使我们能够对密文的乘法运算和线性运算进行评估。此外,我们通过为感兴趣的应用程序(如同态时间锁加密、多方合同签名和电子投票)提出新的协议,展示了同态见证加密的实用性。
{"title":"Homomorphic Witness Encryption and Its Applications","authors":"Yuzhu Wang,&nbsp;Xingbo Wang,&nbsp;Mingwu Zhang","doi":"10.1002/nem.2303","DOIUrl":"https://doi.org/10.1002/nem.2303","url":null,"abstract":"&lt;div&gt;\u0000 \u0000 &lt;p&gt;In witness encryption (&lt;span&gt;WE&lt;/span&gt;), an instance &lt;span&gt;&lt;/span&gt;&lt;math&gt;\u0000 &lt;semantics&gt;\u0000 &lt;mrow&gt;\u0000 &lt;mi&gt;x&lt;/mi&gt;\u0000 &lt;/mrow&gt;\u0000 &lt;annotation&gt;$$ x $$&lt;/annotation&gt;\u0000 &lt;/semantics&gt;&lt;/math&gt; of an &lt;span&gt;NP&lt;/span&gt; problem is allowed to be used to encrypt a message, and who holding a witness of the problem can efficiently decrypt the ciphertext. In this work, we put forth the concept of homomorphic witness encryption (&lt;span&gt;HWE&lt;/span&gt;), where one can evaluate functions over ciphertexts of the same instance without decrypting them, that is, one can manipulate a set of ciphertexts with messages &lt;span&gt;&lt;/span&gt;&lt;math&gt;\u0000 &lt;semantics&gt;\u0000 &lt;mrow&gt;\u0000 &lt;mo&gt;(&lt;/mo&gt;\u0000 &lt;msub&gt;\u0000 &lt;mrow&gt;\u0000 &lt;mi&gt;M&lt;/mi&gt;\u0000 &lt;/mrow&gt;\u0000 &lt;mrow&gt;\u0000 &lt;mn&gt;1&lt;/mn&gt;\u0000 &lt;/mrow&gt;\u0000 &lt;/msub&gt;\u0000 &lt;mo&gt;,&lt;/mo&gt;\u0000 &lt;mo&gt;⋯&lt;/mo&gt;\u0000 &lt;mspace&gt;&lt;/mspace&gt;\u0000 &lt;mo&gt;,&lt;/mo&gt;\u0000 &lt;msub&gt;\u0000 &lt;mrow&gt;\u0000 &lt;mi&gt;M&lt;/mi&gt;\u0000 &lt;/mrow&gt;\u0000 &lt;mrow&gt;\u0000 &lt;mi&gt;n&lt;/mi&gt;\u0000 &lt;/mrow&gt;\u0000 &lt;/msub&gt;\u0000 &lt;mo&gt;)&lt;/mo&gt;\u0000 &lt;/mrow&gt;\u0000 &lt;annotation&gt;$$ left({M}_1,cdots, {M}_nright) $$&lt;/annotation&gt;\u0000 &lt;/semantics&gt;&lt;/math&gt; to obtain the evaluation of &lt;span&gt;&lt;/span&gt;&lt;math&gt;\u0000 &lt;semantics&gt;\u0000 &lt;mrow&gt;\u0000 &lt;mi&gt;f&lt;/mi&gt;\u0000 &lt;mo&gt;(&lt;/mo&gt;\u0000 &lt;msub&gt;\u0000 &lt;mrow&gt;\u0000 &lt;mi&gt;M&lt;/mi&gt;\u0000 &lt;/mrow&gt;\u0000 &lt;mrow&gt;\u0000 &lt;mn&gt;1&lt;/mn&gt;\u0000 &lt;/mrow&gt;\u0000 &lt;/msub&gt;\u0000 &lt;mo&gt;,&lt;/mo&gt;\u0000 &lt;mo&gt;⋯&lt;/mo&gt;\u0000 &lt;mspace&gt;&lt;/mspace&gt;\u0000 &lt;mo&gt;,&lt;/mo&gt;\u0000 &lt;msub&gt;\u0000 &lt;mrow&gt;\u0000 &lt;mi&gt;M&lt;/mi&gt;\u0000 &lt;/mrow&gt;\u0000 &lt;mrow&gt;\u0000 &lt;mi&gt;n&lt;/mi&gt;\u0000 &lt;/mrow&gt;\u0000 &lt;/msub&gt;\u0000 &lt;mo&gt;)&lt;/mo&gt;\u0000 &lt;/mrow&gt;\u0000 &lt;annotation&gt;$$ fleft({M}_1,cdots, {M}_nright) $$&lt;/annotation&gt;\u0000 &lt;/semantics&gt;&lt;/math&gt;, for any function &lt;span&gt;&lt;/span&gt;&lt;math&gt;\u0000 &lt;semantics&gt;\u0000 &lt;mrow&gt;\u0000 &lt;mi&gt;f&lt;/mi&gt;\u0000 &lt;/mrow&gt;\u0000 &lt;annotation&gt;$$ f $$&lt;/annotation&gt;\u0000 &lt;/semantics&gt;&lt;/math&gt;. We declare that such homomorphic witness encryption schemes can be generically constructed from indistinguishable obfuscation (&lt;span&gt;&lt;/span&gt;&lt;math&gt;\u0000 &lt;semantics&gt;\u0000 &lt;mrow&gt;\u0000 &lt;mi&gt;i&lt;/mi&gt;\u0000 &lt;mi&gt;O&lt;/mi&gt;\u0000 &lt;/mrow&gt;\u0000 &lt;annotation&gt;$$ imathcal{O} $$&lt;/annotation&gt;\u0000 ","PeriodicalId":14154,"journal":{"name":"International Journal of Network Management","volume":"35 1","pages":""},"PeriodicalIF":1.5,"publicationDate":"2024-09-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142861880","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Risk-Aware SDN Defense Framework Against Anti-Honeypot Attacks Using Safe Reinforcement Learning 利用安全强化学习对抗反蜜罐攻击的风险意识 SDN 防御框架
IF 1.5 4区 计算机科学 Q3 COMPUTER SCIENCE, INFORMATION SYSTEMS Pub Date : 2024-09-16 DOI: 10.1002/nem.2297
Dongying Gao, Caiwei Guo, Yi Zhang, Wen Ji, Zhilei Lv, Zheng Li, Kunsan Zhang, Ruibin Lin

The development of multiple attack methods by external attackers in recent years poses a huge challenge to the security and efficient operation of software-defined networks (SDN), which are the core of operational controllers and data storage. Therefore, it is critical to ensure that the normal process of network interaction between SDN servers and users is protected from external attacks. In this paper, we propose a risk-aware SDN defense framework based on safe reinforcement learning (SRL) to counter multiple attack actions. Specifically, the defender uses SRL to maximize the utility by choosing to provide a honeypot service or pseudo-honeypot service within predefined security constraints, while the external attacker maximizes the utility by choosing an anti-honeypot attack or masquerade attack. To describe the system risk in detail, we introduce the risk level function to model the simultaneous dynamic attack and defense processes. Simulation results demonstrate that our proposed risk-aware scheme improves the defense utility by 17.5% and 142.4% and reduces the system risk by 42.7% and 59.6% compared to the QLearning scheme and the Random scheme, respectively.

近年来,外部攻击者开发出多种攻击手段,对作为运行控制器和数据存储核心的软件定义网络(SDN)的安全和高效运行提出了巨大挑战。因此,确保 SDN 服务器与用户之间正常的网络交互过程免受外部攻击至关重要。本文提出了一种基于安全强化学习(SRL)的风险感知 SDN 防御框架,以应对多种攻击行为。具体来说,防御者利用 SRL 在预定义的安全约束条件下选择提供蜜罐服务或伪蜜罐服务,从而实现效用最大化;而外部攻击者则通过选择反蜜罐攻击或伪装攻击来实现效用最大化。为了详细描述系统风险,我们引入了风险等级函数来模拟同时进行的动态攻击和防御过程。仿真结果表明,与 QLearning 方案和随机方案相比,我们提出的风险感知方案分别提高了 17.5% 和 142.4% 的防御效用,降低了 42.7% 和 59.6% 的系统风险。
{"title":"Risk-Aware SDN Defense Framework Against Anti-Honeypot Attacks Using Safe Reinforcement Learning","authors":"Dongying Gao,&nbsp;Caiwei Guo,&nbsp;Yi Zhang,&nbsp;Wen Ji,&nbsp;Zhilei Lv,&nbsp;Zheng Li,&nbsp;Kunsan Zhang,&nbsp;Ruibin Lin","doi":"10.1002/nem.2297","DOIUrl":"10.1002/nem.2297","url":null,"abstract":"<div>\u0000 \u0000 <p>The development of multiple attack methods by external attackers in recent years poses a huge challenge to the security and efficient operation of software-defined networks (SDN), which are the core of operational controllers and data storage. Therefore, it is critical to ensure that the normal process of network interaction between SDN servers and users is protected from external attacks. In this paper, we propose a risk-aware SDN defense framework based on safe reinforcement learning (SRL) to counter multiple attack actions. Specifically, the defender uses SRL to maximize the utility by choosing to provide a honeypot service or pseudo-honeypot service within predefined security constraints, while the external attacker maximizes the utility by choosing an anti-honeypot attack or masquerade attack. To describe the system risk in detail, we introduce the risk level function to model the simultaneous dynamic attack and defense processes. Simulation results demonstrate that our proposed risk-aware scheme improves the defense utility by 17.5% and 142.4% and reduces the system risk by 42.7% and 59.6% compared to the QLearning scheme and the Random scheme, respectively.</p>\u0000 </div>","PeriodicalId":14154,"journal":{"name":"International Journal of Network Management","volume":"34 6","pages":""},"PeriodicalIF":1.5,"publicationDate":"2024-09-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142247756","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Editorial for the IJNM Special Issue From the Best Papers of IEEE ICBC 2023 “Advancing Blockchain and Cryptocurrency” IEEE ICBC 2023 年度最佳论文《推进区块链和加密货币》IJNM 特刊编辑部文章
IF 1.5 4区 计算机科学 Q3 COMPUTER SCIENCE, INFORMATION SYSTEMS Pub Date : 2024-09-04 DOI: 10.1002/nem.2301
Laura Ricci, Moayad Aloqaily, Vinayaka Pandit

This special issue contains extended versions of the best papers from 2023 IEEE International Conference on Blockchain and Cryptocurrency. The conference was held from May 1 to May 5, 2023, in Dubai, UAE. The papers in this special issue explore crucial advancements in illicit activity tracking, transaction mechanisms, synchronization, and database integration. The following papers highlight critical advancements and address complex challenges in these domains.

The first paper, “The next phase of identifying illicit activity in Bitcoin” by Jack Nicholls and his team, deepens the discourse on securing Bitcoin transactions. By analyzing current methods and proposing enhancements through machine learning, this paper provides crucial insights into improving the detection of illicit activities and enhancing network security.

In the second paper, “Transaction fee mechanisms with farsighted miners,” authored by Jens Leth Hougaard and colleagues, strategic miner behaviors in the Ethereum network are explored under the new fee mechanism, EIP1559. The paper extends the discussion to strategic foresight in mining operations, presenting a model that evaluates the impacts of varying degrees of hashing power and foresight on network throughput and block variability.

The third contribution, “Out-of-band transaction pool sync for large dynamic blockchain networks” by Novak Boskov et al., innovates the synchronization of transaction pools across large and dynamic blockchain networks. Employing the novel SREP algorithm, this study provides a comprehensive approach with proven scalability and performance improvements, particularly emphasizing reduced block propagation delays and bandwidth overhead.

The fourth paper, “DELTA: A Modular, Transparent and Efficient Synchronization of DLTs and Databases” by Fernández-Bravo Peñuela et al., addresses the integration of blockchain data into traditional databases. The DELTA system offers a seamless, efficient solution for querying blockchain data within enterprise systems, proving significantly faster and more reliable than existing methods.

These papers collectively enhance our understanding of blockchain technology's application, offering new methodologies, insights into miner behavior, security enhancements, and integration techniques for enterprise systems. Their contributions are instrumental in paving the way for more robust, efficient, and secure blockchain networks.

We are immensely grateful to the authors for their innovative research, the reviewers for their critical insights, and the editorial team for their commitment to compiling this transformative special issue.

本特刊收录了 2023 年 IEEE 区块链和加密货币国际会议的优秀论文扩展版。会议于 2023 年 5 月 1 日至 5 月 5 日在阿联酋迪拜举行。本特刊中的论文探讨了非法活动追踪、交易机制、同步和数据库集成方面的重要进展。杰克-尼克尔斯(Jack Nicholls)和他的团队撰写的第一篇论文《比特币非法活动识别的下一阶段》深化了关于比特币交易安全的讨论。在第二篇论文 "有远见矿工的交易费机制"(Transaction fee mechanisms with farsighted miners)中,Jens Leth Hougaard 及其同事探讨了在新的收费机制 EIP1559 下以太坊网络中的战略性矿工行为。Novak Boskov 等人撰写的第三篇论文《大型动态区块链网络的带外交易池同步》对大型动态区块链网络的交易池同步进行了创新。第四篇论文是 Fernández-Bravo Peñuela 等人撰写的 "DELTA:模块化、透明和高效的 DLT 与数据库同步",该论文探讨了将区块链数据整合到传统数据库中的问题。DELTA 系统为在企业系统中查询区块链数据提供了一个无缝、高效的解决方案,证明比现有方法更快、更可靠。这些论文共同提高了我们对区块链技术应用的理解,提供了新的方法、对矿工行为的洞察、安全性增强以及企业系统的集成技术。我们非常感谢作者们的创新研究,感谢审稿人的重要见解,感谢编辑团队致力于编纂这本具有变革意义的特刊。
{"title":"Editorial for the IJNM Special Issue From the Best Papers of IEEE ICBC 2023 “Advancing Blockchain and Cryptocurrency”","authors":"Laura Ricci,&nbsp;Moayad Aloqaily,&nbsp;Vinayaka Pandit","doi":"10.1002/nem.2301","DOIUrl":"10.1002/nem.2301","url":null,"abstract":"<p>This special issue contains extended versions of the best papers from 2023 IEEE International Conference on Blockchain and Cryptocurrency. The conference was held from May 1 to May 5, 2023, in Dubai, UAE. The papers in this special issue explore crucial advancements in illicit activity tracking, transaction mechanisms, synchronization, and database integration. The following papers highlight critical advancements and address complex challenges in these domains.</p><p>The first paper, “The next phase of identifying illicit activity in Bitcoin” by Jack Nicholls and his team, deepens the discourse on securing Bitcoin transactions. By analyzing current methods and proposing enhancements through machine learning, this paper provides crucial insights into improving the detection of illicit activities and enhancing network security.</p><p>In the second paper, “Transaction fee mechanisms with farsighted miners,” authored by Jens Leth Hougaard and colleagues, strategic miner behaviors in the Ethereum network are explored under the new fee mechanism, EIP1559. The paper extends the discussion to strategic foresight in mining operations, presenting a model that evaluates the impacts of varying degrees of hashing power and foresight on network throughput and block variability.</p><p>The third contribution, “Out-of-band transaction pool sync for large dynamic blockchain networks” by Novak Boskov et al., innovates the synchronization of transaction pools across large and dynamic blockchain networks. Employing the novel SREP algorithm, this study provides a comprehensive approach with proven scalability and performance improvements, particularly emphasizing reduced block propagation delays and bandwidth overhead.</p><p>The fourth paper, “DELTA: A Modular, Transparent and Efficient Synchronization of DLTs and Databases” by Fernández-Bravo Peñuela et al., addresses the integration of blockchain data into traditional databases. The DELTA system offers a seamless, efficient solution for querying blockchain data within enterprise systems, proving significantly faster and more reliable than existing methods.</p><p>These papers collectively enhance our understanding of blockchain technology's application, offering new methodologies, insights into miner behavior, security enhancements, and integration techniques for enterprise systems. Their contributions are instrumental in paving the way for more robust, efficient, and secure blockchain networks.</p><p>We are immensely grateful to the authors for their innovative research, the reviewers for their critical insights, and the editorial team for their commitment to compiling this transformative special issue.</p>","PeriodicalId":14154,"journal":{"name":"International Journal of Network Management","volume":"34 5","pages":""},"PeriodicalIF":1.5,"publicationDate":"2024-09-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://onlinelibrary.wiley.com/doi/epdf/10.1002/nem.2301","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142177412","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Duo-H: An Effectual Consensus Algorithm Using Two-Tier Shard Consortium Blockchain Mechanism for Enhanced Privacy Protection Duo-H:利用双层碎片联盟区块链机制加强隐私保护的有效共识算法
IF 1.5 4区 计算机科学 Q3 COMPUTER SCIENCE, INFORMATION SYSTEMS Pub Date : 2024-09-02 DOI: 10.1002/nem.2300
C. H. Sarada Devi, R. Anand, R. Hemalatha, B. Uma Maheswari

Blockchain is an innovative technology for storing data in decentralized, distributed, and secure chain blocks. Consortium blockchains are commonly used in transactions where transactions between organizations are also achieved by the blockchain. In the classic consortium blockchain system, entire nodes are added to each other in the process of transaction consensus. This leads to lower confidentiality in protecting transaction data within the organizations in the consortium. The throughput of the existing consortium blockchain system is still low. To solve the above problems, the paper proposes a two-tier consortium blockchain with transaction privacy based on sharding technology. First, a trust value assessment is carried out to select the nodes of the blockchain. The duo-head observation strategy uses these trust values to identify the nonmalicious node. Finally, the consensus separation approach based on the guarantee mechanism strategy with the shard nodes is presented. This approach is used to select reliable nodes for the blocks to be stored. The proposed consortium blockchain approach evaluation is done in terms of latency, throughput, and transactions per second metrics. As a result of the evaluations, the proposed model with 32 shards possesses 143,891 tx/s$$ tx/s $$ of throughput and 1.11 s of latency. Moreover, by the proposed two-tier consortium model, time consumption is also decreased when uploading data. For a data set of 50,000, the suggested model has a time consumption of 96 s. The proposed research results in higher throughput and less latency in transactions. Also, the research enhances the scalability and reliability by overcoming the poor node issues.

区块链是一种创新技术,用于将数据存储在去中心化、分布式和安全的链块中。联盟区块链通常用于交易,组织之间的交易也通过区块链实现。在经典的联盟区块链系统中,整个节点在交易共识过程中相互添加。这导致保护联盟内各组织交易数据的保密性较低。现有联盟区块链系统的吞吐量仍然较低。为解决上述问题,本文提出了一种基于分片技术的具有交易保密性的双层联盟区块链。首先,通过信任值评估来选择区块链的节点。双头观察策略利用这些信任值来识别非恶意节点。最后,介绍了基于分片节点担保机制策略的共识分离方法。这种方法用于为要存储的区块选择可靠的节点。提议的联盟区块链方法从延迟、吞吐量和每秒交易量等指标进行了评估。评估结果显示,32 个分片的拟议模型拥有 143 891 的吞吐量和 1.11 秒的延迟。此外,通过提议的两层联盟模式,上传数据的时间消耗也减少了。对于 50,000 个数据集,建议的模型耗时 96 秒。此外,这项研究还克服了节点不佳的问题,提高了可扩展性和可靠性。
{"title":"Duo-H: An Effectual Consensus Algorithm Using Two-Tier Shard Consortium Blockchain Mechanism for Enhanced Privacy Protection","authors":"C. H. Sarada Devi,&nbsp;R. Anand,&nbsp;R. Hemalatha,&nbsp;B. Uma Maheswari","doi":"10.1002/nem.2300","DOIUrl":"10.1002/nem.2300","url":null,"abstract":"<div>\u0000 \u0000 <p>Blockchain is an innovative technology for storing data in decentralized, distributed, and secure chain blocks. Consortium blockchains are commonly used in transactions where transactions between organizations are also achieved by the blockchain. In the classic consortium blockchain system, entire nodes are added to each other in the process of transaction consensus. This leads to lower confidentiality in protecting transaction data within the organizations in the consortium. The throughput of the existing consortium blockchain system is still low. To solve the above problems, the paper proposes a two-tier consortium blockchain with transaction privacy based on sharding technology. First, a trust value assessment is carried out to select the nodes of the blockchain. The duo-head observation strategy uses these trust values to identify the nonmalicious node. Finally, the consensus separation approach based on the guarantee mechanism strategy with the shard nodes is presented. This approach is used to select reliable nodes for the blocks to be stored. The proposed consortium blockchain approach evaluation is done in terms of latency, throughput, and transactions per second metrics. As a result of the evaluations, the proposed model with 32 shards possesses 143,891 \u0000<span></span><math>\u0000 <semantics>\u0000 <mrow>\u0000 <mi>tx</mi>\u0000 <mo>/</mo>\u0000 <mi>s</mi>\u0000 </mrow>\u0000 <annotation>$$ tx/s $$</annotation>\u0000 </semantics></math> of throughput and 1.11 s of latency. Moreover, by the proposed two-tier consortium model, time consumption is also decreased when uploading data. For a data set of 50,000, the suggested model has a time consumption of 96 s. The proposed research results in higher throughput and less latency in transactions. Also, the research enhances the scalability and reliability by overcoming the poor node issues.</p>\u0000 </div>","PeriodicalId":14154,"journal":{"name":"International Journal of Network Management","volume":"34 6","pages":""},"PeriodicalIF":1.5,"publicationDate":"2024-09-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142177413","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
An Intelligent and Trust-Enabled Farming Systems With Blockchain and Digital Twins on Mobile Edge Computing 移动边缘计算上的区块链和数字双胞胎智能化、可信任的农业系统
IF 1.5 4区 计算机科学 Q3 COMPUTER SCIENCE, INFORMATION SYSTEMS Pub Date : 2024-08-20 DOI: 10.1002/nem.2299
Geetanjali Rathee, Hemraj Saini, Selvaraj Praveen Chakkravarthy, Rajagopal Maheswar

Advancement and flourishment in mobile edge computing (MEC) have motivated the farmers to deploy an efficient ecosystem in their farms. For further real-time monitoring and surveillance of the environment along with the deployment of intelligent farming, digital twin is considered as one of the emerging and most promising technologies. For proper optimization and utilization of physical systems, the physical components of the ecosystems are connected with the digital space. Further, the smart technologies and devices have convinced to address the expected level of requirements for accessing the rapid growth in farming associated with digital twins. However, with a large number of smart devices, huge amount of generated information from heterogeneous devices may increase the privacy and security concern by challenging the interrupting operations and management of services in smart farming. In addition, the growing risks associated with MEC by modifying the sensor readings and quality of service further affect the overall growth of intelligent farming. In order to resolve these challenges, this paper has proposed a secure surveillance architecture to detect deviations by incorporating digital twins in the ecosystem. Further, for real-time monitoring and preprocessing of information, we have integrated a four-dimensional trust mechanism along with blockchain. The four-dimensional trusted method recognizes the behavior of each communicating device during the transmission of information in the network. Further, blockchain strengthens the surveillance process of each device behavior by continuously monitoring their activities. The proposed mechanism is tested and verified against various abnormalities received from sensors by simulating false use cases in the ecosystem and compared against various security metrics over existing approaches. Furthermore, the proposed mechanism is validated against several security threats such as control command threat, coordinated cyber threats, accuracy, and decision-making and prediction of records over existing methods.

移动边缘计算(MEC)的进步和蓬勃发展促使农民在农场中部署高效的生态系统。为了进一步对环境进行实时监测和监控,同时部署智能农业,数字孪生被认为是最有前途的新兴技术之一。为了适当优化和利用物理系统,生态系统的物理组件与数字空间相连接。此外,智能技术和设备已确信能够满足与数字孪生相关的农业快速增长的预期要求。然而,随着智能设备的大量出现,来自异构设备的海量信息可能会增加隐私和安全问题,对智能农业服务的中断操作和管理构成挑战。此外,通过修改传感器读数和服务质量而与 MEC 相关的风险不断增加,进一步影响了智能农业的整体发展。为了解决这些挑战,本文提出了一种安全监控架构,通过将数字双胞胎纳入生态系统来检测偏差。此外,为了实现实时监控和信息预处理,我们将四维信任机制与区块链结合在一起。四维信任方法可识别网络信息传输过程中每个通信设备的行为。此外,区块链通过持续监控每个设备的活动,加强了对其行为的监控过程。通过模拟生态系统中的虚假用例,针对从传感器接收到的各种异常情况对所提出的机制进行了测试和验证,并与现有方法的各种安全指标进行了比较。此外,与现有方法相比,还针对控制指令威胁、协同网络威胁、准确性、决策和记录预测等几种安全威胁对所提出的机制进行了验证。
{"title":"An Intelligent and Trust-Enabled Farming Systems With Blockchain and Digital Twins on Mobile Edge Computing","authors":"Geetanjali Rathee,&nbsp;Hemraj Saini,&nbsp;Selvaraj Praveen Chakkravarthy,&nbsp;Rajagopal Maheswar","doi":"10.1002/nem.2299","DOIUrl":"10.1002/nem.2299","url":null,"abstract":"<div>\u0000 \u0000 <p>Advancement and flourishment in mobile edge computing (MEC) have motivated the farmers to deploy an efficient ecosystem in their farms. For further real-time monitoring and surveillance of the environment along with the deployment of intelligent farming, digital twin is considered as one of the emerging and most promising technologies. For proper optimization and utilization of physical systems, the physical components of the ecosystems are connected with the digital space. Further, the smart technologies and devices have convinced to address the expected level of requirements for accessing the rapid growth in farming associated with digital twins. However, with a large number of smart devices, huge amount of generated information from heterogeneous devices may increase the privacy and security concern by challenging the interrupting operations and management of services in smart farming. In addition, the growing risks associated with MEC by modifying the sensor readings and quality of service further affect the overall growth of intelligent farming. In order to resolve these challenges, this paper has proposed a secure surveillance architecture to detect deviations by incorporating digital twins in the ecosystem. Further, for real-time monitoring and preprocessing of information, we have integrated a four-dimensional trust mechanism along with blockchain. The four-dimensional trusted method recognizes the behavior of each communicating device during the transmission of information in the network. Further, blockchain strengthens the surveillance process of each device behavior by continuously monitoring their activities. The proposed mechanism is tested and verified against various abnormalities received from sensors by simulating false use cases in the ecosystem and compared against various security metrics over existing approaches. Furthermore, the proposed mechanism is validated against several security threats such as control command threat, coordinated cyber threats, accuracy, and decision-making and prediction of records over existing methods.</p>\u0000 </div>","PeriodicalId":14154,"journal":{"name":"International Journal of Network Management","volume":"35 1","pages":""},"PeriodicalIF":1.5,"publicationDate":"2024-08-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142177489","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
ProKube: Proactive Kubernetes Orchestrator for Inference in Heterogeneous Edge Computing ProKube:用于异构边缘计算推理的主动式 Kubernetes 协调器
IF 1.5 4区 计算机科学 Q3 COMPUTER SCIENCE, INFORMATION SYSTEMS Pub Date : 2024-08-18 DOI: 10.1002/nem.2298
Babar Ali, Muhammed Golec, Sukhpal Singh Gill, Felix Cuadrado, Steve Uhlig

Deep neural network (DNN) and machine learning (ML) models/ inferences produce highly accurate results demanding enormous computational resources. The limited capacity of end-user smart gadgets drives companies to exploit computational resources in an edge-to-cloud continuum and host applications at user-facing locations with users requiring fast responses. Kubernetes hosted inferences with poor resource request estimation results in service level agreement (SLA) violation in terms of latency and below par performance with higher end-to-end (E2E) delays. Lifetime static resource provisioning either hurts user experience for under-resource provisioning or incurs cost with over-provisioning. Dynamic scaling offers to remedy delay by upscaling leading to additional cost whereas a simple migration to another location offering latency in SLA bounds can reduce delay and minimize cost. To address this cost and delay challenges for ML inferences in the inherent heterogeneous, resource-constrained, and distributed edge environment, we propose ProKube, which is a proactive container scaling and migration orchestrator to dynamically adjust the resources and container locations with a fair balance between cost and delay. ProKube is developed in conjunction with Google Kubernetes Engine (GKE) enabling cross-cluster migration and/ or dynamic scaling. It further supports the regular addition of freshly collected logs into scheduling decisions to handle unpredictable network behavior. Experiments conducted in heterogeneous edge settings show the efficacy of ProKube to its counterparts cost greedy (CG), latency greedy (LG), and GeKube (GK). ProKube offers 68%, 7%, and 64% SLA violation reduction to CG, LG, and GK, respectively, and it improves cost by 4.77 cores to LG and offers more cost of 3.94 to CG and GK.

深度神经网络(DNN)和机器学习(ML)模型/推断会产生高度精确的结果,需要大量的计算资源。终端用户智能小工具的容量有限,这促使公司在从边缘到云的连续过程中开发计算资源,并在面向用户的位置托管应用程序,以满足用户对快速响应的要求。Kubernetes 托管推论的资源请求估算能力较差,导致服务水平协议(SLA)遭到违反,表现为延迟和低于标准的性能,端到端(E2E)延迟较高。终身静态资源配置要么会因资源配置不足而损害用户体验,要么会因资源配置过多而产生成本。动态扩展可通过上调规模来弥补延迟,但这会导致额外的成本,而简单地迁移到另一个位置,在服务水平协议(SLA)范围内提供延迟,则可减少延迟并最大限度地降低成本。为了解决在固有的异构、资源受限和分布式边缘环境中进行 ML 推断所面临的成本和延迟挑战,我们提出了 ProKube,它是一种主动式容器扩展和迁移协调器,可动态调整资源和容器位置,在成本和延迟之间取得合理平衡。ProKube 是与谷歌 Kubernetes 引擎(GKE)联合开发的,可实现跨集群迁移和/或动态扩展。它还支持在调度决策中定期添加最新收集的日志,以处理不可预测的网络行为。在异构边缘设置中进行的实验表明,ProKube 的功效优于其同类产品成本贪婪(CG)、延迟贪婪(LG)和 GeKube(GK)。ProKube 比 CG、LG 和 GK 分别减少了 68%、7% 和 64% 的 SLA 违反率,比 LG 提高了 4.77 个内核的成本,比 CG 和 GK 提高了 3.94 个内核的成本。
{"title":"ProKube: Proactive Kubernetes Orchestrator for Inference in Heterogeneous Edge Computing","authors":"Babar Ali,&nbsp;Muhammed Golec,&nbsp;Sukhpal Singh Gill,&nbsp;Felix Cuadrado,&nbsp;Steve Uhlig","doi":"10.1002/nem.2298","DOIUrl":"10.1002/nem.2298","url":null,"abstract":"<div>\u0000 \u0000 <p>Deep neural network (DNN) and machine learning (ML) models/ inferences produce highly accurate results demanding enormous computational resources. The limited capacity of end-user smart gadgets drives companies to exploit computational resources in an edge-to-cloud continuum and host applications at user-facing locations with users requiring fast responses. Kubernetes hosted inferences with poor resource request estimation results in service level agreement (SLA) violation in terms of latency and below par performance with higher end-to-end (E2E) delays. Lifetime static resource provisioning either hurts user experience for under-resource provisioning or incurs cost with over-provisioning. Dynamic scaling offers to remedy delay by upscaling leading to additional cost whereas a simple migration to another location offering latency in SLA bounds can reduce delay and minimize cost. To address this cost and delay challenges for ML inferences in the inherent heterogeneous, resource-constrained, and distributed edge environment, we propose ProKube, which is a proactive container scaling and migration orchestrator to dynamically adjust the resources and container locations with a fair balance between cost and delay. ProKube is developed in conjunction with Google Kubernetes Engine (GKE) enabling cross-cluster migration and/ or dynamic scaling. It further supports the regular addition of freshly collected logs into scheduling decisions to handle unpredictable network behavior. Experiments conducted in heterogeneous edge settings show the efficacy of ProKube to its counterparts cost greedy (CG), latency greedy (LG), and GeKube (GK). ProKube offers 68%, 7%, and 64% SLA violation reduction to CG, LG, and GK, respectively, and it improves cost by 4.77 cores to LG and offers more cost of 3.94 to CG and GK.</p>\u0000 </div>","PeriodicalId":14154,"journal":{"name":"International Journal of Network Management","volume":"35 1","pages":""},"PeriodicalIF":1.5,"publicationDate":"2024-08-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142177415","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
期刊
International Journal of Network Management
全部 Acc. Chem. Res. ACS Applied Bio Materials ACS Appl. Electron. Mater. ACS Appl. Energy Mater. ACS Appl. Mater. Interfaces ACS Appl. Nano Mater. ACS Appl. Polym. Mater. ACS BIOMATER-SCI ENG ACS Catal. ACS Cent. Sci. ACS Chem. Biol. ACS Chemical Health & Safety ACS Chem. Neurosci. ACS Comb. Sci. ACS Earth Space Chem. ACS Energy Lett. ACS Infect. Dis. ACS Macro Lett. ACS Mater. Lett. ACS Med. Chem. Lett. ACS Nano ACS Omega ACS Photonics ACS Sens. ACS Sustainable Chem. Eng. ACS Synth. Biol. Anal. Chem. BIOCHEMISTRY-US Bioconjugate Chem. BIOMACROMOLECULES Chem. Res. Toxicol. Chem. Rev. Chem. Mater. CRYST GROWTH DES ENERG FUEL Environ. Sci. Technol. Environ. Sci. Technol. Lett. Eur. J. Inorg. Chem. IND ENG CHEM RES Inorg. Chem. J. Agric. Food. Chem. J. Chem. Eng. Data J. Chem. Educ. J. Chem. Inf. Model. J. Chem. Theory Comput. J. Med. Chem. J. Nat. Prod. J PROTEOME RES J. Am. Chem. Soc. LANGMUIR MACROMOLECULES Mol. Pharmaceutics Nano Lett. Org. Lett. ORG PROCESS RES DEV ORGANOMETALLICS J. Org. Chem. J. Phys. Chem. J. Phys. Chem. A J. Phys. Chem. B J. Phys. Chem. C J. Phys. Chem. Lett. Analyst Anal. Methods Biomater. Sci. Catal. Sci. Technol. Chem. Commun. Chem. Soc. Rev. CHEM EDUC RES PRACT CRYSTENGCOMM Dalton Trans. Energy Environ. Sci. ENVIRON SCI-NANO ENVIRON SCI-PROC IMP ENVIRON SCI-WAT RES Faraday Discuss. Food Funct. Green Chem. Inorg. Chem. Front. Integr. Biol. J. Anal. At. Spectrom. J. Mater. Chem. A J. Mater. Chem. B J. Mater. Chem. C Lab Chip Mater. Chem. Front. Mater. Horiz. MEDCHEMCOMM Metallomics Mol. Biosyst. Mol. Syst. Des. Eng. Nanoscale Nanoscale Horiz. Nat. Prod. Rep. New J. Chem. Org. Biomol. Chem. Org. Chem. Front. PHOTOCH PHOTOBIO SCI PCCP Polym. Chem.
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1