Mr Sandman: Time Lock Puzzles for Good and Evil
Talkat OWASP AppSec Europe 2018 · on Thursday, 2018-07-05· at 10:15· Fleming - 3rd Floor, QEII Centre Broad Sanctuary, Westminster·
summary
Concrete constructions and demos decide whether to watch: several timelock puzzle types are implemented and shown working — proof‑of‑work executable stub that decrypts an MSF payload in memory after minutes and bypasses consumer AV, VBA macro weaponised versions that mine hashes in-process, repeated‑hash and chained PRNG schemes, and MIT/Rivest style repeated squaring. The talk gives counts (minutes to hours, 10k iterations), shows process hollowing working, and covers heuristics and defenses (encrypted blobs, dynamic key generation, parallelisation and server verification).
AI-written summary · about
chapters (10)
- 0:00Start
- 1:00Delayed Execution
- 4:15Remote Lookups for Time Stamps
- 13:00Chained Hashing
- 18:50Chain Pseudo-Random Number Generators
- 20:08Proof of Work
- 22:57Practical Applications
- 29:19Toilet Puzzles for Defense
- 34:39Benefits of Using It for Defense
- 37:58Conclusion
related talks
15mTales from the Underground: Hilarious Cybercrime Fails!!
54mYes, you too can break crypto Exploiting common crypto mistakes
02h 27mHow hacking works (Workshop edition)
24m🛠 using drand and timelock encryption
42mBreak Crypto like a Pro!
35mShowTime: CPU Timing Attacks With the Human Eye
24m🛠 using drand and timelock encryption
32mLLMs Behind Bars: Sandboxes at Scale for AI on a Short Leash