Shannon (1949)

Computationally unbounded attack

If a source contains information, then the attacker’s omnipotent computer will extract it.

Diffie-Hellman (1976)

Computationally bounded attack

If computers have limited powers, then information can be hard to extract.

Modern Cryptography (1990s)

Logically unbounded attacker

If a feasible attack algorithm exists, then the attacker’s omnipotent programmers will find that algorithm.

ASECOLab

Logically bounded attacker

If programmers have limited logical powers then the attack algorithms can be logically hard to construct.

Welcome to ASECOLab

which means Adaptive Security and ECOnomics Lab

We are the security research lab at Information and Computer Sciences at University of Hawaii at Manoa. We are also still affiliated with Department of Computer Science at Royal Holloway University of London (where the first ASECOLab was founded in 2012).

We study how security is achieved through adaptation, and how fortifications give an illusion of security. This has to do with economics, but also with cryptography (see the pictures above). Our research is thus more “interdisciplinary”, and perhaps riskier than most people like; but it’s huge fun.

We also teach SecSci (Security Science) courses and try to share the fun.