Universally composable almost-everywhere secure computation

DOI10.4230/LIPICS.ITC.2022.14MaRDI QIDQ6561696zbMATH OpenFDO

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

Publication date 25 June 2024

Full work available at URL https://doi.org/10.4230/LIPICS.ITC.2022.14

zbMATH Keywords

almost-everywhere secure computationsecure message transmissionsecure multi-party computationsparse graphsuniversal composability

Mathematics Subject Classification ID

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

Cited in

(2)

• Universally composable almost-everywhere secure computation
• Adaptive security, erasures, and network assumptions in communication-local MPC

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)