Universal composition with global subroutines: capturing global setup within plain UC

DOI10.1007/978-3-030-64381-2_1zbMath1485.94051OpenAlexW3117321621MaRDI QIDQ2119067

Ran Canetti, Christian Badertscher, Vassilis Zikas, Björn Tackmann, Julia Hesse

Publication date: 23 March 2022

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

zbMATH Keywords

plain UC frameworkUC-emulation

Mathematics Subject Classification ID

Cryptography (94A60)

Related Items (7)

Embedding the UC model into the IITM model ⋮ Formalizing delayed adaptive corruptions and the security of flooding networks ⋮ A composable security treatment of ECVRF and batch verifications ⋮ Completeness theorems for adaptively secure broadcast ⋮ On the (Ir)replaceability of global setups, or how (not) to use a global ledger ⋮ Bitcoin as a Transaction Ledger: A Composable Treatment ⋮ Steel: composable hardware-based stateful and randomised functional encryption

This page was built for publication: Universal composition with global subroutines: capturing global setup within plain UC