All IO with untrusted devices would be delayed until the real time exceeds the theoretical time the message was sent.
Then one can have as many timing sidechannels as one likes, and the running program can never learn about them.
All IO with untrusted devices would be delayed until the real time exceeds the theoretical time the message was sent.
Then one can have as many timing sidechannels as one likes, and the running program can never learn about them.
Are you familiar with works like [1]? That is thinking in this direction, but from a different angle.
[1] G. Heiser, G. Klein, T. Murray, Can We Prove Time Protection?. https://arxiv.org/pdf/1901.08338.pdf
I think this is probably a fascinating area of study. It feels like there is a power/time/space non-linearity and being able to trade one for another.
How about the CPU is put into a fixed timestep mode, where all operations take the same amount of time.
If there was a hardware level concept of a thread, it could be a thread property.
Another option would be a queue of futures with a rate control based on the required security properties.