Overcoming impossibility results in composable security using interval-wise guarantees
type: Item
instance of: scholarly article
title: Overcoming impossibility results in composable security using interval-wise guarantees
zbMATH Open document ID: 1503.94033
DOI: 10.1007/978-3-030-56784-2_2
author: Daniel Jost
author: Ueli M. Maurer
publication date: 2022-11-09T00:00:00Z
Mathematics Subject Classification ID: 94A60
zbMATH DE Number: 7614534
zbMATH Keywords: system specifications
zbMATH Keywords: constructive cryptography
zbMATH Keywords: symmetric encryption with adaptive corruption
MaRDI profile type: Publication
full work available at URL: 978-3-030-56784-2 2
OpenAlex ID: W3012960056
cites work: Conditional Reactive Simulatability
cites work: Coin flipping by telephone a protocol for solving impossible problems
cites work: Concurrently Composable Security with Shielded Super-Polynomial Simulators
cites work: Q4783717
cites work: Q4737255
cites work: Idealizing Identity-Based Encryption
cites work: A unified and composable take on ratcheting
cites work: General composition and universal composability in secure multiparty computation
cites work: Constructive Cryptography – A New Paradigm for Security Definitions and Proofs
cites work: Q4737239
cites work: Indistinguishability Amplification
cites work: From Indifferentiability to Constructive Cryptography (and Back)
cites work: Q4409113
cites work: Q4434874
cites work: New notions of security
description: scientific article; zbMATH DE number 7614534