Vulnerabilities

In the Linux kernel, the following vulnerability has been resolved:<br /> <br /> bpf: Fix too early release of tcx_entry<br /> <br /> Pedro Pinto and later independently also Hyunwoo Kim and Wongi Lee reported<br /> an issue that the tcx_entry can be released too early leading to a use<br /> after free (UAF) when an active old-style ingress or clsact qdisc with a<br /> shared tc block is later replaced by another ingress or clsact instance.<br /> <br /> Essentially, the sequence to trigger the UAF (one example) can be as follows:<br /> <br /> 1. A network namespace is created<br /> 2. An ingress qdisc is created. This allocates a tcx_entry, and<br /> &amp;tcx_entry-&gt;miniq is stored in the qdisc&amp;#39;s miniqp-&gt;p_miniq. At the<br /> same time, a tcf block with index 1 is created.<br /> 3. chain0 is attached to the tcf block. chain0 must be connected to<br /> the block linked to the ingress qdisc to later reach the function<br /> tcf_chain0_head_change_cb_del() which triggers the UAF.<br /> 4. Create and graft a clsact qdisc. This causes the ingress qdisc<br /> created in step 1 to be removed, thus freeing the previously linked<br /> tcx_entry:<br /> <br /> rtnetlink_rcv_msg()<br /> =&gt; tc_modify_qdisc()<br /> =&gt; qdisc_create()<br /> =&gt; clsact_init() [a]<br /> =&gt; qdisc_graft()<br /> =&gt; qdisc_destroy()<br /> =&gt; __qdisc_destroy()<br /> =&gt; ingress_destroy() [b]<br /> =&gt; tcx_entry_free()<br /> =&gt; kfree_rcu() // tcx_entry freed<br /> <br /> 5. Finally, the network namespace is closed. This registers the<br /> cleanup_net worker, and during the process of releasing the<br /> remaining clsact qdisc, it accesses the tcx_entry that was<br /> already freed in step 4, causing the UAF to occur:<br /> <br /> cleanup_net()<br /> =&gt; ops_exit_list()<br /> =&gt; default_device_exit_batch()<br /> =&gt; unregister_netdevice_many()<br /> =&gt; unregister_netdevice_many_notify()<br /> =&gt; dev_shutdown()<br /> =&gt; qdisc_put()<br /> =&gt; clsact_destroy() [c]<br /> =&gt; tcf_block_put_ext()<br /> =&gt; tcf_chain0_head_change_cb_del()<br /> =&gt; tcf_chain_head_change_item()<br /> =&gt; clsact_chain_head_change()<br /> =&gt; mini_qdisc_pair_swap() // UAF<br /> <br /> There are also other variants, the gist is to add an ingress (or clsact)<br /> qdisc with a specific shared block, then to replace that qdisc, waiting<br /> for the tcx_entry kfree_rcu() to be executed and subsequently accessing<br /> the current active qdisc&amp;#39;s miniq one way or another.<br /> <br /> The correct fix is to turn the miniq_active boolean into a counter. What<br /> can be observed, at step 2 above, the counter transitions from 0-&gt;1, at<br /> step [a] from 1-&gt;2 (in order for the miniq object to remain active during<br /> the replacement), then in [b] from 2-&gt;1 and finally [c] 1-&gt;0 with the<br /> eventual release. The reference counter in general ranges from [0,2] and<br /> it does not need to be atomic since all access to the counter is protected<br /> by the rtnl mutex. With this in place, there is no longer a UAF happening<br /> and the tcx_entry is freed at the correct time.

The Ultimate Addons for WPBakery plugin for WordPress is vulnerable to Stored Cross-Site Scripting via the plugin&amp;#39;s ultimate_pricing shortcode in all versions up to, and including, 3.19.20 due to insufficient input sanitization and output escaping on user supplied attributes. This makes it possible for authenticated attackers, with contributor-level access and above, to inject arbitrary web scripts in pages that will execute whenever a user accesses an injected page.

The Ultimate Addons for WPBakery plugin for WordPress is vulnerable to Stored Cross-Site Scripting via the plugin&amp;#39;s ultimate_info_table shortcode in all versions up to, and including, 3.19.20 due to insufficient input sanitization and output escaping on user supplied attributes. This makes it possible for authenticated attackers, with contributor-level access and above, to inject arbitrary web scripts in pages that will execute whenever a user accesses an injected page.

The Ultimate Addons for WPBakery plugin for WordPress is vulnerable to Stored Cross-Site Scripting via the plugin&amp;#39;s ult_team shortcode in all versions up to, and including, 3.19.20 due to insufficient input sanitization and output escaping on user supplied attributes. This makes it possible for authenticated attackers, with contributor-level access and above, to inject arbitrary web scripts in pages that will execute whenever a user accesses an injected page.

The Ultimate Addons for WPBakery plugin for WordPress is vulnerable to Stored Cross-Site Scripting via the plugin&amp;#39;s ultimate_info_banner shortcode in all versions up to, and including, 3.19.20 due to insufficient input sanitization and output escaping on user supplied attributes. This makes it possible for authenticated attackers, with contributor-level access and above, to inject arbitrary web scripts in pages that will execute whenever a user accesses an injected page.

