You Sank My Battleship!

Abstract

We report on a case study in secure programming, focusing on the design, implementation and auditing of programs for playing the board game Battleship. We begin by precisely defining the security of Battleship programs, borrowing ideas from theoretical cryptography. We then consider three implementations of Battleship: one in Concurrent ML featuring a trusted referee; one in Haskell/LIO using information flow control to avoid needing a trusted referee; and one in Concurrent ML using access control to avoid needing such a referee. All three implementations employ data abstraction in key ways.

Towards a General-Purpose Dynamic Information Flow Policy

“…• An delegation/revocation policy [3], [32], [50], [38] updates dynamically the sensitivity roles in a security system to accommodate the mutable requirements of security, such as delegating/revoking the access rights of a new/leaving employee. Moreover, there are a few case studies on the needed security properties in the light of one specific context or task [6], [31], [43], [49], and build systems that provably enforces some variants of declassification policy (e.g., CoCon [34], CosMeDis [12]) and erasure policy (e.g., Civitas [21]).…”