Plaintext-Dependent Decryption: A Formal Security Treatment of SSH-CTR

DOI10.1007/978-3-642-13190-5_18zbMath1280.94090OpenAlexW2156819075MaRDI QIDQ3563844

Gaven J. Watson, Kenneth G. Paterson

Publication date: 1 June 2010

Published in: Advances in Cryptology – EUROCRYPT 2010 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-13190-5_18

zbMATH Keywords

SSHcounter modesecurity proof

Mathematics Subject Classification ID

Cryptography (94A60)

Related Items (6)

Hidden shift quantum cryptanalysis and implications ⋮ Data Is a Stream: Security of Stream-Based Channels ⋮ On Symmetric Encryption with Distinguishable Decryption Failures ⋮ Simulatable channels: extended security that is universally composable and easier to prove ⋮ On Hiding a Plaintext Length by Preencryption ⋮ Analysis of the SSH Key Exchange Protocol

This page was built for publication: Plaintext-Dependent Decryption: A Formal Security Treatment of SSH-CTR