Overcoming impossibility results in composable security using interval-wise guarantees

DOI10.1007/978-3-030-56784-2_2MaRDI QIDQ2096476zbMATH OpenOpenAlexFDO

Authors 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)

Recommendations

• Adaptive and concurrent secure computation from new adaptive, non-malleable commitments
• Adaptive hardness and composable security in the plain model from standard assumptions
• Information Security
• Adaptive security of multi-party protocols, revisited
• General composition and universal composability in secure multiparty computation

Cites work

• scientific article; zbMATH DE number 1942416 (Why is no real title available?)
• scientific article; zbMATH DE number 2009954 (Why is no real title available?)
• scientific article; zbMATH DE number 2086702 (Why is no real title available?)
• scientific article; zbMATH DE number 2086716 (Why is no real title available?)
• scientific article; zbMATH DE number 1842484 (Why is no real title available?)
• A unified and composable take on ratcheting
• Coin flipping by telephone a protocol for solving impossible problems
• Concurrently composable security with shielded super-polynomial simulators
• Conditional reactive simulatability
• Constructive cryptography -- a new paradigm for security definitions and proofs
• From Indifferentiability to Constructive Cryptography (and Back)
• General composition and universal composability in secure multiparty computation
• Idealizing identity-based encryption
• Indistinguishability Amplification
• New notions of security: achieving universal composability without trusted setup
• Overcoming impossibility results in composable security using interval-wise guarantees

Cited in

(6)

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

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2096476)