Four Attacks and a Proof for Telegram
Open Access
- 17 December 2025
- journal article
- research article
- Published by Springer Nature in Journal of Cryptology
- Vol. 39 (1) , 10
Abstract
We study the use of symmetric cryptography in the MTProto 2.0 protocol, Telegram’s equivalent of the TLS protocol. We give positive and negative results. On the one hand, we formally and in detail specify a slight variant of Telegram’s “record protocol” and prove that it achieves security in a suitable bidirectional secure channel model, albeit under unstudied assumptions; this model itself advances the state of the art for secure channels. On the other hand, we first motivate our slight deviation from MTProto as deployed by giving two attacks on the original protocol specification: one of practical, one of theoretical interest. Then, we give two attacks on the implementation, which are outside of our formal model: one targeting the client, one targeting the server. The client-side attack enables plaintext recovery by exploiting timing side channels, of varying strength, in three official Telegram clients. On its own this attack is thwarted by the secrecy of header fields that are established by Telegram’s key exchange protocol. We thus chain this attack with an attack against the implementation of the key exchange protocol on Telegram’s servers. This final attack breaks the authentication properties of Telegram’s key exchange, allowing a MitM attack. More mundanely, it also reduces the cost of the client-side plaintext-recovery attack. In totality, our results provide the first comprehensive study of MTProto’s use of symmetric cryptography, as well as highlight weaknesses in its key exchange.Keywords
Funding Information
- Swiss Federal Institute of Technology Zurich
This publication has 42 references indexed in Scilit:
- Beyond Security and Efficiency: On-Demand Ratcheting with Security Awareness2021
- Efficient Ratcheting: Almost-Optimal Guarantees for Secure Messaging2019
- The Double Ratchet: Security Notions, Proofs, and Modularization for the Signal Protocol2019
- Simulatable Channels: Extended Security that is Universally Composable and Easier to Prove2018
- Related-Key Rectangle Attack on 42-Round SHACAL-2Lecture Notes in Computer Science, 2006
- The Security of Triple Encryption and a Framework for Code-Based Game-Playing Proofs2006
- A Provable-Security Treatment of the Key-Wrap Problem2006
- Merkle-Damgård Revisited: How to Construct a Hash Function2005
- A Theoretical Treatment of Related-Key Attacks: RKA-PRPs, RKA-PRFs, and Applications2003
- Communication Theory of Secrecy Systems*Bell System Technical Journal, 1949