News for hackers. Stuff that matters.
Re:CVE-2021-32471 – Input validation in Marvin Minsky 1967 T... by qsort on Monday May 10, 2021 @08:49AM (#27105406)
Yes, that's the joke.
Re:CVE-2021-32471 – Input validation in Marvin Minsky 1967 T... by UncleMeat on Monday May 10, 2021 @11:00AM (#27106658)
No it isn't. The paper forces the universal turing machine to execute a different machine than the one on the input tape by providing crafted input to the intended simulated machine. It isn't a joke paper.

U is fed machine T and input I. By only changing I you can force U to execute a different machine X.

Re:CVE-2021-32471 – Input validation in Marvin Minsky 1967 T... by qsort on Monday May 10, 2021 @12:14PM (#27107641)
Sure, but you achieve that by specifying I in a way you aren't really supposed to. You are effectively invoking undefined behavior.

The implications of this are well understood. You'd have similar vulnerabilities if you ran raw machine code on, say, an x86 processor. Enforcing checks and sanitization in such a way that the 'exploit' can't happen is the exact kind of job you'd have to do in order to write an operating system.

Re:CVE-2021-32471 – Input validation in Marvin Minsky 1967 T... by OskarS on Monday May 10, 2021 @08:53AM (#27105439)
I get that the CVE is a joke, but are you saying the paper is as well?
Re:CVE-2021-32471 – Input validation in Marvin Minsky 1967 T... by toxik on Monday May 10, 2021 @03:07PM (#27109585)
It’s not a joke, people saying otherwise did not understand the paper. The significance is debatable, it’s mostly a kind of collective facepalm for theoretical computer scientists.

The CVE is a joke in the sense that you don’t really need a CVE for a universal Turing machine, as they are quite literally only academic.

Re:CVE-2021-32471 – Input validation in Marvin Minsky 1967 T... by AreYouSirius on Monday May 10, 2021 @09:19AM (#27105664)
i dont know if he says exactly that by i do say exactly that

paper is essentially saying that by using simplest machine possible

we prove it does not provide layers of security abstractions which were invented and deployed in last 40+ years to computers

so thats like getting CVE for turning off ASLR, AppARMOR SElinux etc in linux kernel.

Re:CVE-2021-32471 – Input validation in Marvin Minsky 1967 T... by qsort on Monday May 10, 2021 @09:20AM (#27105677)
As far as I can tell, yes, it is.

Showing a universal Turing machine is a proof of the fact that when you write stuff like the smn theorem or anything that uses universal functions you aren't writing nonsense.

There is no "contract" between the universal machine and the hypothetical user. One could certainly ensure that, say, the input TM is properly formatted, or that "the runtime" will only use a certain set of cells, and so on. The difficulties and problems one would find in trying to do so are the same one would face when writing an operating system and a compiler.

Re:CVE-2021-32471 – Input validation in Marvin Minsky 1967 T... by mycall on Monday May 10, 2021 @08:51AM (#27105427)
Wait until they try unicode, then the joke will be on them.
Re:CVE-2021-32471 – Input validation in Marvin Minsky 1967 T... by jradd on Monday May 10, 2021 @10:20AM (#27106217)
I cannot fathom how complicated arbitrary code execution could get with multi byte characters that could use shift registers, null bytes and byte order marks with determinism in a NOP slide on a heap spray.

Filtering only printable user input helps but even bit map images can expose a heap to a sensitive registers that will execute some target specific generated shell code.

https://en.m.wikipedia.org/wiki/NOP_slide.

https://en.m.wikipedia.org/wiki/Heap_spraying