This is an archived web site made available for research purposes. The web site is no longer maintained.

Qualifier Challenge - KPRCA_00035


Original Versions

Known Vulnerabilities

  • CWE-129 - Improper Validation of Array Index
  • CWE-665 - Improper Initialization
  • CWE-787 - Out-of-bounds Write
  • CWEs are listed as indicated by the challenge author.

Scores

  • ForAllSecure: 4.0
  • TECHx: 1.92
  • CodeJitsu: 1.37
  • CSDS: 0.66
  • Disekt: 0.0
  • Shellphish: 0.0
  • FuzzBOMB: 0.0
  • TrailofBits: 0.0
  • DeepRed: 0.0
  • The maximum score for each challenge in CQE is 4, following the CQE Scoring Document.

Passed consensus evaluation

  • CodeJitsu - CB1
  • CSDS - CB1
  • ForAllSecure - CB1
  • TECHx - CB1
  • TrailofBits - CB1

Proved a POV in reference challenge

Defense against reference POVs

  • ForAllSecure: 100.0% - CB1
  • CodeJitsu: 100.0% - CB1
  • TECHx: 100.0% - CB1
  • CSDS: 100.0% - CB1
  • TrailofBits: 100.0% - CB1

No submission

  • Eighth Place Team
  • Eleventh Place Team
  • Fifth Place Team - Finalist
  • First Place Team - Finalist
  • Fourth Place Team - Finalist
  • Ninth Place Team
  • Second Place Team - Finalist
  • Seventh Place Team - Finalist
  • Sixth Place Team - Finalist
  • Tenth Place Team
  • Third Place Team - Finalist
  • Thirteenth Place Team
  • Twelfth Place Team

All Submissions

DARPA performer group

Kaprica Security (KPRCA)

Description:

This service implements a basic virtual machine that receives one instruction at a time and sends back the VM's current register state.

The protocol starts with a header that has a magic check and fields to allow initialization of the VM's registers and memory. Each instruction is 32-bits and is generally in the format: 8-bit opcode, 4-bit destination register, 4-bit source register, 16-bit literal.

Feature List

The virtual machine implements basic arithmetic such as addition, subtraction, division, and multiplication, as well as integer comparisons and basic IO. The machine state consists of 15 general purpose registers and 64KB of memory. For performance, the interpreter utilizes computed gotos instead of the more common if statements or switch statement.

Vulnerability

The VM supports a syscall that allows the user to frobnicate a region of memory. The fronicate function does not check the arguments that it is called with to ensure they will only result in the frobnication of memory within the bounds of the VM's memory array (main.c:113). Therefore, it is possible to frobnicate a region of memory outside bounds of the array, which in this case is heap memory since the VM's state is allocated on the heap.

CWE classification

CWE-129: Improper Validation of Array Index CWE-665: Improper Initialization CWE-787: Out-of-bounds Write

Challenges

The primary challenge for this service is to get the VM to call the frob syscall function. The syscall function is accessed through a function pointer on the stack. This function pointer is set appropriately according to the syscall arguments. Part of the challenge is that there is no code path that explicitly sets this function pointer to the frobnicate function. However, it is also that case that unless the arguments are specific values, the function pointer is not initialized. Therefore, if the address of memory where this function pointer lies is set to the address of the frobnicate function via some other code path in the program then the vulnerable frobnicate function is accessible. Since the process_xor function's new_val stack variable lies at the same address as the process_sys function's fp variable, this task is achievable. Executing this vulnerability will require symbolic execution or some other way of reasoning about a way of accessing the frobnicate function.


Curated by Lunge Technology, LLC. Questions or comments? Send us email