CyberRota Analysis
AI-GeneratedVersions of Data::SortedSet::Shared for Perl prior to 0.03 are vulnerable to an out-of-bounds read due to unvalidated node indices in rank and min/max query operations. This flaw can lead to unauthorized memory access, potentially allowing an attacker to read sensitive data or crash the application. Organizations using affected versions should prioritize patching this vulnerability to mitigate the risk of exploitation, especially those with local users who have write access to the backing file.
Original NVD Description
Data::SortedSet::Shared versions before 0.03 for Perl allow an out-of-bounds read via unvalidated node indices in the rank and min/max query paths. The attach-time validator ss_validate_header bounds only the root index against the node pool (node_capacity). The order-statistics and min/max queries then follow children[], leftmost and rightmost node indices read raw from the mmap'd segment without bounding them against node_capacity. A full structural check (ss_validate_tree) exists but runs only via an explicit validate method, not on attach. A local peer that can write the backing file can leave the header valid while poisoning the tree links, so the next rank, min or max query dereferences an out-of-bounds node index, reading adjacent memory or crashing the process.