Stateful protocol fuzzing with statemap-based reverse state selection

• URL: http://arxiv.org/abs/2408.06844v1
• Date: Tue, 13 Aug 2024 12:11:41 GMT
• Title: Stateful protocol fuzzing with statemap-based reverse state selection
• Authors: Liu Yu, Shen Yanlong, Zhou Ying,
• Abstract summary: Stateful Coverage-Based Greybox Fuzzing (SCGF) is considered the state-of-the-art method for network protocol greybox fuzzing. This paper proposes a statemap-based reverse state selection method for SCGF.
• Score: 3.7687375904925484
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Stateful Coverage-Based Greybox Fuzzing (SCGF) is considered the state-of-the-art method for network protocol greybox fuzzing. During the protocol fuzzing process, SCGF constructs the state machine of the target protocol by identifying protocol states. Optimal states are selected for fuzzing using heuristic methods, along with corresponding seeds and mutation regions, to effectively conduct fuzz testing. Nevertheless, existing SCGF methodologies prioritise the selection of protocol states without considering the correspondence between program basic block coverage information and protocol states. To address this gap, this paper proposes a statemap-based reverse state selection method for SCGF. This approach prioritises the coverage information of fuzzy test seeds, and delves deeper into the correspondence between the basic block coverage information of the programme and the protocol state, with the objective of improving the bitmap coverage. The state map is employed to simplify the state machine representation method. Furthermore, the design of different types of states has enabled the optimisation of the method of constructing message sequences, the reduction in the length of message sequences further improve the efficiency of test case execution. By optimising the SCGF, we developed SMGFuzz and conducted experiments utilising Profuzzbench in order to assess the testing efficiency of SMGFuzz.The results indicate that compared to AFLNet, SMGFuzz achieved an average increase of 12.48% in edges coverage, a 50.1% increase in unique crashes and a 40.2% increase in test case execution speed over a period of 24 hours.

Related papers

• Inferring State Machine from the Protocol Implementation via Large Language Model [18.942047454890847]
  We propose an innovative state machine inference approach powered by Large Language Models (LLMs) Our evaluation across six protocol implementations demonstrates the method's high efficacy, achieving an accuracy rate exceeding 90%. Our proposed method not only marks a significant step forward in accurate state machine inference but also opens new avenues for improving the security and reliability of protocol implementations.
  arXiv  Detail & Related papers  (2024-05-01T08:46:36Z)
• Statistical evaluation and optimization of entanglement purification protocols [0.0]
  We demonstrate that pioneering protocols are unable to improve the estimated initial average concurrence of almost uniformly sampled density matrices. We also develop a more efficient protocol and investigate it numerically together with a recent proposal based on an entangling rank-$2$ projector.
  arXiv  Detail & Related papers  (2024-02-19T16:58:03Z)
• General Cutting Planes for Bound-Propagation-Based Neural Network Verification [144.7290035694459]
  We generalize the bound propagation procedure to allow the addition of arbitrary cutting plane constraints. We find that MIP solvers can generate high-quality cutting planes for strengthening bound-propagation-based verifiers. Our method is the first verifier that can completely solve the oval20 benchmark and verify twice as many instances on the oval21 benchmark.
  arXiv  Detail & Related papers  (2022-08-11T10:31:28Z)
• Towards Semantic Communication Protocols: A Probabilistic Logic Perspective [69.68769942563812]
  We propose a semantic protocol model (SPM) constructed by transforming an NPM into an interpretable symbolic graph written in the probabilistic logic programming language (ProbLog) By leveraging its interpretability and memory-efficiency, we demonstrate several applications such as SPM reconfiguration for collision-avoidance.
  arXiv  Detail & Related papers  (2022-07-08T14:19:36Z)
• Data post-processing for the one-way heterodyne protocol under composable finite-size security [62.997667081978825]
  We study the performance of a practical continuous-variable (CV) quantum key distribution protocol. We focus on the Gaussian-modulated coherent-state protocol with heterodyne detection in a high signal-to-noise ratio regime. This allows us to study the performance for practical implementations of the protocol and optimize the parameters connected to the steps above.
  arXiv  Detail & Related papers  (2022-05-20T12:37:09Z)
• Performance analysis of continuous-variable quantum key distribution using non-Gaussian states [0.0]
  In this study, we analyze the efficiency of a protocol with discrete modulation of continuous variable non-Gaussian states. We calculate the secure key generation rate against collective attacks using the fact that Eve's information can be bounded based on the protocol.
  arXiv  Detail & Related papers  (2021-12-19T11:55:17Z)
• Quantum anonymous veto: A set of new protocols [0.41998444721319217]
  We propose protocols for quantum anonymous veto (QAV) based on different types of quantum resources. The proposed schemes are analyzed for all the requirements of a valid QAV scheme. A trade-off between correctness and robustness of the probabilistic QAV schemes is observed.
  arXiv  Detail & Related papers  (2021-09-13T18:56:09Z)
• Quantum key distribution based on orthogonal state encoding [0.0]
  Two quantum key distribution protocols are presented. One does not need to employ order-rearrangement techniques while the other needs to. We modify the protocols for implementing in noisy channels by applying the testing state method.
  arXiv  Detail & Related papers  (2021-07-05T12:14:05Z)
• Round-robin differential phase-time-shifting protocol for quantum key distribution: theory and experiment [58.03659958248968]
  Quantum key distribution (QKD) allows the establishment of common cryptographic keys among distant parties. Recently, a QKD protocol that circumvents the need for monitoring signal disturbance, has been proposed and demonstrated in initial experiments. We derive the security proofs of the round-robin differential phase-time-shifting protocol in the collective attack scenario. Our results show that the RRDPTS protocol can achieve higher secret key rate in comparison with the RRDPS, in the condition of high quantum bit error rate.
  arXiv  Detail & Related papers  (2021-03-15T15:20:09Z)
• Selective Classification via One-Sided Prediction [54.05407231648068]
  One-sided prediction (OSP) based relaxation yields an SC scheme that attains near-optimal coverage in the practically relevant high target accuracy regime. We theoretically derive bounds generalization for SC and OSP, and empirically we show that our scheme strongly outperforms state of the art methods in coverage at small error levels.
  arXiv  Detail & Related papers  (2020-10-15T16:14:27Z)
• Adaptive Sampling for Best Policy Identification in Markov Decision Processes [79.4957965474334]
  We investigate the problem of best-policy identification in discounted Markov Decision (MDPs) when the learner has access to a generative model. The advantages of state-of-the-art algorithms are discussed and illustrated.
  arXiv  Detail & Related papers  (2020-09-28T15:22:24Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.