Lol if you think cryptography doesn&#x27;t consider corruptions of involved parties; there&#x27;s a huge host of studied corruption models, from static to adaptive corruption, and different type of corruptions, from malicious to rational to covert adversaries.<p>Secure computation is a catch-all term for cryptographically safe computation; this includes ORAM schemes, FHE, iO, Searchable Symmetric Encryption, PIR, etc.<p>If you mock without knowing, you&#x27;re the fool. No one claims that these schemes can solve computer security problems; for one, these schemes are still largely theoretical. But there&#x27;s been huge advances in the field, and some things that have emerged as a result of this theory are being deployed by Google, Microsoft, etc (CryptDB).