International Journal of Network Management最新文献

{"title":"Massive Data HBase Storage Method for Electronic Archive Management","authors":"Huaquan Su,&nbsp;Junwei Li,&nbsp;Li Guo,&nbsp;Wanshuo Wang,&nbsp;Yongjiao Yang,&nbsp;You Wen,&nbsp;Kai Li,&nbsp;Pingyan Mo","doi":"10.1002/nem.2308","DOIUrl":"https://doi.org/10.1002/nem.2308","url":null,"abstract":"<div>\u0000 \u0000 <p>The acceleration of the digitalization process in enterprise and university education management has generated a massive amount of electronic archive data. In order to improve the intelligence, storage quality, and efficiency of electronic records management and achieve efficient storage and fast retrieval of data storage models, this study proposes a massive data storage model based on HBase and its retrieval optimization scheme design. In addition, HDFS is introduced to construct a two-level storage structure and optimize values to improve the scalability and load balancing of HBase, and the retrieval efficiency of the HBase storage model is improved through SL-TCR and BF filters. The results indicated that HDFS could automatically recover data after node, network partition, and NameNode failures. The write time of HBase was 56 s, which was 132 and 246 s less than Cassandra and CockroachDB. The query latency was reduced by 23% and 32%, and the query time was reduced by 9988.51 ms, demonstrating high reliability and efficiency. The delay of BF-SL-TCL was 1379.28 s after 1000 searches, which was 224.78 and 212.74 s less than SL-TCL and Blockchain Retrieval Acceleration and reduced the delay under high search times. In summary, this storage model has obvious advantages in storing massive amounts of electronic archive data and has high security and retrieval efficiency, which provides important reference for the design of storage models for future electronic archive management. The storage model designed by the research institute has obvious advantages in storing massive electronic archive data, solving the problem of lack of scalability in electronic archive management when facing massive data, and has high security and retrieval efficiency. It has important reference for the design of storage models for future electronic archive management.</p>\u0000 </div>","PeriodicalId":14154,"journal":{"name":"International Journal of Network Management","volume":"35 1","pages":""},"PeriodicalIF":1.5,"publicationDate":"2024-10-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142737619","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}

{"title":"The Role of Network Centralization in Shaping Digital Sovereignty: An Analysis Under the DNS Lens","authors":"Andrei C. Azevedo,&nbsp;Eder J. Scheid,&nbsp;Muriel F. Franco,&nbsp;Demétrio F. F. Boeira,&nbsp;Luciano Zembruzki,&nbsp;Lisandro Z. Granville","doi":"10.1002/nem.2309","DOIUrl":"https://doi.org/10.1002/nem.2309","url":null,"abstract":"<div>\u0000 \u0000 <p>Centralization of Internet-based services in a few key players has been a topic of study in recent years. One of such services, the domain name system (DNS), is one of the pillars of the Internet, which allows users to access websites on the Internet through easy-to-remember domain names rather than complex numeric IP addresses. In this DNS context, the reliance on a small number of large DNS providers can lead to (a) risks of data breaches and disruption of service in the event of failures and (b) concerns about the digital sovereignty of countries regarding DNS hosting. As several essential services are provided through electronic government (E-Gov), it is highly important to be able to measure the digital sovereignty of a nation and the impacts that the lack of such feature can bring to its citizens. This work approaches the issue of DNS concentration on the Internet by presenting a solution to measure DNS hosting centralization and digital sovereignty in different countries, such as Brazil, India, China, Russia, and South Africa. With the data obtained through these measurements, relevant questions are answered, such as which are the top-10 DNS providers, if there is DNS centralization, and how dependent countries are on such providers to manage domains using their country code top-level domains (ccTLD). Future opportunities could investigate the impacts on sovereignty under the lens of other layers of the open systems interconnection (OSI) Network Sovereignty representation model presented in this work.</p>\u0000 </div>","PeriodicalId":14154,"journal":{"name":"International Journal of Network Management","volume":"35 1","pages":""},"PeriodicalIF":1.5,"publicationDate":"2024-10-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142724177","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}

{"title":"Lightweight Flow-Based Policy Enforcement for SDN-Based Multi-Domain Communication","authors":"Abdulhakim Sabur","doi":"10.1002/nem.2312","DOIUrl":"https://doi.org/10.1002/nem.2312","url":null,"abstract":"<div>\u0000 \u0000 <p>Although software-defined networking (SDN) is commonly employed for intra-domain communication, inter-domain communication still heavily relies on conventional routing methods, specifically BGP-based routers. The BGP router plays a crucial role in managing control and data planes, but this traditional approach hinders the exploitation of SDN advantages. Previous studies demonstrated the use of BGP for inter-domain and end-to-end communication. This paper advocates for the adoption of a fully SDN-based data plane packet switching strategy through the introduction of LPEES, a lightweight policy framework tailored for SDN-based inter-domain communication. LPEES strategically confines BGP's functionality to the control plane, preserving SDN benefits. Evaluation results confirm the effectiveness of LPEES compared to the BGP routing approach, as measured by throughput and various network quality of service (QoS) metrics. Additionally, LPEES streamlines inter-domain communication by utilizing a trust-based routing policy approach that can establish trust between communicating domains. The presented solution's main advantage is that it loosens the burden on the administrator by requiring less human interference to check the inter-domain communication security and privacy. Our evaluations show LPEES outperform the BGP-based in terms of throughput as LPEES achieves a <span></span><math>\u0000 <semantics>\u0000 <mrow>\u0000 <mo>∼</mo>\u0000 </mrow>\u0000 <annotation>$$ sim $$</annotation>\u0000 </semantics></math>27 Gbps versus <span></span><math>\u0000 <semantics>\u0000 <mrow>\u0000 <mo>∼</mo>\u0000 </mrow>\u0000 <annotation>$$ sim $$</annotation>\u0000 </semantics></math>22 Gbps in the traditional approach. Based on our experiments, LPEES also enhances the communication delay by an average of <span></span><math>\u0000 <semantics>\u0000 <mrow>\u0000 <mo>∼</mo>\u0000 </mrow>\u0000 <annotation>$$ sim $$</annotation>\u0000 </semantics></math>17% compared to the traditional BGP-based approach.</p>\u0000 </div>","PeriodicalId":14154,"journal":{"name":"International Journal of Network Management","volume":"35 1","pages":""},"PeriodicalIF":1.5,"publicationDate":"2024-10-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142737594","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}

{"title":"Autonomous Attack Mitigation Through Firewall Reconfiguration","authors":"Daniele Bringhenti,&nbsp;Francesco Pizzato,&nbsp;Riccardo Sisto,&nbsp;Fulvio Valenza","doi":"10.1002/nem.2307","DOIUrl":"https://doi.org/10.1002/nem.2307","url":null,"abstract":"<p>Packet filtering firewalls represent a main defense line against cyber attacks that target computer networks daily. However, the traditional manual approaches for their configuration are no longer applicable to next-generation networks, which have become much more complex after the introduction of virtualization paradigms. Some automatic strategies have been investigated in the literature to change that old-fashioned configuration approach, but they are not fully autonomous and still require several human interventions. In order to overcome these limitations, this paper proposes an autonomous approach for firewall reconfiguration where all steps are automated, from the derivation of the security requirements coming from the logs of IDSs to the deployment of the automatically computed configurations. A core component of this process is React-VEREFOO, which models the firewall reconfiguration problem as a Maximum Satisfiability Modulo Theories problem, allowing the combination of full automation, formal verification, and optimization in a single technique. An implementation of this proposal has undergone experimental validation to show its effectiveness and performance.</p>","PeriodicalId":14154,"journal":{"name":"International Journal of Network Management","volume":"35 1","pages":""},"PeriodicalIF":1.5,"publicationDate":"2024-10-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://onlinelibrary.wiley.com/doi/epdf/10.1002/nem.2307","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143117635","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}

{"title":"Security, Privacy, and Trust Management on Decentralized Systems and Networks","authors":"Weizhi Meng,&nbsp;Sokratis K. Katsikas,&nbsp;Jiageng Chen,&nbsp;Chao Chen","doi":"10.1002/nem.2311","DOIUrl":"https://doi.org/10.1002/nem.2311","url":null,"abstract":"&lt;p&gt;With the rapid growth of size and scale in current organization, decentralize systems are becoming dominant, which is an interconnected information system where no single entity or central server is employed as a sole authority, such as Internet of Things (IoT), smart home system, smart city system, and more. For such systems, sensors are important to gather and process data as the lower level components. However, with the distributed deployment, decentralized systems are facing various security, privacy, and trust issues. For instance, any compromised sensor may leak sensitive data or be used to infect other entities within the system. It is also a long-term challenge to establish trust among different nodes and defeat malicious insiders. Here, there is a requirement to develop suitable management schemes for decentralized systems and networks regarding security, privacy, and trust. This special issue focuses on the identification of security, privacy, and trust issues in decentralized systems and the development of effective solutions in handling security, privacy, and trust issues for decentralized systems, for example, IoT, cyber-physical systems (CPS), smart city, and smart home.&lt;/p&gt;&lt;p&gt;In the first contribution entitled “A security-enhanced equipment predictive maintenance solution for the ETO manufacturing,” Cao et al. proposed a security-enhanced predictive maintenance scheme specifically designed for ETO-type production equipment. This scheme can use the industrial Internet of Things (IIoT) technology to monitor machines and equipment, constructing prediction models using machine learning methods and reinforcing the security of the prediction system through adoption of a decentralized architecture with blockchain distributed storage. In this experiment, six supervised learning models were compared, and it was found that the model based on the random forest algorithm achieved an outstanding accuracy rate of 98.88%.&lt;/p&gt;&lt;p&gt;In the second contribution entitled “IGXSS: XSS payload detection model based on inductive GCN,” Wang et al. figured out that XSS is one of the most common web application attacks, in which an attacker can obtain private user information from IoT devices or cloud platforms. To address this issue, the authors proposed an XSS payload detection model based on inductive graph neural networks, shortly IGXSS (XSS payload detection model based on inductive GCN). The method aims to detect XSS payloads under an IoT environment by segmenting the samples as nodes and obtaining the feature matrix of nodes and edges.&lt;/p&gt;&lt;p&gt;In the third contribution entitled “Privacy-protected object detection through trustworthy image fusion,” Zhang et al. identified that user privacy may be leaked as infrared images may contain sensitive information. The authors then proposed a procedure for enhancing the database privacy, object detection based on multi-band infrared image datasets, and they utilized the transfer learning technique to migrate know","PeriodicalId":14154,"journal":{"name":"International Journal of Network Management","volume":"34 6","pages":""},"PeriodicalIF":1.5,"publicationDate":"2024-10-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://onlinelibrary.wiley.com/doi/epdf/10.1002/nem.2311","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142642020","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}

{"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}

{"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}

{"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}

{"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}

{"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}