We can make multi-factor authentication actually work by relying on human’s unparalleled ability to recognize acquaintances and detect impersonators.
Multi-factor authentication, a mechanism where the user provides two or more loosely coupled evidences of their identity, has become ubiquitous in access management of computer systems. Compared to a single factor authentication, no single piece of information about the user is sufficient for authentication, and account take-over requires obtaining multiple kinds of information about the user.
However, known multi-factor authentication schemes rely on a single user’s knowledge, possession, and inherence. Consequently, while breaking multi-factor authentication is harder than breaking single-factor, password or key based, authentication, it still requires access to a single entity only.
(more…)
Comments Off
http://anglican.ml/, the proper domain for the Anglican way of machine learning.
Comments Off
Kant said: there are two a priori intuitions — space and time. There are also categories, and “the number of the categories in each class is always the same, namely, three”, like unity-plurality-modality, or possibility-existence-necessity. It would be fun to have three a priori intuitions, but only two exist, sigh. Really though?
(more…)
Comments Off
Paper, slides, and poster as presented at SOCS 2015.
We introduce an approximate search algorithm for fast maximum a posteriori probability estimation in probabilistic programs, which we call Bayesian ascent Monte Carlo (BaMC). (more…)
Comments Off
An early workshop paper, superseded by current research but still relevant, slides, and a poster.
Abstract
We introduce a new approach to solving path-finding problems under uncertainty by representing them as probabilistic models and applying domain-independent inference algorithms to the models. (more…)
Comments Off
Anglican is a probabilistic programming language, or better yet, a concept, living in symbiosis with Clojure. Anglican stands for Church of England (because we are here in Oxford). To create your Turing-complete probabilistic models, clone anglican-user and hack away. Or, look at cool examples.
Read more…
Comments Off
Found my own slides from a talk I gave a year ago, about rational meta-reasoning. Do they seem interesting to me because I have degraded during this year?
Comments Off
We introduce a new algorithm for multi-agent path finding, derived from the idea of meta-agent conflict-based search (MA-CBS). (more…)
Comments Off
My Tea Talk slides, on October 1st, 2014.
Comments Off