This article is cited in 1 paper

Mathematical Foundations of Computer Security

Deniable group communications in the presence of global unlimited adversary

V. F. Sheidaev^a, D. Y. Gamayunov<sup>b

a</sup> Lomonosov Moscow State University, Moscow, Russia
^b National Research University Higher School of Economics, Moscow, Russia

Abstract: With this paper, we provide our research into the problem of secure communications in the presence of a global unlimited adversary. As a solution, we propose to use decentralised deniable communications. We have made use of our existing multi-party Off-the-Record protocol's modification which is able to function over decentralised transport. Its Perfect Forward Secrecy (PFS) features were improved by adding Key Ratcheting procedure to the protocol's flow. As a result, we propose a fully decentralised cryptosystem which has deniability and transcript consistency features, improved PFS and ability to resist the Sybil attack. We also give a detailed overview of the protocol model implementation in JavaScript designed to function in conditions of centralized server's absence.

Keywords: secure communications, decentralised communications, deniability.

UDC: 004.057.4

DOI: 10.17223/20710410/40/6

Bibliographic databases:

• 
•