Simulatable channels: extended security that is universally composable and easier to prove
type: Item
instance of: scholarly article
title: Simulatable channels: extended security that is universally composable and easier to prove
zbMATH Open document ID: 1447.94030
DOI: 10.1007/978-3-030-03332-3_19
author: Jean Paul Degabriele
author: Marc Fischlin
publication date: 2019-01-23T00:00:00Z
Mathematics Subject Classification ID: 94A60
Mathematics Subject Classification ID: 94A62
zbMATH DE Number: 7005650
zbMATH Keywords: secure channels
zbMATH Keywords: ciphertext fragmentation
zbMATH Keywords: universal composability
zbMATH Keywords: SSH
zbMATH Keywords: subtle authenticated encryption
MaRDI profile type: Publication
full work available at URL: 978-3-030-03332-3 19
OpenAlex ID: W2898381248
cites work: How to Securely Release Unverified Plaintext in Authenticated Encryption
cites work: Rogue Decryption Failures: Reconciling AE Robustness Notions
cites work: Q4474200
cites work: Q2707451
cites work: Security of Symmetric Encryption in the Presence of Ciphertext Fragmentation
cites work: On Symmetric Encryption with Distinguishable Decryption Failures
cites work: Q2778861
cites work: Q4737255
cites work: Advances in Cryptology - CRYPTO 2003
cites work: Q4536815
cites work: Q4250779
cites work: Data Is a Stream: Security of Stream-Based Channels
cites work: Robust Authenticated-Encryption AEZ and the Problem That It Solves
cites work: Online Authenticated-Encryption and its Nonce-Reuse Misuse-Resistance
cites work: Confidentiality and Integrity: A Constructive Perspective
cites work: Plaintext-Dependent Decryption: A Formal Security Treatment of SSH-CTR
cites work: Fast Software Encryption
cites work: A Provable-Security Treatment of the Key-Wrap Problem
description: scientific article; zbMATH DE number 7005650