Universally composable almost-everywhere secure computation

DOI10.4230/LIPICS.ITC.2022.14MaRDI QIDQ6561696FDO

Authors Nishanth Chandran, Pouyan Forghani, Juan Garay, Rafail M. Ostrovsky, Rutvik Patel, Vassilis Zikas

Publication date 25 June 2024

zbMATH Keywords

sparse graphssecure multi-party computationuniversal composabilitysecure message transmissionalmost-everywhere secure computation

Mathematics Subject Classification ID

Data encryption (aspects in computer science) (68P25) Cryptography (94A60)

This page was built for publication: Universally composable almost-everywhere secure computation

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