3 ms·
The goal of probably secure computing would be merely to (hopefully) extend the mathematical certainties of cryptography to computers and software. The politics
by TimTheTinker 8y ago
The goal of probably secure computing would be merely to (hopefully) extend the mathematical certainties of cryptography to computers and software. The politics of cryptography wouldn’t change, they would only be broadened. Intentional back doors would still be possible, and the ramifications of building them would be just as dire.
So the best provable security could do would be to eliminate security holes like buffer overflow/etc. Trust issues (and even side-channel attacks) would still be present as always.
- bb88 8y agoThen you're probably using the wrong language.
- TimTheTinker 8y agoWell I did say "in the theorem-proving sense", meaning that the code undergoes formal verification. There are programming languages for which each function is a theorem that is proved at compile time. That's what I meant. There are some low-level libraries that have already been partially converted to theorem-proved functions for the sake of security.
- bb88 8y agoYou're slicing the argument thinner than what a politician would see.