Overcoming impossibility results in composable security using interval-wise guarantees

DOI10.1007/978-3-030-56784-2_2zbMath1503.94033OpenAlexW3012960056MaRDI QIDQ2096476

Daniel Jost, Ueli M. Maurer

Publication date: 9 November 2022

Full work available at URL: https://doi.org/10.1007/978-3-030-56784-2_2

zbMATH Keywords

constructive cryptographysymmetric encryption with adaptive corruptionsystem specifications

Mathematics Subject Classification ID

Cryptography (94A60)

Related Items (5)

A more complete analysis of the signal double ratchet algorithm ⋮ Anonymous authenticated communication ⋮ Giving an adversary guarantees (or: how to model designated verifier signatures in a composable framework) ⋮ Adaptive security of multi-party protocols, revisited ⋮ Overcoming impossibility results in composable security using interval-wise guarantees

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• General composition and universal composability in secure multiparty computation
• Overcoming impossibility results in composable security using interval-wise guarantees
• A unified and composable take on ratcheting
• Idealizing Identity-Based Encryption
• Constructive Cryptography – A New Paradigm for Security Definitions and Proofs
• From Indifferentiability to Constructive Cryptography (and Back)
• New notions of security
• Indistinguishability Amplification
• Coin flipping by telephone a protocol for solving impossible problems
• Concurrently Composable Security with Shielded Super-Polynomial Simulators
• Conditional Reactive Simulatability

This page was built for publication: Overcoming impossibility results in composable security using interval-wise guarantees