Universally Composable Security

DOI10.1145/3402457zbMath1491.68036OpenAlexW3088537673MaRDI QIDQ5066937

Ran Canetti

Publication date: 31 March 2022

Published in: Journal of the ACM (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/3402457

zbMATH Keywords

specificationsecurity modelinguniversal compositionmodular securitysecurity-preserving composition

Mathematics Subject Classification ID

Cryptography (94A60) Network protocols (68M12) Computer security (68M25)

Related Items (16)

MoSS: modular security specifications framework ⋮ Unclonable polymers and their cryptographic applications ⋮ 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 ⋮ SecureBiNN: 3-party secure computation for binarized neural network inference ⋮ Revisiting the efficiency of asynchronous MPC with optimal resilience against general adversaries ⋮ Classically verifiable NIZK for QMA with preprocessing ⋮ Revisiting the efficiency of perfectly secure asynchronous multi-party computation against general adversaries ⋮ Completeness theorems for adaptively secure broadcast ⋮ Oblivious RAM with worst-case logarithmic overhead ⋮ On the communication efficiency of statistically secure asynchronous MPC with optimal resilience ⋮ On the (Ir)replaceability of global setups, or how (not) to use a global ledger ⋮ Policy-compliant signatures ⋮ Bitcoin as a Transaction Ledger: A Composable Treatment ⋮ High-performance multi-party computation for binary circuits based on oblivious transfer

This page was built for publication: Universally Composable Security