Four attacks and a proof for Telegram
From MaRDI portal
Cites work
- scientific article; zbMATH DE number 1302834 (Why is no real title available?)
- scientific article; zbMATH DE number 2009976 (Why is no real title available?)
- A Provable-Security Treatment of the Key-Wrap Problem
- Analysis of the Telegram key exchange
- Beyond security and efficiency: on-demand ratcheting with security awareness
- Breaking and provably repairing the SSH authenticated encryption scheme
- Communication Theory of Secrecy Systems*
- Efficient ratcheting: almost-optimal guarantees for secure messaging
- Fast Software Encryption
- From stateless to stateful: generic authentication and authenticated encryption constructions with application to TLS
- Hash-Function Based PRFs: AMAC and Its Multi-User Security
- How to securely release unverified plaintext in authenticated encryption
- Merkle-Damgård Revisited: How to Construct a Hash Function
- On bounded distance decoding with predicate: breaking the ``lattice barrier for the hidden number problem
- On-line ciphers and the Hash-CBC constructions
- Optimal channel security against fine-grained state compromise: the safety of messaging
- Progress in Cryptology - INDOCRYPT 2004
- Ratcheted encryption and key exchange: the security of messaging
- Related-Key Rectangle Attack on 42-Round SHACAL-2
- Robust channels: handling unreliable networks in the record layers of QUIC and DTLS 1.3
- Simplifying game-based definitions -- indistinguishability up to correctness and its application to stateful AE
- Simulatable channels: extended security that is universally composable and easier to prove
- The Security of Triple Encryption and a Framework for Code-Based Game-Playing Proofs
- The double ratchet: security notions, proofs, and modularization for the signal protocol
This page was built for publication: Four attacks and a proof for Telegram
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6868484)