In the Linux kernel, the following vulnerability has been resolved:<br /> <br /> bpf: Fix overrunning reservations in ringbuf<br /> <br /> The BPF ring buffer internally is implemented as a power-of-2 sized circular<br /> buffer, with two logical and ever-increasing counters: consumer_pos is the<br /> consumer counter to show which logical position the consumer consumed the<br /> data, and producer_pos which is the producer counter denoting the amount of<br /> data reserved by all producers.<br /> <br /> Each time a record is reserved, the producer that "owns" the record will<br /> successfully advance producer counter. In user space each time a record is<br /> read, the consumer of the data advanced the consumer counter once it finished<br /> processing. Both counters are stored in separate pages so that from user<br /> space, the producer counter is read-only and the consumer counter is read-write.<br /> <br /> One aspect that simplifies and thus speeds up the implementation of both<br /> producers and consumers is how the data area is mapped twice contiguously<br /> back-to-back in the virtual memory, allowing to not take any special measures<br /> for samples that have to wrap around at the end of the circular buffer data<br /> area, because the next page after the last data page would be first data page<br /> again, and thus the sample will still appear completely contiguous in virtual<br /> memory.<br /> <br /> Each record has a struct bpf_ringbuf_hdr { u32 len; u32 pg_off; } header for<br /> book-keeping the length and offset, and is inaccessible to the BPF program.<br /> Helpers like bpf_ringbuf_reserve() return `(void *)hdr + BPF_RINGBUF_HDR_SZ`<br /> for the BPF program to use. Bing-Jhong and Muhammad reported that it is however<br /> possible to make a second allocated memory chunk overlapping with the first<br /> chunk and as a result, the BPF program is now able to edit first chunk&amp;#39;s<br /> header.<br /> <br /> For example, consider the creation of a BPF_MAP_TYPE_RINGBUF map with size<br /> of 0x4000. Next, the consumer_pos is modified to 0x3000 /before/ a call to<br /> bpf_ringbuf_reserve() is made. This will allocate a chunk A, which is in<br /> [0x0,0x3008], and the BPF program is able to edit [0x8,0x3008]. Now, lets<br /> allocate a chunk B with size 0x3000. This will succeed because consumer_pos<br /> was edited ahead of time to pass the `new_prod_pos - cons_pos &gt; rb-&gt;mask`<br /> check. Chunk B will be in range [0x3008,0x6010], and the BPF program is able<br /> to edit [0x3010,0x6010]. Due to the ring buffer memory layout mentioned<br /> earlier, the ranges [0x0,0x4000] and [0x4000,0x8000] point to the same data<br /> pages. This means that chunk B at [0x4000,0x4008] is chunk A&amp;#39;s header.<br /> bpf_ringbuf_submit() / bpf_ringbuf_discard() use the header&amp;#39;s pg_off to then<br /> locate the bpf_ringbuf itself via bpf_ringbuf_restore_from_rec(). Once chunk<br /> B modified chunk A&amp;#39;s header, then bpf_ringbuf_commit() refers to the wrong<br /> page and could cause a crash.<br /> <br /> Fix it by calculating the oldest pending_pos and check whether the range<br /> from the oldest outstanding record to the newest would span beyond the ring<br /> buffer size. If that is the case, then reject the request. We&amp;#39;ve tested with<br /> the ring buffer benchmark in BPF selftests (./benchs/run_bench_ringbufs.sh)<br /> before/after the fix and while it seems a bit slower on some benchmarks, it<br /> is still not significantly enough to matter.

A vulnerability was found in itsourcecode Simple Task List 1.0. It has been classified as critical. This affects the function insertUserRecord of the file signUp.php. The manipulation of the argument username leads to sql injection. It is possible to initiate the attack remotely. The exploit has been disclosed to the public and may be used. The associated identifier of this vulnerability is VDB-271707.

A vulnerability was found in SourceCodester Student Study Center Desk Management System 1.0 and classified as problematic. Affected by this issue is some unknown functionality of the file /sscdms/classes/Users.php?f=save of the component HTTP POST Request Handler. The manipulation of the argument firstname/middlename/lastname/username leads to cross site scripting. The attack may be launched remotely. The exploit has been disclosed to the public and may be used.

A vulnerability has been found in itsourcecode Document Management System 1.0 and classified as critical. Affected by this vulnerability is an unknown functionality of the file insert.php. The manipulation of the argument anothercont leads to sql injection. The attack can be launched remotely. The exploit has been disclosed to the public and may be used. The identifier VDB-271705 was assigned to this vulnerability.

A flaw was found in Skupper. When Skupper is initialized with the console-enabled and with console-auth set to Openshift, it configures the openshift oauth-proxy with a static cookie-secret. In certain circumstances, this may allow an attacker to bypass authentication to the Skupper console via a specially-crafted cookie.

An issue was discovered in GitLab CE/EE affecting all versions starting from 11.8 prior to 16.11.6, starting from 17.0 prior to 17.0.4, and starting from 17.1 prior to 17.1.2 where it was possible to upload an NPM package with conflicting package data.

A vulnerability, which was classified as critical, has been found in SourceCodester Online Student Management System 1.0. This issue affects some unknown processing of the file /add-students.php. The manipulation of the argument image leads to unrestricted upload. The attack may be initiated remotely. The exploit has been disclosed to the public and may be used. The associated identifier of this vulnerability is VDB-271703.