Project page for the DDP thesis: AI for Security Planning — A Game-Theoretic Approach (IIT Bombay, 2026)
-
Updated
Jul 19, 2026 - JavaScript
Project page for the DDP thesis: AI for Security Planning — A Game-Theoretic Approach (IIT Bombay, 2026)
QSE deception as insurance against attacker misspecification. Solver, proofs, and 16-node CVE testbed. GameSec 2026.
AI for Security Planning: A Game-Theoretic Approach — Dual Degree Project, IIT Bombay. Stackelberg security games (DOBSS/MILP), dynamic imperfect-information games, CFR vs SPNE.
Browser-based security-game lab — IND-CPA, CCA2, EUF-CMA, and the PRP/PRF switching lemma measured as Adv = 2·wins/trials − 1 over real AES, RSA-2048, ElGamal, ECDSA, and Ed25519, with Wilson intervals and a flat histogram that proves nothing.
To associate your repository with the security-games topic, visit your repo's landing page and select "manage topics."