Enhancing ZRTP by using Computational Puzzles

In this paper we present and discuss a new approach for securing multimedia communication, which is based on three innovations. the first innovation is the integration of a challenge-response scheme for enhancing the diffie-hellman based zrtp protocol. when being called, a callee must present the result of a computational puzzle (a token) within a short amount of time. a man-in-the-middle (mitm) would not be able to compute such a token within the required time, and thus fail to get into the media path. the scheme works best in situations when zrtp is most vulnerable to so-called mafia attacks, i.e., if both caller and callee do not know each other.the second innovation complements the first one on those occasions where the above scheme may fail. the call is delayed for a certain amount of time which depends on the agreed session key. since during a mitm attack two different keys (and thus waiting times) exist, caller and callee would not start their call at the same time and the mitm attack would fail.the third innovation is in the definition of a new computational puzzle which forms the basis of the challenge-response scheme. we propose a computational puzzle which is based on computing selected eigenvectors of real symmetric matrices. in contrast to existing puzzles, the one we propose does not rely on a shared secret, can be validated quickly, and existing solution methods exhibit limited scalability so that the threat from attacks based on massively parallel computing resources can be controlled