论文记录-ICMC2024审稿

Submission 10

对抗网络中的连接维护，关注了链路不确定性和网络异构性，将网络建模为随机图，然后基于动态规划设计防御策略（即需要维护哪些连接）

Summary

This paper addresses the problem of maintaining connectivity in adversarial networks where network links are characterized by uncertainty and heterogeneity. The study innovatively models the network as a random graph, where each link has a defined probability of existence, a probing cost, and resilience. The main objective is to develop defensive strategies that ensure the maximum possible connected component of the network remains intact despite adversarial attacks. The authors provide a rigorous formulation of the problem, prove its NP-hardness, and propose both optimal and approximate defensive strategies. Extensive simulations are carried out to validate the effectiveness of these strategies against various attack scenarios.

Strength

1. The paper stands out for its novel approach to integrating link uncertainty and heterogeneity into the network model, which offers a more realistic representation of actual network conditions compared to the traditional static models.
2. The authors provide a thorough analysis, including a proof of NP-hardness which solidifies the theoretical foundation of the research problem. The dynamic programming-based strategy for optimal defense adds depth to the methodology.
3. The use of both synthetic and real-world data to demonstrate the effectiveness of the proposed strategies under diverse attacking patterns ensures that the results are robust and applicable in various settings.

Weakness

1. The paper lacks a discussion of recent developments in the field, particularly from the last three years. Including and discussing contemporary research could significantly strengthen the paper’s relevance and depth, showcasing how the proposed solutions fit within the latest advancements in network security and resilience.
2. Although the strategies proposed are innovative, the paper lacks a detailed comparison with existing methods. A more comprehensive analysis comparing these new strategies to current best practices would underline the improvements and practical applicability of the proposed methods, offering clearer insights into their benefits and drawbacks.

Submission 13

分布式存储中最优节点修复的MSR代码构建，权衡最小存储再生和最小带宽再生

Summary

This paper presents a comprehensive study on the development and optimization of multi-layer Minimum Storage Regenerating (MSR) codes. The primary focus of the paper is on enhancing the efficiency and reliability of node repairs within distributed storage systems, which is crucial for applications requiring high availability and data integrity. The authors explore the theoretical underpinnings of regenerating codes and propose a novel construction method using a product-matrix framework that optimizes the trade-off between storage overhead and repair bandwidth. The paper includes a thorough analysis of the performance of these codes through theoretical bounds and numerical simulations, addressing both node failure scenarios and adversarial attacks.

Strength

1. The paper introduces an innovative approach to constructing MSR codes using a multi-layer framework. This method addresses practical issues such as node failures and adversarial attacks, and significantly enhances the error correction capabilities beyond traditional Reed-Solomon codes.
2. The authors provide a detailed theoretical analysis accompanied by numerical simulations that demonstrate the efficacy of the proposed codes under various conditions. This thorough examination adds a robust layer of validation to their claims.
3. The paper is well-organized, with clear sections that logically flow from the introduction of basic concepts to more complex discussions on code optimization and performance analysis.

Weakness

1. The paper could strengthen its impact by providing a more extensive comparison with existing methods. Specifically, a detailed discussion on how the proposed MSR codes compare to other state-of-the-art regenerating codes in terms of both performance and computational efficiency would be valuable.
2. The manuscript does not sufficiently describe the experimental setup, including the specific parameters and environments in which the simulations were conducted.
3. The manuscript contains several typos and grammatical errors such as:
   1. “The sentence ‘It can observed from Fig. 6 that as…’ should be corrected to ‘It can be observed from Fig. 6 that as…’ to include the missing verb ‘be’, ensuring grammatical correctness.”
   2. In Theorem 1, the phrase ‘in defined’ should be revised to ‘as defined’ to correct the preposition use and enhance the clarity of the statement.

Submission 15

DT辅助边缘计算中推理服务的累积保真度最大化

Summary

The manuscript presents a detailed study on the optimization of service model fidelity in Digital Twin (DT)-assisted edge computing environments, emphasizing the deployment of 6G communication technologies. The authors propose a novel accumulative fidelity maximization problem that focuses on the strategic placement of DTs and models to minimize resource consumption while maximizing service fidelity. The paper offers a comprehensive methodology that includes formulating the problem, developing algorithms for DT and model placement, and devising a scheduling algorithm for updating model data using IoT devices. The efficacy of the proposed solutions is evaluated through a series of simulations, which demonstrate significant improvements over baseline models.

Strength

1. The paper tackles an emerging issue in edge computing with a novel and timely approach. The integration of DTs in edge computing for enhancing service model fidelity using 6G technology is a forward-thinking solution that aligns well with current technological advancements.
2. The simulation results are thorough and provide a convincing argument for the effectiveness of the proposed algorithms. The comparison with baseline models is helpful in illustrating the improvements and practical applicability of the research.

Weakness

1. It is recommended that the authors include a table of mathematical symbols and their definitions. This would aid in the reader’s understanding of the mathematical expressions and algorithms discussed throughout the paper, ensuring that the technical content is accessible to a broader audience.
2. The paper lacks a detailed discussion on potential future research directions. Expanding on how these algorithms could be adapted or extended to other scenarios or technologies would be beneficial for readers and could spur further research.

Submission 35

训练了一个针对智能合约MEV漏洞检测的模型，在包含 15,132 个中小型智能合约和 23 个 Dapp 的数据集上对 FuzzLaPRO 进行了评估，发现了 79 个智能合约级别的新漏洞和 4 个 Dapp 级别的新漏洞，在覆盖效率和错误方面都超越了最先进的模糊器发现率。

Summary

This paper introduces FuzzLaPRO, an innovative fuzzing tool for smart contracts that utilizes Natural Language Processing (NLP) and expert auditor knowledge to identify financial exploit vulnerabilities (MEVs). Unlike conventional fuzzing tools that primarily focus on code patterns, FuzzLaPRO simulates auditor testing methodologies to effectively identify complex, logic-related vulnerabilities. The paper thoroughly describes the tool’s conceptual approach, implementation mechanisms, and its evaluation on a dataset consisting of 15,132 small and medium-sized smart contracts and 23 Dapps.

Strength

1. FuzzLaPRO’s use of NLP to comprehend the logic of smart contracts represents a novel approach in the realm of fuzzing tools. By mimicking human auditor thought processes, the tool is capable of uncovering complex vulnerabilities that are typically undetectable through standard code pattern matching.
2. The tool significantly enhances adaptability to various Ethereum Virtual Machine (EVM) versions and distributed applications (Dapps) through dynamic version discovery and implicit contract bridging, aligning it closely with real-world applications.
3. In practical tests, FuzzLaPRO surpassed existing state-of-the-art fuzzing tools in coverage efficiency and bug discovery rate, identifying 79 new vulnerabilities at the smart contract level and 4 at the Dapp level, demonstrating superior testing effectiveness.

Weakness

1. Due to its complex logic understanding and extensive contract interaction simulations, the tool may incur high computational costs and time consumption, particularly in large-scale applications, posing potential challenges in performance efficiency. The paper does not sufficiently analyze the complexity of the proposed method or the various costs associated with its implementation. Understanding these aspects is crucial for evaluating the practicality and scalability of the tool in different environments.
2. The manuscript would benefit from linguistic polishing to enhance readability and professional appearance. Additionally, the use of terminology and formatting needs standardization; for instance, the inconsistent capitalization of “figure” in some instances and “Figure” in others should be unified to maintain a consistent style throughout the document.